Quantum money from hidden subspaces
DOI10.4086/toc.2013.v009a009zbMath1298.81054arXiv1203.4740OpenAlexW2611481031MaRDI QIDQ3191578
Scott Aaronson, Paul Christiano
Publication date: 6 October 2014
Published in: Theory of Computing, Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.4740
multivariate polynomialsquantum computingquantum cryptographyelectronic cashquantum moneyno-cloning theoremquantum lower bounds
Quantum computation (81P68) Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (30)
This page was built for publication: Quantum money from hidden subspaces