All Quantum Adversary Methods Are Equivalent

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 present a 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.

• Type: Conference
• Year: 2005
• Where: ICALP
• Authors: Robert Spalek, Mario Szegedy
• Keywords: ICALP 2005, Quantum Adversary Method, Strong Weighted Adversary, Theoretical Computer Science, Weighted Adversary