Deutsch D., Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer, Proc. of the Royal Society of London, vol.400, 1985, 97-117. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Seminar on Automata, Fall 1996 - Quantum Computation Part (Correct)
....idea of algorithm and what comes to the e#ciency, all reasonable models of the computation are polynomially related with Turing machine. Early notes on the field of quantum computation were made by R. Feynman as mentioned before, but one of the first research result was obtained by D. Deutch 1985 [2]. The interest on the quantum computation raised however as late as 1994 after P. Shor s surprising discovery: A polynomial time Las Vegas quantum algorithm for factoring integers [3] a task that has been thoght impossible for the classical computers. The number of printed papers on quantum ....
D. Deutsch: Quantum theory, the Church-Turing principle and the universal quantum computer, Proceedings of the Royal Society, London, vol A400, 1985, pp. 97-117. 7
A Quantum Scattering Approach to Undecidable Problems.. - Adamyan, Calude, Pavlov (2002) (Correct)
.... 43, 8, 10] have been discussed in a series of papers [18, 12, 25] The common denominator of all approaches is the essential use of some physical theory, relativity theory in [18] quantum theory [12, 25] an attitude advocated by Landauer [32, 33] information is inevitably physical) and Deutsch [16, 17] (the reason why we find it possible to construct, say, electronic calculators, and indeed why we can perform mental arithmetic . is that the laws of physics happen to permit the existence of physical models for the operations of arithmetic) The aim of the present paper is to revisit the ....
D. Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer, Proceedings of the Royal Society London, A 400 (1985), 97--119.
Survey of Computational Assumptions Used in Cryptography Broken or.. - Zhu (2001) (Correct)
....Feynman observed that certain quantum mechanical e#ects could not be simulated e#ciently on a computer. This observation led to speculation 38 that perhaps computation in general could be done more e#ciently using quantum e#ects. In 1985, Deutsch defined the universal quantum Turing machine [Deu85] However, it wasn t until 1994 that this field saw exciting promises brought by Shor s algorithm. Shor discovered polynomial time quantum algorithms for integer factorization and discrete log, thus attacked many cryptosystems based on the hardness of these problems. Shor s work prompted a flurry ....
David Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London Ser. A, A400:97--117, 1985.
Entanglement and Control of Quantum States - Wellens (Correct)
.... laboratory [18, 19, 20] and the branching ratio of di#erent products of chemical reactions can be controlled by an appropriate laser pulse [21] However, a complete quantum state control, i.e. the ability to perform arbitrary unitary operations (as would be required, e.g. for quantum computing [22, 23]) is only possible for relatively simple systems. The most fundamental example is a two level atom, where arbitrary rotations of the Bloch vector can be achieved by a classical electromagnetic field in resonance with the energy di#erence between the two atomic levels (e.g. chapter 15.3 in [24] ....
D. Deutsch, Quantum-Theory, the Church-Turing Principle and the Universal Quantum Computer, Proc. R. Soc. London, Ser. A 400, 97 (1985).
A Decision Procedure For Unitary Linear Quantum Cellular Automata - Dürr, Santha (1999) (Correct)
....mechanics. Feynman [8, 9] pointed out first that there might be a substantial gap between computational models based on classical physics and those based on quantum mechanics. The quantum Turing machine (QTM) the first model of quantum computation, was introduced by Benioff [1, 2] Deutsch in [5] described a universal simulator for QTMs with exponential overhead. Bernstein and Vazirani [3] were able to construct a universal QTM with only polynomial overhead. Other quantum computational models were also studied recently. Deutsch [6] has defined the model of quantum circuits, and later Yao ....
D. Deutsch, Quantum theory, the Church-Turing principle and the universal quantum computer, Proceedings of the Royal Society of London, A400 (1985), pp. 97--117.
Quantum Computation - Gupta Self-citation (Quantum) (Correct)
No context found.
David Deutsch Quantum theory, the Church-Turing principle and universal quantum computer, Proceedings of the Royal Society of London Ser.A A400, 97-117, 1985.
Quantum Algorithms for Hidden Subgroups of S_n - Rao (2001) Self-citation (Quantum) (Correct)
No context found.
David Deutsch Quantum Theory, the Church Turing Principle and the Universal Quantum Computer. Proceedings of the Royal Society of London Ser. A, 400(1985) pp.97-117 43
Unknown - Eugene Eberbach Comp (Correct)
No context found.
Deutsch D., Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer, Proc. of the Royal Society of London, vol.400, 1985, 97-117.
Is Entscheidungsproblem Solvable? - Beyond Undecidability Of (Correct)
No context found.
Deutsch D., Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer, Proc. of the Royal Society of London, vol.400, 1985, 97-117.
Are There New Models of Computation: Reply to Wegner and.. - Cockshott, Michaelson (Correct)
No context found.
D. Deutsch, Quantum theory, the Church-Turing principle and the universal quantum computer, Proceedings of the Royal Society of London A 400, pp. 97-117, 1985.
Computational Complexity of an Optical Model of Computation - Woods (2005) (Correct)
No context found.
David Deutsch. The Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London A, 400:97--117, 1985.
Quantum Computation and Natural Language Processing - Chen (2002) (Correct)
No context found.
D. Deutsch, \Quantum theory, the church-turing principle and the universal quantum computer," in 35th Annual Symposium on the Foundations of Computer Science, (London, UK), pp. 97-117, Royal Society of London A 400, 1985.
Physical Systems for the Solution of Hard Computational Problems - Mattsson (2003) (Correct)
No context found.
Deutsch D, Quantum theory, the Church-Turing principle and the universal quantum computer , Proc. R. Soc. Lond. A 400 97--117 (1985)
Defying Dimensions Modulo 6 - Grolmusz (2003) (Correct)
No context found.
D. Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. Lond. A, 400:97-117, 1985.
Functional Quantum Programming - Mu, Bird (Correct)
No context found.
D. Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. In Proceedings of the Royal Society, Series A, volume 400, pages 97--117, 1985.
Quantum Modeling - Goldstein (Correct)
No context found.
D. Deutsch, \Quantum theory, the church-turing principle and the universal quantum computer," Proceedings, R. Soc. London A 400, p. 97, 1985.
Lower Bounds for Randomized and Quantum Query Complexity.. - Laplante, Magniez (Correct)
No context found.
D. Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. In Proceedings of the Royal Society of London A, volume 400, pages 97--117, 1985.
Some Parallel Algorithms for Integer Factorisation - Brent (1999) (5 citations) (Correct)
No context found.
D. Deutsch, Quantum theory, the Church-Turing principle and the universal quantum computer, Proc. Roy. Soc. London, Ser. A 400 (1985), 97--117.
Some Parallel Algorithms for Integer Factorisation - Brent (1999) (5 citations) (Correct)
No context found.
D. Deutsch, Quantum theory, the Church-Turing principle and the universal quantum computer, Proc.Roy.Soc.London,Ser.A400 (1985), 97--117.
Quantum Computing - And Shor's Factoring (Correct)
No context found.
D. Deutsch. Quantum theory, the Church--Turing principle and the universal quantum computer. Proc. R. Soc. Lond. A 400 (1985), 97--117.
Quantum Computation - Aharonov (1998) (1 citation) (Correct)
No context found.
Deutsch D, Quantum theory, the Church-Turing principle and the universal quantum computer, In Proc. Roy. Soc. Lond. A 400 97-117, 1985
On Statistical Query Sampling and NMR Quantum Computing - Blum, Yang (Correct)
No context found.
D. Deutsch. Quantum theory, the Church-Turing Principle and the universal quantum computer. In Proc. R. Soc. Lond. A, 400:97--117, 1985.
Unknown - Th Summer School (1998) (Correct)
No context found.
Deutsch, D., Quantum theory, the Church-Turing principle and the universal quantum computer, Proc. R. Soc. Lond. A, 400, 97--117 (1985).
Survey of Computational Assumptions Used in Cryptography Broken or.. - Zhu (2001) (Correct)
No context found.
David Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London Ser. A, A400:97-117, 1985.
Incompleteness, Complexity, Randomness and Beyond - Calude (2002) (Correct)
No context found.
D. Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer, Proceedings of the Royal Society London, A 400 (1985), 97--119.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC