Are Quantum States Exponentially Long Vectors?

In his paper titled "Are Quantum States Exponentially Long Vectors? ", Scott Aaronson expresses gratitude towards Oded Goldreich for inviting him to the 2005 Oberwolfach Meeting on Complexity Theory. The extended abstract, based on a talk given at the event, delves into a critical analysis of Goldreich's views on quantum computing. Aaronson challenges and refutes Goldreich's perspectives, arguing that they are fundamentally flawed. Despite not presenting any new results in the paper, Aaronson engages in informal discourse to debunk Goldreich's assertions about quantum states. Through this examination, Aaronson aims to shed light on the inaccuracies in Goldreich's understanding of quantum computing. The paper serves as a platform for intellectual debate and offers insights into the complexities of quantum theory.

Introduction

In 2005, Scott Aaronson was invited to the Oberwolfach Meeting on Complexity Theory by Oded Goldreich. During this event, Goldreich presented his views on quantum computing, which sparked a critical response from Aaronson. In his paper titled "Are Quantum States Exponentially Long Vectors?", Aaronson expresses gratitude towards Goldreich for inviting him and takes the opportunity to engage in an informal discourse about the inaccuracies in Goldreich's understanding of quantum computing.

The Debate

Goldreich's perspective on quantum states can be summarized as follows: he believes that quantum states are exponentially long vectors, meaning that they require an exponential amount of classical information to describe them accurately. This view is based on the assumption that any physical system can be simulated efficiently using classical computation. However, Aaronson argues that this assumption is flawed and leads to incorrect conclusions about quantum states.

Aaronson begins by pointing out that there is no evidence or proof for the belief that all physical systems can be efficiently simulated classically. He also highlights how this assumption contradicts well-established results in complexity theory, such as NP-completeness and BQP-completeness. These results suggest that there are problems which cannot be solved efficiently using classical computation but can be solved using a quantum computer.

Furthermore, Aaronson explains how Goldreich's belief ignores the fundamental principles of quantum mechanics. According to these principles, it is not possible to measure all properties of a system simultaneously with arbitrary precision. This means that even if we had access to an exponentially long vector representing a quantum state, we would not be able to extract all its information without disturbing its delicate superposition.

Debunking Goldreich's Arguments

Aaronson goes on to refute specific arguments made by Goldreich regarding the efficiency of simulating physical systems classically. For instance, one argument is that quantum states can be approximated by classical probability distributions. However, Aaronson points out that this only holds true for certain types of measurements and not all possible measurements.

Another argument made by Goldreich is that the exponential length of a quantum state vector can be reduced through compression techniques. Aaronson counters this claim by explaining how these techniques are based on assumptions about the structure of the data, which may not hold in the case of quantum states.

Insights into Quantum Theory

Through his critique of Goldreich's views, Aaronson offers valuable insights into the complexities of quantum theory. He highlights how our understanding of quantum mechanics is still evolving and there are many open questions to be explored. This paper serves as a platform for intellectual debate and encourages further research in this field.

Aaronson also emphasizes the importance of distinguishing between classical and quantum computation when discussing these topics. He argues that conflating the two can lead to misunderstandings and incorrect conclusions, as seen in Goldreich's arguments.

The Role of Informal Discourse

One interesting aspect of this paper is its use of informal discourse to challenge Goldreich's perspectives. Instead of presenting new results or formal proofs, Aaronson engages in a conversation-like style to debunk Goldreich's assertions. This approach makes the paper more accessible to a wider audience and encourages critical thinking about complex topics like quantum computing.

Conclusion

In "Are Quantum States Exponentially Long Vectors?", Scott Aaronson provides a detailed analysis and critique of Oded Goldreich's views on quantum computing. Through his arguments, he challenges fundamental assumptions made by Goldreich and sheds light on inaccuracies in his understanding of quantum states. The paper serves as a platform for intellectual debate and offers valuable insights into the complexities of quantum theory. It also highlights the importance of distinguishing between classical and quantum computation when discussing these topics.