198 search results - page 1 / 40 » The Multiplicative Quantum Adversary |
COCO
2008
Springer
13 years 6 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...
TIT
2008
13 years 4 months ago
2008
An extractor is a function that is used to extract randomness. Given an imperfect random source X and a uniform seed Y , the output (X; Y ) is close to uniform. We study properties...
COCO
2005
Springer
13 years 10 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
ICALP
2005
Springer
13 years 10 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...
DAGSTUHL
2006
13 years 6 months ago
2006
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...