Negative weights make adversaries stronger
Authors:
Open Access
- 11 June 2007
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 526-535
Abstract
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 application to classical complexity in formula size lower bounds, and is versatile with equivalent formulations in terms of weight schemes, eigenvalues, and Kolmogorov complexity. All these formulations rely on the principle that if an algorithm successfully computes a function then, in particular, it is able to distinguish between inputs which map to different values. We present a stronger version of the adversary method which goes beyond this principle to make explicit use of the stronger condition that the algorithm actually computes the function. This new method, which we call ADV+-, has all the advantages of the old: it is a lower bound on bounded-error quantum query complexity, its square is a lower bound on formula size, and it behaves well with respect to function composition. Moreover ADV+- is always at least as large as the adversary method ADV, and we show an example of a monotone function for which ADV+-(f)=Omega(ADV(f)^1.098). We also give examples showing that ADV+- does not face limitations of ADV like the certificate complexity barrier and the property testing barrier.Comment: 29 pages, v2: added automorphism principle, extended to non-boolean functions, simplified examples, added matching upper bound for ADKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- THE QUANTUM ADVERSARY METHOD AND CLASSICAL FORMULA SIZE LOWER BOUNDScomputational complexity, 2006
- On the power of Ambainis lower boundsTheoretical Computer Science, 2005
- All Quantum Adversary Methods Are Equivalent2005
- Quantum lower bounds for the collision and the element distinctness problemsJournal of the ACM, 2004
- Complexity measures and decision tree complexity: a surveyTheoretical Computer Science, 2002
- Quantum Lower Bounds by Quantum ArgumentsJournal of Computer and System Sciences, 2002
- Quantum lower bounds by polynomialsJournal of the ACM, 2001
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- On rank vs. communication complexityCombinatorica, 1995
- Monotone circuits for connectivity require super-logarithmic depth1988