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)
- "Deconfined" quantum critical points
- Successive phase transitions at finite temperatures of the supersolid in the three-dimensional extended Bose-Hubbard model
- Thermal Phase Transition of Generalized Heisenberg Models for SU(N) Spins on Square and Honeycomb Lattices
- Precise estimation of the S = 2 Haldane gap by numerical diagonalization
Cited by in corpus (9)
- Generalization of the Haldane conjecture to SU(3) chains
- Generalization of the Haldane conjecture to SU() chains
- Flag manifold sigma models: spin chains and integrable theories
- Haldane Gap of the Three-Box Symmetric Chain
- Physics of integer spin antiferromagnetic chains : Haldane gaps and edge states
- DSQSS: Discrete Space Quantum Systems Solver
- Haldane Gaps of Large-S Heisenberg Antiferromagnetic Chains and Asymptotic Behavior
- Asymptotic Freedom and Large Spin Antiferromagnetic Chains
- Extraordinary magnetic response of an anisotropic 2D antiferromagnet via site-dilution