4084 search results - page 8 / 817 » The Method of Quantum Clustering |
COCO
2008
Springer
14 years 11 months ago
2008
Springer
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progres...
102
Voted
FOCS
1998
IEEE
15 years 1 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...
IPL
2000
14 years 9 months ago
2000
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environ...
STOC
2003
ACM
15 years 9 months ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...