相关论文: Complex Langevin dynamics: criteria for correctnes…
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…
Lattice QCD at finite chemical potential is difficult due to the sign problem. We use stochastic quantization and complex Langevin dynamics to study this issue. First results for QCD in the hopping expansion are encouraging. U(1) and SU(3)…
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…
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…
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 (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…
Using complex Langevin method we probe the possibility of dynamical supersymmetry breaking in supersymmetric quantum mechanics models with complex actions. The models we consider are invariant under the combined operation of parity and time…
The Complex Langevin (CL) method to simulate `complex probabilities', ideally produces expectation values for the observables that converge to a limit equal to the expectation values obtained with the original complex `probability' measure.…
At nonzero chemical potential the numerical sign problem in lattice field theory limits the use of standard algorithms based on importance sampling. Complex Langevin dynamics provides a possible solution, but it has to be applied with care.…
We analyze to what extent the complex Langevin method, which is in principle capable of solving the so-called sign problems, can be considered as reliable. We give a formal derivation of the correctness and then point out various…
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…
Complex Langevin (CL) is a computational method to circumvent the numerical sign problem with applications in finite-density quantum chromodynamics and the real-time dynamics of quantum field theories. It has long been known that, depending…
In the landscape of approaches toward the simulation of Lattice Models with complex action the Complex Langevin (CL) appears as a straightforward method with a simple, well defined setup. Its applicability, however, is controlled by certain…
Lattice simulations of non-zero density QCD introduce the so-called sign problem (complex or negative probabilities), which invalidates importance sampling methods. To circumvent this, we use the Complex Langevin Equation (CLE), to measure…
The complex Langevin method is a promising approach to the complex-action problem based on a fictitious time evolution of complexified dynamical variables under the influence of a Gaussian noise. Although it is known to have a restricted…
We demonstrate analytically that complex Langevin dynamics can solve the sign problem in one-dimensional QCD in the thermodynamic limit. In particular, it is shown that the contributions from the complex and highly oscillating spectral…
There are problems in physics and particularly in field theory which are defined by complex valued weight functions $e^{-S}$ where $S$ is a polynomial action $S: R^n \rightarrow C $. The conditions under which a convergent complex Langevin…
In this paper we test the complex Langevin algorithm for numerical simulations of a random matrix model of QCD with a first order phase transition to a phase of finite baryon density. We observe that a naive implementation of the algorithm…
Recent progress of the complex Langevin method and the Lefschetz thimble in connection with the sign problem is reviewed. These methods rely on the complexification of the original field manifold and they allow direct simulations of…
Monte Carlo simulation of gauge theories with a $\theta$ term is known to be extremely difficult due to the sign problem. Recently there has been major progress in solving this problem based on the idea of complexifying dynamical variables.…