Skip to Main content Skip to Navigation
Conference papers

Adversary lower bounds for nonadaptive quantum algorithms

Abstract : 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.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Natacha Portier Connect in order to contact the contributor
Submitted on : Wednesday, April 9, 2008 - 11:29:09 AM
Last modification on : Saturday, September 11, 2021 - 3:17:05 AM
Long-term archiving on: : Friday, November 25, 2016 - 10:34:09 PM


Files produced by the author(s)


  • HAL Id : ensl-00260279, version 2
  • ARXIV : 0804.1440



Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao. Adversary lower bounds for nonadaptive quantum algorithms. WoLLIC 2008 15th Workshop on Logic, Language, Information and Computation, Jul 2008, Edinburgh, United Kingdom. ⟨ensl-00260279v2⟩



Les métriques sont temporairement indisponibles