Related papers: A worm algorithm for the fully-packed loop model

We present a Markov-chain Monte Carlo algorithm of "worm"type that correctly simulates the O(n) loop model on any (finite and connected) bipartite cubic graph, for any real n>0, and any edge weight, including the fully-packed limit of…

The worm algorithm is a versatile technique in the Markov chain Monte Carlo method for both classical and quantum systems. The algorithm substantially alleviates critical slowing down and reduces the dynamic critical exponents of various…

Nonreversible Markov chains can outperform reversible chains in the Markov chain Monte Carlo method. Lifting is a versatile approach to introducing net stochastic flow in state space and constructing a nonreversible Markov chain. We present…

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…

The loop gas approach to lattice field theory provides an alternative, geometrical description in terms of fluctuating loops. Statistical ensembles of random loops can be efficiently generated by Monte Carlo simulations using the worm…

We investigate the symmetric Ashkin-Teller (AT) model on the triangular lattice in the antiferromagnetic two-spin coupling region ($J<0$). In the $J \rightarrow -\infty$ limit, we map the AT model onto a fully-packed loop-dimer model on the…

We study a classical fully-frustrated honeycomb lattice Ising model using Markov chain Monte Carlo methods and exact calculations . The Hamiltonian realizes a degenerate ground state manifold of equal-energy states, where each hexagonal…

We study a class of loop models, parameterized by a continuously varying loop fugacity n, on the hydrogen-peroxide lattice, which is a three-dimensional cubic lattice of coordination number 3. For integer n > 0, these loop models provide…

We propose a new decoder for "matchable'' qLDPC codes that uses a Markov Chain Monte Carlo algorithm - called the worm algorithm - to approximately compute the probabilities of logical error classes given a syndrome. The algorithm hence…

We apply a worm algorithm to simulate the quantum transverse-field Ising model in a path-integral representation of which the expansion basis is taken as the spin component along the external-field direction. In such a representation, a…

We present an algorithm for the efficient simulation of the half-filled spinless $t$-$V$ model on bipartite lattices, which combines the stochastic series expansion method with determinantal quantum Monte Carlo techniques widely used in…

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…

We design an irreversible worm algorithm for the zero-field ferromagnetic Ising model by using the lifting technique. We study the dynamic critical behavior of an energy estimator on both the complete graph and toroidal grids, and compare…

We take advantage of recent improvements in the grand canonical Hybrid Monte Carlo (HMC) algorithm, to perform a precision study of the single-particle gap in the hexagonal Hubbard model, with on-site electron-electron interactions. After…

We prove rapid mixing of the Prokofiev-Svistunov (or worm) algorithm for the zero-field ferromagnetic Ising model, on all finite graphs and at all temperatures. As a corollary, we show how to rigorously construct simple and efficient…

We investigate in some detail an alternative simulation strategy for lattice field theory based on the so-called worm algorithm introduced by Prokof'ev and Svistunov in 2001. It amounts to stochastically simulating the strong coupling…

We present the ground state extension of the efficient quantum Monte Carlo algorithm for lattice fermions of arXiv:1411.0683. Based on continuous-time expansion of imaginary-time projection operator, the algorithm is free of systematic…

We present a new approach to path integral Monte Carlo (PIMC) simulations based on the worm algorithm, originally developed for lattice models and extended here to continuous-space many-body systems. The scheme allows for efficient…

Recently, Syljuasen and Sandvik proposed a new framework for constructing algorithms of quantum Monte Carlo simulation. While it includes new classes of powerful algorithms, it is not straightforward to find an efficient algorithm for a…

Quantum Monte Carlo algorithms based on a world-line representation such as the worm algorithm and the directed loop algorithm are among the most powerful numerical techniques for the simulation of non-frustrated spin models and of bosonic…