Uniform Approximation by (Quantum) Polynomials

Details Uniform Approximation by (Quantum) Polynomials Uniform Approximation by (Quantum) Polynomials

2010-08-09

arxiv.org/abs/1008.1599v3

Quantum Information and Computation, (3&4):215-225, 2011

Physics

Quantum Physics

9 pages; minor improvements based on journal version; http://www.rintonpress.com/journals/qiconline.html#v11n34

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Uniform Approximation by (Quantum) Polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Uniform Approximation by (Quantum) Polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Uniform Approximation by (Quantum) Polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-582641