Related papers: Worm Algorithm for CP(N-1) Model
We propose a highly efficient "worm" like cluster Monte Carlo algorithm for the quantum rotor model in the link-current representation. We explicitly prove detailed balance for the new algorithm even in the presence of disorder. For the…
We investigate the critical behavior of three-dimensional ferromagnetic CP(N-1) models, which are characterized by a global U(N) and a local U(1) symmetry. We perform numerical simulations of a lattice model for N=2, 3, and 4. For N=2 we…
We perform hybrid Monte-Carlo simulation of $N_f=2+1+1 $ lattice QCD with domain-wall quarks at the physical point. The simulation is carried out on the $ L^3 \times T = 64^3 \times 64 $ lattice with lattice spacing $a \sim 0.064 $ fm ($ L…
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…
Polynomial approximations to the inverse of the fermion matrix are used to filter the dynamics of the upper energy scales in HMC simulations. The use of a multiple time-scale integration scheme allows the filtered pseudofermions to be…
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…
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 discuss hybrid Monte Carlo algorithms for odd-flavor lattice QCD simulations. The algorithms include a polynomial approximation which enables us to simulate odd-flavor QCD in the framework of the hybrid Monte Carlo algorithm. In order to…
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…
Simulating lattice QCD with chiral fermions and indeed using Domain Wall Fermions continues to be challenging project however large are concurrent computers. One obvious bottleneck is the slow pace of prototyping using the low level coding…
We present a new class of algorithms for performing valence-bond quantum Monte Carlo of quantum spin models. Valence-bond quantum Monte Carlo is a T=0 Monte Carlo method based on sampling of a set of operator-strings that can be viewed as…
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 propose a method of simulating efficiently many-body interacting fermion lattice models in trapped ions, including highly nonlinear interactions in arbitrary spatial dimensions and for arbitrarily distant couplings. We map products of…
In the strong coupling limit, $n$-point functions in lattice QCD with staggered fermions can be rewritten exactly as sums over constrained configurations of monomers, dimers, and baryon loops covering the spacetime lattice. Worm algorithms…
We present a Markov-chain Monte Carlo algorithm of worm type that correctly simulates the fully-packed loop model on the honeycomb lattice, and we prove that it is ergodic and has uniform stationary distribution. The fully-packed loop model…
We develop cluster algorithms for a broad class of loop models on two-dimensional lattices, including several standard O(n) loop models at n \ge 1. We show that our algorithm has little or no critical slowing-down when 1 \le n \le 2. We use…
An algorithm to simulate full QCD with 3 colours at nonzero chemical potential on the lattice is proposed. The algorithm works for small values of the chemical potential and can be used to extract expectation values of CPT invariant…
We perform Monte Carlo simulations of the CP$^{N-1}$ model on the square lattice for $N=10$, $21$, and $41$. Our focus is on the severe slowing down related to instantons. To fight this problem we employ open boundary conditions as proposed…
Through natural evolution, nervous systems of organisms formed near-optimal structures to express behavior. Here, we propose an effective way to create control agents, by \textit{re-purposing} the function of biological neural circuit…
This review gives an overview on the research of algorithms for dynamical fermions used in large scale lattice QCD simulations. First a short overview on the state-of-the-art of ensemble generation at the physical point is given. Followed…