%0 Generic %1 Reichardt2009 %A Reichardt, Ben W. %D 2009 %K QC complexity imported %T Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function %U http://arxiv.org/abs/0904.2759 %X The general adversary bound is a semi-definite program (SDP) that lower-bounds the quantum query complexity of a function. We turn this lower bound into an upper bound, by giving a quantum walk algorithm based on the dual SDP that has query complexity at most the general adversary bound, up to a logarithmic factor. In more detail, the proof has two steps, each based on "span programs," a certain linear-algebraic model of computation. First, we give an SDP that outputs for any boolean function a span program computing it that has optimal "witness size." The optimal witness size is shown to coincide with the general adversary lower bound. Second, we give a quantum algorithm for evaluating span programs with only a logarithmic query overhead on the witness size. The first result is motivated by a quantum algorithm for evaluating composed span programs. The algorithm is known to be optimal for evaluating a large class of formulas. The allowed gates include all constant-size functions for which there is an optimal span program. So far, good span programs have been found in an ad hoc manner, and the SDP automates this procedure. Surprisingly, the SDP's value equals the general adversary bound. A corollary is an optimal quantum algorithm for evaluating "balanced" formulas over any finite boolean gate set. The second result extends span programs' applicability beyond the formula evaluation problem. A strong universality result for span programs follows. A good quantum query algorithm for a problem implies a good span program, and vice versa. Although nearly tight, this equivalence is nontrivial. Span programs are a promising model for developing more quantum algorithms.

@misc{Reichardt2009, abstract = { The general adversary bound is a semi-definite program (SDP) that lower-bounds the quantum query complexity of a function. We turn this lower bound into an upper bound, by giving a quantum walk algorithm based on the dual SDP that has query complexity at most the general adversary bound, up to a logarithmic factor. In more detail, the proof has two steps, each based on "span programs," a certain linear-algebraic model of computation. First, we give an SDP that outputs for any boolean function a span program computing it that has optimal "witness size." The optimal witness size is shown to coincide with the general adversary lower bound. Second, we give a quantum algorithm for evaluating span programs with only a logarithmic query overhead on the witness size. The first result is motivated by a quantum algorithm for evaluating composed span programs. The algorithm is known to be optimal for evaluating a large class of formulas. The allowed gates include all constant-size functions for which there is an optimal span program. So far, good span programs have been found in an ad hoc manner, and the SDP automates this procedure. Surprisingly, the SDP's value equals the general adversary bound. A corollary is an optimal quantum algorithm for evaluating "balanced" formulas over any finite boolean gate set. The second result extends span programs' applicability beyond the formula evaluation problem. A strong universality result for span programs follows. A good quantum query algorithm for a problem implies a good span program, and vice versa. Although nearly tight, this equivalence is nontrivial. Span programs are a promising model for developing more quantum algorithms. }, added-at = {2009-05-07T22:51:54.000+0200}, author = {Reichardt, Ben W.}, biburl = {https://www.bibsonomy.org/bibtex/2f608b5cd265d656daaf0f469471f8bb3/ggiedke}, description = {Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function}, interhash = {cc3cbf630b54f580b4f0622968cb7a0b}, intrahash = {f608b5cd265d656daaf0f469471f8bb3}, keywords = {QC complexity imported}, note = {cite arxiv:0904.2759 Comment: 70 pages, 2 figures}, timestamp = {2009-05-07T22:51:54.000+0200}, title = {Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function}, url = {http://arxiv.org/abs/0904.2759}, year = 2009 }