15 citations · 72 across the 13 of their papers we have counts for
1 paper · 1 filter
Pacal Koiran, Jürgen Landes, Natacha Portier +1
We present general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Our results are based on the adversary method of Ambainis.