arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.01439quant-ph
收藏

量子信号处理与量子奇异值变换在U(N)上的应用

Quantum Signal Processing and Quantum Singular Value Transformation on $U(N)$

Zhejiang University(浙江大学);North Carolina State University(北卡罗来纳州立大学)

Xi Lu, Yuan Liu, Hongwei Lin

AI总结:

本文提出在U(N)上实现量子信号处理和奇异值变换的框架,通过块编码输入实现多项式变换,并展示了多项式函数、N区间决策和量子振幅估计算法的应用。

摘要:

量子信号处理和量子奇异值变换是实现量子计算机上块编码矩阵多项式变换的强大工具,并在许多著名量子算法中实现了渐近最优复杂度。我们提出了一种在U(N)上的量子信号处理和奇异值变换框架,从块编码输入中实现多个多项式,作为原始框架在U(2)上的推广。我们提供了可实现多项式矩阵的全面表征,并给出了递归算法来构建实现所需多项式变换的量子电路。作为三个示例应用,我们提出了一种实现双变量多项式函数的框架,展示了通过迭代U(2)-QSP实现N区间决策的O(d)查询复杂度,相比需要O(d log₂N)查询的迭代U(2)-QSP有log₂N的改进,并展示了在不使用自适应测量的情况下实现海森堡极限的量子振幅估计算法。

英文摘要:

Quantum signal processing and quantum singular value transformation are powerful tools to implement polynomial transformations of block-encoded matrices on quantum computers, and has achieved asymptotically optimal complexity in many prominent quantum algorithms. We propose a framework of quantum signal processing and quantum singular value transformation on $U(N)$, which realizes multiple polynomials simultaneously from a block-encoded input, as a generalization of those on $U(2)$ in the original frameworks. We provide a comprehensive characterization of achievable polynomial matrices and give recursive algorithms to construct the quantum circuits that realize desired polynomial transformations. As three example applications, we propose a framework to realize bi-variate polynomial functions, demonstrate $N$-interval decision achieving $O(d)$ query complexity with a $\log_2 N$ improvement over iterative $U(2)$-QSP requiring $O(d\log_2 N)$ queries, and present a quantum amplitude estimation algorithm achieving the Heisenberg limit without adaptive measurements.

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

↑