Span-Program-Based Quantum Algorithm for Evaluating Formulas

We give a quantum algorithm for evaluating formulas over an extended gate set, including all two- and three-bit binary gates (e.g., NAND, 3-majority). The algorithm is optimal on read-once formulas for which each gate's inputs are balanced in a certain sense. The main new tool is a correspondence between a classical linear-algebraic model of computation, "span programs," and weighted bipartite graphs. A span program's evaluation corresponds to an eigenvalue-zero eigenvector of the associated graph. A quantum computer can therefore evaluate the span program by applying spectral estimation to the graph. For example, the classical complexity of evaluating the balanced ternary majority formula is unknown, and the natural generalization of randomized alpha-beta pruning is known to be suboptimal. In contrast, our algorithm generalizes the optimal quantum AND-OR formula evaluation algorithm and is optimal for evaluating the balanced ternary majority formula.

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

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

[3]  Andris Ambainis.  Quantum search with variable times , 2008, STACS.

[4]  M. Szegedy,et al.  Quantum Walk Based Search Algorithms , 2008, TAMC.

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

[6]  Frédéric Magniez,et al.  Search via quantum walk , 2006, STOC '07.

[7]  R. Cleve,et al.  Quantum algorithms revisited , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[8]  Anna Gál,et al.  Lower bounds for monotone span programs , 2005, computational complexity.

[9]  Gene H. Golub,et al.  Matrix computations , 1983 .

[10]  Ravi Kumar,et al.  Two applications of information complexity , 2003, STOC '03.

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

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

[13]  Pavel Pudlák,et al.  A note on monotone complexity and the rank of matrices , 2003, Inf. Process. Lett..

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

[15]  Ronald Cramer,et al.  Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups , 2002, CRYPTO.

[16]  Mario Szegedy,et al.  Quantum Decision Trees and Semidefinite Programming. , 2001 .

[17]  Lov K. Grover.  Trade-offs in the quantum search algorithm , 2002 .

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

[19]  Avi Wigderson,et al.  Superpolynomial Lower Bounds for Monotone Span Programs , 1996, Comb..

[20]  Eric Allender,et al.  The complexity of matrix rank and feasible systems of linear equations , 1999, computational complexity.

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

[22]  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).

[23]  Andris Ambainis.  A nearly optimal discrete query quantum algorithm for evaluating NAND formulas , 2007 .

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

[25]  Bart Preneel,et al.  On the Size of Monotone Span Programs , 2004, SCN.

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

[27]  Shengyu Zhang,et al.  Every NAND formula of size N can be evaluated in time N^{1/2+o(1)} on a quantum computer , 2007 .