Quantum money from knots

Authors:
Edward Farhi;David Gosset;Avinatan Hassidim;Andrew Lutomirski;Peter Shor
Affiliations:
Center for Theoretical Physics, Mass. Inst. of Tech., Cambridge, MA;University of Waterloo, Waterloo, Canada;Bar Ilan University and Google Israel;AMA Capital Mgmt LLC, Palo Alto, CA;Math, CTP and CSAIL, Mass. Inst. of Tech., Cambridge, MA
Venue:
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Year:
2012

Citing 4
Cited 4

The computational complexity of knot and link problems

Journal of the ACM (JACM)
Conjugate coding

ACM SIGACT News - A special issue on cryptography
Adiabatic Quantum State Generation

SIAM Journal on Computing
Quantum Copy-Protection and Quantum Money

CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity

Quantum rejection sampling

Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Quantum money from hidden subspaces

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Quantum money

Communications of the ACM
Quantum rejection sampling

ACM Transactions on Computation Theory (TOCT) - Special issue on innovations in theoretical computer science 2012

Quantified Score

Hi-index	0.02

Visualization

Abstract

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.