相关论文: New algorithms for finite density QCD
One strategy for reducing the sign problem in finite-density field theories is to deform the path integral contour from real to complex fields. If the deformed manifold is the appropriate combination of Lefschetz thimbles -- or somewhat…
The QCD at finite density is not well understood yet, where standard Monte Carlo simulation suffers from the sign problem. In order to overcome the sign problem, the method of Lefschetz thimble has been explored. Basically, the original…
Some recent developments to handle the numerical sign problem in QCD and related theories at nonzero density are reviewed. In this contribution I focus on changing the integration order to soften the severity of the sign problem, the…
It is sometimes speculated that the sign problem that afflicts many quantum field theories might be reduced or even eliminated by choosing an alternative domain of integration within a complexified extension of the path integral (in the…
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…
At finite density, lattice simulations are hindered by the well-known sign problem: for finite chemical potentials, the QCD action becomes complex and the Boltzmann weight $e^{-S}$ cannot be interpreted as a probability distribution to…
The great majority of algorithms employed in the study of lattice field theory are based on Monte Carlo's importance sampling method, i.e. on probability interpretation of the Boltzmann weight. Unfortunately in many theories of interest one…
We study the heavy-dense limit of QCD on the lattice with heavy quarks at high density. The effective three dimensional theory has a sign problem which is alleviated by sign optimization where the path integration domain is deformed in…
We study the sign problem in the Hubbard model on the hexagonal lattice away from half-filling using the Lefschetz thimbles method. We identify the saddle points, reduce their amount, and perform quantum Monte Carlo (QMC) simulations using…
The complex Langevin method and the generalized Lefschetz-thimble method are two closely related approaches to the sign problem, which are both based on complexification of the original dynamical variables. The former can be viewed as a…
The complex Langevin method is one hopeful candidate to tackle the sign problem. This method is applicable not only to QCD but also to nonrelativistic field theory, such as condensed matter physics. We present the simulation results of a…
The numerical sign problem is a major obstacle to the quantitative understanding of many important physical systems with first-principles calculations. Typical examples for such systems include finite-density QCD, strongly-correlated…
Recently there has been remarkable progress in solving the sign problem, which occurs in investigating statistical systems with a complex weight. The two promising methods, the complex Langevin method and the Lefschetz thimble method, share…
Progress in the application of the complex Langevin method to full QCD at non-zero chemical potential is reported. The method evades the sign problem which makes naive simulations at nonzero density impossible. The procedure 'gauge cooling'…
The sign problem obstructs the determination of the QCD phase diagram in the temperature-baryon chemical potential plane using lattice QCD. We review the sign problem in QCD and related field theories, including applications to real-time…
In these proceedings, we summarize the Lefschetz thimble approach to the sign problem of Quantum Field Theories. In particular, we review its motivations, and we summarize the results of the application of two different algorithms to two…
The sign problem appears in lattice QCD as soon as a non-zero chemical potential is introduced. This prevents direct simulations to determine the phase structure of the strongly interacting matter. Complex Langevin methods have been…
Non-perturbative lattice QCD calculations at non vanishing baryon number density are hampered by the QCD sign problem. The path integral, that in lattice QCD is calculated numerically, becomes highly oscillating. One possible solution is…
Simulations of full QCD at nonzero baryon density using light quark masses are presented. The sign problem is evaded by the usage of the complex Langevin equation. The simulations are stabilized by the gauge cooling procedure for small…
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…