Adversary lower bounds for nonadaptive quantum algorithms
Pacal KoiranJürgen LandesNatacha PortierPenghui Yao
所有作者
Pacal KoiranJürgen LandesNatacha PortierPenghui Yao
文献摘要
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.