Quantum theory, the Church–Turing principle and the universal quantum computer

  title={Quantum theory, the Church–Turing principle and the universal quantum computer},
  author={David Deutsch},
  journal={Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences},
  pages={117 - 97}
  • D. Deutsch
  • Published 8 July 1985
  • Physics, Philosophy
  • Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences
It is argued that underlying the Church–Turing hypothesis there is an implicit physical assertion. Here, this assertion is presented explicitly as a physical principle: ‘every finitely realizible physical system can be perfectly simulated by a universal model computing machine operating by finite means’. Classical physics and the universal Turing machine, because the former is continuous and the latter discrete, do not obey the principle, at least in the strong form above. A class of model… 

What Exactly Are Quantum Computations? Classical and Quantum Turing Machines

The more abstract notion of quantum computing machine is introduced, whose computations can be linguistically described by formulas of quantum computational logics.

10 Quantum Complexity Theory I

  • Physics, Computer Science
The foundations of computational complexity theory and the complexity-theoretic form of the Church-Turing thesis are reexamined, and the computational power of computing devices based on quantum physics is studied.

Quantum complexity theory

This paper gives the first formal evidence that quantum Turing machines violate the modern (complexity theoretic) formulation of the Church--Turing thesis, and proves that bits of precision suffice to support a step computation.

Another Quantum Turing Machines

This paper considers that the superposition of configurations, a basic concept of the quantum Turing machines, should also be applied to the probabilistic Turing machines to solve the satisfiability and the validity problems in polynomial time.

The Computational Status of Physics: A Computable Formulation of Quantum Theory

This work considers the physicality of hypercomputational behaviour from first principles, by showing that quantum theory can be reformulated in a way that explains why physical behaviours can be regarded as 'computing something' in the standard computational state-machine sense.

Quantum Computers

  • P. Shor
  • Computer Science, Physics
  • 1998
This work explains quantum computing, and gives an algorithm for prime factorization on a quantum computer that runs asymptotically much faster than the best known algorithm on a digital computer.

Quantum Turing Machines Computations and Measurements

A definition of QTM is proposed, which extends and unifies the notions of Deutsch and Bernstein & Vazirani and defines a class of quantum computable functions, which is a mapping from a general quantum state to a probability distribution of natural numbers.

Construction of a universal quantum computer

A universal quantum computer that can emulate any classical Turing machine and can execute any algorithm that can be implemented in the quantum gate array framework but under the control of a quantum program, and hence is quantum computationally universal.

A computable formulation of quantum theory

According to the Church-Turing Thesis (CTT), effective formal behaviours can be simulated by Turing machines; this has naturally led to speculation that physical sys- tems can also be simulated



Church's Thesis and Principles for Mechanisms

On the Einstein-Podolsky-Rosen paradox

THE paradox of Einstein, Podolsky and Rosen [1] was advanced as an argument that quantum mechanics could not be a complete theory but should be supplemented by additional variables. These additional

On quantum-mechanical automata

Godel, Escher, Bach: An Eternal Golden Braid

From the Publisher: Winner of the Pulitzer Prize, this book applies Godel's seminal contribution to modern mathematics to the study of the human mind and the development of artificial intelligence.

The Logic of Scientific Discovery.

Each of these stages of a research project are evaluated to clarify the sources of ambiguities and uncertainties and suggestions are offered for reducing errors and speeding scientific progress.

Phys. Rev. D

  • Phys. Rev. D
  • 1981

1976Conceptual foundations of quantum mechanics (second edn)

  • 1976

SIAM Jl Comput

  • SIAM Jl Comput
  • 1981