Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

37

FOCS
2003
IEEE

favoriteEmaildiscussreport

126views Theoretical Computer Science» more FOCS 2003»

Polynomial Degree vs. Quantum Query Complexity

14 years 4 months ago

Polynomial Degree vs. Quantum Query Complexity

Download www.cs.sfu.ca

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

Andris Ambainis

Real-time Traffic

FOCS 2003 | Lower Bound | Quantum Query | Quantum Query Complexity | Theoretical Computer Science |

claim paper

Related Content

» Characterization of NonDeterministic Quantum Query and Quantum Communication Complexity

» Robust Polynomials and Quantum Algorithms

» New Results on Quantum Property Testing

» Sharp Quantum versus Classical Query Complexity Separations

» Quantum Query Complexity of Multilinear Identity Testing

» AverageCase Quantum Query Complexity

» How Many Query Superpositions Are Needed to Learn

» Quantum Lower Bounds by Polynomials

» Quantum and classical query complexities of local search are polynomially related

Post Info
More Details (n/a)

Added	04 Jul 2010
Updated	04 Jul 2010
Type	Conference
Year	2003
Where	FOCS
Authors	Andris Ambainis

Comments (0)