Adversary lower bounds for nonadaptive quantum algorithms
Computational Complexity
2008-12-18 v1 Quantum Physics
Abstract
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.
Cite
@article{arxiv.0804.1440,
title = {Adversary lower bounds for nonadaptive quantum algorithms},
author = {Pacal Koiran and Jürgen Landes and Natacha Portier and Penghui Yao},
journal= {arXiv preprint arXiv:0804.1440},
year = {2008}
}