首页|Analysis of pseudo-random number generators in QMC-SSE method
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 performance of different PRNGs on the widely used QMC method known as the stochastic series expansion(SSE)algorithm.To quantitatively compare them,we intro-duce 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.
stochastic series expansionquantum Monte Carlopseudo-random number generator
刘东旭、徐维、张学锋
展开 >
Department of Physics,Chongqing University,Chongqing 401331,China
万方数据
维普
