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.
Item Type: | Book Section |
---|---|
Faculties: | Philosophy, Philosophy of Science and Religious Science > Munich Center for Mathematical Philosophy (MCMP) Philosophy, Philosophy of Science and Religious Science > Munich Center for Mathematical Philosophy (MCMP) > Logic |
Subjects: | 100 Philosophy and Psychology > 160 Logic |
ISBN: | 978-3-540-69936-1 |
ISSN: | 0302-9743 |
Place of Publication: | Berlin, Heidelberg |
Language: | English |
Item ID: | 28407 |
Date Deposited: | 30. Jun 2016 07:59 |
Last Modified: | 04. Nov 2020 13:07 |