.png){kind=icon}
返回
Quantum Monte Carlo algorithm for Bose-Hubbard models on arbitrary graphs
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevB.109.134519.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose a quantum Monte Carlo algorithm capable of simulating the Bose-Hubbard model on arbitrary graphs, obviating the need for devising lattice-specific updates for different input graphs. We show that with our method, which is based on the recently introduced permutation matrix representation quantum Monte Carlo [Gupta, Albash, and Hen, J. Stat. Mech. (2020) 073105], the problem of adapting the simulation to a given geometry amounts to generating a cycle basis for the graph on which the model is defined, a procedure that can be carried out efficiently and in an automated manner. To showcase the versatility of our approach, we provide simulation results for Bose-Hubbard models defined on two-dimensional lattices as well as on a number of random graphs.
Keyword:
EINSTEIN CONDENSATION
LOCALIZATION
PHASE
MOTT
期刊
IF:
3.7
论文数:
15.4W
被引数:
41.0W
机构
引用论文
Quantum phase transitions in the two-dimensional hardcore boson model -: art. no. 014513.png)
PHYSICAL REVIEW BOAAI
PHYSICAL REVIEW BIF3.7
OAAI分享收藏
查看更多内容