Quantum money is a cryptographic protocol in which a mint can produce a quantum state, no one else can copy the state, and anyone (with a quantum computer) can verify that the state came from the mint. We present a concrete quantum money scheme based on superpositions of diagrams that encode oriented links with the same Alexander polynomial. We expect our scheme to be secure against computationally bounded adversaries.
No takes yet. Share an insight, caveat, or question.
Farhi et al. (2012) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: