Related papers: Evading the model sign problem in the PNJL model w…
The path optimization method is applied to a QCD effective model with the Polyakov loop and the repulsive vector-type interaction at finite temperature and density to circumvent the model sign problem. We show how the path optimization…
We investigate the sign problem in field theories by using the path optimization method with use of the neural network. For theories with the sign problem, integral in the complexified variable space is a promising approach to obtain a…
We apply the path optimization method to a QCD effective model with the Polyakov loop at finite density to circumvent the model sign problem. The Polyakov-loop extended Nambu--Jona-Lasinio model is employed as the typical QCD effective…
We introduce the feedforward neural network to attack the sign problem via the path optimization method. The variables of integration is complexified and the integration path is optimized in the complexified space by minimizing the cost…
We propose a new approach to circumvent the sign problem in which the integration path is optimized to control the sign problem. We give a trial function specifying the integration path in the complex plane and tune it to optimize the cost…
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…
The path optimization method, which is proposed to control the sign problem in quantum field theories with continuous degrees of freedom by machine learning, is applied to a spin model with discrete degrees of freedom. The path optimization…
The path optimization method with machine learning is applied to the one-dimensional massive lattice Thirring model, which has the sign problem caused by the fermion determinant. This study aims to investigate how the path optimization…
We investigate the role of the isoscalar vector interaction and the dynamics of the Polyakov loop on inhomogeneous phases in the phase diagram of the two-flavor Nambu-Jona--Lasinio (NJL) model. Thereby we concentrate on phases with a…
The Monte Carlo evaluation of path integrals is one of a few general purpose methods to approach strongly coupled systems. It is used in all branches of Physics, from QCD/nuclear physics to the correlated electron systems. However, many…
We investigate efficiency of a gauge-covariant neural network and an approximation of the Jacobian in optimizing the complexified integration path toward evading the sign problem in lattice field theories. For the construction of the…
We suggest an approach for simulating theories with a sign problem that relies on optimisation of complex integration contours that are not restricted to lie along Lefschetz thimbles. To that end we consider the toy model of a…
We investigate the sign problem in 0+1 dimensional QCD at finite chemical potential by using the path optimization method. The SU(3) link variable is complexified to the SL(3,$\mathbb{C}$) link variable, and the integral path is represented…
This paper presents a method for alleviating sign problems in lattice path integrals, including those associated with finite fermion density in relativistic systems. The method makes use of information gained from some systematic expansion…
The path optimization has been proposed to weaken the sign problem which appears in some field theories such as finite density QCD. In this method, we optimize the integration path in complex plain to enhance the average phase factor. In…
Many fascinating systems suffer from a severe (complex action) sign problem preventing us from calculating them with Markov Chain Monte Carlo simulations. One promising method to alleviate the sign problem is the transformation of the…
We consider the NP-hard problem of MAP-inference for undirected discrete graphical models. We propose a polynomial time and practically efficient algorithm for finding a part of its optimal solution. Specifically, our algorithm marks some…
Lattice Monte Carlo calculations of interacting systems on non-bipartite lattices exhibit an oscillatory imaginary phase known as the phase or sign problem, even at zero chemical potential. One method to alleviate the sign problem is to…
Monte Carlo simulations away from half-filling suffer from a sign problem that can be reduced by deforming the contour of integration. Such a transformation, which induces a Jacobian determinant in the Boltzmann weight, can be implemented…
We investigate the efficiency of a gauge invariant input to a neural network for the path optimization method. While the path optimization with a completely gauge-fixed link-variable input has successfully tamed the sign problem in a simple…