Paper · P23
Genovese & Stambler (2025)
Fabrizio Genovese; Lev Stambler · 2025-12-24 (v1); v2 2026-03-13
- Status
- ABSTRACT READOnly the abstract (and possibly skimmed PDF) was read; theorem details are not verified.
- Game
- none stated
- Anchor
- —
- Source file
- research/PRIOR_ART_MATRIX.csv
Precise theorem
Publicly verifiable quantum money with limited verifications from one-time memories (conjugate coding + hardware assumptions) (abstract).
Citations
Record
Every field of the source record, in file order.
- Canonical linkcanonical_link
https://arxiv.org/abs/2512.21304
- Authorsauthors
Fabrizio Genovese; Lev Stambler
- Publication datepublication_date
2025-12-24 (v1); v2 2026-03-13
- Versionversion
arXiv v2
- Correction statuscorrection_status
n/a
- Input modelinput_model
conjugate coding states; one-time memories
- Verifier modelverifier_model
public, limited number of verifications
- Adversary capabilitiesadversary_capabilities
hardware-assumption model
- Tested parameterstested_parameters
none
- Proof dependenciesproof_dependencies
one-time memories
- Datasetsdatasets
none
- Codecode
https://github.com/neverlocal/otm_billz (licence NOT_VERIFIED)
- Licenselicense
arXiv CC BY 4.0
- Limitationslimitations
Hardware assumptions.
- What QMint addswhat_QMint_adds
Nothing; recent related work for O2.
- Access statusaccess_status
ABSTRACT_READ
- Qmint gameqmint_game
none