Related papers: Complex saddle points and the sign problem in comp…
We present results of the numerical simulation of the two-dimensional Thirring model at finite density and temperature. The severe sign problem is dealt with by deforming the domain of integration into complex field space. This is the first…
We study Langevin dynamics for recovering the planted signal in the spiked matrix model. We provide a "path-wise" characterization of the overlap between the output of the Langevin algorithm and the planted signal. This overlap is…
We review recent attempts at dealing with the sign problem in Monte Carlo calculations by deforming the region of integration in the path integral from real to complex fields. We discuss the theoretical foundations, the algorithmic issues…
One of the yet unsolved questions of QCD in the context of the Standard Model is to explain the strong CP problem. A way to look for a better understanding of it is to investigate the theory in the presence of a non-zero topological theta…
In the paper, we generalize the approach Gasnikov et. al, 2017, which allows to solve (stochastic) convex optimization problems with an inexact gradient-free oracle, to the convex-concave saddle-point problem. The proposed approach works,…
The fermion sign problem, the biggest obstacle in quantum Monte Carlo calculations, is completely solved in this paper. Here, we find a strategy, in which the contribution from those negative-weighted paths is thoroughly cancelled or…
In this paper, we propose a variance-reduced primal-dual algorithm with Bregman distance for solving convex-concave saddle-point problems with finite-sum structure and nonbilinear coupling function. This type of problems typically arises in…
Quantum cosmology aims at elucidating the beginning of our Universe. Back in early 80's, Vilenkin and Hartle-Hawking put forward the "tunneling from nothing" and "no boundary" proposals. Recently there has been renewed interest in this…
When simulating molecular systems using deterministic equations of motion (e.g., Newtonian dynamics), such equations are generally numerically integrated according to a well-developed set of algorithms that share commonly agreed-upon…
Several numerical schemes are proposed for the solution of Nonequilibrium Langevin Dynamics (NELD), and the rate of convergence is analyzed. Due to the special deforming boundary conditions used, care must be taken when using standard…
Monte Carlo calculations in the framework of lattice field theory provide non-perturbative access to the equilibrium physics of quantum fields. When applied to certain fermionic systems, or to the calculation of out-of-equilibrium physics,…
Picard--Lefschetz theory is applied to path integrals of quantum mechanics, in order to compute real-time dynamics directly. After discussing basic properties of real-time path integrals on Lefschetz thimbles, we demonstrate its…
We present a strategy to alleviate the sign problem in continuous-time quantum Monte Carlo (CTQMC) simulations of the dynamical-mean-field-theory (DMFT) equations for the spin-orbit-coupled multiorbital Hubbard model. We first identify the…
Latent-variable energy-based models (LVEBMs) assign a single normalized energy to joint pairs of observed data and latent variables, offering expressive generative modeling while capturing hidden structure. We recast maximum-likelihood…
Non-equilibrium quantum many-body systems, which are difficult to study via classical computation, have attracted wide interest. Quantum simulation can provide insights into these problems. Here, using a programmable quantum simulator with…
Frustrated spin systems generically suffer from the negative sign problem inherent to Monte Carlo methods. Since the severity of this problem is formulation dependent, optimization strategies can be put forward. We introduce a phase pinning…
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…
We solve large-scale mixed-integer linear programs (MILPs) via distributed asynchronous saddle point computation. This is motivated by the MILPs being able to model problems in multi-agent autonomy, e.g., task assignment problems and…
As is well known the Complex Langevin (CL) method sometimes fails to converge or converges to the wrong limit. We identified one reason for this long ago: insufficient decay of the probability density either near infinity or near poles of…
We consider strongly-convex-strongly-concave saddle-point problems with general non-bilinear objective and different condition numbers with respect to the primal and the dual variables. First, we consider such problems with smooth composite…