On the Monte Carlo Boolean decision tree complexity of read-once formulae
Random Structures & Algorithms
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Lower bounds for monotone span programs
Computational Complexity
The complexity of matrix rank and feasible systems of linear equations
Computational Complexity
Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Two applications of information complexity
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A note on monotone complexity and the rank of matrices
Information Processing Letters
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
A lower bound on the quantum query complexity of read-once functions
Journal of Computer and System Sciences
Quantum Speed-Up of Markov Chain Based Algorithms
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Polynomial degree vs. quantum query complexity
Journal of Computer and System Sciences - Special issue on FOCS 2003
Negative weights make adversaries stronger
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Probabilistic Boolean decision trees and the complexity of evaluating game trees
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
All quantum adversary methods are equivalent
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On the size of monotone span programs
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
On directional vs. undirectional randomized decision tree complexity for read-once formulas
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
New developments in quantum algorithms
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Any AND-OR Formula of Size $N$ Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer
SIAM Journal on Computing
Efficient circuits for quantum walks
Quantum Information & Computation
Improved bounds for the randomized decision tree complexity of recursive majority
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Faster quantum algorithm for evaluating game trees
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Reflections for quantum query algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Exact Quantum Algorithms for the Leader Election Problem
ACM Transactions on Computation Theory (TOCT)
A stronger LP bound for formula size lower bounds via clique constraints
Theoretical Computer Science
Span programs for functions with constant-sized 1-certificates: extended abstract
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Quantum adversary (upper) bound
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Span programs and quantum algorithms for st-connectivity and claw detection
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Average-case lower bounds for formula size
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Superlinear advantage for exact quantum algorithms
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
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.