arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2107.11284cond-mat.str-el
收藏

团簇微扰理论的行列式量子Monte Carlo求解器

Determinantal Quantum Monte Carlo solver for Cluster Perturbation Theory

Edwin W. Huang, Yao Wang

摘要:

集团微扰理论(CPT)是一种计算具有局域相互作用的费米子模型谱函数的方法。通过将有限簇模型的解与簇内跳跃的微扰理论相结合,CPT提供了具有任意动量分辨率的单粒子性质,同时产生低计算成本。在这里,我们引入确定性量子蒙特卡罗(DQMC)作为CPT的求解器。与标准求解器相比,精确对角化(ED),DQMC求解器通过利用更大的集群减少了有限尺寸效应,允许研究温度依赖性,并能够对更多的模型进行大规模模拟。我们讨论了CPT的DQMC求解器的实现,并对吸引和排斥哈伯德模型的CPT+DQMC方法进行了基准测试,展示了其优于标准DQMC和CPT+ED模拟的优势。

英文摘要:

Cluster Perturbation Theory (CPT) is a technique for computing the spectral function of fermionic models with local interactions. By combining the solution of the model on a finite cluster with perturbation theory on intra-cluster hoppings, CPT provides access to single-particle properties with arbitrary momentum resolution while incurring low computational cost. Here, we introduce Determinantal Quantum Monte Carlo (DQMC) as a solver for CPT. Compared to the standard solver, exact diagonalization (ED), the DQMC solver reduces finite size effects through utilizing larger clusters, allows study of temperature dependence, and enables large-scale simulations of a greater set of models. We discuss the implementation of the DQMC solver for CPT and benchmark the CPT+DQMC method for the attractive and repulsive Hubbard models, showcasing its advantages over standard DQMC and CPT+ED simulations.

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

↑