Sciweavers

TOC
2008

A Quantum Algorithm for the Hamiltonian NAND Tree

13 years 10 months ago
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.
Edward Farhi, Jeffrey Goldstone, Sam Gutmann
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2008
Where TOC
Authors Edward Farhi, Jeffrey Goldstone, Sam Gutmann
Comments (0)