Related papers: Progress in lattice algorithms
I describe a method that places the fermion fields and the gauge fields on different lattice spacings during the Hybrid Monte Carlo generation of Ginsparg-Wilson dynamical ensembles. The idea is motivated by Wilson's formulation of the…
We investigate the performance of the hybrid Monte Carlo algorithm, the standard algorithm used for lattice QCD simulations involving fermions, in updating non-trivial global topological structures. We find that the hybrid Monte Carlo…
Reverse Monte Carlo (RMC) is an algorithm that incorporates stochastic modification of the action as part of the process that updates the fields in a Monte Carlo simulation. Such update moves have the potential of lowering or eliminating…
We explore a self-learning Markov chain Monte Carlo method based on the Adversarial Non-linear Independent Components Estimation Monte Carlo, which utilizes generative models and artificial neural networks. We apply this method to the…
We present a simulation algorithm for Hamiltonian fermion lattice models. A guiding trial wave function is adaptively optimized during Monte Carlo evolution. We apply the method to the two dimensional Gross-Neveu model and analyze systematc…
The effect of different move sets on the folding kinetics of the Monte Carlo simulations is analysed based on the conformation-network and the temperature-dependent folding kinetics. A new scheme of implementing Metropolis algorithm is…
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…
Monte Carlo is a versatile and frequently used tool in statistical physics and beyond. Correspondingly, the number of algorithms and variants reported in the literature is vast, and an overview is not easy to achieve. In this pedagogical…
We present a set of related Hybrid Monte Carlo methods to simulate an arbitrary number of dynamical overlap fermions. Each fermion is represented by a chiral pseudo-fermion field. The new algorithm reduces critical slowing down in the…
Monte Carlo algorithms are a foundational pillar of modern computational science, yet their effective application hinges on a deep understanding of their performance trade offs. This paper presents a critical analysis of the evolution of…
We discuss the inclusion of fermionic loops contributions in Numerical Stochastic Perturbation Theory for Lattice Gauge Theories. We show how the algorithm implementation is in principle straightforward and report on the status of the…
On the lattice some of the salient features of pure gauge theories and of gauge theories with fermions in complex representations of the gauge group seem to be lost. These features can be recovered by considering part of the theory in the…
This thesis is focused on the implementation and the application of a novel kind of algorithm which is expected to overcome the limitations of older schemes. This new algorithm is named Multiboson Method. It allows to simulate an arbitrary…
Three topics concerning fermion simulation algorithms are discussed: 1.) A performance comparison of the multiboson technique to simulate dynamical fermions and the Kramers equation algorithm, 2.) the question of reversibility in the Hybrid…
L\"uscher's local bosonic algorithm for Monte Carlo simulations of quantum field theories with fermions is applied to the simulation of a possibly supersymmetric Yang-Mills theory with a Majorana fermion in the adjoint representation.…
We consider Monte Carlo algorithms for the simulation of charged lattice gases with purely local dynamics. We study the mobility of particles as a function of temperature and show that the poor mobility of particles at low temperatures is…
We propose three novel gerrymandering algorithms which incorporate the spatial distribution of voters with the aim of constructing gerrymandered, equal-population, connected districts. Moreover, we develop lattice models of voter…
Quantum computing is a promising way to systematically solve the longstanding computational problem, the ground state of a many-body fermion system. Many efforts have been made to realise certain forms of quantum advantage in this problem,…
We propose a modification of the Hybrid-Monte-Carlo algorithm that allows for a larger step-size of the integration scheme at constant acceptance rate. The key ingredient is that the pseudo-fermion action is split into two parts. We test…
I present the recent developments in a specific sub-field of chiral gauge theories on the lattice. This sub-field pertains to the use of infinitely many fermi fields to describe a single chiral field. In this approach, both anomalous and…