Skip to content
Static snapshot of QMint (git 5b73a0bb93c1) — live experiments run locally
Research library

Paper · P06

Anonymous Quantum Tokens with Classical Verification

Title from docs/planning/QMINT_MASTER_RESEARCH_PLAN.md section 16; not present in the matrix row.

Dmytro Gavinsky; Dar Gilboa; Siddhartha Jain; Dmitri Maslov; Jarrod R. McClean · 2025-10-07 (v1); v2 2025-10-21

Status
ABSTRACT READOnly the abstract (and possibly skimmed PDF) was read; theorem details are not verified.ABSTRACT_READ + PDF definitions/claims skimmed; exact Claim 13 inequality NOT transcribed
Game
A1
Anchor
—
Source file
research/PRIOR_ART_MATRIX.csv

Precise theorem

Definition 9 (tokens with classical verification, parameters n,m,N_Mint,N_Verify,t,eps_loss,eps_fraud); Construction 10 meets Def.9 with n=k, m=k 2^{k/4}, N_Mint=2^{k/4}, N_Verify=2^{k/2}, t=k, eps_loss=2^{-k/2}, eps_fraud=2^{-k/4} (4|k); Definition 11 repetitive tokens; Claim 12 (repetitive scheme -> Def.9 scheme); Claim 13 anonymity/audit via swap test; Construction 15 main scheme.

Citations

Record

Every field of the source record, in file order.

Canonical linkcanonical_link

https://arxiv.org/abs/2510.06212

Authorsauthors

Dmytro Gavinsky; Dar Gilboa; Siddhartha Jain; Dmitri Maslov; Jarrod R. McClean

Publication datepublication_date

2025-10-07 (v1); v2 2025-10-21

Versionversion

arXiv v2 PDF read. No journal reference (2026-10-11).

Correction statuscorrection_status

n/a

Input modelinput_model

Bank mints identical (repetitive) single-use quantum tokens; users hold quantum tokens.

Verifier modelverifier_model

Classical bill validation (no long-term quantum memory / quantum communication for verification); users audit bank via swap test between tokens.

Adversary capabilitiesadversary_capabilities

Unforgeability: unconditional (query-bound argument, Lemma 8 generalising [FGGS99,Vel13]). Anonymity: detects bank tracking attempts with probability bounded in Claim 13.

Tested parameterstested_parameters

none (theory)

Proof dependenciesproof_dependencies

Swap test chain inequality (Claims 5-6); quantum query lower bound Lemma 8.

Datasetsdatasets

none

Codecode

none identified

Licenselicense

arXiv CC BY 4.0

Limitationslimitations

Single-use tokens; anonymity requires users to exchange pattern tokens; not composable with S-money or Wiesner proofs.

What QMint addswhat_QMint_adds

Nothing; frontier lane O1 reading only. Not to be merged with S1/S2/D1 theorems.

Access statusaccess_status

ABSTRACT_READ + PDF definitions/claims skimmed; exact Claim 13 inequality NOT transcribed

Qmint gameqmint_game

A1

Related entries