UNIFORM APPROXIMATION BY (QUANTUM) POLYNOMIALS

被引：0
|
作者：
Drucker, Andrew [1 ]
de Wolf, Ronald [2 ]
机构：
[1] MIT, Cambridge, MA 02139 USA
[2] CWI, NL-1009 AB Amsterdam, Netherlands
来源：
QUANTUM INFORMATION & COMPUTATION | 2011年 / 11卷 / 3-4期
关键词：
Quantum algorithms; Jackson's Theorem; Approximation theory;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：215 / 225
页数：11
相关论文
共 50 条
12345