A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
The Quantum Query Complexity of Read-Many Formulas
[chapter]

2012
*
Lecture Notes in Computer Science
*

The quantum query complexity of evaluating any read-once formula with n black-box input bits is Theta(sqrt(n)). However, the corresponding problem for read-many formulas (i.e., formulas in which the inputs have fanout) is not well understood. Although the optimal read-once formula evaluation algorithm can be applied to any formula, it can be suboptimal if the inputs have large fanout. We give an algorithm for evaluating any formula with n inputs, size S, and G gates using O(minn, sqrtS, n^1/2

doi:10.1007/978-3-642-33090-2_30
fatcat:sj4wkylm7bb5jmdrou7wvhuf4i