Related papers: Lefschetz thimble-inspired weight regularizations …
The sign problem of relativistic field theories at finite fermion chemical potential has been approached by deforming the domain of integration into complex field space. We present a method for selecting a deformed manifold of integration…
Real time evolution of a scalar field theory is investigated. The severe sign problem is circumvented using the Complex Langevin equation. The naive application of the method breaks down for extended real times due to the appearance of…
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…
We propose a path optimization method (POM) to evade the sign problem in the Monte-Carlo calculations for complex actions. Among many approaches to the sign problem, the Lefschetz-thimble path-integral method and the complex Langevin method…
A final goal for thimble regularization of lattice field theories is the application to lattice QCD and the study of its phase diagram. Gauge theories pose a number of conceptual and algorithmic problems, some of which can be addressed even…
We consider the sign problem for classical spin models at complex $\beta =1/g_0^2$ on $L\times L$ lattices. We show that the tensor renormalization group method allows reliable calculations for larger Im$\beta$ than the reweighting Monte…
Self-interacting scalar quantum field theories possessing $PT$-symmetry are physically admissible since their energy spectrum is real and bounded below. However, models with $PT$-invariant potentials can have complex actions in general and…
The ability to describe strongly interacting matter at finite temperature and baryon density provides the means to determine, for instance, the equation of state of QCD at non-zero baryon chemical potential. From a theoretical point of…
We present a simulation strategy for the real-time dynamics of quantum fields, inspired by reinforcement learning. It builds on the complex Langevin approach, which it amends with system specific prior information, a necessary prerequisite…
As a solution towards the numerical sign problem, we propose a novel Hybrid Monte Carlo algorithm, in which molecular dynamics is performed on a continuum set of integration surfaces foliated by the antiholomorphic gradient flow ("the…
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 Picard-Lefschetz theory offers a promising tool to solve the sign problem in QCD and other field theories with complex path-integral weight. In this paper the Lefschetz-thimble approach is examined in simple fermionic models which share…
This chapter [of a supplement to Prog. Theo. Phys.] reviews numerical simulations of quantum field theories based on stochastic quantization and the Langevin equation. The topics discussed include renormalization of finite step-size…
Monte Carlo methods cannot probe far into the QCD phase diagram with a real chemical potential, due to the famous sign problem. Complex Langevin simulations, using adaptive step-size scaling and gauge cooling, are suited for sampling path…
We present our latest results on the application of the complex Langevin method to one- and two-dimensional QCD. Although the method is stable, it unfortunately converges to an incorrect result when applied as such. After applying…
Langevin Monte Carlo (LMC) is an iterative algorithm used to generate samples from a distribution that is known only up to a normalizing constant. The nonasymptotic dependence of its mixing time on the dimension and target accuracy is…
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 study the Stephanov model, which is an RMT model for QCD at finite density, using the Complex Langevin algorithm. Naive implementation of the algorithm shows convergence towards the phase quenched or quenched theory rather than to…
A method is developed which speeds up averaging in quantum simulations where minus signs cause difficulties. A Langevin equation method in conjunction with a replication algorithm is used enabling one to average over a continuously varying…
Simulations of QCD with a finite chemical potential typically lead to a severe sign problem, prohibiting any standard Monte Carlo approach. Complex Langevin simulations provide an alternative to sample path integrals with oscillating weight…