Quantum computing: beyond the limits of conventional computation

The quantum model of computation not only offers entirely new ways to manipulate information, but also allows information processing tasks to be formulated in unconventional, genuine quantum mechanical terms. We show that the task of distinguishing among entangled quantum states combines entanglement and non-determinism in a way that makes the quantum solution impossible to simulate on any classical machine (even one equipped with the same measurement capabilities as the quantum computational device). A new class of information processing tasks is thus uncovered whose members are readily carried out by a quantum computer, yet are impossible to perform on any classical machine (whether deterministic or probabilistic). In the broad, unconventional context created by quantum mechanics, the computational power of a quantum computer is therefore strictly greater than that of a classical computer.

[1]  G. Brassard,et al.  Oracle Quantum Computing , 1992, Workshop on Physics and Computation.

[2]  R. Penrose,et al.  Shadows of the Mind , 1994 .

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

[4]  S. Lloyd Programming the Universe: A Quantum Computer Scientist Takes on the Cosmos , 2006 .

[5]  Michael Barr,et al.  The Emperor's New Mind , 1989 .

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

[7]  Charles H. Bennett,et al.  Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. , 1992, Physical review letters.

[8]  Carl Pomerance,et al.  The Development of the Number Field Sieve , 1994 .

[9]  J. Bell On the Einstein-Podolsky-Rosen paradox , 1964 .

[10]  Tien D. Kieu Quantum adiabatic algorithm for Hilbert's tenth problem: I. The algorithm , 2003 .

[11]  Umesh V. Vazirani,et al.  Quantum complexity theory , 1993, STOC.

[12]  Selim G. Akl,et al.  Quantum Measurements and Universal Computation , 2006, Int. J. Unconv. Comput..

[13]  Weinfurter,et al.  Dense coding in experimental quantum communication. , 1996, Physical review letters.

[14]  S. BellJ,et al.  Einstein‐Podolsky‐Rosen逆理 量子力学での遠隔作用か , 1987 .

[15]  Selim G. Akl,et al.  THE MYTH OF UNIVERSAL COMPUTATION ∗ , 2005 .

[16]  R. Feynman Simulating physics with computers , 1999 .

[17]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[18]  Amir Kamil,et al.  Quantum Computability and Complexity and the Limits of Quantum Computation , 2003 .

[19]  Cristian S. Calude,et al.  Coins, Quantum Measurements, and Turing's Barrier , 2002, Quantum Inf. Process..