One complexity theorist's view of quantum computing

Theoretical Computer Science

Volumn 292, Issue 3, 2003, Pages 597-610

  Fortnow, Lance ^a  

^a NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS;

QUANTUM COMPUTING;

QUANTUM THEORY;

EID: 0037473941     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00377-2     Document Type: Conference Paper

References (35)

1. Adleman L., DeMarrais J., Huang M. Quantum computability. SIAM J. Comput. 26(5):1997;1524-1540.
2. Aleliunas R., Karp R., Lipton R., Lovász L., Rackoff C. Random walks, universal traversal sequences, and the complexity of maze problems. Proc. 20th IEEE Symp. on Foundations of Computer Science. 1979;218-223 IEEE, New York.
3. Arora S., Lund C., Motwani R., Sudan M., Szegedy M. Proof verification and the hardness of approximation problems. J. ACM. 45(3):1998;501-555.
4. Babai L., Fortnow L., Lund C. Non-deterministic exponential time has two-prover interactive protocols. Comput. Complexity. 1(1):1991;3-40.
5. Balcázar J., Díaz J., Gabarró J. Structural Complexity I, EATCS Monographs on Theoretical Computer Science. Vol. 11:1988;Springer, Berlin.
6. Beals R., Buhrman H., Cleve R., Mosca M., de Wolf R. Quantum lower bounds by polynomials. Proc. 39th IEEE Symp. on Foundations of Computer Science. 1998;352-361 IEEE, New York.
7. Bennett C. Logical reversibility of computation. IBM J. Res. Develop. 17(6):1973;525-532.
8. C. Bennett, G. Brassard, A. Ekert, Quantum cryptography, Scientific American, October 1992, pp. 50-57.
9. Bennett C., Bernstein E., Brassard G., Vazirani U. Strengths and weaknesses of quantum computing. SIAM J. Comput. 26(5):1997;1510-1523.
10. Bernstein E., Vazirani U. Quantum complexity theory. SIAM J. Comput. 26(5):1997;1411-1473.
11. Boneh D., Lipton R. Quantum cryptanalysis of hidden linear functions. Proc. 15th CRYPTO Conf. Lecture Notes in Computer Science. Vol. 963:1995;424-437 Springer, Berlin.
12. Fenner S., Fortnow L., Kurtz S., Li L. An oracle builder's toolkit. Proc. 8th IEEE Structure in Complexity Theory Conf. 1993;120-131 IEEE, New York.
13. S. Fenner, F. Green, S. Homer, R. Pruim, Determining acceptance possibility for a quantum computation is hard for PH, Tech. Report 98-008, Computer Science Department, Boston University, 1998.
14. Fortnow L. The role of relativization in complexity theory. Bull. European Assoc. Theoretical Comput. Sci. 52:1994;229-244.
15. Fortnow L. Relativized worlds with an infinite hierarchy. Inform. Process. Lett. 69(6):1999;309-313.
16. Fortnow L., Rogers J. Complexity limitations on quantum computation. J. Comput. System Sci. 59(2):1999;240-252.
17. Grover L. A fast quantum mechanical algorithm for database search. Proc. 28th ACM Symp. on the Theory of Computing. 1996;212-219 ACM, New York.
18. Gruska J. Quantum Computing. 1999;McGraw-Hill, New York.
19. Hopcroft J., Ullman J. Introduction to Automata Theory, Languages and Computation. 1979;Addison-Wesley, Reading, MA.
20. Kitaev A. Quantum computations. algorithms and error correction Russian Math. Surveys. 52(6):1997;53-112.
21. Kitaev A., Watrous J. Parallelization, amplification, and exponential time simulation of quantum interactive proof systems. Proc. 32nd ACM Symp. on the Theory of Computing. 2000;608-617 ACM, New York.
22. L. Li, On the counting functions, Ph.D. Thesis, Department of Computer Science TR 93-12, University of Chicago, 1993.
23. Lund C., Fortnow L., Karloff H., Nisan N. Algebraic methods for interactive proof systems. J. ACM. 39(4):1992;859-868.
24. D. Meyer, Quantum games and quantum algorithms, in: S. Lomonaco, Jr., H. Brandt (eds.), Quantum Computation and Quantum Information Science, Contemporary Mathematics Series. American Mathematical Society, 2001, Providence, RI, to appear.
25. Nisan N., Szegedy M. On the degree of boolean functions as real polynomials. Comput. Complexity. 4(4):1994;301-313.
26. J. Preskill, Lecture notes for advanced mathematical methods of physics, http://www.theory.caltech.edu/̃preskill/ph229/index.html #lecture, 1998.
27. Shamir A. IP=PSPACE J. ACM. 39(4):1992;869-877.
28. Shor P. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5):1997;1484-1509.
29. Simon D. On the power of quantum computation. SIAM J. Comput. 26(5):1997;1474-1483.
30. R. Solovay, V. Strassen, A fast Monte-Carlo test for primality, SIAM J. Comput. 6 (1977) 84-85, see also erratum 7 (1978) 118.
31. R. Solovay, A. Yao, Manuscript, 1996.
32. Toda S., Ogiwara M. Counting classes are at least as hard as the polynomial-time hierarchy. SIAM J. Comput. 21(2):1992;316-328.
33. Valiant L. The complexity of computing the permanent. Theoret. Comput. Sci. 8:1979;189-201.
34. Watrous J. PSPACE has constant-round quantum interactive proof systems. Proc. 40th IEEE Symp. on Foundations of Computer Science. 1999;112-119 IEEE, New York.
35. Watrous J. Quantum simulations of classical random walks and undirected graph connectivity. Proc. 14th IEEE Conf. on Computational Complexity. 1999;180-187 IEEE Computer Society, Los Alamitos.