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

QSP预处理搭车指南

The Hitchhiker's Guide to QSP pre-processing

S. E. Skelton

AI总结:

本文综述QSP约定与相位因子预处理方法,分析Wilson方法的误差界限,并通过基准比较证明Berntson–Sünderhauf方法在复多项式上更优。

摘要:

量子信号处理(QSP)依赖于一个历史上代价高昂的预处理步骤,即“QSP处理/相位因子求解”。QSP处理如今已是量子算法文献中一个发展成熟的主题,因此早该有一篇面向初学者的QSP处理综述。本工作快速梳理了QSP约定与预处理方法,并从一种教学上易于理解的QSP约定开始。随后,我们综述了与三种常见多项式类型相关的QSP约定:具有确定奇偶性的实多项式、倒数/反倒数Chebyshev多项式之和,以及复多项式。我们围绕三项标准展示这些约定的表现:电路长度、多项式条件和预处理方法。接着,我们综述了最近提出的用于QSP处理的Wilson方法,并给出其能够在有界误差下成功的条件。尽管所得界限在计算上并不高效,我们证明,对于相关目标多项式和精度区间,包括Hamiltonian模拟算法中使用的Jacobi-Anger展开,该方法能够以线性误差传播取得成功。然后,我们将基准测试应用于三种用于QSP电路的QSP处理方法,并表明Berntson和Sünderhauf提出的方法在复多项式方面优于Wilson方法和标准优化策略。

英文摘要:

Quantum signal processing (QSP) relies on a historically costly pre-processing step, "QSP-processing/phase-factor finding." QSP-processing is now a developed topic within quantum algorithms literature, and a beginner accessible review of QSP-processing is overdue. This work provides a whirlwind tour through QSP conventions and pre-processing methods, beginning from a pedagogically accessible QSP convention. We then review QSP conventions associated with three common polynomial types: real polynomials with definite parity, sums of reciprocal/anti-reciprocal Chebyshev polynomials, and complex polynomials. We demonstrate how the conventions perform with respect to three criteria: circuit length, polynomial conditions, and pre-processing methods. We then review the recently introduced Wilson method for QSP-processing and give conditions where it can succeed with bound error. Although the resulting bound is not computationally efficient, we demonstrate that the method succeeds with linear error propagation for relevant target polynomials and precision regimes, including the Jacobi-Anger expansion used in Hamiltonian simulation algorithms. We then apply our benchmarks to three QSP-processing methods for QSP circuits and show that a method introduced by Berntson and Sünderhauf outperforms both the Wilson method and the standard optimization strategy for complex polynomials.

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

↑