arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.04246quant-phmath-phmath.MP
收藏

量子信号处理中的互补多项式

Complementary polynomials in quantum signal processing

Bjorn K. Berntson, Christoph Sünderhauf

AI总结:

针对量子信号处理中互补多项式现有数值方法无法显式误差分析的问题,提出基于复分析的围道积分表示,开发带显式误差保证的FFT算法,性能优于现有最优优化方法。

摘要:

量子信号处理是在量子计算机上实现多项式函数的框架。要实现给定多项式$P$,必须首先构造对应的互补多项式$Q$。现有解决该问题的方法采用数值手段,无法进行显式误差分析。我们提出一种利用复分析研究互补多项式的新方法,核心数学结果是给出了典范互补多项式的围道积分表示。在单位圆上,该表示具有极为简洁有效的傅里叶分析解释,我们借此开发了基于快速傅里叶变换(Fast Fourier Transform, FFT)的算法,可在单项式基下高效计算$Q$,且具备显式误差保证。数值实验表明,我们的算法性能优于当前最先进的基于优化的互补多项式计算方法。

英文摘要:

Quantum signal processing is a framework for implementing polynomial functions on quantum computers. To implement a given polynomial $P$, one must first construct a corresponding complementary polynomial $Q$. Existing approaches to this problem employ numerical methods that are not amenable to explicit error analysis. We present a new approach to complementary polynomials using complex analysis. Our main mathematical result is a contour integral representation for a canonical complementary polynomial. On the unit circle, this representation has a particularly simple and efficacious Fourier analytic interpretation, which we use to develop a Fast Fourier Transform-based algorithm for the efficient calculation of $Q$ in the monomial basis with explicit error guarantees. Numerical evidence that our algorithm outperforms the state-of-the-art optimization-based method for computing complementary polynomials is provided.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑