Quantum gambling based on Nash-equilibrium
Pei Zhang, Xiao-Qi Zhou, Yun-Long Wang, Peter J. Shadbolt, Yong-Sheng, Zhang, Hong Gao, Fu-Li Li, Jeremy L. O'Brien

TL;DR
This paper introduces a quantum gambling protocol that ensures fairness between two distant parties without third-party trust, leveraging game theory and quantum mechanics to reach a Nash-equilibrium, with practical optical demonstration.
Contribution
It presents a novel quantum gambling protocol that guarantees fairness without third-party trust and demonstrates its practical feasibility.
Findings
Protocol guarantees fairness through Nash-equilibrium
Adaptable to biased gambling applications
Experimental optical demonstration successfully conducted
Abstract
A fair gambling is hard to be made between two spatially separated parties without introducing a trusted third party. Here we propose a novel gambling protocol, which enables fair gambling between two distant parties without the help of a third party. By incorporating the key concepts and methods of game theory, our protocol will force the two parties to move their strategies to a Nash-equilibrium point which guarantees the fairness through the physical laws of quantum mechanics. Furthermore, we show that our protocol can be easily adapted to a biased version, which would find applications in lottery, casino, etc. A proof-of-principle optical demonstration of this protocol is reported as well.
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
