Computational Complexity and the Interpretation of a Quantum State Vector
Arkady Bolotin

TL;DR
This paper explores the implications of assuming the Schrödinger equation is computationally intractable, challenging the traditional view that it must be solvable for macroscopic systems, and addresses the macro-objectivation problem in quantum mechanics.
Contribution
It introduces the idea that the Schrödinger equation's intractability can provide a new perspective on the macro-objectivation problem in quantum theory.
Findings
Proposes intractability of the Schrödinger equation as a solution to macro-objectivation.
Challenges the assumption that the Schrödinger equation must be solvable for macroscopic systems.
Suggests computational complexity considerations are relevant to quantum interpretation.
Abstract
The macro-objectivation problem derives from the fact that the Schrodinger equation is linear and thus requires that a macroscopic system interacting with an entangled state must be entangled as well. However, such a requirement entails that the Schrodinger equation must also be solvable in the macroscopic world in the same way as it is solvable in the microscopic world, which itself is an assumption. In this work, the alternative assumption that the Schrodinger equation is in general an intractable problem is considered.
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
TopicsComputability, Logic, AI Algorithms · Quantum Mechanics and Applications · Quantum Computing Algorithms and Architecture
