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

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Genovese, Fabrizio, Stambler, Lev
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914391477190656
author Genovese, Fabrizio
Stambler, Lev
author_facet Genovese, Fabrizio
Stambler, Lev
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2512_21304
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle A Note on Publicly Verifiable Quantum Money with Low Quantum Computational Resources
Genovese, Fabrizio
Stambler, Lev
Quantum Physics
Cryptography and Security
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.
title A Note on Publicly Verifiable Quantum Money with Low Quantum Computational Resources
topic Quantum Physics
Cryptography and Security
url https://arxiv.org/abs/2512.21304