Noise-tolerant public-key quantum money from a classical oracle
arXiv:2407.06463 · doi:10.22331/q-2025-04-07-1691
Abstract
Quantum money is the task of verifying the validity of banknotes while ensuring that they cannot be counterfeited. Public-key quantum money allows anyone to perform verification, while the private-key setting restricts the ability to verify to banks, as in Wiesner's original scheme. The current state of technological progress means that errors are impossible to entirely suppress, hence the requirement for noise-tolerant schemes. We show for the first time how to achieve noise-tolerance in the public-key setting. Our techniques follow Aaronson and Christiano's oracle model, where we use the ideas of quantum error correction to extend their scheme: a valid banknote is now a subspace state possibly affected by noise, and verification is performed by using classical oracles to check for membership in "larger spaces." Additionally, a banknote in our scheme is minted by preparing conjugate coding states and applying a unitary that permutes the standard basis vectors.
46 pages, 3 figures. Accepted for publication in Quantum
References in corpus (12)
- Strengths and Weaknesses of Quantum Computing
- Quantum memories: emerging applications and recent advances
- Quantum Error Correction: An Introductory Guide
- Single ion-qubit exceeding one hour coherence time
- Quantum Copy-Protection and Quantum Money
- Unforgeable Noise-Tolerant Quantum Tokens
- Quantum state restoration and single-copy tomography
- Quantum Tokens for Digital Signatures
- Breaking and making quantum money: toward a new quantum cryptographic protocol
- Quantum money with nearly optimal error tolerance
- A monogamy-of-entanglement game for subspace coset states
- Practically feasible robust quantum money with classical verification