Adversary lower bounds for nonadaptive quantum algorithms

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We 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.

Keywords

Computational Complexity, Quantum Physics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/212342

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0804.1440
 http://arxiv.org/abs/0804.1440
 Dans proceedings of WoLLIC 2008 - WoLLIC 2008 15th Workshop on Logic, Language, Information and Computation, Edinburgh : Royaume-Uni

Collections

arXiv