Quantum Money with Classical Verification
Dmytro Gavinsky

TL;DR
This paper introduces a novel quantum money scheme enabling classical verification, demonstrating the first secure quantum money that does not require quantum communication for verification and is secure against adaptive adversaries.
Contribution
It presents the first secure quantum money scheme with classical verification and adaptive security, expanding practical applicability of quantum currency.
Findings
Secure quantum money scheme with classical verification
First scheme secure against adaptive adversaries
No quantum communication needed for verification
Abstract
We propose and construct a quantum money scheme that allows verification through classical communication with a bank. This is the first demonstration that a secure quantum money scheme exists that does not require quantum communication for coin verification. Our scheme is secure against adaptive adversaries - this property is not directly related to the possibility of classical verification, nevertheless none of the earlier quantum money constructions is known to possess it.
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 · Computability, Logic, AI Algorithms · Quantum Mechanics and Applications
