2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/124372We 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.16 pages, 15 figures, v2 with run time improved to sqrt N by slight sharpening of estimates in section 3Quantum Physicstext