## Quantum complexity theory (1993)

### Cached

### Download Links

- [www.tcs.ifi.lmu.de]
- [www.hep.princeton.edu]
- [http.cs.berkeley.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM |

Citations: | 475 - 5 self |

### BibTeX

@INPROCEEDINGS{Bernstein93quantumcomplexity,

author = {Ethan Bernstein and Umesh Vazirani},

title = {Quantum complexity theory},

booktitle = {in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM},

year = {1993},

pages = {11--20}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This construction is substantially more complicated than the corresponding construction for classical Turing machines (TMs); in fact, even simple primitives such as looping, branching, and composition are not straightforward in the context of quantum Turing machines. We establish how these familiar primitives can be implemented and introduce some new, purely quantum mechanical primitives, such as changing the computational basis and carrying out an arbitrary unitary transformation of polynomially bounded dimension. We also consider the precision to which the transition amplitudes of a quantum Turing machine need to be specified. We prove that O(log T) bits of precision suffice to support a T step computation. This justifies the claim that the quantum Turing machine model should be regarded as a discrete model of computation and not an analog one. We give the first formal evidence that quantum Turing machines violate the modern (complexity theoretic) formulation of the Church–Turing thesis. We show the existence of a problem, relative to an oracle, that can be solved in polynomial time on a quantum Turing machine, but requires superpolynomial time on a bounded-error probabilistic Turing machine, and thus not in the class BPP. The class BQP of languages that are efficiently decidable (with small error-probability) on a quantum Turing machine satisfies BPP ⊆ BQP ⊆ P ♯P. Therefore, there is no possibility of giving a mathematical proof that quantum Turing machines are more powerful than classical probabilistic Turing machines (in the unrelativized setting) unless there is a major breakthrough in complexity theory.