Journal ArticleDOI
Quantum theory, the Church-Turing principle and the universal quantum computer
Reads0
Chats0
TLDR
In this paper, it is argued that underlying the Church-Turing hypothesis there is an implicit physical assertion: every finitely realizable physical system can be perfectly simulated by a universal model computing machine operating by finite means.Abstract:
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 realizable 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.read more
Citations
More filters
Book ChapterDOI
Deutsch-Jozsa Algorithm for Continuous Variables
TL;DR: Using the Fourier transformation and XOR gate appropriate for continuous spectra, it is shown that under ideal operation to infinite precision that there is an infinite reduction in number of query calls in this scheme.
Journal ArticleDOI
Computation in Finitary Stochastic and Quantum Processes
TL;DR: In this paper, the authors introduce stochastic and quantum finite-state transducers as computation-theoretic models of quantum finitary processes and compare deterministic and non-deterministic versions, summarizing their relative computational power.
Patent
Quantum computing method using Josephson junctions between s-wave and d-wave superconductors
TL;DR: In this paper, a solid-state quantum computing structure includes a set of islands that Josephson junctions separate from a first superconducting bank, and the crystal orientations of the islands relative to the bank influence the initial quantum state and tunneling probabilities between the ground states.
References
More filters
Journal ArticleDOI
On the Einstein-Podolsky-Rosen paradox
TL;DR: In this article, it was shown that even without such a separability or locality requirement, no hidden variable interpretation of quantum mechanics is possible and that such an interpretation has a grossly nonlocal structure, which is characteristic of any such theory which reproduces exactly the quantum mechanical predictions.
Book
The Logic of Scientific Discovery
TL;DR: The Open Society and Its Enemies as discussed by the authors is regarded as one of Popper's most enduring books and contains insights and arguments that demand to be read to this day, as well as many of the ideas in the book.
Journal ArticleDOI
Black holes and entropy
TL;DR: In this paper, the concept of black-hole entropy was introduced as a measure of information about a black hole interior which is inaccessible to an exterior observer, and it was shown that the entropy is equal to the ratio of the black hole area to the square of the Planck length times a dimensionless constant of order unity.
Journal ArticleDOI
Godel, Escher, Bach: An Eternal Golden Braid
TL;DR: In this paper, the authors apply Godel's seminal contribution to modern mathematics to the study of the human mind and the development of artificial intelligence, and apply it to the case of artificial neural networks.
Journal ArticleDOI
Universal upper bound on the entropy-to-energy ratio for bounded systems
TL;DR: For systems with negligible self-gravity, the bound follows from application of the second law of thermodynamics to a gedanken experiment involving a black hole as discussed by the authors, and it is shown that black holes have the maximum entropy for given mass and size which is allowed by quantum theory and general relativity.