Uniform approximation by (quantum) polynomials

Authors:
Andrew Drucker;Ronald De Wolf
Affiliations:
MIT, Cambridge, MA;CWI, Amsterdam, The Netherlands
Venue:
Quantum Information & Computation
Year:
2011

Citing 2
Cited 0

A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Quantum lower bounds by polynomials

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that quantum algorithms can be used to re-prove a classical theorem in approx-imation theory, Jackson's Theorem, which gives a nearly-optimal quantitative version ofWeierstrass's Theorem on uniform approximation of continuous functions by polynomi-als. We provide two proofs, based respectively on quantum counting and on quantumphase estimation.