Adversary lower bounds for nonadaptive quantum algorithms

We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We show that they yield optimal lower bounds for several natural problems, and we challenge the reader to determine the nonadaptive quantum query complexity of the 1-to-1 versus 2-to-1 problem and of Hidden Translation. In addition to the results presented at Wollic 2008 in the conference version of this paper, we show that the lower bound given by the second method is always at least as good (and sometimes better) as the lower bound given by the rst method. We also compare these two quantum lower bounds to probabilistic lower bounds.

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao
• Keywords: CORR 2008, Education, Lower Bounds, Nonadaptive Quantum, Query Complexity