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.
cs.CC↗
arXiv subjects
Pacal Koiran
Publications and source records attributed to Pacal Koiran.