Quantum Speed‐up of Computations

Wolfram’s thesis consists of two parts: (a) Any physical system can be simulated (to any degree of approximation) by a universal Turing machine (b) Complexity bounds on Turing machine simulations have physical significance. For example, suppose that the computation of the minimum energy of some system of n particles takes at least exponentially (in n) many steps. Then the relaxation time of the actual physical system to its minimum energy state will also take exponential time. An even more extreme formulation of (more or less) the same thesis is due to Aharonov (1998): A probabilistic Turing machine can simulate any reasonable physical device in polynomial cost. She calls this The Modern Church Thesis. Aharonov refers here to probabilistic Turing machines that use random numbers in addition to the usual deterministic table of steps. It seems that such machines are capable to perform certain tasks faster than fully deterministic machines. The most famous randomized algorithm of that kind concerns the decision whether a given natural number is prime. A probabilistic algorithm that decides primality in a number of

[1]  R. Jozsa,et al.  Quantum Computation and Shor's Factoring Algorithm , 1996 .

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

[3]  A. Paz.  Probabilistic algorithms , 2003 .

[4]  Itamar Pitowsky,et al.  Laplace's demon consults an oracle: The computational complexity of prediction , 1996 .

[5]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[6]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

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

[8]  H T Siegelmann,et al.  Dating and Context of Three Middle Stone Age Sites with Bone Points in the Upper Semliki Valley, Zaire , 2007 .

[9]  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.

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

[11]  Wolfram,et al.  Undecidability and intractability in theoretical physics. , 1985, Physical review letters.

[12]  J. Earman,et al.  Forever Is a Day: Supertasks in Pitowsky and Malament-Hogarth Spacetimes , 1993, Philosophy of Science.

[13]  R. D. Wolf.  Quantum Computation and Shor's Factoring Algorithm , 1999 .

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Lov K. Grover,et al.  Quantum computation , 1999, Proceedings Twelfth International Conference on VLSI Design. (Cat. No.PR00013).

[16]  Joseph F. Traub,et al.  Algorithms and Complexity: New Directions and Recent Results , 1976 .

[17]  Moore,et al.  Unpredictability and undecidability in dynamical systems. , 1990, Physical review letters.

[18]  H. Keisler,et al.  The Kleene Symposium , 1980 .

[19]  M. B. Pour-El,et al.  The wave equation with computable initial data such that its unique solution is not computable , 1981 .

[20]  Oron Shagrir,et al.  Physical Hypercomputation and the Church–Turing Thesis , 2003, Minds and Machines.