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 computing machines that is the quantum generalization of the class of Turing machines is described, and it is shown that quantum theory and the 'universal quantum computer’ are compatible with the principle. Computing machines resembling the universal quantum computer could, in principle, be built and would have many remarkable properties not reproducible by any Turing machine. These do not include the computation of non-recursive functions, but they do include ‘quantum parallelism’, a method by which certain probabilistic tasks can be performed faster by a universal quantum computer than by any classical restriction of it. The intuitive explanation of these properties places an intolerable strain on all interpretations of quantum theory other than Everett’s. Some of the numerous connections between the quantum theory of computation and the rest of physics are explored. Quantum complexity theory allows a physically more reasonable definition of the ‘complexity’ or ‘knowledge’ in a physical system than does classical complexity theory.
[1]
M. Kendall,et al.
The Logic of Scientific Discovery.
,
1959
.
[2]
J. Bell.
On the Einstein-Podolsky-Rosen paradox
,
1964
.
[3]
J. Bekenstein.
Black Holes and Entropy
,
1973,
Jacob Bekenstein.
[4]
Tommaso Toffoli,et al.
Computation and Construction Universality of Reversible Cellular Automata
,
1977,
J. Comput. Syst. Sci..
[5]
D. Hofstadter,et al.
Godel, Escher, Bach: An Eternal Golden Braid
,
1979
.
[6]
Robin Gandy,et al.
Church's Thesis and Principles for Mechanisms
,
1980
.
[7]
Douglas R. Hofstadter,et al.
Godel, Escher, Bach: An Eternal Golden Braid.
,
1980
.
[8]
J. Bekenstein.
Universal upper bound on the entropy-to-energy ratio for bounded systems
,
1981,
Jacob Bekenstein.
[9]
David Z. Albert,et al.
On quantum-mechanical automata
,
1983
.