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

张量网络替代模型用于变分量子计算

Tensor network surrogate models for variational quantum computation

The University of Osaka(大阪大学);Boston University(波士顿大学);Flatiron Institute(平顿研究所)

Ryo Watanabe, Dries Sels, Joseph Tindall

AI总结:

本文提出使用二维张量网络模拟变分量子算法,展示其在Ising spin-glass问题上的高精度模拟能力,并通过参数迁移和扩展训练避免局部极小值,提升采样效率。

摘要:

我们采用二维张量网络(TN)模型来模拟二维量子比特架构上的变分量子算法,通过量子近似优化算法(QAOA)在重叠六边形和正方形晶格上的Ising自旋玻璃问题中展示其能力。对于最多三体相互作用的重叠六边形问题,通过在小实例上训练并迁移到数量级更大的系统中,参数只能在中等深度内改善采样能量分布,表明参数集中作为迁移策略存在根本限制。通过在更大系统大小上扩展训练本身,我们避免了局部极小值并获得了更低能量的样本。纠缠增长和重要性抽样分析表明,模拟在适度的键维度下仍具有经典可行性。我们发现参数集中也持续存在于正方形晶格上,尽管计算成本显著增加以获得可靠采样。总体而言,我们的TN框架不仅为在二维晶格上评估变分量子算法提供了高效且受控的框架,还为训练变分算法提供了有效的替代模型。

英文摘要:

We adopt a two-dimensional tensor-network (TN) ansatz to simulate variational quantum algorithms on two-dimensional qubit architectures, demonstrating its capability to accurately simulate deep circuits through the Quantum Approximate Optimization Algorithm (QAOA) applied to Ising spin-glass problems on heavy-hexagonal and square lattices. For heavy-hexagonal problems with up to three-body interactions, parameters trained on small instances and transferred to systems an order of magnitude larger improve the sampled energy distribution only up to intermediate depths, indicating a fundamental limit of parameter concentration as a transfer strategy. By extending the training itself with TN simulations on larger system sizes, we avoid local minima and obtain lower-energy samples. Analyses of entanglement growth and importance sampling show that the simulation remains classically feasible with moderate bond dimension. We find that parameter concentration also persists on square lattices, albeit at substantially higher computational cost to perform reliable sampling. Overall, our TN framework not only provides an efficient and controlled framework for benchmarking variational quantum algorithms on two-dimensional lattices, but also serves as an effective surrogate model for training variational algorithms.

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

↑