Any AND-OR Formula of Size N Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer
Related Databases
Web of Science
You must be logged in with an active subscription to view this.Article Data
History
Submitted: 2 January 2008
Accepted: 16 July 2009
Published online: 30 April 2010
Publication Data
ISSN (print): 0097-5397
ISSN (online): 1095-7111
CODEN: smjcat
Consider the problem of evaluating an AND-OR formula on an N-bit black-box input. We present a bounded-error quantum algorithm that solves this problem in time $N^{1/2+o(1)}$. In particular, approximately balanced formulas can be evaluated in $O(\sqrt{N})$ queries, which is optimal. The idea of the algorithm is to apply phase estimation to a discrete-time quantum walk on a weighted tree whose spectrum encodes the value of the formula.
Copyright © 2010 Society for Industrial and Applied Mathematics
Permalink: http://dx.doi.org/10.1137/080712167
Cited by
(2016) Quantum Query Complexity of Almost All Functions with Fixed On-set Size. computational complexity. CrossRef
(2016) Quantum walk on the line through potential barriers. Quantum Information Processing 15, 675-688. CrossRef
(2016) Quantum algorithms: an overview. npj Quantum Information 2, 15023. CrossRef
2016. Generating Reversible Circuits from Higher-Order Functional Programs. Reversible Computation, 289-306. CrossRef
(2015) Dual lower bounds for approximate degree and Markov–Bernstein inequalities. Information and Computation 243, 2-25. CrossRef
(2015) Explicit relation between all lower bound techniques for quantum query complexity. International Journal of Quantum Information 13, 1350059. CrossRef
(2015) ScaffCC: Scalable compilation and analysis of quantum programs. Parallel Computing 45, 2-17. CrossRef
(2014) Shrinkage of De Morgan Formulae by Spectral Techniques. 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 551-560. CrossRef
Ben W. Reichardt. (2014) Span Programs are Equivalent to Quantum Query Algorithms. SIAM Journal on Computing 43:3, 1206-1219. Abstract | PDF (314 KB)
(2013) A strong direct product theorem for quantum query complexity. computational complexity 22, 429-462. CrossRef
(2012) A Strong Direct Product Theorem for Quantum Query Complexity. 2012 IEEE 27th Conference on Computational Complexity, 236-246. CrossRef
(2012) A stronger LP bound for formula size lower bounds via clique constraints. Theoretical Computer Science 434, 87-97. CrossRef
(2011) Single-qubit unitary gates by graph scattering. Physical Review A 84. CrossRef
(2011) Quantum Query Complexity of State Conversion. 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 344-353. CrossRef
(2011) Quantum versus classical query complexity of relation. 2011 Seventh International Conference on Natural Computation, 1336-1340. CrossRef
Sign in
Help
View Cart
