A note on quantum black-box complexity of almost all Boolean functions

Simple item page
dc.creatorAmbainis, Andris
dc.date1998-11-28
dc.date.accessioned2026-07-07T06:15:52Z
dc.date.available2026-07-07T06:15:52Z
dc.descriptionWe show that, for almost all N-variable Boolean functions f, at least N/4-O(\sqrt{N} log N) queries are required to compute f in quantum black-box model with bounded error.
dc.description4 pages, LaTeX
dc.identifierhttps://arxiv.org/abs/quant-ph/9811080
dc.identifierhttp://arxiv.org/abs/quant-ph/9811080
dc.identifierInform.Proc.Lett. 71 (1999) 5-7
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/93892
dc.subjectQuantum Physics
dc.subjectComputational Complexity
dc.titleA note on quantum black-box complexity of almost all Boolean functions
dc.typetext

Files

Collections

arXiv