Quantum money from hidden subspaces
From MaRDI portal
Publication:3191578
DOI10.4086/toc.2013.v009a009zbMath1298.81054arXiv1203.4740MaRDI 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 polynomials; quantum computing; quantum cryptography; electronic cash; quantum money; no-cloning theorem; quantum lower bounds
81P68: Quantum computation
94A60: Cryptography
68Q12: Quantum algorithms and complexity in the theory of computing
81P94: Quantum cryptography (quantum-theoretic aspects)