The Physical Church-Turing Thesis and the Principles of Quantum Theory

Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory. Yet several works have shown how quantum theory as it stands could breach the physical Church-Turing thesis. We draw a clear line as to when this is the case, in a way that is inspired by Gandy. Gandy formulates postulates about physics, such as homogeneity of space and time, bounded density and velocity of information --- and proves that the physical Church-Turing thesis is a consequence of these postulates. We provide a quantum version of the theorem. Thus this approach exhibits a formal non-trivial interplay between theoretical physics symmetries and computability assumptions.

[1]  L. Ballentine,et al.  Quantum Theory: Concepts and Methods , 1994 .

[2]  P. Oscar Boykin,et al.  On universal and fault-tolerant quantum computing: a novel basis and a new constructive proof of universality for Shor's basis , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[3]  Edwin J. Beggs,et al.  Can Newtonian systems, bounded in space, time, mass and energy compute all functions? , 2007, Theor. Comput. Sci..

[4]  E. Prugovec̆ki.  Information-theoretical aspects of quantum measurement , 1977 .

[5]  J. V. Tucker,et al.  Experimental computation of real numbers by Newtonian machines , 2007, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[6]  Umesh V. Vazirani,et al.  Quantum Complexity Theory , 1997, SIAM J. Comput..

[7]  Benjamin Schumacher,et al.  Locality and Information Transfer in Quantum Operations , 2005, Quantum Inf. Process..

[8]  Gilles Dowek,et al.  On the completeness of quantum computation models , 2010, CiE.

[9]  Mile Gu,et al.  More really is different , 2008, 0809.0151.

[10]  Robin Gandy,et al.  Church's Thesis and Principles for Mechanisms , 1980 .

[11]  Vincent Nesme,et al.  Unitarity plus causality implies localizability , 2007, J. Comput. Syst. Sci..

[12]  Paul Benioff,et al.  New Gauge Field from Extension of Space Time Parallel Transport of Vector Spaces to the Underlying Number Systems , 2010, 1008.3134.

[13]  Nachum Dershowitz,et al.  A Natural Axiomatization of Computability and Proof of Church's Thesis , 2008, Bulletin of Symbolic Logic.

[14]  Alex Kane,et al.  Coins , 1984 .

[15]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[16]  Oron Shagrir,et al.  Physical Computation: How General are Gandy’s Principles for Mechanisms? , 2007, Minds and Machines.

[17]  Edwin J. Beggs,et al.  Embedding infinitely parallel computation in Newtonian kinematics , 2006, Appl. Math. Comput..

[18]  Tien D. Kieu,et al.  Computing the non-computable , 2002, ArXiv.

[19]  Comparing causality principles , 2004, quant-ph/0410051.

[20]  Gilles Dowek,et al.  Operational semantics for formal tensorial calculus , 2004 .

[21]  Wilfried Sieg,et al.  An abstract model for parallel computations : Gandy's thesis , 1999 .

[22]  M. A. Nielsen.  Computable Functions, Quantum Measurements, and Quantum Dynamics , 1997 .

[23]  Cristian S. Calude,et al.  Coins, Quantum Measurements, and Turing's Barrier , 2002, Quantum Inf. Process..

[24]  Martin Ziegler,et al.  Physically-relativized Church-Turing Hypotheses: Physical foundations of computing and complexity theory of computational physics , 2008, Appl. Math. Comput..

[25]  A. Connes.  THE WITT CONSTRUCTION IN CHARACTERISTIC ONE AND QUANTIZATION , 2010, 1009.1769.

[26]  R. Werner,et al.  Reversible quantum cellular automata , 2004, quant-ph/0405174.

[27]  Current Trends in Axiomatic Quantum Field Theory , 1998, hep-th/9811233.

[28]  R. Werner,et al.  Semicausal operations are semilocalizable , 2001, quant-ph/0104027.

[29]  István Németi,et al.  0 Fe b 20 02 Non-Turing computations via Malament – Hogarth spacetimes , 2002 .

[30]  Vincent Nesme,et al.  One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations , 2007, LATA.

[31]  M. Hogarth.  Non-Turing Computers and Non-Turing Computability , 1994, PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association.

[32]  R. Mcweeny.  On the Einstein-Podolsky-Rosen Paradox , 2000 .

[33]  H. S. Allen.  The Quantum Theory , 1928, Nature.

[34]  Warren D. Smith,et al.  Church's Thesis Meets Quantum Mechanics , 1999 .

[35]  J. Preskill,et al.  Causal and localizable quantum operations , 2001, quant-ph/0102043.