Strengths and weaknesses of quantum computing

SIAM Journal on Computing

Volumn 26, Issue 5, 1997, Pages 1510-1523

  Bennett, Charles H ^a   Bernstein, Ethan ^b   Brassard, Gilles ^c   Vazirani, Umesh ^d  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b MICROSOFT   (United States)

^c UNIVERSITÉ DE MONTRÉAL   (Canada)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Oracle quantum Turing machines; Quantum polynomial time; Quantum Turing machines

Indexed keywords

EID: 0001063035     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539796300933     Document Type: Article

References (19)

1. L. BABAI AND S. MORAN, Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes, J. Comput. System Sci., 36 (1988), pp. 254-276.
2. C. H. BENNETT, Logical reversibility of computation, IBM J. Res. Develop., 17 (1973), pp. 525-532.
3. A with probability 1, SIAM J. Comput., 10 (1981), pp. 96-113.
4. E. BERNSTEIN AND U. VAZIRANI, Quantum complexity theory, in Proc. 25th Annual ACM Symposium Theory Comput., San Diego, CA, 1993, pp. 11-20; SIAM J. Comput., 26 (1997), pp. 1411-1473.
5. E. BERNSTEIN AND U. VAZIRANI, Quantum complexity theory, in Proc. 25th Annual ACM Symposium Theory Comput., San Diego, CA, 1993, pp. 11-20; SIAM J. Comput., 26 (1997), pp. 1411-1473.
6. A. BERTHIAUME AND G. BRASSARD, The quantum challenge to structural complexity theory, in Proc. 7th IEEE Conference on Structure in Complexity Theory, Boston, MA, 1992, pp. 132-137.
7. A. BERTHIAUME AND G. BRASSARD, Oracle quantum computing, J. Modern Opt., 41 (1994), pp. 2521-2535.
8. M. BOYER, G. BRASSARD, P. HØYER, AND A. TAPP, Tight bounds on quantum searching, in Proc. 4th Workshop on Phys. Comput., New England Complex Systems Institute, Boston, 1996, pp. 36-43. Available online in the Inter Journal at http://interjournal.org.
9. N. BSHOUTY AND J. JACKSON, Learning DNF over uniform distribution using a quantum example oracle, in Proc. 8th Annual ACM Conference on Comput. Learning Theory, Santa Cruz, CA, 1995, pp. 118-127.
10. D. DEUTSCH, Quantum theory, the Church-Turing principle and the universal quantum computer, Proc. Roy. Soc. London A, 400 (1985), pp. 97-117.
11. D. DEUTSCH, Quantum computational networks, Proc. Roy. Soc. London A, 425 (1989), pp. 73-90.
12. D. DEUTSCH AND R. JOZSA, Rapid solution of problems by quantum computation, Proc. Roy. Soc. London A, 439 (1992), pp. 553-558.
13. R. FEYNMAN, Simulating physics with computers, Internat. J. Theoret. Phys., 21 (1982), pp. 467-488.
14. L. GROVER, A fast quantum mechanical algorithm for database search, in Proc. 28th Annual ACM Symposium on Theory of Comput., Philadelphia, PA, 1996, pp. 212-219.
15. J. MACHTA, Phase Information in Quantum Oracle Computing, manuscript, Physics Dept., University of Massachusetts at Amherst, Amherst, MA, 1996.
16. P. W. SHOR, Algorithms for quantum computation: Discrete logarithms and factoring, in Proc. 35th Annual IEEE Symposium on Foundations of Comput. Sci., Santa Fe, NM, 1994, pp. 124-134.
17. D. SIMON, On the power of quantum computation, in Proc. 35th Annual IEEE Symposium on Foundations of Comput. Sci., Santa Fe, NM, 1994, pp. 116-123; SIAM J. Comput., 26 (1997), pp. 1474-1483.
18. D. SIMON, On the power of quantum computation, in Proc. 35th Annual IEEE Symposium on Foundations of Comput. Sci., Santa Fe, NM, 1994, pp. 116-123; SIAM J. Comput., 26 (1997), pp. 1474-1483.
19. A. YAO, Quantum circuit complexity, in Proc. 34th Annual IEEE Symposium on Foundations of Comput. Sci., Palo Alto, CA, 1993, pp. 352-361.