Highly Influenced

# A Quantum Algorithm for the Hamiltonian NAND Tree

@article{Farhi2008AQA, title={A Quantum Algorithm for the Hamiltonian NAND Tree}, author={Edward Farhi and Jeffrey Goldstone and Sam Gutmann}, journal={Theory of Computing}, year={2008}, volume={4}, pages={169-190} }

- Published 2008 in Theory of Computing
DOI:10.4086/toc.2008.v004a008

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 running time proportional to √ N. We also show a lower bound of Ω( √ N) for the NAND tree problem in the Hamiltonian oracle model. ACM Classification: F.1.2, F.2.2 AMS Classification: 68Q10, 68Q17

#### From This Paper

##### Figures, tables, and topics from this paper.

112 Citations

8 References

Similar Papers

#### References

##### Publications referenced by this paper.

Showing 1-8 of 8 references