arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2101.03161hep-lat
收藏

强关联系统的团簇和meron算法研究进展

Recent progress on cluster and meron algorithms for strongly correlated systems

Debasish Banerjee

摘要:

高效的蒙特卡罗算法极大地促进了强相互作用玻色子和费米子系统的从头计算研究。本文强调了这一要求,并概述了构建聚类算法背后的思想,并通过具体示例进行了说明。在有限密度和实时的费米子系统的数值研究有时会受到臭名昭著的符号问题,这也进行了讨论。讨论了解决某些符号问题的meron簇算法的构造。集群算法,可以模拟某些纯阿贝尔规范理论(实现为量子链路模型)进行了讨论。

英文摘要:

Ab-initio studies of strongly interacting bosonic and fermionic systems is greatly facilitated by efficient Monte Carlo algorithms. This article emphasizes this requirement, and outlines the ideas behind the construction of the cluster algorithms and illustrates them via specific examples. Numerical studies of fermionic systems at finite densities and at real-times are sometimes hindered by the infamous sign problem, which is also discussed. The construction of meron cluster algorithms, which can solve certain sign problems are discussed. Cluster algorithms which can simulate certain pure Abelian gauge theories (realized as quantum link models) are also discussed.

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

↑