@inproceedings{eb184b3ad73a432b836287555a8ce0ae,
title = "Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure",
abstract = "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 n tree using O(n2+logω) queries, where ω is independent of n and depends only on the type of subformulas within the tree. We also prove a classical lower bound of nΩ(log log n) queries, thus showing a (small) super-polynomial speed-up.",
keywords = "NAND tree, span programs, super-polynomial quantum speed-up",
author = "Bohua Zhan and Shelby Kimmel and Avinatan Hassidim",
note = "Place of conference:USA; 3rd Conference on Innovations in Theoretical Computer Science, ITCS 2012 ; Conference date: 08-01-2012 Through 10-01-2012",
year = "2012",
doi = "https://doi.org/10.1145/2090236.2090258",
language = "الإنجليزيّة",
isbn = "9781450311151",
series = "ITCS 2012 - Innovations in Theoretical Computer Science Conference",
pages = "249--265",
booktitle = "ITCS 2012 - Innovations in Theoretical Computer Science Conference",
}