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.