Space-bounded quantum complexity

Journal of Computer and System Sciences

Volumn 59, Issue 2, 1999, Pages 281-326

  Watrous, John ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; ERROR ANALYSIS; PROBABILITY; QUANTUM THEORY; THEOREM PROVING; TURING MACHINES;

PROBABILISTIC TURING MACHINES (PTM); QUANTUM TURING MACHINES (QTM);

COMPUTATIONAL COMPLEXITY;

EID: 0032597110     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1655     Document Type: Article

References (28)

1. Allender E., Ogihara M. Relationships among PL, #L, and the determinant. RAIRO Theoret. Inform. Appl. 30:1996;1-21.
2. Bennett C. H. Logical reversibility of computation. IBM J. Res. Develop. 17:1973;525-532.
3. Bennett C. H. Time/space trade-offs for reversible computation. SIAM J. Comput. 18:1989;766-776.
4. Bernstein E., Vazirani U. Quantum complexity theory. SIAM Journal on Computing. 26:1997;1411-1473.
5. Berthiaume A., Brassard G. Oracle quantum computing. J. Modern Opt. 41:1994;2521-2535.
6. Borodin A. On relating time and space to size and depth. SIAM J. Comput. 6:1977;733-744.
7. Borodin A., Cook S., Pippenger N. Parallel computation for well-endowed rings and space-bounded probabilistic machines. Inform. and Control. 58:1983;113-136.
8. Crescenzi P., Papadimitriou C. Reversible simulation of space-bounded computations. Theoret. Comput. Sci. 143:1995;159-165.
9. Deutsch D. Quantum theory, the Church-Turing principle and the universum quantum computer. Proc. Soc. London A. 400:1985;97-117.
10. Deutsch D., Jozsa R. Rapid solutions of problems by quantum computation. Proceedings of the Royal Society of London A. 439:1992;553-558.
11. Fenner S., Green F., Homer S., Pruim R. Technical Report. April 1998.
12. Gill J. Computational complexity of probabilistic Turing machines. SIAM J. Comput. 6:1977;675-695.
13. Grover L. Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79:1997;325-328.
14. Householder A. The Theory of Matrices in Numerical Analysis. 1965;Blaisdell, Boston.
15. Jung H. Relationships between probabilistic and deterministic tape complexity. 10th Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science. 118:1981;Springer-Verlag, New York/Berlin. p. 339-346.
16. Jung H. On probabilistic time and space. Proceedings of the 12th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science. 194:1985;Springer-Verlag. p. 310-317.
17. A. Kondacs and J. Watrous, On the power of quantum finite state automata, in Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997, pp. 66-75.
18. K. Lange, P. McKenzie, and A. Tapp, Reversible space equals deterministic space (extended abstract), in Proceedings of the 12th Annual IEEE Conference on Computational Complexity, 1997, pp. 45-50. To appear in Journal of Computer and System Sciences.
19. K. Lange, P. McKenzie, and A. Tapp, Reversible space equals deterministic space (extended abstract), in Proceedings of the 12th Annual IEEE Conference on Computational Complexity, 1997, pp. 45-50. To appear in Journal of Computer and System Sciences.
20. Ruzzo W., Simon J., Tompa M. Space-bounded hierarchies and probabilistic computations. J. Comput. System Sci. 28:1984;216-230.
21. M. Saks, Randomization and derandomization in space-bounded computation, in Proceedings of the 11th Annual IEEE Conference on Computational Complexity, 1996, pp. 128-149.
22. 3/2), in Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995, pp. 344-353.
23. Savage J. The Complexity of Computing. 1976;Wiley, New York.
24. Shor P. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26:1997;1484-1509.
25. Simon D. On the power of quantum computation. SIAM J. Comput. 26:1997;1474-1483.
26. J. Watrous, Relationships between quantum and classical space-bounded complexity classes, in Proceedings of the 13th Annual IEEE Conference on Computation Complexity, 1998, pp. 210-227.
27. Watrous J. Space-Bounded Quantum Computation. 1998;University of Wisconsin, Madison.
28. A. Yao, Quantum circuit complexity, in Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993, pp. 352-361.