A Quantum Algorithm for the Hamiltonian NAND Tree
Quantum Physics
2007-05-23 v2
Abstract
We give a quantum algorithm for the binary NAND tree problem in the Hamiltonian oracle model. The algorithm uses a continuous time quantum walk with a run time proportional to sqrt N. We also show a lower bound of sqrt N for the NAND tree problem in the Hamiltonian oracle model.
Keywords
Cite
@article{arxiv.quant-ph/0702144,
title = {A Quantum Algorithm for the Hamiltonian NAND Tree},
author = {E. Farhi and J. Goldstone and S. Gutmann},
journal= {arXiv preprint arXiv:quant-ph/0702144},
year = {2007}
}
Comments
16 pages, 15 figures, v2 with run time improved to sqrt N by slight sharpening of estimates in section 3