26 citations · 44 across the 4 of their papers we have counts for
1 paper · 1 filter
Andris Ambainis, Andrew M. Childs, François Le Gall +1
We study the quantum query complexity of finding a certificate for a d-regular, k-level balanced NAND formula. Up to logarithmic factors, we show that the query complexity is Theta…