Computational complexity and quantum interpretations
Vivek Kumar, M. P. Singh, R. Srikanth

TL;DR
This paper explores how the computational complexity class relationship between BQP and BPP may influence the philosophical interpretation of quantum mechanics, linking physical theory constraints to foundational debates.
Contribution
It proposes that the complexity relationship between BQP and BPP constrains quantum interpretations, suggesting a subjective view favors BQP = BPP, while a realist view implies BPP is a subset of BQP.
Findings
Subjective interpretations favor BQP = BPP.
Realist interpretations imply BPP is a subset of BQP.
Computational complexity may influence quantum foundational perspectives.
Abstract
In computational complexity theory, it remains to be understood whether is the same as . Prima facie, one would expect that this mathematical question is quite unrelated to the foundational question of whether the quantum state is an element of reality or of the observer's knowledge. By contrast, here we argue that the complexity of computation in a physical theory may constrain its physical interpretation. Specifically in the quantum case, we argue that a subjective interpretation of the quantum mechanics favors the proposition . Therefore, if , then a realist interpretation of quantum mechanics would be favored.
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 Computing Algorithms and Architecture · Computability, Logic, AI Algorithms · Benford’s Law and Fraud Detection
