The Community for Technology Leaders
RSS Icon
Subscribe
Providence, Rhode Island
Oct. 21, 2007 to Oct. 23, 2007
ISBN: 0-7695-3010-9
pp: 363-372
ABSTRACT
For any AND-OR formula of size N, there exists a bounded-error N^{1/2 + o(1)} -time quantum algorithm, based on a discrete-time quantum walk, that evaluates this formula on a black-box input. Balanced, or "approximately balanced," formulas can be evaluated in {\rm O}(\sqrt N ) {\rm O}(\sqrt N ) (2 - o(1))th power of the quantum query complexity is a lower bound on the formula size, almost solving in the positive an open problem posed by Laplante, Lee and Szegedy.
INDEX TERMS
null
CITATION
Andris Ambainis, Andrew M. Childs, Ben W. Reichardt, Robert Spalek, Shengyu Zhang, "Any AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a Quantum Computer", FOCS, 2007, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 2007, pp. 363-372, doi:10.1109/FOCS.2007.57
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool