On The Power of Exact Quantum Polynomial Time

We investigate the power of quantum computers when they are required to return an answer that is guaranteed correct after a time that is upper-bounded by a polynomial in the worst case. In an oracle setting, it is shown that such machines can solve problems that would take exponential time on any classical bounded-error probabilistic computer.

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

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

[3]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[4]  P. Benioff.  Quantum mechanical hamiltonian models of turing machines , 1982 .

[5]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[6]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[7]  I PaulBenioff.  Quantum Mechanical Hamiltonian Models of Turing Machines , 1982 .

[8]  Gilles Brassard,et al.  Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..

[9]  Gilles Brassard,et al.  The quantum challenge to structural complexity theory , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

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

[11]  Gilles Brassard,et al.  A Quantum Jump in Computer Science , 1995, Computer Science Today.