The Polynomial Method in Quantum and Classical Computing

In 1889, A. A. Markov proved a powerful result about low-degree real polynomials: roughly speaking, that such polynomials cannot have a sharp jump followed by a long, relatively flat part. A century later, this result - as well as other results from the field of approximation theory - came to play a surprising role in classical and quantum complexity theory. In this article, the author tries to tell this story in an elementary way, beginning with classic results in approximation theory and ending with some recent applications.

[1]  Wladimir Markoff,et al.  Über Polynome, die in einem gegebenen Intervalle möglichst wenig von Null abweichen , 1916 .

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

[3]  Alexander A. Sherstov.  The unbounded-error communication complexity of symmetric functions , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[4]  Ronald de Wolf,et al.  Quantum lower bounds by polynomials , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[5]  Noam Nisan,et al.  On the degree of boolean functions as real polynomials , 1992, STOC '92.

[6]  Scott Aaronson,et al.  Quantum lower bound for the collision problem , 2001, STOC '02.

[7]  Scott Aaronson,et al.  Limitations of quantum advice and one-way communication , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[8]  Scott Aaronson,et al.  Quantum lower bounds for the collision and the element distinctness problems , 2004, JACM.

[9]  A. Razborov.  Quantum communication complexity of symmetric predicates , 2002, quant-ph/0204025.

[10]  Andris Ambainis.  Polynomial degree vs. quantum query complexity , 2006, J. Comput. Syst. Sci..

[11]  Alexander A. Razborov,et al.  The Sign-Rank of AC^O , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[12]  Daniel A. Spielman,et al.  PP is closed under intersection , 1991, STOC '91.

[13]  Scott Aaronson,et al.  BQP and the polynomial hierarchy , 2009, STOC '10.

[14]  Richard Beigel,et al.  Perceptrons, PP, and the polynomial hierarchy , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[15]  Scott Aaronson,et al.  Oracles are subtle but not malicious , 2005, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[16]  Elliott Ward Cheney,et al.  A Comparison of Uniform Approximations on an Interval and a Finite Subset Thereof , 1966 .

[17]  Alexander A. Razborov,et al.  The Sign-Rank of AC0 , 2010, SIAM J. Comput..

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

[19]  Hartmut Klauck,et al.  Quantum and classical strong direct product theorems and optimal time-space tradeoffs , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.