Computational Complexity and the Nature of Quantum Mechanics (Extended version)

02/09/2019
by   Alessio Benavoli, et al.
0

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 having it follow from two main postulates (i) the theory should be logically consistent; (ii) 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.

READ FULL TEXT
research
02/12/2019

Computational Complexity and the Nature of Quantum Mechanics

Quantum theory (QT) has been confirmed by numerous experiments, yet we s...
research
07/14/2019

When Entanglement meets Classical Communications: Quantum Teleportation for the Quantum Internet (Invited Paper)

Quantum Teleportation is the key communication functionality of the Quan...
research
11/24/2020

Quantization of Blackjack: Quantum Basic Strategy and Advantage

Quantum computers that process information by harnessing the remarkable ...
research
07/28/2020

Cost of quantum entanglement simplified

Quantum entanglement is a key physical resource in quantum information p...
research
12/24/2022

Development of a Thermodynamics of Human Cognition and Human Culture

Inspired by foundational studies in classical and quantum physics, and b...
research
01/03/2020

Quantum Interference for Counting Clusters

Counting the number of clusters, when these clusters overlap significant...
research
11/11/2019

Classification on the Computational Complexity of Spin Models

In this note, we provide a unifying framework to investigate the computa...

Please sign up or login with your details

Forgot password? Click here to reset