A Note on Publicly Verifiable Quantum Money with Low Quantum Computational Resources
Fabrizio Genovese, Lev Stambler

TL;DR
This paper introduces a publicly verifiable quantum money protocol that requires minimal quantum resources, utilizing one-time memories and conjugate coding to prevent double spending and enable digital signatures.
Contribution
It presents a novel quantum money scheme with low quantum computational requirements based on one-time memories and conjugate coding, with practical implementation details.
Findings
Supports limited verifications and digital signatures.
Prevents double spending via no-cloning principle.
Provides a practical implementation at the given URL.
Abstract
In this work we present a publicly verifiable quantum money protocol which assumes close to no quantum computational capabilities. We rely on one-time memories which in turn can be built from quantum conjugate coding and hardware-based assumptions. Specifically, our scheme allows for a limited number of verifications and also allows for quantum tokens for digital signatures. Double spending is prevented by the no-cloning principle of conjugate coding states. An implementation of the concepts presented in this work can be found at https://github.com/neverlocal/otm_billz.
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 · Quantum Information and Cryptography · Quantum Mechanics and Applications
