paper

Parallel loop cluster quantum Monte Carlo simulation of quantum magnets based on global union-find graph algorithm

arXiv:1810.07485 · doi:10.1016/j.cpc.2019.01.004

Abstract

A large-scale parallel loop cluster quantum Monte Carlo simulation is presented. On 24,576 nodes of the K computer, one loop cluster Monte Carlo update of the world-line configuration of the antiferromagnetic Heisenberg chain with spins at inverse temperature is executed in about 8.62 seconds, in which global union-find cluster identification on a graph of about 1.1 trillion vertices and edges is performed. By combining the nonlocal global updates and the large-scale parallelization, we have virtually achieved about -fold speed-up from the conventional local update Monte Carlo simulation performed on a single core. We have estimated successfully the antiferromagnetic correlation length and the magnitude of the first excitation gap of the antiferromagnetic Heisenberg chain for the first time as and , respectively.

16 pages, 9 figures

References in corpus (4)

Cited by in corpus (9)