量子信号处理中相位因子的有效计算
Efficient phase-factor evaluation in quantum signal processing
摘要:
量子信号处理(QSP)是一种在量子计算机上精确实现矩阵多项式的强大量子算法。基于QSP的量子算法的渐近分析表明,对于一系列任务,如哈密顿模拟和量子线性系统问题,原则上可以获得渐近最优结果。QSP的另一个好处是它使用了最少数量的辅助量子比特,这有助于它在近中期量子架构上的实现。然而,到目前为止,还没有经典稳定的算法,允许计算的相位因子,需要建立QSP电路。现有的方法需要使用变精度算法,并且只能应用于相对低次数的多项式。我们在这里提出了一种基于优化的方法,可以准确地计算相位因子使用标准的双精度算术运算。我们证明了这种方法的性能与应用程序的哈密顿模拟,本征值滤波,和量子线性系统的问题。我们的数值结果表明,优化算法可以找到相位因子,以准确地近似多项式的次数大于$10,000$与误差低于$10^{-12}$。
英文摘要:
Quantum signal processing (QSP) is a powerful quantum algorithm to exactly implement matrix polynomials on quantum computers. Asymptotic analysis of quantum algorithms based on QSP has shown that asymptotically optimal results can in principle be obtained for a range of tasks, such as Hamiltonian simulation and the quantum linear system problem. A further benefit of QSP is that it uses a minimal number of ancilla qubits, which facilitates its implementation on near-to-intermediate term quantum architectures. However, there is so far no classically stable algorithm allowing computation of the phase factors that are needed to build QSP circuits. Existing methods require the usage of variable precision arithmetic and can only be applied to polynomials of relatively low degree. We present here an optimization based method that can accurately compute the phase factors using standard double precision arithmetic operations. We demonstrate the performance of this approach with applications to Hamiltonian simulation, eigenvalue filtering, and the quantum linear system problems. Our numerical results show that the optimization algorithm can find phase factors to accurately approximate polynomials of degree larger than $10,000$ with error below $10^{-12}$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。