Work

A Quantum Algorithm for the Hamiltonian NAND Tree

Year: 2007
Type: preprint
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.
Language: English
Open Access status: green
OpenAlex ID: W2949399092
Cites: 6
Cited by: 171
Related to: 10