Adversary lower bounds for nonadaptive quantum algorithms
Pacal Koiran (LIP), J\"urgen Landes, Natacha Portier (LIP), Penghui, Yao
TL;DR
This paper develops general techniques using the adversary method to establish lower bounds on the query complexity of nonadaptive quantum algorithms, advancing understanding of their limitations.
Contribution
It introduces new methods for proving lower bounds specifically tailored for nonadaptive quantum algorithms using the adversary approach.
Findings
Provides a framework for lower bounds on nonadaptive quantum query complexity
Extends the adversary method to nonadaptive algorithms
Offers insights into the limitations of nonadaptive quantum algorithms
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography