A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
Quantum lower bounds by polynomials
Journal of the ACM (JACM)
Quantum computation and quantum information
Quantum computation and quantum information
Complexity measures and decision tree complexity: a survey
Theoretical Computer Science - Complexity and logic
Quantum lower bounds by quantum arguments
Journal of Computer and System Sciences - Special issue on STOC 2000
Polynomial Degree vs. Quantum Query Complexity
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Quantum lower bounds for the collision and the element distinctness problems
Journal of the ACM (JACM)
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
A lower bound on the quantum query complexity of read-once functions
Journal of Computer and System Sciences
Quantum Walk Algorithm for Element Distinctness
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
The Quantum Adversary Method and Classical Formula Size Lower Bounds
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Quantum algorithms for the triangle problem
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Probabilistic Boolean decision trees and the complexity of evaluating game trees
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Quantum search on bounded-error inputs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Quantum verification of matrix products
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
New upper and lower bounds for randomized and quantum local search
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Polynomial degree vs. quantum query complexity
Journal of Computer and System Sciences - Special issue on FOCS 2003
On the power of Ambainis lower bounds
Theoretical Computer Science
Negative weights make adversaries stronger
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Span-program-based quantum algorithm for evaluating formulas
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Adversary Lower Bounds for Nonadaptive Quantum Algorithms
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Adversary lower bounds for nonadaptive quantum algorithms
Journal of Computer and System Sciences
Lower bounds on quantum query complexity for read-once decision trees with parity nodes
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Reflections for quantum query algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the black-box complexity of sperner's lemma
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
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 equal: spectral adversary [1], weighted adversary [2], strong weighted adversary [3], and the Kolmogorov complexity adversary [4]. 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 all versions of the quantum adversary method easily follow.