Related papers: Comparison of algorithms for solving the sign prob…
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.…
We calculate the finite-temperature density and polarization equations of state of one-dimensional fermions with a zero-range interaction, considering both attractive and repulsive regimes. In the path-integral formulation of the…
We consider the sign problem for classical spin models at complex $\beta =1/g_0^2$ on $L\times L$ lattices. We show that the tensor renormalization group method allows reliable calculations for larger Im$\beta$ than the reweighting Monte…
We apply the complex Langevin method (CLM) to overcome the sign problem in 4D SU(2) gauge theory with a theta term extending our previous work on the 2D U(1) case. The topology freezing problem can be solved by using open boundary…
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…
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…
We present results of tensor-network simulations of the three-dimensional $O(2)$ model at non-zero chemical potential and temperature, which were computed using the higher-order tensor-renormalization-group method (HOTRG). This necessitated…
We consider a generalization of the Thirring model in 2+1 dimensions at finite density. We employ stochastic quantization and check for the applicability in the finite density case to circumvent the sign problem. To this end we derive…
The sign problem at nonzero chemical potential prohibits the use of importance sampling in lattice simulations. Since complex Langevin dynamics does not rely on importance sampling, it provides a potential solution. Recently it was shown…
We consider a generalized Thirring model in 0+1 dimensions at finite density. In order to deal with the resulting sign problem we employ stochastic quantization, i.e., a complex Langevin evolution. We investigate the convergence properties…
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 complex Langevin method is a leading candidate for solving the sign problem occurring in various physical situations, notably QCD at finite chemical potential. Its most vexing problem is `convergence to the wrong limit', where the…
The theoretical treatment of Fermi systems consisting of particles with unequal masses is challenging. Even in one spatial dimension analytic solutions are limited to special configurations and numerical progress with Monte Carlo…
In molecular dynamics, penalized overdamped Langevin dynamics are used to model the motion of a set of particles that follow constraints up to a parameter $\varepsilon$. The most used schemes for simulating these dynamics are the Euler…
In the presence of a chemical potential, the physics of level crossings leads to singularities at zero temperature, even when the spatial volume is finite. These singularities are smoothed out at a finite temperature but leave behind…
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…
Statistical sampling with the complex Langevin (CL) equation is applied to (0+1)-dimensional Thirring model, and its uniform-field variant, at finite fermion chemical potential $\mu$. The CL simulation reproduces a crossover behavior which…
The problem of sampling according to the probability distribution minimizing a given free energy, using interacting particles unadjusted kinetic Langevin Monte Carlo, is addressed. In this setting, three sources of error arise, related to…
The three-dimensional SU(3) spin model is an effective Polyakov loop model for QCD at nonzero temperature and density. It suffers from a sign problem at nonzero chemical potential. We revisit this model using complex Langevin dynamics and…
We study sampling as optimization in the space of measures. We focus on gradient flow-based optimization with the Langevin dynamics as a case study. We investigate the source of the bias of the unadjusted Langevin algorithm (ULA) in…