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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
