Logo Logo
Switch Language to German

Koiran, Pascal; Landes, Jürgen; Portier, Natacha and Yao, Penghui (2008): Adversary Lower Bounds for Nonadaptive Quantum Algorithms. In: Hodges, Wilfrid and de Queiroz, Ruy (eds.) : Logic, Language, Information and Computation ; 15th international workshop, WoLLIC 2008, Edinburgh, UK, July 1 - 4, 2008 ; proceedings. Lecture notes in computer science, Vol. 5110. Berlin, Heidelberg: Springer. pp. 226-237

Full text not available from 'Open Access LMU'.


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.

Actions (login required)

View Item View Item