Related papers: Numerical methods for the sign problem in Lattice …
Our knowledge about the QCD phase diagram at finite baryon chemical potential $\mu_{B}$ is limited by the well known sign problem. The path integral measure, in the standard determinantal approach, becomes complex at finite $\mu_{B}$ so…
Aiming at evading the notorious sign problem in classical Monte-Carlo approaches to lattice quantum chromodynamics, we present an approach for quantum computing finite-temperature lattice gauge theories at non-zero density. Based on the…
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 is the fundamental limitation to quantum Monte Carlo simulations of the statistical mechanics of interacting fermions. Determinant quantum Monte Carlo (DQMC) is one of the leading methods to study lattice models such as the…
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…
The sign problem of QCD prevents standard lattice simulations to determine the phase diagram of strong interactions with a finite chemical potential directly. Complex Langevin simulations provide an alternative method to sample path…
During the last 40 years, Monte Carlo calculations based upon Importance Sampling have matured into the most widely employed method for determinig first principle results in QCD. Nevertheless, Importance Sampling leads to spectacular…
Although Monte Carlo calculations using Importance Sampling have matured into the most widely employed method for determining first principle results in QCD, they spectacularly fail for theories with a sign problem or for which certain rare…
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…
I review the presence of the sign problem in lattice QCD at nonzero baryon density and its relation with the overlap and Silver Blaze problems. I then discuss progress in some cases where the sign problem can be handled, either because the…
A $\theta$ term in lattice field theory causes the sign problem in Monte Carlo simulations. This problem can be circumvented by Fourier-transforming the topological charge distribution $P(Q)$. This strategy, however, has a limitation,…
The complex Langevin (CL) method shows significant potential in addressing the numerical sign problem. Nonetheless, it often produces incorrect results when used without any stabilization techniques. Leveraging insights from previous…
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…
Peripheral heavy-ion collisions are expected to exhibit magnetic fields with magnitudes comparable to the QCD scale, as well as non-zero baryon densities. Whereas QCD at finite magnetic fields can be simulated directly with standard lattice…
We argue the sign problem of the fermion determinant at finite density. It is unavoidable not only in Monte-Carlo simulations on the lattice but in the mean-field approximation as well. A simple model deriving from Quantum Chromodynamics…
Gauge theories are of paramount importance in our understanding of fundamental constituents of matter and their interactions. However, the complete characterization of their phase diagrams and the full understanding of non-perturbative…
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…
We develop a first-principle generalised density of state method for studying numerically quantum field theories with a complex action. As a proof of concept, we show that with our approach we can solve numerically the strong sign problem…
The canonical approach, which was developed for solving the sign problem, may suffer from a new type of sign problem. In the canonical approach, the grand partition function is written as a fugacity expansion: $Z_G(\mu,T) = \sum_n Z_C(n,T)…
Many research programs aiming to deal with the sign problem were proposed since the advent of lattice field theory. Several of these try to achieve this by exploiting properties of analytic functions. This is also the case for our study.…