Are Quantum States Exponentially Long Vectors?
Scott Aaronson
TL;DR
This paper critiques Oded Goldreich's views on quantum computing, arguing against his perspectives and clarifying misconceptions about quantum states and their complexity.
Contribution
It provides a critical analysis of Goldreich's position on quantum states, challenging his assumptions and clarifying misconceptions about quantum complexity.
Findings
Goldreich's views on quantum states are shown to be incorrect
Quantum states are not necessarily exponentially long vectors
The paper clarifies misconceptions about quantum complexity
Abstract
I'm grateful to Oded Goldreich for inviting me to the 2005 Oberwolfach Meeting on Complexity Theory. In this extended abstract, which is based on a talk that I gave there, I demonstrate that gratitude by explaining why Goldreich's views about quantum computing are wrong.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Mechanics and Applications · Quantum Computing Algorithms and Architecture · Computability, Logic, AI Algorithms