All Quantum Adversary Methods are Equivalent
Robert Spalek (CWI), Mario Szegedy (Rutgers)

TL;DR
This paper proves that all known variants of the quantum adversary method are fundamentally equivalent, unifying the approach and clarifying its limitations in quantum lower bound proofs.
Contribution
It demonstrates the equivalence of multiple quantum adversary methods and introduces new formulations, showing they are essentially the same underlying technique.
Findings
All variants of the quantum adversary method are equivalent.
The paper provides new formulations of the adversary method.
Limitations of these methods are derived from their equivalence.
Abstract
The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spectral adversary (Barnum, Saks, and Szegedy, 2003), weighted adversary (Ambainis, 2003), strong weighted adversary (Zhang, 2005), and the Kolmogorov complexity adversary (Laplante and Magniez, 2004). We also pa few new equivalent formulations of the method. This shows that there is essentially _one_ quantum adversary method. From our approach, all known limitations of these versions of the quantum adversary method easily follow.
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 · Quantum Mechanics and Applications
