Related papers: Progress in lattice algorithms
We generalize the Hamiltonian Monte Carlo algorithm with a stack of neural network layers and evaluate its ability to sample from different topologies in a two dimensional lattice gauge theory. We demonstrate that our model is able to…
We present a modification of the Hybrid Monte Carlo algorithm for tackling the critical slowing down of generating Markov chains of lattice gauge configurations towards the continuum limit. We propose a new method to exchange information…
Formulating gauge theories on a lattice offers a genuinely non-perturbative way of studying quantum field theories, and has led to impressive achievements. In particular, it significantly deepened our understanding of quantum…
We discuss a simulation algorithm for dynamical fermions, which combines the multiboson technique with the Hybrid Monte Carlo algorithm. The algorithm turns out to give a substantial gain over standard methods in practical simulations and…
An exact, nonlocal, finite step-size algorithm for Monte Carlo simulation of theories with dynamical fermions is proposed. The algorithm is based on obtaining the new configuration U' from the old one U by solving the equation $ M(U') \eta…
We discuss the impact of various improvements on simulations of dynamical overlap fermions using the Hybrid Monte Carlo algorithm. We focus on the usage of fat links and multiple pseudo-fermion fields.
Models of non-interacting fermions coupled to auxilliary classical degrees of freedom are relevant to the understanding of a wide variety of problems in many body physics, {\it e.g.} the description of manganites, diluted magnetic…
Gauged gaussian Projected Entangled Pair States are particular tensor network constructions that describe lattice states of fermionic matter interacting with dynamical gauge fields. We show how one can efficiently compute, using Monte-Carlo…
A new algorithm for simulation of theories with dynamical fermions is presented. The algorithm is based on obtaining the new configuration U' from the old one U by solving the equation M(U')\eta= \omega M(U)\eta, where M is fermionic…
The development of improved algorithms for QCD on the lattice has enabled us to do calculations at small quark masses and get control over the chiral extrapolation. Also finer lattices have become possible, however, a severe slowing down…
We introduce and compare three different Monte Carlo determinantal algorithms that allow one to compute dynamical quantities, such as the self-energy, of fermionic systems in their thermodynamic limit. We show that the most efficient…
I review recent machine trends and algorithmic developments for dynamical lattice QCD simulations with the HMC algorithm for Wilson-type fermions. The topics include the trend toward multi-core processors and general purpose GPU (GPGPU)…
The reasons for the feasibility of the Microcanonical Fermionic Average ($MFA$) approach to lattice gauge theory with dynamical fermions are discussed. We then present a new exact algorithm, which is free from systematic errors and…
Typical fermion algorithms require the computation (or sampling) of the fermion determinant. We focus instead on cluster algorithms which do not involve the determinant and involve a more physically relevant sampling of the configuration…
Monte Carlo techniques with importance sampling have been extensively applied to lattice gauge theory in the Lagrangian formulation. Unfortunately, it is extremely difficult to compute the excited states using the conventional Monte Carlo…
Three possibilities to speed up the Hybrid Monte Carlo algorithm are investigated. Changing the step-size adaptively brings no practical gain. On the other hand, substantial improvements result from using an approximate Hamiltonian or a…
Cluster algorithms have been recently used to eliminate sign problems that plague Monte-Carlo methods in a variety of systems. In particular such algorithms can also be used to solve sign problems associated with the permutation of fermion…
In a previous paper, we have described a method to perform Fixed-Node Quantum Monte Carlo calculations for lattice fermions. In this paper, we present an extension of this method, by which it is possible to find information on the…
We describe a Fourier Accelerated Hybrid Monte Carlo algorithm suitable for dynamical fermion simulations of non-gauge models. We test the algorithm in supersymmetric quantum mechanics viewed as a one-dimensional Euclidean lattice field…
We present the ground state extension of the efficient quantum Monte Carlo algorithm for lattice fermions of arXiv:1411.0683. Based on continuous-time expansion of imaginary-time projection operator, the algorithm is free of systematic…