An adversary for algorithms

The general adversary bound is a semi-definite program that lower-bounds the number of input queries needed by a quantum algorithm to evaluate a function. It is known to be tight up to constant factors for functions (total or partial) with boolean output and binary input alphabet. We show that the general adversary bound is tight for any function whatsoever, with potentially non-boolean input or output alphabets. We also show that quantum query complexity exhibits a remarkable composition property: Q ( f(g(x), . . . , g(x)) ) = O ( Q(f)Q(g) ) for any compatible functions f, g. This was previously known only in the boolean case. Both of these results are obtained by defining a new, but closely related, semi-definite program that we call the witness size. The minimization formulation of the witness size adds constraints compared with the general adversary bound to enable dual solutions to correspond to eigenvalue-zero eigenvectors of certain graphs. While the witness size can be strictly larger than the adversary bound, we show that it can be at most a factor of two larger.

[1]  Michael E. Saks,et al.  A lower bound on the quantum query complexity of read-once functions , 2001, Electron. Colloquium Comput. Complex..

[2]  Andris Ambainis,et al.  The quantum query complexity of certification , 2010, Quantum Inf. Comput..

[3]  Jan Neerbek,et al.  Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness , 2002, Algorithmica.

[4]  Andris Ambainis,et al.  Polynomial degree vs. quantum query complexity , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[5]  Ben Reichardt,et al.  Reflections for quantum query algorithms , 2010, SODA '11.

[6]  Frédéric Magniez,et al.  Quantum algorithms for element distinctness , 2000, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[7]  Andrew M. Childs,et al.  ANY AND-OR FORMULA OF SIZE N CAN BE EVALUATED IN TIME N1/2+o(1) ON A QUANTUM COMPUTER , 2010 .

[8]  Troy Lee,et al.  A Direct Product Theorem for Discrepancy , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

[9]  Ben Reichardt,et al.  Span-program-based quantum algorithm for evaluating formulas , 2007, Theory Comput..

[10]  Andrew M. Childs,et al.  Discrete-Query Quantum Algorithm for NAND Trees , 2009, Theory Comput..

[11]  Mario Szegedy,et al.  All Quantum Adversary Methods Are Equivalent , 2005, ICALP.

[12]  Troy Lee,et al.  Negative weights make adversaries stronger , 2007, STOC '07.

[13]  M. Sipser,et al.  Invariant quantum algorithms for insertion into an ordered list , 1999, quant-ph/9901059.

[14]  Frédéric Magniez,et al.  Lower bounds for randomized and quantum query complexity using Kolmogorov arguments , 2004 .

[15]  M. Ben-Or,et al.  Quantum Search in an Ordered List via Adaptive Learning , 2007, quant-ph/0703231.

[16]  Gilles Brassard,et al.  Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..

[17]  Scott Aaronson,et al.  Quantum lower bounds for the collision and the element distinctness problems , 2004, JACM.

[18]  Michael E. Saks,et al.  Quantum query complexity and semi-definite programming , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[19]  Shengyu Zhang.  On the Power of Ambainis's Lower Bounds , 2004, ICALP.

[20]  Robert Spalek,et al.  Lower Bounds on Quantum Query Complexity , 2005, Bull. EATCS.

[21]  Hartmut Klauck,et al.  Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity , 2010, Inf. Process. Lett..

[22]  Nathan Linial,et al.  Complexity measures of sign matrices , 2007, Comb..

[23]  Andris Ambainis,et al.  Quantum lower bounds by quantum arguments , 2000, STOC '00.

[24]  Ben Reichardt.  Least span program witness size equals the general adversary lower bound on quantum query complexity , 2010, Electron. Colloquium Comput. Complex..

[25]  Andris Ambainis,et al.  Quantum walk algorithm for element distinctness , 2003, 45th Annual IEEE Symposium on Foundations of Computer Science.

[26]  Ronald de Wolf,et al.  Robust Polynomials and Quantum Algorithms , 2003, Theory of Computing Systems.

[27]  R. Bhatia.  Positive Definite Matrices , 2007 .

[28]  Edward Farhi,et al.  A Quantum Algorithm for the Hamiltonian NAND Tree , 2008, Theory Comput..

[29]  Andrew M. Childs,et al.  Quantum algorithms for subset finding , 2005, Quantum Inf. Comput..

[30]  Ben Reichardt,et al.  Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[31]  Troy Lee,et al.  Optimal Quantum Adversary Lower Bounds for Ordered Search , 2008, ICALP.

[32]  Ben Reichardt,et al.  Span programs and quantum query algorithms , 2010, Electron. Colloquium Comput. Complex..

[33]  Shengyu Zhang,et al.  On the power of Ambainis lower bounds , 2005, Theor. Comput. Sci..

[34]  Pablo A. Parrilo,et al.  Quantum algorithms for the ordered search problem via semidefinite programming , 2007 .

[35]  Frédéric Magniez,et al.  Quantum algorithms for the triangle problem , 2005, SODA '05.