Relationships between quantum and classical space-bounded complexity classes

This paper investigates the relative power of space-bounded quantum and classical (probabilistic) computational models. The following relationships are proved. 1. Any probabilistic Turing machine (PTM) which runs in space s and which halts absolutely (i.e. halts with certainty after a finite number of steps) can be simulated in space O(s) by a quantum Turing machine (QTM). If the PTM operates with bounded error, then the QTM may be taken to operate with bounded error as well, although the QTM may not halt absolutely in this case. In the unbounded error case, the QTM may be taken to halt absolutely. 2. Any QTM running in space s can be simulated by an unbounded error PTM running in space O(s). No assumptions on the probability of error or Turing time for the QTM are required, but it is assumed that all transition amplitudes of the quantum machine are rational. It follows that unbounded error, space O(s) bounded quantum Turing machines and probabilistic Turing machines are equivalent in power. This implies that any space s QTM can be simulated deterministically in space O(s/sup 2/), and further that any (unbounded-error) QTM running in log-space can be simulated in NC/sup 2/ We also consider quantum analogues of nondeterministic and one-sided error probabilistic space-bounded classes, and prove some simple relationships regarding these classes.

[1]  Pierre McKenzie,et al.  Reversible space equals deterministic space , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

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

[3]  H. Jung.  Relationships between Probabilistic and Deterministic Tape Complexity , 1981, MFCS.

[4]  Daniel R. Simon,et al.  On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[5]  Charles H. Bennett.  Time/Space Trade-Offs for Reversible Computation , 1989, SIAM J. Comput..

[6]  Umesh V. Vazirani,et al.  Quantum Complexity Theory , 1997, SIAM J. Comput..

[7]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

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

[9]  John Watrous,et al.  On the power of quantum finite state automata , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[10]  V Vinay.  Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

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

[12]  Michael Saks,et al.  RSPACE(S) DSPACE(S^3/2) , 1995, FOCS 1995.

[13]  Christos H. Papadimitriou,et al.  Reversible Simulation of Space-Bounded Computations , 1995, Theor. Comput. Sci..

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

[15]  Stephen A. Fenner,et al.  Determining Acceptance Possibility for a Quantum Computation is Hard for PH , 1998 .

[16]  Eric Allender,et al.  Relationships Among PL, #L, and the Determinant , 1996, RAIRO Theor. Informatics Appl..

[17]  Aiken,et al.  Why is Boolean Complexity Theory Di cult ? , 1992 .

[18]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[19]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

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

[21]  Michael Saks.  omization and Derandomization in Space-Bounded Computation , 1996 .

[22]  Allan Borodin,et al.  Parallel Computation for Well-Endowed Rings , 1983 .

[23]  L. Fortnow.  Counting complexity , 1998 .

[24]  Hermann Jung,et al.  On Probabilistic Tape Complexity and Fast Circuits for Matrix Inversion Problems (Extended Abstract) , 1984, ICALP.

[25]  Alston S. Householder,et al.  The Theory of Matrices in Numerical Analysis , 1964 .

[26]  L. Valiant.  Why is Boolean complexity theory difficult , 1992 .

[27]  Hermann Jung.  On Probabilistic Time and Space , 1985, ICALP.

[28]  Andrew Chi-Chih Yao,et al.  Quantum Circuit Complexity , 1993, FOCS.

[29]  Leonard M. Adleman,et al.  Quantum Computability , 1997, SIAM J. Comput..

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