arXiv:1702.04771

Remarks on the construction of worm algorithms for lattice field theories in worldline representation

Mario Giuliani, Christof Gattringer

Published Feb 15, 2017• 3 citations

Abstract

We introduce a generalized worldline model where the partition function is a sum over configurations of a conserved flux on a d-dimensional lattice. The weights for the configurations of the corresponding worldlines have factors living on the links of the lattice, as well as terms which live on the sites x and depend on all fluxes attached to x. The model represents a general class of worldline systems, among them the dual representation of the relativistic Bose gas at finite density. We construct a suitable worm algorithm and show how to correctly distribute the site weights in the various Metropolis probabilities that determine the worm. We analyze the algorithm in detail and give a proof of detailed balance. Our algorithm admits the introduction of an amplitude parameter A that can be chosen freely. Using a numerical simulation of the relativistic Bose gas we demonstrate that A allows one to influence the starting and terminating probabilities and thus the average length and the efficiency of the worm.

DOI: 10.48550/arxiv.1702.04771

Related papers

Path-Integral Monte Carlo Worm Algorithm for Bose Systems with Periodic Boundary Conditions

Gabriele Spada, S. Giorgini, Sebastiano Pilati

We provide a detailed description of the path-integral Monte Carlo worm algorithm used to exactly calculate the thermodynamics of Bose systems in the canonical ensemble. The algorithm is fully consistent with periodic boundary conditions, which are applied to simulate homogeneous phases of bulk systems, and it does not require any limitation in the length of the Monte Carlo moves realizing the sampling of the probability distribution function in the space of path configurations. The result is achieved by adopting a representation of the path coordinates where only the initial point of each path is inside the simulation box, the remaining ones being free to span the entire space. Detailed balance can thereby be ensured for any update of the path configurations without the ambiguity of the selection of the periodic image of the particles involved. We benchmark the algorithm using the non-interacting Bose gas model for which exact results for the partition function at finite number of particles can be derived. Convergence issues and the approach to the thermodynamic limit are also addressed for interacting systems of hard spheres in the regime of high density.

arXiv:2203.00010Condensed MatterMar 29, 202219 citations

Codebase release 1.0 Worm

Nicolas Sadoune, Lode Pollet

We present a novel and open-source implementation of the worm algorithm, which is an algorithm to simulate Bose-Hubbard and sign-positive spin models using a path-integral representation of the partition function. The code can deal with arbitrary lattice structures and assumes spin-exchange terms, or bosonic hopping amplitudes, between nearest-neighbor sites, and local or nearest-neighbor interactions of the density-density type. We explicitly demonstrate the near-linear scaling of the algorithm with respect to the system volume and the inverse temperature and analyze the autocorrelation times in the vicinity of a U(1) U(1) second order phase transition. The code is written in such a way that extensions to other lattice models as well as closely-related sign-positive models can be done straightforwardly on top of the provided framework.

SciPost Physics CodebasesNov 29, 20222 citations

Efficient and scalable path integral Monte Carlo simulations with worm-type updates for Bose-Hubbard and XXZ models

Nicolas Sadoune, Lode Pollet

We present a novel and open-source implementation of the worm algorithm, which is an algorithm to simulate Bose-Hubbard and sign-positive spin models using a path-integral representation of the partition function. The code can deal with arbitrary lattice structures and assumes spin-exchange terms, or bosonic hopping amplitudes, between nearest-neighbor sites, and local or nearest-neighbor interactions of the density-density type. We explicitly demonstrate the near-linear scaling of the algorithm with respect to the system volume and the inverse temperature and analyze the autocorrelation times in the vicinity of a U(1) U ( 1 ) second order phase transition. The code is written in such a way that extensions to other lattice models as well as closely-related sign-positive models can be done straightforwardly on top of the provided framework.

arXiv:2204.12262SciPost Physics CodebasesNov 29, 202218 citations

Worldline Approach to Few-Body Physics on the Lattice

Hersh Singh

We study the physics of two species of non-relativistic hard-core bosons with attractive or repulsive delta function interactions on a spacetime lattice using the worldline formulation. By tuning the chemical potential carefully we show that worm algorithms can efficiently sample the worldline configurations in any fixed particle-number sector. Since fermions can be treated as hard-core bosons up to a permutation sign, we also apply this approach to non-relativistic fermions. The fermion permutation sign is treated as an observable in this approach and can be used to extract energies for each particle-number sector. Since in one dimension non-relativistic fermions can only permute due to boundary effects, unlike the auxiliary field method, in many cases our approach does not suffer from sign problems. Using our method we discover limitations of the recently proposed complex Langevin calculations in one dimension.

arXiv:1812.02364International Symposium on Lattice Field Theory (LATTICE)May 29, 20193 citations

Dual geometric worm algorithm for two-dimensional discrete classical lattice models

Peter B. Hitchcock, Erik Schwartz Sørensen, Fabien Alet

We present a dual geometrical worm algorithm for two-dimensional Ising models. The existence of such dual algorithms was first pointed out by Prokof'ev and Svistunov [Phys. Rev. Lett. 87, 160601 (2001)]]. The algorithm is defined on the dual lattice and is formulated in terms of bond variables and can therefore be generalized to other two-dimensional models that can be formulated in terms of bond variables. We also discuss two related algorithms formulated on the direct lattice, applicable in any dimension. These latter algorithms turn out to be less efficient but of considerable intrinsic interest. We show how such algorithms quite generally can be "directed" by minimizing the probability for the worms to erase themselves. Explicit proofs of detailed balance are given for all the algorithms. In terms of computational efficiency the dual geometrical worm algorithm is comparable to well known cluster algorithms such as the Swendsen-Wang and Wolff algorithms, however, it is quite different in structure and allows for a very simple and efficient implementation. The dual algorithm also allows for a very elegant way of calculating the domain wall free energy.

arXiv:cond-mat/0311011Physical Review EJul 2, 200410 citations

Parallelized Quantum Monte Carlo Algorithm with Nonlocal Worm Updates

Akiko Masaki-Kato, Takafumi Suzuki, Kenji Harada +2 more

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 hard-core Bose-Hubbard model with $L\ifmmode\times\else\texttimes\fi{}L\ifmmode\times\else\texttimes\fi{}\ensuremath{\beta}t=10240\ifmmode\times\else\texttimes\fi{}10240\ifmmode\times\else\texttimes\fi{}16$, using 3200 computing cores, which shows good parallelization efficiency.

arXiv:1307.0328Physical Review LettersApr 10, 20143 citations