Related papers: An Algorithm for Gluinos on the Lattice
An overview is given over the recently developed and now widely used Monte Carlo algorithms with reduced or eliminated critical slowing down. The basic techniques are overrelaxation, cluster algorithms and multigrid methods. With these…
We discuss the lattice formulation of gauge theories with fermions in arbitrary representations of the color group, and present the implementation of the RHMC algorithm for simulating dynamical Wilson fermions. A first dataset is presented…
We present an exact Monte Carlo algorithm designed to sample theories where the energy is a sum of many couplings of decreasing strength. The algorithm avoids the computation of almost all non-leading terms. Its use is illustrated by…
We report on simulations with two flavors of O(a) improved degenerate Wilson fermions with Schroedinger functional boundary conditions. The algorithm which is used is Hybrid Monte Carlo with two pseudo-fermion fields as proposed by M.…
This is the write-up of three lectures on algorithms for dynamical fermions that were given at the ILFTN workshop 'Perspectives in Lattice QCD' in Nara during November 2005. The first lecture is on the fundamentals of Markov Chain Monte…
We present a method that optimizes the aspect ratio of a spatially anisotropic quantum lattice model during the quantum Monte Carlo simulation, and realizes the virtually isotropic lattice automatically. The anisotropy is removed by using…
Generalized rules for building and flipping clusters in the quantum Monte Carlo loop algorithm are presented for the XXZ-model in a uniform magnetic field along the Z-axis. As is demonstrated for the Heisenberg antiferromagnet it is…
The Robbins-Monro algorithm is a recursive, simulation-based stochastic procedure to approximate the zeros of a function that can be written as an expectation. It is known that under some technical assumptions, Gaussian limit distributions…
Self-learning Monte Carlo method [arXiv:1610.03137, 1611.09364] is a powerful general-purpose numerical method recently introduced to simulate many-body systems. In this work, we implement this method in the framework of determinantal…
In this work we introduce a worldline based fermion Monte Carlo algorithm for studying few body quantum mechanics of self-interacting fermions in the Hamiltonian lattice formulation. Our motivation to construct the method comes from our…
The increase with time of computer resources devoted to simulations of full QCD is spectacular. Yet the reduction of systematic errors is comparatively slow. This is due to the algorithmic complexity of the problem. I review, in elementary…
In this paper, a new progressive mesh algorithm is introduced in order to perform fast physical simulations by the use of a lattice Boltzmann method (LBM) on a single-node multi-GPU architecture. This algorithm is able to mesh automatically…
We perform Monte Carlo investigations of the 4d ${\cal N}=1$ supersymmetric Yang-Mills (SYM) theory on the lattice with dynamical gluinos in the adjoint representation of the SU(2) gauge group. Our aim is to determine the mass spectrum of…
Recent progress in the development of quantum technologies has enabled the direct investigation of dynamics of increasingly complex quantum many-body systems. This motivates the study of the complexity of classical algorithms for this…
We introduce novel algorithms for the quantum simulation of molecular systems which are asymptotically more efficient than those based on the Trotter-Suzuki decomposition. We present the first application of a recently developed technique…
We study a large N_{c} limit of a two-dimensional Yang-Mills theory coupled to bosons and fermions in the fundamental representation. Extending an approach due to Rajeev we show that the limiting theory can be described as a classical…
We introduce Majorana Propagation, an algorithmic framework for the classical simulation of Fermionic circuits. Inspired by Pauli Propagation, Majorana Propagation operates by applying successive truncations throughout the Heisenberg…
Ab-initio studies of strongly interacting bosonic and fermionic systems is greatly facilitated by efficient Monte Carlo algorithms. This article emphasizes this requirement, and outlines the ideas behind the construction of the cluster…
The development of Monte Carlo algorithms for generating gauge field configurations with dynamical fermions and methods for extracting the most information from ensembles are summarised.
We present a bosonization procedure which replaces fermions with generalized spin variables subject to local constraints. It requires that the number of Majorana modes per lattice site matches the coordination number modulo two. If this…