Adversary Lower Bounds for Nonadaptive Quantum Algorithms

摘要

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.