Semi-Loss-Tolerant Strong Coin Flipping Protocol Using EPR Pairs
Jia-Jun Ma, Fen-Zhuo Guo, Qian Yang, Yan-Bing Li, Qiao-Yan Wen

TL;DR
This paper introduces a semi-loss-tolerant quantum strong coin flipping protocol using EPR pairs and quantum memory, achieving lower bias than previous protocols and analyzing the impact of losses on security and feasibility.
Contribution
The paper presents a novel semi-loss-tolerant protocol utilizing EPR pairs and quantum memory, reducing bias compared to prior loss-tolerant protocols.
Findings
Bias decreases as loss probability p decreases
Bias approaches 0.3536 when p approaches 0
Protocol is experimentally feasible
Abstract
In this paper, we present a quantum strong coin flipping protocol. In this protocol, an EPR pair and a quantum memory storage are made use of, and losses in the quantum communication channel and quantum memory storage are all analyzed. We obtain the bias in the fair scenario as a function of , where is the probability that the particle in Bob's quantum memory storage is lost, which means our bias varies as the degree of losses in the quantum memory storage changes. Therefore we call our protocol semi-loss-tolerant. We also show that the bias decreases with decreasing . When approaches 0, the bias approaches 0.3536, which is less than that of all the previous loss-tolerant protocols. Details of both parties' optimal cheating strategies are also given and analyzed. What's more, experimental feasibility is discussed and demonstrated. Compared with previous qubit-based…
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.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum and electron transport phenomena
