A short-loop algorithm for quantum Monte Carlo simulations
arXiv:0709.1718 · doi:10.1103/PhysRevE.77.036708
Abstract
We present an algorithmic framework for a variant of the quantum Monte Carlo operator-loop algorithm, where non-local cluster updates are constructed in a way that makes each individual loop smaller. The algorithm is designed to increase simulation efficiency in cases where conventional loops become very large, do not close altogether, or otherwise behave poorly. We demonstrate and characterize some aspects of the short-loop on a square lattice spin-1/2 XXZ model where, remarkably, a significant increase in simulation efficiency is observed in some parameter regimes. The simplicity of the model provides a prototype for the use of short-loops on more complicated quantum systems.
9 pages, 9 figures: new FSS discussion added
References in corpus (5)
- Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
- Worm Algorithm for Continuous-space Path Integral Monte Carlo Simulations
- Generalized Directed Loop Method for Quantum Monte Carlo Simulations
- Optimal Monte Carlo Updating
- Simulations of ultracold bosonic atoms in optical lattices with anharmonic traps