779 citations · 2.6k across the 35 of their papers we have counts for
1 paper · 1 filter
Andrew M. Childs, Shelby Kimmel, Robin Kothari
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., for…