Related papers: Worm algorithm for the O(2N) Gross-Neveu model
We show that high-temperature expansions may serve as a basis for the novel approach to efficient Monte Carlo simulations. "Worm" algorithms utilize the idea of updating closed path configurations (produced by high-temperature expansions)…
We review our results for the simulation of the 2--d lattice Gross--Neveu model in a fermion loop representation. Possible extensions of our techniques to other models and higher dimensions are discussed, as well as the limitations of…
State-of-the-art algorithms for simulating fermions coupled to gauge fields often rely on integrating fermion degrees of freedom. While successful in simulating QCD at zero chemical potential, at finite density these approaches are hindered…
We study the O(3) sigma model in $D=2$ on the lattice with a Boltzmann weight linearized in $\beta$ on each link. While the spin formulation now suffers from a sign-problem the equivalent loop model remains positive and becomes particularly…
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 present a family of graphical representations for the O($N$) spin model, where $N \ge 1$ represents the spin dimension, and $N=1,2,3$ corresponds to the Ising, XY and Heisenberg models, respectively. With an integer parameter $0 \le \ell…
We continue the investigation on the applications of the Kramers equation to the numerical simulation of field theoretic models. In a previous paper we have described the theory and proposed various algorithms. Here, we compare the simplest…
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 study the large-$N$ limit of adjoint fermion one-matrix models. We find one-cut solutions of the loop equations for the correlators of these models and show that they exhibit third order phase transitions associated with $m$-th order…
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…
We propose a method to improve lattice operators composed of Wilson fermions which allows the removal of all corrections of $O(a)$, including those proportional to the quark mass. It requires off-shell improvement of quark fields and…
We perform Monte-Carlo measurements of two and three point functions of charged operators in the critical O(2) model in 3 dimensions. Our results are compatible with the predictions of the large charge superfluid effective field theory. To…
We investigate the two dimensional lattice Gross--Neveu model in large flavor number limit using the domain-wall fermion formulation, as a toy model of lattice QCD. We study nonperturbative behaviorn of the restoration of chiral symmetry of…
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 Weingarten lattice gauge model of Nambu-Goto strings is generalised to allow for fluctuations of an intrinsic worldsheet metric through a dynamical quadrilation. The continuum limit is taken for $c\leq1$ matter, reproducing the results…
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…
Two cluster algorithms, based on constructing and flipping loops, are presented for worldline quantum Monte Carlo simulations of fermions and are tested on the one-dimensional repulsive Hubbard model. We call these algorithms the loop-flip…
In the fermion loop formulation the contributions to the partition function naturally separate into topological equivalence classes with a definite sign. This separation forms the basis for an efficient fermion simulation algorithm using a…
We show that coarse graining arguments invented for the analysis of multi-spin systems on a randomly triangulated surface apply also to the O(n) model on a random lattice. These arguments imply that if the model has a critical point with…
Simulating strongly correlated fermionic systems is notoriously hard on classical computers. An alternative approach, as proposed by Feynman, is to use a quantum computer. Here, we discuss quantum simulation of strongly correlated fermionic…