121 search results - page 4 / 25 » The complexity of the Quantum Adiabatic Algorithm |
STOC
1993
ACM
14 years 1 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...
STACS
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
FOCS
1998
IEEE
14 years 2 months ago
1998
IEEE
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
COCO
1998
Springer
14 years 2 months ago
1998
Springer
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...
COCO
2001
Springer
14 years 2 months ago
2001
Springer
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard...