Adversary lower bounds for nonadaptive quantum algorithms - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

Adversary lower bounds for nonadaptive quantum algorithms

(1) , (2) , (1) , (3)
1
2
3

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.
Fichier principal
Vignette du fichier
nonadaptQuantum.pdf (162.73 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

ensl-00260279 , version 1 (03-03-2008)
ensl-00260279 , version 2 (09-04-2008)

Identifiers

Cite

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⟩
89 View
206 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More