A Quantum Algorithm for the Hamiltonian NAND Tree

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 running time proportional to N. We also show a lower bound of ( N) for the NAND tree problem in the Hamiltonian oracle model.

• Type: Journal
• Year: 2008
• Where: TOC
• Authors: Edward Farhi, Jeffrey Goldstone, Sam Gutmann
• Keywords: Binary Nand Tree, Hamiltonian Oracle Model, NAND Tree Problem, TOC 2008