{"ID":2825559,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2512.21304","arxiv_id":"2512.21304","title":"A Note on Publicly Verifiable Quantum Money with Low Quantum Computational Resources","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.","short_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 a...","url_abs":"https://arxiv.org/abs/2512.21304","url_pdf":"https://arxiv.org/pdf/2512.21304v2","authors":"[\"Fabrizio Genovese\",\"Lev Stambler\"]","published":"2025-12-24T17:48:03Z","proceeding":"quant-ph","tasks":"[\"quant-ph\",\"cs.CR\"]","methods":"[]","has_code":false,"code_links":[{"ID":605675,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_id":2825559,"paper_url":"https://arxiv.org/abs/2512.21304","paper_title":"A Note on Publicly Verifiable Quantum Money with Low Quantum Computational Resources","repo_url":"https://github.com/neverlocal/otm_billz","is_official":false,"mentioned_in_paper":false,"mentioned_in_github":true,"github_stars":0}]}