1391 search results - page 1 / 279 » Complexity Limitations on Quantum Computation |
ACMSE
2006
ACM
13 years 9 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
COCO
1998
Springer
13 years 9 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...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
SPAA
2003
ACM
13 years 10 months ago
2003
ACM
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...