R. de Wolf
- Uniform approximation by (quantum) polynomials
- Quantum Information and Computation
- Volume | Issue number
- 11 | 3&4
- Pages (from-to)
- Document type
- Interfacultary Research Institutes
- Institute for Logic, Language and Computation (ILLC)
- 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.
- Accepted author manuscript
- Other links
- issue contents
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.