Sciweavers

COCO
2008
Springer
86views Algorithms» more  COCO 2008»
13 years 6 months ago
The Multiplicative Quantum Adversary
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...
Robert Spalek
ICALP
2005
Springer
13 years 9 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
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
14 years 4 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek