Is Quantum Mechanics Falsifiable? A computational perspective on the foundations of Quantum Mechanics
classification
🪐 quant-ph
keywords
quantummechanicscomplexityparadigmscientificappliedarguecannot
read the original 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}.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Lower overhead fault-tolerant building blocks for noisy quantum computers
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.