 |
|
Subscribers:
to view the full text of a paper, click on the title of the paper. If you
have any problem to access the full text, please check with your librarian
or contact
qic@rintonpress.com
To subscribe to QIC, please click
Here.
|
Quantum
Information and Computation
ISSN: 1533-7146
published since 2001
|
|
Vol.11 No.3&4
March 2011 |
|
Uniform approximation by (quantum) polynomials
(pp0215-0225)
Andrew
Drucker and Ronald de Wolf
doi:
https://doi.org/10.26421/QIC11.3-4-2
Abstracts:
We show that quantum algorithms can be used to re-prove a classical
theorem in approximation theory, Jacksons Theorem, which gives a
nearly-optimal quantitative version of Weierstrasss Theorem on uniform
approximation of continuous functions by polynomials. We provide two
proofs, based respectively on quantum counting and on quantum phase
estimation.
Key words:
Quantum algorithms, Jacksons Theorem, Approximation
theory |
¡¡ |
