23 citations · 34 across the 3 of their papers we have counts for
1 paper · 1 filter
Andris Ambainis, Arturs Backurs, Juris Smotrovs +1
We show that almost all n-bit Boolean functions have bounded-error quantum query complexity at least n/2, up to lower-order terms. This improves over an earlier n/4 lower bound of…