Polynomial Degree vs. Quantum Query Complexity

The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bounds on quantum algorithms. It has been an open problem whether this lower bound is tight. We exhibit a function with polynomial degree M and quantum query

• Type: Conference
• Year: 2003
• Where: FOCS
• Authors: Andris Ambainis
• Keywords: FOCS 2003, Lower Bound, Quantum Query, Quantum Query Complexity, Theoretical Computer Science