Uniform approximation by (quantum) polynomials
| Authors |
|
|---|---|
| Publication date | 2011 |
| Journal | Quantum Information & Computation |
| Volume | Issue number | 11 | 3&4 |
| Pages (from-to) | 215-225 |
| Organisations |
|
| Abstract |
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. |
| Document type | Article |
| Language | English |
| Published at | https://arxiv.org/abs/1008.1599 |
| Other links | http://www.rintonpress.com/journals/qicabstracts/qicabstracts11-34.html |
| Downloads |
354435.pdf
(Accepted author manuscript)
|
| Permalink to this page | |