Analysis of pseudo-random number generators in QMC-SSE method

In the quantum Monte Carlo (QMC) method, the pseudo-random number generator (PRNG) plays a crucial role in determining the computation time. However, the hidden structure of the PRNG may lead to serious issues such as the breakdown of the Markov process. Here, we systematically analyze the performan...

Full description

Saved in:
Bibliographic Details
Published in:Chinese physics B 2024-03, Vol.33 (3), p.37509
Main Authors: Liu, Dong-Xu, Xu, Wei, Zhang, Xue-Feng
Format: Article
Language:English
Subjects:
pseudo-random number generator
quantum Monte Carlo
stochastic series expansion
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the quantum Monte Carlo (QMC) method, the pseudo-random number generator (PRNG) plays a crucial role in determining the computation time. However, the hidden structure of the PRNG may lead to serious issues such as the breakdown of the Markov process. Here, we systematically analyze the performance of different PRNGs on the widely used QMC method known as the stochastic series expansion (SSE) algorithm. To quantitatively compare them, we introduce a quantity called QMC efficiency that can effectively reflect the efficiency of the algorithms. After testing several representative observables of the Heisenberg model in one and two dimensions, we recommend the linear congruential generator as the best choice of PRNG. Our work not only helps improve the performance of the SSE method but also sheds light on the other Markov-chain-based numerical algorithms.
ISSN:1674-1056
2058-3834
DOI:10.1088/1674-1056/ad1e69