activity
20022009
most citedA quantum lower bound for the query complexity of Simon's problem

7 citations · 10 across the 7 of their papers we have counts for

collaborators
Showing 2008Show all

1 paper · 1 filter

cs.CC2008★ 2 cited

Adversary lower bounds for nonadaptive quantum algorithms

Pacal Koiran, Jürgen Landes, Natacha Portier +1

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.