Adversary Lower Bounds for Nonadaptive Quantum Algorithms
From MaRDI portal
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.
Cited in
(4)- Nonadaptive quantum query complexity
- The quantum adversary method and classical formula size power bounds
- scientific article; zbMATH DE number 5899240 (Why is no real title available?)
- An algorithmic argument for nonadaptive query complexity lower bounds on advised quantum computation (extended abstract)
This page was built for publication: Adversary Lower Bounds for Nonadaptive Quantum Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511461)