Unconditionally secure quantum coin flipping

TL;DR

This paper introduces a quantum coin flipping protocol that achieves unconditional security with arbitrarily small bias, challenging previous beliefs about the impossibility of such protocols.

Contribution

The paper presents a novel QCF protocol based on a problem unsolvable without quantum algorithms, bypassing existing no-go proofs.

Findings

Proposes a QCF protocol with arbitrarily small bias

Demonstrates the protocol evades all known no-go proofs

Establishes the feasibility of unconditionally secure quantum coin flipping

Abstract

Quantum coin flipping (QCF) is an essential primitive for quantum cryptography. Unconditionally secure strong QCF with an arbitrarily small bias was widely believed to be impossible. But basing on a problem which cannot be solved without quantum algorithm, here we propose such a QCF protocol, and show how it manages to evade all existing no-go proofs on QCF.