Practical Quantum Retrieval Games
Juan Miguel Arrazola, Markos Karasamanis, Norbert L\"utkenhaus

TL;DR
This paper introduces a practical construction of quantum retrieval games (QRGs) based on the hidden matching problem, demonstrating their implementability with current technology and their potential to enhance quantum cryptographic protocols.
Contribution
It presents a general method to construct (1-out-of-k) QRGs with exponentially decreasing cheating probabilities and introduces new QRGs using coherent states of light suitable for real-world experiments.
Findings
Cheating probabilities decrease exponentially with k.
QRGs can be implemented with available technology.
New QRGs based on coherent states are feasible in practice.
Abstract
Complex cryptographic protocols are often constructed from simpler building-blocks. In order to advance quantum cryptography, it is important to study practical building-blocks that can be used to develop new protocols. An example is quantum retrieval games (QRGs), which have broad applicability and have already been used to construct quantum money schemes. In this work, we introduce a general construction of quantum retrieval games based on the hidden matching problem and show how they can be implemented in practice using available technology. More precisely, we provide a general method to construct (1-out-of-k) QRGs, proving that their cheating probabilities decrease exponentially in . In particular, we define new QRGs based on coherent states of light, which can be implemented even in the presence of experimental imperfections. Our results constitute a new tool in the arsenal of…
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.
