arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2503.08039physics.comp-phcond-mat.othercond-mat.str-elquant-ph
收藏

用于任意高自旋哈密顿量的量子蒙特卡罗算法

A quantum Monte Carlo algorithm for arbitrary high-spin Hamiltonians

University of Southern California(南加州大学)

Arman Babakhani, Lev Barash, Itay Hen

AI总结:

本文提出了一种适用于任意高自旋哈密顿量的量子蒙特卡罗算法,通过排列矩阵表示框架实现,适用于多种相互作用模型并提供开源代码。

摘要:

我们提出了一种通用的量子蒙特卡罗算法,用于模拟任意高自旋(自旋大于1/2)哈密顿量,该算法基于最近发展的排列矩阵表示(PMR)框架。我们的方法扩展了之前为自旋-1/2哈密顿量开发的PMR-QMC方法[Phys. Rev. Research 6, 013281 (2024)]。由于该方法不依赖于局部键分解,它同样适用于具有任意连接性、长程和多自旋相互作用的模型,其闭合行走公式允许自然地分析符号问题条件,以循环权重为依据。为了证明其适用性和通用性,我们将其应用于正方形晶格上的自旋-1和自旋-3/2量子Heisenberg模型,以及随机生成的高自旋哈密顿量。此外,我们展示了该方法如何自然扩展到包含混合粒子种类的一般哈密顿量,包括玻色子和费米子。我们的程序代码已在GitHub上免费提供。

英文摘要:

We present a universal quantum Monte Carlo algorithm for simulating arbitrary high-spin (spin greater than 1/2) Hamiltonians, based on the recently developed permutation matrix representation (PMR) framework. Our approach extends a previously developed PMR-QMC method for spin-1/2 Hamiltonians [Phys. Rev. Research 6, 013281 (2024)]. Because it does not rely on a local bond decomposition, the method applies equally well to models with arbitrary connectivities, long-range and multi-spin interactions, and its closed-walk formulation allows a natural analysis of sign-problem conditions in terms of cycle weights. To demonstrate its applicability and versatility, we apply our method to spin-1 and spin-3/2 quantum Heisenberg models on the square lattice, as well as to randomly generated high-spin Hamiltonians. Additionally, we show how the approach naturally extends to general Hamiltonians involving mixtures of particle species, including bosons and fermions. We have made our program code freely accessible on GitHub.

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

↑