Span Programs are Equivalent to Quantum Query Algorithms

Span programs form a linear-algebraic model of computation that is studied to prove classical lower bounds. Quantum query complexity is a coherent generalization for quantum algorithms of decision-tree complexity. It is characterized by a semidefinite program known as the general adversary bound. We connect these classical and quantum models by proving that for any boolean function, the optimal “witness size” of a span program equals the general adversary bound. Therefore, span program witness size and quantum query complexity are equivalent measures. In particular, quantum algorithms can be designed based on span programs.

[1]  Miklos Santha.  On the Monte Carlo Boolean decision tree complexity of read-once formulae , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

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

[3]  Frédéric Magniez,et al.  Improved quantum query algorithms for triangle finding and associativity testing , 2013, SODA.

[4]  Ben Reichardt,et al.  Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection , 2012, ESA.

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

[6]  Miklos Santha.  On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae , 1995, Random Struct. Algorithms.

[7]  H. Buhrman,et al.  Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..

[8]  Andris Ambainis,et al.  Symmetry-Assisted Adversaries for Quantum State Generation , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

[9]  Aleksandrs Belovs,et al.  Span programs for functions with constant-sized 1-certificates: extended abstract , 2011, STOC '12.

[10]  Nikolai K. Vereshchagin,et al.  On Computation and Communication with Small Bias , 2007, Computational Complexity Conference.

[11]  Troy Lee,et al.  A strong direct product theorem for quantum query complexity , 2012, 2012 IEEE 27th Conference on Computational Complexity.

[12]  Avi Wigderson,et al.  On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

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

[14]  Anna Gál.  A characterization of span program size and improved lower bounds for monotone span programs , 1998, STOC '98.

[15]  Aleksandrs Belovs,et al.  Quantum Algorithm for k-distinctness with Prior Knowledge on the Input , 2011, 1108.3022.

[16]  Andris Ambainis,et al.  Any AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a Quantum Computer , 2010, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[17]  Ronald de Wolf,et al.  Quantum lower bounds by polynomials , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[18]  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 .

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

[20]  Ben Reichardt,et al.  Span-Program-Based Quantum Algorithm for Evaluating Formulas , 2012, Theory Comput..

[21]  Ben Reichardt.  Faster quantum algorithm for evaluating game trees , 2011, SODA '11.

[22]  Kazuyuki Amano.  Bounding the randomized decision tree complexity of read-once Boolean functions , 2011, SODA '11.

[23]  Troy Lee,et al.  The Quantum Adversary Method and Classical Formula Size Lower Bounds , 2005, Computational Complexity Conference.

[24]  Rocco A. Servedio,et al.  Learning DNF in time 2Õ(n1/3) , 2004, J. Comput. Syst. Sci..

[25]  Rocco A. Servedio,et al.  Learning intersections and thresholds of halfspaces , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[26]  Yechao Zhu,et al.  Quantum Query Complexity of Subgraph Containment with Constant-sized Certificates , 2011 .

[27]  Robert Spalek,et al.  Tight adversary bounds for composite functions , 2005 .

[28]  Aleksandrs Belovs,et al.  Learning-Graph-Based Quantum Algorithm for k-Distinctness , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[29]  Aleksandrs Belovs,et al.  Span-program-based quantum algorithm for the rank problem , 2011, ArXiv.

[30]  Troy Lee,et al.  Quantum Query Complexity of State Conversion , 2010, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[31]  Raymond H. Putra,et al.  Unbounded-Error Quantum Query Complexity , 2007, ISAAC.

[32]  Ronald de Wolf,et al.  Quantum Proofs for Classical Theorems , 2009, Theory Comput..

[33]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[34]  Tsuyoshi Ito,et al.  A quantum query algorithm for the graph collision problem , 2012 .

[35]  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.

[36]  Michael E. Saks,et al.  Probabilistic Boolean decision trees and the complexity of evaluating game trees , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

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

[38]  Frédéric Magniez,et al.  Learning graph based quantum query algorithms for finding constant-size subgraphs , 2011, Chic. J. Theor. Comput. Sci..

[39]  Andris Ambainis,et al.  A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs , 2006, STOC.

[40]  Bohua Zhan,et al.  Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure , 2011, ITCS '12.

[41]  Mario Szegedy,et al.  All Quantum Adversary Methods are Equivalent , 2006, Theory Comput..

[42]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[43]  Troy Lee,et al.  A note on the sign degree of formulas , 2009, ArXiv.

[44]  Andris Ambainis,et al.  Any AND-OR Formula of Size N Can Be Evaluated in Time N1/2+o(1) on a Quantum Computer , 2010, SIAM J. Comput..

[45]  Pavel Pudlák.  Monotone complexity and the rank of matrices , 2002, Electron. Colloquium Comput. Complex..

[46]  László Lovász,et al.  Semidefinite Programs and Combinatorial Optimization , 2003 .

[47]  Marc Snir,et al.  Lower Bounds on Probabilistic Linear Decision Trees , 1985, Theor. Comput. Sci..

[48]  Raymond H. Putra,et al.  Unbounded-Error Quantum Query Complexity , 2008, ISAAC.

[49]  Robert Spalek.  The Multiplicative Quantum Adversary , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

[50]  Ben Reichardt.  Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas , 2011, TQC.