Related papers: A Finite Baryon Density Algorithm
The past few years have seen considerable progress in algorithmic development for the generation of gauge fields including the effects of dynamical fermions. The Rational Hybrid Monte Carlo (RHMC) algorithm, where Hybrid Monte Carlo is…
In this work, we examine sampling problems with non-smooth potentials. We propose a novel Markov chain Monte Carlo algorithm for sampling from non-smooth potentials. We provide a non-asymptotical analysis of our algorithm and establish a…
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…
We introduce a quantum Monte Carlo method at finite temperature for interacting fermionic models in the canonical ensemble, where the conservation of the particle number is enforced. Although general thermodynamic arguments ensure the…
In the context of Monte Carlo sampling for lattice models, the complexity of the energy landscape often leads to Markov chains being trapped in local optima, thereby increasing the correlation between samples and reducing sampling…
Due to the complexity of order statistics, the finite sample behaviour of robust statistics is generally not analytically solvable. While the Monte Carlo method can provide approximate solutions, its convergence rate is typically very slow,…
An implicit purification scheme is proposed for calculation of the temperature-dependent, grand canonical single-particle density matrix, given as a Fermi operator expansion in terms of the Hamiltonian. The computational complexity is shown…
We propose a general purpose Bayesian inference algorithm for expensive likelihoods, replacing the stochastic term in the Langevin equation with a deterministic density gradient term. The particle density is evaluated from the current…
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…
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…
We propose various improvements of finite step-size updating for full QCD on the lattice that might turn finite step-size updating into a viable alternative to the hybrid Monte Carlo algorithm. These improvements are noise reduction of the…
Correlated fermions are of high interest in condensed matter (Fermi liquids, Wigner molecules), cold atomic gases and dense plasmas. Here we propose a novel approach to path integral Monte Carlo (PIMC) simulations of strongly degenerate…
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…
We present a variational density matrix approach to the thermal properties of interacting fermions in the continuum. The variational density matrix is parametrized by a permutation equivariant many-body unitary transformation together with…
Imaginary baryon number chemical potential simulations are a popular workaround for the (in)famous sign problem plaguing finite density QCD studies on the lattice. One is necessarily left with the problem of analytically continuing results…
Exponential observables, formulated as $\log \langle e^{\hat{X}}\rangle$ where $\hat{X}$ is an extensive quantity, play a critical role in study of quantum many-body systems, examples of which include the free-energy and entanglement…
We present two new suggestions for density of states (DoS) approaches to finite density lattice QCD. Both proposals are based on the recently developed and successfully tested DoS FFA technique, which is a DoS approach for bosonic systems…
We consider the problem of performing Bayesian inference for logistic regression using appropriate extensions of the ensemble Kalman filter. Two interacting particle systems are proposed that sample from an approximate posterior and prove…
A purification algorithm for expanding the single-particle density matrix in terms of the Hamiltonian operator is proposed. The scheme works with a predefined occupation and requires less than half the number of matrix-matrix…
This paper presents a method for alleviating sign problems in lattice path integrals, including those associated with finite fermion density in relativistic systems. The method makes use of information gained from some systematic expansion…