A nearly optimal discrete query quantum algorithm for evaluating NAND formulas
Quantum Physics
2007-05-23 v1
Abstract
We present an O(\sqrt{N}) discrete query quantum algorithm for evaluating balanced binary NAND formulas and an O(N^{{1/2}+O(\frac{1}{\sqrt{\log N}})}) discrete query quantum algorithm for evaluating arbitrary binary NAND formulas.
Keywords
Cite
@article{arxiv.0704.3628,
title = {A nearly optimal discrete query quantum algorithm for evaluating NAND formulas},
author = {Andris Ambainis},
journal= {arXiv preprint arXiv:0704.3628},
year = {2007}
}