相关论文: Complex Langevin analysis of 2D U(1) gauge theory …

Although numerical simulation in lattice field theory is one of the most effective tools to study non-perturbative properties of field theories, it faces serious obstacles coming from the sign problem in some theories such as finite density…

Stochastic approximation methods play a central role in maximum likelihood estimation problems involving intractable likelihood functions, such as marginal likelihoods arising in problems with missing or incomplete data, and in parametric…

The sign problem is a major obstacle to our understanding of the phase diagram of QCD at finite baryon density. Several numerical methods have been proposed to tackle this problem, but a full solution to the sign problem is still elusive.…

We review our new method, which might be the most direct and efficient way for approaching the continuum physics from Hamiltonian lattice gauge theory. It consists of solving the eigenvalue equation with a truncation scheme preserving the…

We study the gauging of a global U(1) symmetry in a gapped system in (2+1)d. The gauging procedure has been well-understood for a finite global symmetry group, which leads to a new gapped phase with emergent gauge structure and can be…

A continuous-time path integral Quantum Monte Carlo method using the directed-loop algorithm is developed to simulate the Anderson single-impurity model in the occupation number basis. Although the method suffers from a sign problem at low…

While the Metropolis Adjusted Langevin Algorithm (MALA) is a popular and widely used Markov chain Monte Carlo method, very few papers derive conditions that ensure its convergence. In particular, to the authors' knowledge, assumptions that…

We present a general technique for addressing sign problems that arise in Monte Carlo simulations of field theories. This method deforms the domain of the path integral to a manifold in complex field space that maximizes the average sign…

We introduce a projected complex Langevin (CL) numerical sampling method -- a fictitious Langevin dynamics scheme that uses numerical projection to sample a constrained stationary distribution with highly oscillatory character. Despite the…

This paper presents a detailed theoretical analysis of the Langevin Monte Carlo sampling algorithm recently introduced in Durmus et al. (Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreau, 2016)…

Path Integral Monte Carlo simulations have been performed for U(1) lattice gauge theory in (2+1) dimensions on anisotropic lattices. We extractthe static quark potential, the string tension and the low-lying "glueball" spectrum.The…

We consider a hybrid Monte Carlo algorithm which is applicable to lattice theories defined on Lefschetz thimbles. In the algorithm, any point (field configuration) on a thimble is parametrized uniquely by the flow-direction and the…

Langevin Monte Carlo (LMC) is a popular Markov chain Monte Carlo sampling method. One drawback is that it requires the computation of the full gradient at each iteration, an expensive operation if the dimension of the problem is high. We…

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…

In the case of nonabelian gauge theories with a complex weight, a controlled exploration of the complexified configuration space during a complex Langevin process requires the use of SL(N,C) gauge cooling, in order to minimize the distance…

We investigate the two-dimensional lattice U(1) gauge-Higgs model with a topological term, employing L\"uscher's admissibility condition. The standard Monte Carlo simulation for this model is hindered not only by the complex action problem…

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…

On the base of the diffusion Monte-Carlo method we develop the method allowing to simulate the quantum systems with complex wave function. The method is exact and there are no approximations on the simulations of the module and the phase of…

The recently developed Meron-Cluster algorithm completely solves the exponentially difficult sign problem for a number of models previously inaccessible to numerical simulation. We use this algorithm in a high-precision study of a model of…

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…