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

基于矩阵积算符的量子启发算法用于经典自旋哈密顿量

Quantum-Inspired Algorithm for Classical Spin Hamiltonians Based on Matrix Product Operators

Graduate School of Engineering Science, The University of Osaka(大阪大学工学研究科);Center for Computational Quantum Physics, Flatiron Institute(平顿研究所计算量子物理中心);Center for Quantum Information and Quantum Biology, Osaka University(大阪大学量子信息与量子生物学中心);RIKEN Center for Computational Science (R-CCS)(理化学研究所计算科学中心)

Ryo Watanabe, Joseph Tindall, Shohei Miyakoshi, Hiroshi Ueda

AI总结:

本文提出一种基于矩阵积算符的量子启发算法,用于求解经典自旋哈密顿量优化问题,通过谱过滤和幂迭代方法提升性能,避免局部极小值并提供系统改进路径。

摘要:

我们提出了一种张量网络(TN)方法,用于解决经典优化问题,该方法受到量子态的谱过滤和采样启发。我们首先将成本函数的伊辛哈密顿量进行位移和缩放,使得所有本征值变为非负数,并且基态对应于最大的本征值,这些本征值随后通过幂迭代放大。我们将变换后的哈密顿量表示为矩阵积算符(MPO),并通过截断的MPO-MPO收缩形成该对象的庞大幂次,将结果算符嵌入到矩阵积态中,以在计算基中进行采样。与密度矩阵重整化群方法不同,我们的方法通过增加键维数提供了一条系统改进的直接路线,并且在避免局部极小值方面表现更好。我们还研究了这种幂方法在重叠六边形晶格上的高阶伊辛哈密顿量中的性能,并与模拟退火进行比较。这些结果突显了量子启发算法在解决优化问题中的潜力,并为评估和开发量子算法提供了基准。

英文摘要:

We propose a tensor-network (TN) approach for solving classical optimization problems that is inspired by spectral filtering and sampling on quantum states. We first shift and scale an Ising Hamiltonian of the cost function so that all eigenvalues become non-negative and the ground states correspond to the the largest eigenvalues, which are then amplified by power iteration. We represent the transformed Hamiltonian as a matrix product operator (MPO) and form an immense power of this object via truncated MPO-MPO contractions, embedding the resulting operator into a matrix product state for sampling in the computational basis. In contrast to the density-matrix renormalization group, our approach provides a straightforward route to systematic improvement by increasing the bond dimension and is better at avoiding local minima. We also study the performance of this power method in the context of a higher-order Ising Hamiltonian on a heavy-hexagonal lattice, making a comparison with simulated annealing. These results highlight the potential of quantum-inspired algorithms for solving optimization problems and provide a baseline for assessing and developing quantum algorithms.

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

↑