121 search results - page 11 / 25 » The complexity of the Quantum Adiabatic Algorithm |
115
click to vote
ICALP
2001
Springer
15 years 6 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
125
click to vote
STACS
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Suppose one has access to oracles generating samples from two unknown probability distributions p and q on some N-element set. How many samples does one need to test whet...
138
click to vote
FOCS
1998
IEEE
15 years 6 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 ...
113
click to vote
TEC
2008
15 years 1 months ago
2008
Abstract--The complexity of the selection procedure of a genetic algorithm that requires reordering, if we restrict the class of the possible fitness functions to varying fitness f...
100
click to vote
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...