An adversary for algorithms
Troy Lee, Rajat Mittal, Ben W. Reichardt, Robert Špalek · 2010
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.