Flipping quantum coins
Guido Berlin, Gilles Brassard, Felix Bussieres, Nicolas Godbout,, Joshua A. Slater, Wolfgang Tittel

TL;DR
This paper presents the first loss-tolerant quantum coin-flipping protocol, demonstrating practical implementation and sequential use to reveal cheating attempts, advancing quantum cryptography applications.
Contribution
It introduces a loss-immune quantum coin-flipping protocol and shows its practical, sequential application in realistic noisy environments.
Findings
First loss-tolerant quantum coin-flipping implementation
Sequential protocol guarantees detection of cheating over multiple flips
Demonstrates practical quantum coin flipping as a cryptographic tool
Abstract
Coin flipping is a cryptographic primitive in which two distrustful parties wish to generate a random bit in order to choose between two alternatives. This task is impossible to realize when it relies solely on the asynchronous exchange of classical bits: one dishonest player has complete control over the final outcome. It is only when coin flipping is supplemented with quantum communication that this problem can be alleviated, although partial bias remains. Unfortunately, practical systems are subject to loss of quantum data, which restores complete or nearly complete bias in previous protocols. We report herein on the first implementation of a quantum coin-flipping protocol that is impervious to loss. Moreover, in the presence of unavoidable experimental noise, we propose to use this protocol sequentially to implement many coin flips, which guarantees that a cheater unwillingly…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
