Sciweavers

Share
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
10 years 3 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
books