# Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure

@inproceedings{Zhan2012SuperpolynomialQS,
title={Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure},
author={Bohua Zhan and Shelby Kimmel and Avinatan Hassidim},
booktitle={ITCS '12},
year={2012}
}
• Published in ITCS '12 4 January 2011
• Computer Science
We give a quantum algorithm for evaluating a class of boolean formulas (such as NAND trees and 3-majority trees) on a restricted set of inputs. Due to the structure of the allowed inputs, our algorithm can evaluate a depth <i>n</i> tree using <i>O</i>(<i>n</i><sup>2+logω</sup>) queries, where ω is independent of <i>n</i> and depends only on the type of subformulas within the tree. We also prove a classical lower bound of <i>n</i><sup>Ω(log log <i>n</i>)</sup> queries, thus showing a (small…
19 Citations

## Figures from this paper

Quantum Algorithms for Graph Connectivity and Formula Evaluation
• Computer Science
ArXiv
• 2017
Results indicate that this st-connectivity-based approach may be the "right" way of looking at quantum algorithms for formula evaluation, and that this approach can yield superpolynomial quantum/classical separations.
NAND-Trees, Average Choice Complexity, and Effective Resistance
• Computer Science
ArXiv
• 2015
The player with a winning strategy for the two-player game associated with the nand-tree can win the game with an expected O(N^(1/4) √C(x)) quantum queries against a random opponent, where C(x) is the average choice complexity of the instance.
Sculpting Quantum Speedups
• Computer Science
Computational Complexity Conference
• 2015
This work gives a full characterization of sculptable functions in the query complexity setting, and investigates sculpting in the Turing machine model, showing that if there is any BPP-bi-immune language in BQP, then every language outside BPP can be restricted to a promise which places it in PromiseBQP but not in promiseBPP.
Leveraging Unknown Structure in Quantum Query Algorithms
• Computer Science
ArXiv
• 2020
A modified span program algorithm is designed to show speed-ups persist even without having a promise ahead of time, and this approach is extended to the more general problem of state conversion.
Quantum Algorithm for Monotonicity Testing on the Hypercube
• Mathematics, Computer Science
Theory Comput.
• 2015
A bounded-error quantum algorithm is developed that makes $\tilde O(n^{1/4}\varepsilon^{-1/2})$ queries to a Boolean function $f$, accepts a monotone function, and rejects a function that is $\varpsilon$-far from being monotones.
• S. Kimmel
• Computer Science, Mathematics
Chic. J. Theor. Comput. Sci.
• 2012
A method for upper bounding the quantum query complexity of certain boolean formula evaluation problems, using fundamental theorems about the general adversary bound is described, which gives an upper bound on query complexity without producing an algorithm.
Quantum Algorithms for Learning Symmetric Juntas via the Adversary Bound
• Aleksandrs Belovs
• Computer Science, Mathematics
2014 IEEE 29th Conference on Computational Complexity (CCC)
• 2014
This paper constructs optimal quantum query algorithms for the cases when h is the XOR or the OR function, or the exact-half function or the majority function, and proves an upper bound of $${O(k^{1/4})}$$O (k 1/4).
Quantum Algorithms for Learning Symmetric Juntas via Adversary Bound
• Aleksandrs Belovs
• Mathematics, Computer Science
Computational Complexity Conference
• 2014
This paper studies the following variant of the junta learning problem, given oracle access to a Boolean function f on n variables that only depends on k variables, and constructs optimal quantum query algorithms for the cases when h is the OR function or the exact-half function.
This work obtains a version of the bound for general input oracles, which is a lower bound for exact transformation and an upper bound for approximate transformation and possesses the tight composition property.
Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection
• Computer Science
ESA
• 2012
An algorithm is given that uses O(n) queries to the adjacency matrix of an n-vertex graph to decide if vertices s and t are connected, under the promise that they either are connected by a path of length at most d, or are disconnected.

## References

SHOWING 1-10 OF 18 REFERENCES
Every NAND formula of size N can be evaluated in time N^{1/2+o(1)} on a quantum computer
• Mathematics
• 2007
For every NAND formula of size N, there is a bounded-error N^{1/2+o(1)}-time quantum algorithm, based on a coined quantum walk, that evaluates this formula on a black-box input. Balanced, or
Quantum property testing
• Computer Science
SODA '03
• 2003
A similar notion of quantum property testing is defined and it is shown that there exist languages with quantum property testers but no good classical testers and there are also languages which require a large number of queries even for quantumly testing.
The Need for Structure in Quantum Speedups
• Computer Science, Mathematics
Theory Comput.
• 2009
It is shown that for any problem that is invariant under permuting inputs and outputs, the quantum query complexity is at least the 9 root of the classical randomized query complexity, and that one essentially cannot hope to prove P 6 BQP relative to a random oracle.
Every NAND formula of size N can be evaluated in time O ( N 1 2 + ε ) on a quantum computer
• Mathematics
• 2008
For every NAND formula of size N , there is a bounded-error O(N 1 2 )-time quantum algorithm that evaluates this formula on a black-box input, for ε > 0 an arbitrarily small constant. It follows that
Span-program-based quantum algorithm for evaluating formulas
• Computer Science
STOC
• 2008
A quantum algorithm for evaluating formulas over an extended gate set, including all two- and three-bit binary gates (e.g., NAND, 3-majority), generalizes the optimal quantum AND-OR formula evaluation algorithm and is optimal for evaluating the balanced ternary majority formula.
Probabilistic Boolean decision trees and the complexity of evaluating game trees
• Computer Science
27th Annual Symposium on Foundations of Computer Science (sfcs 1986)
• 1986
A randomized variant of alphabeta pruning is analyzed, it is shown that it is considerably faster than the deterministic one in worst case, and it is proved optimal for uniform trees.
Faster quantum algorithm for evaluating game trees
An O(√n log n)-query quantum algorithm for evaluating size-n AND-OR formulas and a novel tensor-product span program composition method, which generates graphs with vertices corresponding to minimal zero-certificates is given.
Superpolynomial Speedups Based on Almost Any Quantum Circuit
• Mathematics, Computer Science
ICALP
• 2008
It is shown that a wide class of unitary circuits can be used in place of Hadamards to obtain a O(1) vs. Ω(n) separation and a general method for amplifying quantum-classical separations is given that allows us to achieve a nO( 1)vs.nΩ(logn)separation from any dispersing circuit.
Quantum speed-up of Markov chain based algorithms
• M. Szegedy
• Computer Science
45th Annual IEEE Symposium on Foundations of Computer Science
• 2004
It is shown that under certain conditions, the quantum version of the Markov chain gives rise to a quadratic speed-up, and that the quantum escape time, just like its classical version, depends on the spectral properties of the transition matrix with the marked rows and columns deleted.
On the power of quantum computation
• Daniel R. Simon
• Computer Science
Proceedings 35th Annual Symposium on Foundations of Computer Science
• 1994
This work presents here a problem of distinguishing between two fairly natural classes of function, which can provably be solved exponentially faster in the quantum model than in the classical probabilistic one, when the function is given as an oracle drawn equiprobably from the uniform distribution on either class.