密度定理及其在量子信号处理中的应用
Density theorems with applications in quantum signal processing
摘要:
我们研究了在量子信号处理应用中出现的两类一元多项式的逼近能力。虽然仅在域$[0,1]$中的近似在物理上是期望的,但是这些多项式族不仅由$[0,1]$中的边界约束来定义,而且还由$[0,1]$之外的附加边界约束来定义。人们可能想知道这些额外的约束是否会抑制它们在$[0,1]$中的近似属性。本文的主要结果是,情况并非如此-额外的约束条件并不妨碍这些多项式族的能力,以近似任意以及任何连续函数$f:[0,1] \rightarrow [0,1]$的上确界规范,提供$f$也匹配任何多项式在家庭中的$0$和$1$。我们还研究了具体的问题,近似的阶跃函数$[0,1]$(与步骤从$0$ $1$发生在$x=\frac{1}{2}$)使用这些家庭之一,并提出了两个子家庭的单调和非单调近似。对于非单调的情况下,在一些额外的假设下,我们提供了一个迭代的启发式算法,找到最佳的多项式逼近。
英文摘要:
We study the approximation capabilities of two families of univariate polynomials that arise in applications of quantum signal processing. Although approximation only in the domain $[0,1]$ is physically desired, these polynomial families are defined by bound constraints not just in $[0,1]$, but also with additional bound constraints outside $[0,1]$. One might wonder then if these additional constraints inhibit their approximation properties within $[0,1]$. The main result of this paper is that this is not the case -- the additional constraints do not hinder the ability of these polynomial families to approximate arbitrarily well any continuous function $f:[0,1] \rightarrow [0,1]$ in the supremum norm, provided $f$ also matches any polynomial in the family at $0$ and $1$. We additionally study the specific problem of approximating the step function on $[0,1]$ (with the step from $0$ to $1$ occurring at $x=\frac{1}{2}$) using one of these families, and propose two subfamilies of monotone and non-monotone approximations. For the non-monotone case, under some additional assumptions, we provide an iterative heuristic algorithm that finds the optimal polynomial approximation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。