Lower bounds for randomized and quantum query complexity using Kolmogorov arguments

We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolmogorov complexity to query complexity. Our technique generalizes the weighted, unweighted methods of Ambainis, and the spectral method of Barnum, Saks and Szegedy. As an immediate consequence of our main theorem, it can be shown that adversary methods can only prove lower bounds for Boolean functions f in 0(min((/spl radic/nC/sup 0/(f)), (/spl radic/nC/sup 0/(f)))) where C/sup 0/, C/sup 1/ is the certificate complexity, and n is the size of the input. We also derive a general form of the ad hoc weighted method used by Hoyer, Neerbek and Shi to give a quantum lower bound on ordered search and sorting.

[1]  Ronald de Wolf,et al.  Quantum lower bounds by polynomials , 2001, JACM.

[2]  Shengyu Zhang.  On the Power of Ambainis's Lower Bounds , 2004, ICALP.

[3]  H. S. Allen.  The Quantum Theory , 1928, Nature.

[4]  Daniel R. Simon,et al.  On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[5]  山本 喜久,et al.  20世紀の名著名論：D. Deutsch : Quantum Theory The Church - Turing Principle and The Universal Quantum Computer , 2004 .

[6]  Shengyu Zhang,et al.  On the power of Ambainis lower bounds , 2005, Theor. Comput. Sci..

[7]  Michael E. Saks,et al.  Quantum query complexity and semi-definite programming , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[8]  Jan Neerbek,et al.  Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness , 2002, Algorithmica.

[9]  Mario Szegedy,et al.  All Quantum Adversary Methods Are Equivalent , 2005, ICALP.

[10]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[11]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.

[12]  M. Szegedy.  On the Quantum Query Complexity of Detecting Triangles in Graphs , 2003, quant-ph/0310107.

[13]  László Babai,et al.  Stronger separations for random-self-reducibility, rounds, and advice , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[14]  Umesh V. Vazirani,et al.  Quantum complexity theory , 1993, STOC.

[15]  Andris Ambainis,et al.  Polynomial degree vs. quantum query complexity , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[16]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[17]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[18]  Mario Szegedy,et al.  Quantum Decision Trees and Semidefinite Programming. , 2001 .

[19]  Troy Lee,et al.  THE QUANTUM ADVERSARY METHOD AND CLASSICAL FORMULA SIZE LOWER BOUNDS , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

[20]  Mehdi Mhalla,et al.  Quantum Query Complexity of Some Graph Problems , 2004, SIAM J. Comput..

[21]  Michael E. Saks,et al.  A lower bound on the quantum query complexity of read-once functions , 2001, Electron. Colloquium Comput. Complex..

[22]  Joan Feigenbaum,et al.  On coherence, random-self-reducibility, and self-correction , 1998, computational complexity.

[23]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[24]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[25]  G. H. C. New.  On coherence , 1989, Nature.

[26]  Andris Ambainis,et al.  Quantum lower bounds by quantum arguments , 2000, STOC '00.

[27]  Scott Aaronson,et al.  Lower bounds for local search by quantum arguments , 2003, STOC '04.