Related papers: Accelerating Dynamical Fermion Computations using …
We present a massively parallel quantum Monte Carlo based implementation of real-space dynamical mean-field theory for general inhomogeneous correlated fermionic lattice systems. As a first application, we study magnetic order in a binary…
The Wilson fermion determinant can be written as product of the determinants of two hermitian positive definite matrices. This formulation allows to simulate non-degenerate quark flavors by means of the hybrid Monte Carlo algorithm. A major…
We show how the integrators used for the molecular dynamics step of the Hybrid Monte Carlo algorithm can be further improved. These integrators not only approximately conserve some Hamiltonian $H$ but conserve exactly a nearby shadow…
We present an algorithmic study for the simulation of two massless flavors of O(a) improved Wilson quarks with Schroedinger functional boundary conditions. The algorithm used is Hybrid Monte Carlo with two pseudo-fermion fields as proposed…
Quantum field theories underlie all of our understanding of the fundamental forces of nature. The are relatively few first principles approaches to the study of quantum field theories [such as quantum chromodynamics (QCD) relevant to the…
We develop an extended framework for the hybrid Monte Carlo (HMC) algorithm in lattice gauge theory by embedding the $SU(N)$ group into the space of general complex matrices,$M_N(\mathbb{C})$. Auxiliary directions will be completely…
Tempering is used to change the quark mass while remaining in equilibrium between the trajectories of a standard hybrid Monte Carlo simulation of four flavours of staggered fermions. The algorithm is faster for small enough quark masses,…
Ab initio quantum Monte Carlo (QMC) is a stochastic approach for solving the many-body Schr\"odinger equation without resorting to one-body approximations. QMC algorithms are readily parallelizable via ensembles of $N_w$ walkers, making…
We present an update of BQCD, our Hybrid Monte Carlo program for simulating lattice QCD. BQCD is one of the main production codes of the QCDSF collaboration and is used by CSSM and in some Japanese finite temperature and finite density…
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 absence of negative sign problem in quantum Monte Carlo simulations of spin and fermion systems has different origins. World-line based algorithms for spins require positivity of matrix elements whereas auxiliary field approaches for…
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…
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…
The numerical sign problem remains one of the central challenges in computational physics. The Worldvolume Hybrid Monte Carlo (WV-HMC) method has recently been proposed as a reliable and computationally efficient algorithm that crucially…
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…
We investigate L\"uscher's method of including dynamical Wilson fermions in a lattice simulation of QCD with two quark flavours. We measure the accuracy of the approximation by comparing it with Hybrid Monte Carlo results for gauge…
For big data analysis, high computational cost for Bayesian methods often limits their applications in practice. In recent years, there have been many attempts to improve computational efficiency of Bayesian inference. Here we propose an…
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…
Variational inference lies at the core of many state-of-the-art algorithms. To improve the approximation of the posterior beyond parametric families, it was proposed to include MCMC steps into the variational lower bound. In this work we…
The recent development of logical quantum processors marks a pivotal transition from the noisy intermediate-scale quantum (NISQ) era to the fault-tolerant quantum computing (FTQC) era. These devices have the potential to address classically…