Computational Complexity and the Nature of Quantum Mechanics
arXiv:1902.04569
Abstract
Quantum theory (QT) has been confirmed by numerous experiments, yet we still cannot fully grasp the meaning of the theory. As a consequence, the quantum world appears to us paradoxical. Here we shed new light on QT by being based on two main postulates: 1. the theory should be logically consistent; 2. inferences in the theory should be computable in polynomial time. The first postulate is what we require to each well-founded mathematical theory. The computation postulate defines the physical component of the theory. We show that the computation postulate is the only true divide between QT, seen as a generalised theory of probability, and classical probability. All quantum paradoxes, and entanglement in particular, arise from the clash of trying to reconcile a computationally intractable, somewhat idealised, theory (classical physics) with a computationally tractable theory (QT) or, in other words, from regarding physics as fundamental rather than computation.
arXiv commentarXiv admin note: substantial text overlap with arXiv:1902.03513
References in corpus (36)
- Quantum entanglement
- Relational Quantum Mechanics
- Symmetric Informationally Complete Quantum Measurements
- Information Causality as a Physical Principle
- A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
- Quantum computations without definite causal structure
- Quantum Theory From Five Reasonable Axioms
- Probabilistic theories with purification
- Unknown Quantum States: The Quantum de Finetti Representation
- A complete family of separability criteria
- Quantum Mechanics as Quantum Information (and only a little more)
- Distinguishing separable and entangled states
- Quantum-Bayesian Coherence: The No-Nonsense Version
- Undecidability of the Spectral Gap (short version)
- Sum-of-squares decompositions for a family of CHSH-like inequalities and their application to self-testing
- Tsirelson bounds for generalized Clauser-Horne-Shimony-Holt inequalities
- NP-complete Problems and Physical Reality
- Necessary and sufficient conditions for bipartite entanglement
- Symmetric Informationally Complete Measurements of Arbitrary Rank
- Quantum Computational Complexity in the Presence of Closed Timelike Curves
- Consistency, Amplitudes and Probabilities in Quantum Theory
- How continuous quantum measurements in finite dimension are actually discrete
- Is "genuine multipartite entanglement" really genuine?
- Explicit product ensembles for separable quantum states
- Four and a Half Axioms for Finite Dimensional Quantum Mechanics
- On quantum vs. classical probability
- Information-theoretic postulates for quantum theory
- Quantum theory as a principle theory: insights from an information-theoretic reconstruction
- Desirability and the birth of incomplete preferences
- Quantum mechanics: The Bayesian theory generalised to the space of Hermitian matrices
- Derivation of Quantum Theory from Feynman's Rules
- The symmetrical foundation of Measure, Probability and Quantum theories
- A Gleason-type theorem for any dimension based on a gambling formulation of Quantum Mechanics
- A polarity theory for sets of desirable gambles
- Quantum Computing and Hidden Variables II: The Complexity of Sampling Histories
- Bernstein's socks and polynomial-time provable coherence