Parallelized Quantum Monte Carlo Algorithm with Nonlocal Worm Updates
arXiv:1307.0328 · doi:10.1103/PhysRevLett.112.140603
Abstract
Based on the worm algorithm in the path-integral representation, we propose a general quantum Monte Carlo algorithm suitable for parallelizing on a distributed-memory computer by domain decomposition. Of particular importance is its application to large lattice systems of bosons and spins. A large number of worms are introduced and its population is controlled by a fictitious transverse field. For a benchmark, we study the size-dependence of the Bose-condensation order parameter of the hardcore Bose-Hubbard model with , using 3200 computing cores, which shows good parallelization efficiency.
arXiv comment6 pages, 4 figures
References in corpus (11)
- Quantum Monte Carlo with Directed Loops
- The ALPS project release 2.0: Open source software for strongly correlated systems
- Exact, Complete, and Universal Continuous-Time Worldline Monte Carlo Approach to the Statistics of Discrete Quantum Systems
- Cluster Algorithm for Vertex Models
- Feynman diagrams versus Fermi-gas Feynman emulator
- Suppression of the critical temperature for superfluidity near the Mott transition: validating a quantum simulator
- Recent Developments of World-Line Monte Carlo Methods
- Possibility of Deconfined Criticality in SU(N) Heisenberg Models at Small N
- Accessing the dynamics of large many-particle systems using Stochastic Series Expansion
- Phase diagram of 4He adsorbed on graphite
- Engineering Local optimality in Quantum Monte Carlo algorithms