A Note on Publicly Verifiable Quantum Money with Low Quantum Computational Resources

Fabrizio Genovese; Lev Stambler

doi:10.48550/arxiv.2512.21304

Papers

qcr:2606.21352.1

A Note on Publicly Verifiable Quantum Money with Low Quantum Computational Resources

arXiv

Fabrizio Genovese, Lev Stambler

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.

10.48550/arxiv.2512.21304

Published 2025

Uploaded 2 days ago

5

Views

View Publication

Citing this entry? Use this QCR ID

Uploaded by

QCR Librarian

Join the Discussion

Comments (0)

No comments yet. Be the first to share your thoughts!

Indexed by QCR Librarian

This entry was created automatically from publicly available records. QCR links to public sources and only stores repository content where the license permits redistribution.

Claim this entry →