On the complexity of simulating space-bounded quantum computations

Computational Complexity

Volumn 12, Issue 1-2, 2003, Pages 48-84

  Watrous, John ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

Quantum computational complexity; Space bounded computation; Space bounded quantum computation

Indexed keywords

EID: 2442665444     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00037-003-0177-8     Document Type: Article

References (24)

1. L. ADLEMAN, J. DEMARRAIS & M. HUANG (1997). Quantum computability. SIAM J. Comput. 26, 1524-1540.
2. D. AHARONOV, A. KITAEV & N. NISAN (1998). Quantum circuits with mixed states. In Proc. 30th Annual ACM Symposium on Theory of Computing, 20 30.
3. E. ALLENDER, V. ARVIND & M. MAHAJAN (2003). Arithmetic complexity, Kleene closure, and formal power series. Theory Comput. Syst. 36, 303-328.
4. E. ALLENDER & M. OGIHARA (1996). Relationships among PL, #L, and the determinant. RAIRO Inform. Théor. Appl. 30, 1-21.
5. A. BORODIN, S. COOK & N. PIPPENGER (1983). Parallel computation for well-endowed rings and space-bounded probabilistic machines. Inform. and Control 58, 113-136.
6. D. BRUSS, D. DIVINCENZO, A. EKERT, C. FUCHS, C. MACCHIAVELLO & J. SMOLIN (1998). Optimal universal and state-dependent quantum cloning. Phys. Rev. A 57, 2368-2378.
7. R. CLEVE (1998). Personal communication.
8. S. FENNER, L. FORTNOW & S. KURTZ (1994). Gap-definable counting classes. J. Comput. System Sci. 48, 116-148.
9. S. FENNER, F. GREEN, S. HOMER & R. PRUIM (1999). Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy. Proc. Roy. Soc. London A 455, 3953-3966.
10. L. FORTNOW (1997). Counting complexity. In Complexity Theory Retrospective II, L. Hemaspaandra & A. Selman (eds.), Springer, 81-107.
11. L. FORTNOW & J. ROGERS (1999). Complexity limitations on quantum computation. J. Comput. System Sci. 59, 240-252.
12. J. GILL (1977). Computational complexity of probabilistic Turing machines. SIAM J. Comput. 6, 675-695.
13. I. M. ISAACS (1994). Algebra: a Graduate Course. Brooks/Cole.
14. H. JUNG (1985). On probabilistic time and space. In Proc. 12th International Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci. 194, Springer, 310 317.
15. A. YU. KITAEV, A. H. SHEN & M. N. VYALYI (2002). Classical and Quantum Computation. Grad. Stud. Math. 47, Amer. Math. Soc.
16. K. MAHLER (1961). Lectures on Diophantine Approximations, Vol. 1, Cushing Malloy.
17. M. NIELSEN & C. CAVES (1997). Reversible quantum operations and their application to teleportation. Phys. Rev. A 55, 2547-2556.
18. M. A. NIELSEN & I. L. CHUANG (2000). Quantum Computation and Quantum Information. Cambridge Univ. Press.
19. M. SAKS (1996). Randomization and derandomization in space-bounded computation. In Proc. 11th Annual IEEE Conference on Computational Complexity, 128 149.
20. W. SAVITCH (1970). Relationships between nondeterministic and deterministic tape complexities. J. Comput. System Sci. 4, 177-192.
21. B. TERHAL & D. DIVINCENZO (2000). On the problem of equilibration and the computation of correlation functions on a quantum computer. Phys. Rev. A 61, article 022 301.
22. L. VALIANT (1979). The complexity of computing the permanent. Theoret. Comput. Sci. 8, 189-201.
23. K. WAGNER & G. WECHSUNG (1986). Computational Complexity. Math. Appl. 21, Reidel.
24. J. WATROUS (1999). Space-bounded quantum complexity. J. Comput. System Sci. 59, 281-326.