Impossibility Proofs and Quantum Bit Commitment
Horace P. Yuen

TL;DR
This paper discusses the limitations of quantum bit commitment protocols and proposes methods to achieve security by testing for cheating entanglement, challenging previous impossibility results.
Contribution
It introduces a testing approach that exploits multiple cheating entanglement possibilities to secure quantum bit commitment, addressing known impossibility proofs.
Findings
Quantum bit commitment can be secured using testing for cheating entanglement
Impossibility proofs have limitations when testing strategies are employed
Proposes a practical approach to overcome theoretical security barriers
Abstract
The nature and scope of various impossibility proofs as they relate to real-world situations are discussed. In particular, it is shown in words without technical symbols how secure quantum bit commitment protocols may be obtained with testing that exploits the multiple possibilities of cheating entanglement formation.
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 Mechanics and Applications · Quantum Information and Cryptography · Quantum Computing Algorithms and Architecture
