Related papers: Dual Geometric Worm Algorithm for Two-Dimensional …

A worm algorithm is proposed for the two-dimensional spin glasses. The method is based on a low-temperature expansion of the partition function. The low-temperature configurations of the spin glass on square lattice can be viewed as strings…

We report on the development of two dual worm constructions that lead to cluster algorithms for efficient and ergodic Monte Carlo simulations of frustrated Ising models with arbitrary two-spin interactions that extend up to third-neighbours…

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…

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…

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…

The Prokof'ev Svistunov worm algorithm was originally developed for models with nearest neighbor interactions that in a high temperature expansion are mapped to systems of closed loops. In this work we present the surface worm algorithm…

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 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 show that the two dimensional Ising model is complete, in the sense that the partition function of any lattice model on any graph is equal to the partition function of the 2D Ising model with complex coupling. The latter model has all…

We discuss the implementation of a directed geometrical worm algorithm for the study of quantum link-current models. In this algorithm Monte Carlo updates are made through the biased reptation of a worm through the lattice. A directed…

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 study the dynamic critical behavior of the worm algorithm for the two- and three-dimensional Ising models, by Monte Carlo simulation. The autocorrelation functions exhibit an unusual three-time-scale behavior. As a practical matter, the…

We investigate the extension of the Prokof'ev-Svistunov worm algorithm to Wilson lattice fermions in an external scalar field. We effectively simulate by Monte Carlo the graphs contributing to the hopping expansion of the two-point function…

We give efficient quantum algorithms to estimate the partition function of (i) the six vertex model on a two-dimensional (2D) square lattice, (ii) the Ising model with magnetic fields on a planar graph, (iii) the Potts model on a quasi 2D…

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 goal of this work is to lay the groundwork to construct and characterize a quantum device; which we refer to as a superfluid ring lattice; that could serve as a multi-qubit system in the future. Accordingly, a mathematical framework,…

We review some aspects of the fermionic interpretation of the two-dimensional Ising model. The use is made of the notion of the integral over the anticommuting Grassmann variables. For simple and more complicated 2D Ising lattices, the…

We present the surface worm algorithm (SWA) which is a generalization of the Prokof'ev Svistunov worm algorithm to perform the simulation of the dual representation (surfaces and loops) of Abelian gauge-Higgs models on a lattice. We compare…

In order to develop fast inversion algorithms we have used overlap solvers in two dimensions. Lattice QED theory with U(1) group symmetry in two dimensional space-times dimensions has always been a testing ground for algorithms. By the…

The dual tasks of quantum Hamiltonian learning and quantum Gibbs sampling are relevant to many important problems in physics and chemistry. In the low temperature regime, algorithms for these tasks often suffer from intractabilities, for…