Sciweavers

121 search results - page 11 / 25
» The complexity of the Quantum Adiabatic Algorithm
Sort
View
ICALP
2001
Springer
15 years 2 months ago
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
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...
Peter Høyer, Jan Neerbek, Yaoyun Shi
STACS
2010
Springer
15 years 5 months ago
Quantum Algorithms for Testing Properties of Distributions
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...
Sergey Bravyi, Aram Wettroth Harrow, Avinatan Hass...
FOCS
1998
IEEE
15 years 2 months ago
Quantum Lower Bounds by Polynomials
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 ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
TEC
2008
135views more  TEC 2008»
14 years 10 months ago
Quantum Genetic Optimization
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...
Andrea Malossini, Enrico Blanzieri, T. Calarco
ICALP
2005
Springer
15 years 3 months ago
All Quantum Adversary Methods Are Equivalent
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...
Robert Spalek, Mario Szegedy