Logo Logo
Hilfe
Hilfe
Switch Language to English
Koiran, Pascal; Landes, Jürgen; Portier, Natacha und Yao, Penghui (2008): Adversary Lower Bounds for Nonadaptive Quantum Algorithms. In: Hodges, Wilfrid und de Queiroz, Ruy (Hrsg.): Logic, Language, Information and Computation ; 15th international workshop, WoLLIC 2008, Edinburgh, UK, July 1 - 4, 2008 ; proceedings. Lecture notes in computer science, Bd. 5110. Berlin, Heidelberg: Springer. S. 226-237
Volltext auf 'Open Access LMU' nicht verfügbar.

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.