Rational approximations and quantum algorithms with postselection

We study the close connection between rational functions that approximate a given Boolean function, and quantum algorithms that compute the same function using post-selection. We show that the minimal degree of the former equals (up to a factor of 2) the minimal query complexity of the latter. We give optimal (up to constant factors) quantum algorithms with postselection for the Majority function, slightly improving upon an earlier algorithm of Aaronson. Finally we show how Newman's classic theorem about low-degree rational approximation of the absolute-value function follows from these algorithms.

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

[2]  Troy Lee,et al.  A note on the sign degree of formulas , 2009, ArXiv.

[3]  Scott Aaronson,et al.  Quantum computing, postselection, and probabilistic polynomial-time , 2004, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

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

[5]  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.

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

[7]  Hansraj Gupta,et al.  On a Problem of Erdos , 1950 .

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

[9]  Ronald de Wolf,et al.  A note on quantum algorithms and the minimal degree of ε-error polynomials for symmetric functions , 2008, Quantum Inf. Comput..

[10]  Lance Fortnow,et al.  Complexity limitations on quantum computation , 1999, J. Comput. Syst. Sci..

[11]  Ronald de Wolf,et al.  Quantum Proofs for Classical Theorems , 2009, Theory Comput..

[12]  BuhrmanHarry,et al.  Quantum lower bounds by polynomials , 2001 .

[13]  H. Buhrman,et al.  Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..

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

[15]  Ronald de Wolf,et al.  Uniform approximation by (quantum) polynomials , 2011, Quantum Inf. Comput..

[16]  D. Wulbert.  The Rational Approximation of Real Functions , 1978 .

[17]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[18]  Alexander A. Sherstov.  The Intersection of Two Halfspaces Has High Threshold Degree , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[19]  R. Feynman.  Simulating physics with computers , 1999 .

[20]  C. S. Davis.  Rational approximations to e , 1978, Journal of the Australian Mathematical Society.