Quantum Computation and Arrows of Time

Abstract

Quantum physics is surprising in many ways. One surprise is the threat to locality implied by Bell's Theorem. Another surprise is the capacity of quantum computation, which poses a threat to the complexity-theoretic Church-Turing thesis. In both cases, the surprise may be due to taking for granted a certain strict arrow-of-time assumption, whose applicability may be limited to the classical domain. This possibility has been noted repeatedly in the context of Bell's Theorem. The argument concerning quantum computation is described here. Further development of models which violate this strong arrow-of-time assumption, replacing it by a weaker arrow, is called for.

arXiv comment6 two-column pages, no figures

References in corpus (13)

• On the reality of the quantum state
• Information Causality as a Physical Principle
• Quantum probabilities as Bayesian probabilities
• The lesson of causal discovery algorithms for quantum correlations: Causal explanations of Bell-inequality violations require fine-tuning
• Is the quantum state real? An extended review of $\psi$-ontology theorems
• A glance beyond the quantum model
• No quantum advantage for nonlocal computation
• Is a time symmetric interpretation of quantum theory possible without retrocausality?
• What Bell Did
• Bell's Theorem and Locally-Mediated Reformulations of Quantum Mechanics
• Bell's Theorem and the Causal Arrow of Time
• A Lenient Causal Arrow of Time?
• A relational time-symmetric framework for analyzing the quantum computational speedup