Adversary lower bounds for nonadaptive quantum algorithms

Simple item page
dc.creatorKoiran, Pacal
dc.creatorLandes, Jürgen
dc.creatorPortier, Natacha
dc.creatorYao, Penghui
dc.date2008-04-09
dc.date.accessioned2026-07-07T12:18:14Z
dc.date.available2026-07-07T12:18:14Z
dc.descriptionWe present general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Our results are based on the adversary method of Ambainis.
dc.identifierhttps://arxiv.org/abs/0804.1440
dc.identifierhttp://arxiv.org/abs/0804.1440
dc.identifierDans proceedings of WoLLIC 2008 - WoLLIC 2008 15th Workshop on Logic, Language, Information and Computation, Edinburgh : Royaume-Uni
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/212342
dc.subjectComputational Complexity
dc.subjectQuantum Physics
dc.titleAdversary lower bounds for nonadaptive quantum algorithms
dc.typetext

Files

Collections

arXiv