All Quantum Adversary Methods are Equivalent
| dc.creator | Spalek, Robert | |
| dc.creator | Szegedy, Mario | |
| dc.date | 2004-09-17 | |
| dc.date | 2006-02-01 | |
| dc.date.accessioned | 2026-07-07T06:40:44Z | |
| dc.date.available | 2026-07-07T06:40:44Z | |
| dc.description | 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. | |
| dc.description | 18 pages, ICALP 2005, LNCS 3580, v2: polished and fixed one proof, v3: generalized the adversary bound to non-Boolean functions and published in ToC | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0409116 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0409116 | |
| dc.identifier | Theory of Computing, 2(1):1-18, 2006 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/101475 | |
| dc.subject | Quantum Physics | |
| dc.title | All Quantum Adversary Methods are Equivalent | |
| dc.type | text |