Related papers: New algorithms for finite density QCD
We employ the Complex Langevin method for simulation of complex-valued actions. First, we show how to test for convergence of the method by explicitely computing boundary terms and demonstrate this in a model. Then we investigate the…
Simulating thimble regularization of lattice field theory can be tricky when more than one thimble is to be taken into account. A couple of years ago we proposed a solution for this problem. More recently this solution proved to be…
In this article we consider sampling from log concave distributions in Hamiltonian setting, without assuming that the objective gradient is globally Lipschitz. We propose two algorithms based on monotone polygonal (tamed) Euler schemes, to…
Complex weights appear in Physics which are beyond a straightforward importance sampling treatment, as required in Monte Carlo calculations. This is the well-known sign problem. The complex Langevin approach amounts to effectively construct…
We study three possible ways to circumvent the sign problem in the O(3) nonlinear sigma model in 1+1 dimensions. We compare the results of the worm algorithm to complex Langevin and multiparameter reweighting. Using the worm algorithm, the…
The theoretical treatment of Fermi systems consisting of particles with unequal masses is challenging. Even in one spatial dimension analytic solutions are limited to special configurations and numerical progress with Monte Carlo…
The study of lattice gauge theories with Monte Carlo simulations is hindered by the infamous sign problem that appears under certain circumstances, in particular at non-zero chemical potential. So far, there is no universal method to…
We present the reweighted complex Langevin method, which enlarges the applicability range of the complex Langevin method by reweighting the complex trajectories. In this reweighting procedure both the auxiliary and target ensembles have a…
The nuclear shell model is known to describe the properties of various nuclei extremely well. However, the auxiliary-field quantum Monte Carlo calculations cannot be applied to it with general interactions due to the sign problem. The model…
We present Monte Carlo calculations of the thermodynamics of the (2+1) dimensional Thirring model at finite density. We bypass the sign problem by deforming the domain of integration of the path integral into complex space in such a way as…
Lattice models with complex actions are important for the understanding of matter at finite densities, but not accessible by the standard Monte Carlo techniques due to the sign problem. Here we derive a new approach for avoiding the complex…
The complex Langevin method (CLM) provides a promising way to perform the path integral with a complex action using a stochastic equation for complexified dynamical variables. It is known, however, that the method gives wrong results in…
Langevin diffusion processes and their discretizations are often used for sampling from a target density. The most convenient framework for assessing the quality of such a sampling scheme corresponds to smooth and strongly log-concave…
We present a novel method for drawing samples from Gibbs distributions with densities of the form $\pi(x) \propto \exp(-U(x))$. The method accelerates the unadjusted Langevin algorithm by introducing an inertia term similar to Polyak's…
We consider the heavy-dense limit of QCD at finite fermion density in the canonical formulation and approximate it by a 3-state Potts model. In the strong coupling limit, the model is free of the sign problem. Away from the strong coupling,…
In this paper, we provide non-asymptotic upper bounds on the error of sampling from a target density using three schemes of discretized Langevin diffusions. The first scheme is the Langevin Monte Carlo (LMC) algorithm, the Euler…
One reason for the well known fact that the Complex Langevin (CL) method sometimes fails to converge or converges to the wrong limit has been identified long ago: it is insufficient decay of the probability density either near infinity or…
The complex Langevin method aims at performing path integral with a complex action numerically based on complexification of the original real dynamical variables. One of the poorly understood issues concerns occasional failure in the…
The method of complex Langevin simulations is a tool that can be used to tackle the complex-action problem encountered, for instance, in finite-density lattice quantum chromodynamics or real-time lattice field theories. The method is based…
In recent years there has been much progress on the investigation of the QCD phase diagram with lattice QCD simulations. In this review I focus on the developments in the last two years. Especially the addition of external influences or new…