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.
https://hal-ens-lyon.archives-ouvertes.fr/ensl-00260279
Contributor : Natacha Portier
<>
Submitted on : Wednesday, April 9, 2008 - 11:29:09 AM
Last modification on : Thursday, February 7, 2019 - 3:49:01 PM
Long-term archiving on : Friday, November 25, 2016 - 10:34:09 PM
