Is Quantum Mechanics Falsifiable? A computational perspective on the foundations of Quantum Mechanics
Dorit Aharonov, Umesh Vazirani

TL;DR
This paper explores the challenge of testing quantum mechanics at high complexity levels, proposing the use of interactive experiments as a new paradigm beyond traditional predict-and-verify methods.
Contribution
It introduces a novel approach to testing quantum mechanics through interactive experiments, addressing limitations of standard scientific methods in high-complexity regimes.
Findings
Quantum mechanics exhibits exponential complexity in computation.
Standard testing paradigms are insufficient for high-complexity regimes.
Interactive experiments can extend the testing capabilities for quantum mechanics.
Abstract
Quantum computation teaches us that quantum mechanics exhibits exponential complexity. We argue that the standard scientific paradigm of "predict and verify" cannot be applied to testing quantum mechanics in this limit of high complexity. We describe how QM can be tested in this regime by extending the usual scientific paradigm to include {\it interactive experiments}.
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
