587 search results - page 20 / 118 » Quantum computation and quantum information |
STOC
2006
ACM
14 years 4 months ago
2006
ACM
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
STOC
1993
ACM
14 years 3 months ago
1993
ACM
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...
CASC
2007
Springer
14 years 5 months ago
2007
Springer
FSTTCS
1998
Springer
14 years 3 months ago
1998
Springer
ENTCS
2008
13 years 11 months ago
2008
abstraction and quantum computation Alessandra Di Pierro1 Dipartimento di Informatica University of Pisa Pisa, Italy Herbert Wiklicky2 Department of Computing Imperial College Lond...