most citedAdversary lower bounds for nonadaptive quantum algorithms

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

cs.CC2008★ 2 cited

Adversary lower bounds for nonadaptive quantum algorithms

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.