A nearly optimal discrete query quantum algorithm for evaluating NAND formulas

Simple item page
dc.creatorAmbainis, Andris
dc.date2007-04-26
dc.date.accessioned2026-07-07T07:58:31Z
dc.date.available2026-07-07T07:58:31Z
dc.descriptionWe present an O(\sqrt{N}) discrete query quantum algorithm for evaluating balanced binary NAND formulas and an O(N^{{1/2}+O(\frac{1}{\sqrt{\log N}})}) discrete query quantum algorithm for evaluating arbitrary binary NAND formulas.
dc.description21 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/0704.3628
dc.identifierhttp://arxiv.org/abs/0704.3628
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/128036
dc.subjectQuantum Physics
dc.titleA nearly optimal discrete query quantum algorithm for evaluating NAND formulas
dc.typetext

Files

Collections

arXiv