A note on quantum black-box complexity of almost all Boolean functions
Quantum Physics
2007-05-23 v1 Computational Complexity
Abstract
We show that, for almost all N-variable Boolean functions f, at least N/4-O(\sqrt{N} log N) queries are required to compute f in quantum black-box model with bounded error.
Cite
@article{arxiv.quant-ph/9811080,
title = {A note on quantum black-box complexity of almost all Boolean functions},
author = {Andris Ambainis},
journal= {arXiv preprint arXiv:quant-ph/9811080},
year = {2007}
}
Comments
4 pages, LaTeX