Related papers: A Worm Algorithm for the Lattice CP(N-1) Model
An efficient algorithm is presented to simulate the O(N) loop model on the square lattice for arbitrary values of $N>0$. The scheme combines the worm algorithm with a new data structure to resolve both the problem of loop crossings and the…
As a characteristic property of all quantum systems, entanglement participates in many important quantum phenomena. In this proceeding, we employ it in the study of quantum field theories at finite density. We incorporate evaluations of…
We present and compare new types of algorithms for lattice QCD with staggered fermions in the limit of infinite gauge coupling. These algorithms are formulated on a discrete spatial lattice but with continuous Euclidean time. They make use…
Two-dimensional CP**(N-1) models are used to compare the behavior of different cooling techniques on the lattice. Cooling is one of the most frequently used tools to study on the lattice the topological properties of the vacuum of a field…
We simulate $N_f=2+1$ QCD at the physical point combining open and periodic boundary conditions in a parallel tempering framework, following the original proposal by M. Hasenbusch for $2d$ $\mathrm{CP}^{N-1}$ models, which has been recently…
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…
We propose a cold atom implementation to attain the continuum limit of (1+1)-d CP(N-1) quantum field theories. These theories share important features with (3+1)-d QCD, such as asymptotic freedom and $\theta$ vacua. Moreover, their…
Lattice regularization of chiral fermions is an important development of the theory of elementary particles. Nontheless, brute force computer simulations are very expensive, if not prohibitive. In this letter I exploit the non-interacting…
Lattice QCD in the strong coupling regime can be formulated in dual variables which are integer-valued. It can be efficiently simulated for modest finite temperatures and finite densities via the worm algorithm, circumventing the finite…
We propose a flux representation based lattice formulation of the partition function corresponding to the SU(2) principal chiral Lagrangian, including a chemical potential and scalar/pseudo-scalar source terms. Lattice simulations are then…
We investigate the $\theta$-dependence of 2-dimensional $CP^{N-1}$ models in the large-$N$ limit by lattice simulations. Thanks to a recent algorithm proposed by M. Hasenbusch to improve the critical slowing down of topological modes,…
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 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…
We present a method of simulating lattice QCD at nonzero chemical potential in the chiral limit. By adding a weak four-fermi interaction to the standard staggered fermion SU(3) QCD action, we produce an algorithm in which the limit of…
It has been a big challenge for lattice QCD to simulate dynamical quarks near the chiral limit. Theoretically, it is well-known that the naive chiral symmetry cannot be realized on the lattice (the Nielsen-Ninomiya theorem). Also…
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…
The prospect of quantum simulating lattice gauge theories opens exciting possibilities for understanding fundamental forms of matter. Here, we show that trapped ions represent a promising platform in this context when simultaneously…
We propose and test an algorithm to simulate a lattice system of interacting fermions in two spatial dimensions. The approach is an extension of the entanglement renormalization technique [Phys. Rev. Lett. 99, 220405 (2007)] and the related…
We present a polynomial hybrid Monte Carlo (PHMC) algorithm for lattice QCD with odd numbers of flavors of O(a)-improved Wilson quark action. The algorithm makes use of the non-Hermitian Chebyshev polynomial to approximate the inverse…
QCD at non-zero chemical potential ($\mu$) for quark number has a complex fermion determinant and thus standard simulation methods for lattice QCD cannot be applied. We therefore simulate this theory using the Complex-Langevin algorithm…