Related papers: Testing a Fourier Accelerated Hybrid Monte Carlo A…
Efficient continuous time quantum Monte Carlo (CT-QMC) algorithms that do not suffer from time discretization errors have become the state-of-the-art for most discrete quantum models. They have not been widely used yet for fermionic quantum…
Critical slowing down presents a critical obstacle to lattice QCD calculation at the smaller lattice spacings made possible by Exascale computers. Inspired by the concept of Fourier acceleration, we study a version of the Riemannian…
We introduce methodologies for highly scalable quantum Monte Carlo simulations of electron-phonon models, and report benchmark results for the Holstein model on the square lattice. The determinant quantum Monte Carlo (DQMC) method is a…
The standard hybrid Monte Carlo algorithm is known to simulate even flavors QCD only. Simulations of odd flavors QCD, however, can be also performed in the framework of the hybrid Monte Carlo algorithm where the inverse of the fermion…
Strongly correlated fermionic systems are of great interest in condensed matter physics and numerical methods are indispensable tools for their study. However, existing approaches such as exact diagonalization (ED) and stochastic quantum…
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…
We present first, exploratory results of a hybrid Monte-Carlo algorithm for dynamical, n_f=2, four-dimensional QCD with overlap fermions. As expected, the computational requirements are typically two orders of magnitude larger for the…
The advantages of using Multi-Step corrections for simulations of lattice gauge theories with dynamical fermions will be discussed. This technique is suited for algorithms based on the Multi-Boson representation of the dynamical fermions as…
We discuss algorithms for domain wall fermions focussing on accelerating Hybrid Monte Carlo sampling of gauge configurations. Firstly a new multigrid algorithm for domain wall solvers and secondly a domain decomposed hybrid monte carlo…
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 give some new performance results for the Hybrid Monte Carlo (HMC) simulation of dynamical clover-improved Wilson fermions using an improved pseudo-fermion action. The generalisation of even-odd preconditioning for the standard Wilson…
We give a detailed description of the so-called Polynomial Hybrid Monte Carlo (PHMC) algorithm. The effects of the correction factor, which is introduced to render the algorithm exact, are discussed, stressing their relevance for the…
The basic idea of fast Monte Carlo (MC) simulations is to perform particle-based MC simulations with the excluded-volume interactions modeled by "soft" repulsive potentials that allow particle overlapping. This gives much faster system…
We investigate the performance of the hybrid Monte Carlo algorithm in updating non-trivial global topological structures. We find that the hybrid Monte Carlo algorithm has serious problems decorrelating the global topological charge. This…
In this paper we propose new algorithm to reduce autocorrelation in Markov chain Monte-Carlo algorithms for euclidean field theories on the lattice. Our proposing algorithm is the Hybrid Monte-Carlo algorithm (HMC) with restricted Boltzmann…
The performance of the Hybrid Monte Carlo algorithm is determined by the speed of sparse matrix-vector multiplication within the context of preconditioned conjugate gradient iteration. We study these operations as implemented for the…
Monte Carlo (MC) simulations of lattice models are a widely used way to compute thermodynamic properties of substitutional alloys. A limitation to their more widespread use is the difficulty of driving a MC simulation in order to obtain the…
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…
Building on recent solutions of the fermion sign problem for specific models we present two continuous-time quantum Monte Carlo methods for efficient simulation of mass-imbalanced Hubbard models on bipartite lattices at half-filling. For…
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…