Sciweavers

STOC
1993
ACM
134views Algorithms» more  STOC 1993»
13 years 8 months ago
Quantum complexity theory
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...
Ethan Bernstein, Umesh V. Vazirani