Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Farhi et al. (2008) studied this question.