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.
Related papers
Ranked by semantic similarity — how closely each paper's abstract matches this one (100% = near-identical topic).