Related papers: Designing weight regularizations based on Lefschet…
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…
We show that complex Langevin simulation converges to a wrong result, by relating it to the Lefschetz-thimble path integral, when the path-integral weight has different phases among dominant complex saddle points. Equilibrium solution of…
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…
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…
Lefschetz thimbles and complex Langevin dynamics both provide a means to tackle the numerical sign problem prevalent in theories with a complex weight in the partition function, e.g. due to nonzero chemical potential. Here we collect some…
The complex Langevin (CL) method is a promising approach to overcome the sign problem, which emerges in real-time formulations of quantum field theories. Over the past decade, stabilization techniques for CL have been developed with…
The complex Langevin (CL) method is a promising approach to overcome the sign problem that occurs in real-time formulations of quantum field theories. Using the Schwinger-Keldysh formalism, we study SU($N_c$) gauge theories with CL. We…
One of the main challenges in simulations on Lefschetz thimbles is the computation of the relative weights of contributing thimbles. In this paper we propose a solution to that problem by means of computing those weights using a reweighting…
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…
We develop a way of improving complex Langevin dynamics motivated by the Lefschetz-thimble decomposition of integrals. In our method, arbitrary observables of an original model with multiple Lefschetz thimbles are computed by a modified…
We study the utility of a complex Langevin (CL) equation as an alternative for the Monte Carlo (MC) procedure in the evaluation of expectation values occurring in fermionic many-body problems. We find that a CL approach is natural in cases…
Thimble regularization as a solution to the sign problem has been successfully put at work for a few toy models. Given the non trivial nature of the method (also from the algorithmic point of view) it is compelling to provide evidence that…
Recently the complex Langevin method (CLM) has been attracting attention as a solution to the sign problem, which occurs in Monte Carlo calculations when the effective Boltzmann weight is not real positive. An undesirable feature of the…
The complex Langevin (CL) method is a classical numerical strategy to alleviate the numerical sign problem in the computation of lattice field theories. Mathematically, it is a simple numerical tool to compute a wide class of…
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…
Monte Carlo simulations are useful tools for modeling quantum systems, but in some cases they suffer from a sign problem, leading to an exponential slow down in their convergence to a value. While solving the sign problem is generically…
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…
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…
The complex Langevin approach is a promising method for the numerical treatment of systems with a sign problem, for which conventional lattice field theory techniques based on importance sampling cannot be applied. However, complex Langevin…
The graph matching problem is a significant special case of the Quadratic Assignment Problem, with extensive applications in pattern recognition, computer vision, protein alignments and related fields. As the problem is NP-hard, relaxation…