Abstract
In the popular imagination, quantum computers would be almost magical devices, able to “solve impossible problems in an instant” by trying exponentially many solutions in parallel. In this talk, I’ll describe four results in quantum computing theory that directly challenge this view.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aaronson, S.: Quantum lower bound for the collision problem. In: Proc. ACM STOC, pp. 635–642 (2002)
Aaronson, S.: Limitations of quantum advice and one-way communication. Theory of Computing 1, 1–28 (2004)
Aaronson, S.: The learnability of quantum states (2006)
Aaronson, S.: Lower bounds for local search by quantum arguments. SIAM J. Comput. 35(4), 804–824 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aaronson, S. (2007). The Limits of Quantum Computers. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds) Computer Science – Theory and Applications. CSR 2007. Lecture Notes in Computer Science, vol 4649. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74510-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-74510-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74509-9
Online ISBN: 978-3-540-74510-5
eBook Packages: Computer ScienceComputer Science (R0)