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 metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00260279
Contributor : Natacha Portier <>
Submitted on : Wednesday, April 9, 2008 - 11:29:09 AM
Last modification on : Thursday, February 7, 2019 - 3:49:01 PM
Long-term archiving on : Friday, November 25, 2016 - 10:34:09 PM

Files

nonadaptQuantum.pdf
Files produced by the author(s)

Identifiers

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

Collections

Citation

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⟩

Share

Metrics

Record views

197

Files downloads

232