A Quantum Algorithm for the Hamiltonian NAND Tree

Simple item page
dc.creatorFarhi, E.
dc.creatorGoldstone, J.
dc.creatorGutmann, S.
dc.date2007-02-14
dc.date2007-02-22
dc.date.accessioned2026-07-07T07:48:04Z
dc.date.available2026-07-07T07:48:04Z
dc.descriptionWe 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.
dc.description16 pages, 15 figures, v2 with run time improved to sqrt N by slight sharpening of estimates in section 3
dc.identifierhttps://arxiv.org/abs/quant-ph/0702144
dc.identifierhttp://arxiv.org/abs/quant-ph/0702144
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/124372
dc.subjectQuantum Physics
dc.titleA Quantum Algorithm for the Hamiltonian NAND Tree
dc.typetext

Files

Collections

arXiv