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

基于张量网络的量子优化算法

Quantum power iterations via tensor networks

Terra Quantum AG

V. Akshay, A. Berezutskii, Ar. Melnikov, A. Termanova, M. R. Perelshtein

AI总结:

本文提出一种基于张量网络的量子优化算法,通过将低秩表示转换为量子电路实现幂迭代,规避了经典算法的指数级运行时间扩展,并保证运行时间优势。

摘要:

在优化领域,著名的经典算法之一是幂迭代。简而言之,该算法恢复某个可对角化矩阵的主特征向量。由于许多优化问题可以表述为特征值/特征向量搜索,该算法具有广泛的适用性。在操作上,幂迭代包括执行重复的矩阵与向量乘法(或 MatVec),随后进行重归一化步骤,以收敛到主特征值/特征向量。然而,包括基于张量网络的新方法在内的经典实现,需要算法运行时间呈指数级扩展。在本文中,我们提出了一种量子实现来规避这一缺陷。我们的方法涉及将低秩表示;用于矩阵的 Matrix Product Operators (MPO) 和用于向量的 Matrix Product States (MPS),转换为量子电路。具体而言,我们通过变分最小化目标 MPO 与 MPO ansatz 之间的 Frobenius 距离来恢复酉近似,其中张量核心被约束为酉矩阵。这种酉 MPO 可以通过添加辅助量子比特轻松实现为量子电路。此后,通过适当的初始化和对辅助空间的 post-selection,我们实现了经典算法的单次迭代。使用我们提出的方法,幂迭代可以完全在量子计算机上通过重复的静态电路块实现;因此,确实可以保证运行时间优势。此外,通过利用 Riemannian 优化和交叉近似技术,我们的方法变得与实例无关,从而允许在量子计算框架内解决黑盒优化。

英文摘要:

In optimization, one of the well-known classical algorithms is power iterations, which recovers the dominant eigenvector of a diagonalizable matrix. Since numerous optimization problems can be formulated as an eigenvalue/eigenvector search, this algorithm features wide applicability. Operationally, power iterations perform repeated matrix-to-vector multiplications (\texttt{MatVec}) followed by a renormalization step to converge to the dominant eigenvalue/eigenvector. However, classical tensor network realizations can exhibit worst-case exponential growth of tensor ranks with the number of iterations. We propose a quantum realization offering a possible route around this bottleneck. Our method involves casting low-rank representations---MPO for matrices and MPS for vectors---into quantum circuits. Specifically, we recover a unitary approximation by variationally minimizing the Frobenius distance between a target MPO and an MPO ansatz wherein the tensor cores are constrained to unitaries. Such unitary MPOs can be implemented as quantum circuits with ancillary qubits. With appropriate initialization and post-selection on the ancillary space, we realize a single classical iteration. With our proposed methodology, power iterations can be realized entirely on a quantum computer via repeated, static circuit blocks. By exploiting Riemannian optimization and cross-approximation techniques, our methodology becomes instance-agnostic, allowing one to address black-box optimization of functions admitting low-rank tensor network representations within quantum computing. We emphasize that this work establishes the construction and analyzes its reliable operating conditions; it does not demonstrate an end-to-end computational advantage over classical tensor network optimization, which we discuss explicitly.

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

↑