A Note on Publicly Verifiable Quantum Money with Low Quantum Computational Resources
This work addresses the challenge of secure quantum money for applications like digital signatures, though it appears incremental as it builds on existing concepts like one-time memories and conjugate coding.
The authors tackled the problem of creating publicly verifiable quantum money with minimal quantum computational requirements, achieving a scheme that allows limited verifications and supports quantum tokens for digital signatures by leveraging one-time memories and conjugate coding.
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.