Related papers: Path optimization method for the sign problem
The algorithm based on integration over Lefschetz thimbles is a promising method to resolve the sign problem for complex actions. However, this algorithm often meets a difficulty in actual Monte Carlo calculations because the configuration…
We study three possible ways to circumvent the sign problem in the O(3) nonlinear sigma model in 1+1 dimensions. We compare the results of the worm algorithm to complex Langevin and multiparameter reweighting. Using the worm algorithm, the…
This article gives an introduction to the multilevel blocking (MLB) approach to both the fermion and the dynamical sign problem in path-integral Monte Carlo simulations. MLB is able to substantially relieve the sign problem in many…
We discuss two problems in complexified auxiliary fields in fermionic effective models, the auxiliary sign problem associated with the repulsive vector-field and the choice of the cut for the scalar field appearing from the logarithmic…
Inspired by the Boltzmann kinetics, we propose a collision-based dynamics with a Monte Carlo solution algorithm that approximates the solution of the multi-marginal optimal transport problem via randomized pairwise swapping of sample…
Quantum Monte Carlo belongs to the most accurate simulation techniques for quantum many-particle systems. However, for fermions, these simulations are hampered by the sign problem that prohibits simulations in the regime of strong…
In lattice field theory, the interactions of elementary particles can be computed via high-dimensional integrals. Markov-chain Monte Carlo (MCMC) methods based on importance sampling are normally efficient to solve most of these integrals.…
We present a new approach to Bayesian inference that entirely avoids Markov chain simulation, by constructing a map that pushes forward the prior measure to the posterior measure. Existence and uniqueness of a suitable measure-preserving…
Using a path integral approach, we derive an analytical solution of a nonlinear and singular Langevin equation, which has been introduced previously by P.-G. de Gennes as a simple phenomenological model for the stick-slip motion of a solid…
Based on the existing pivot rules, the simplex method for linear programming is not polynomial in the worst case. Therefore the optimal pivot of the simplex method is crucial. This study proposes the optimal rule to find all shortest pivot…
This work shows that the recently discovered operator contraction identity for solving the discreet Path Integral of the harmonic oscillator can be applied equally to fermions in any dimension. This then yields an exactly solvable model for…
Navigating a collision-free and optimal trajectory for a robot is a challenging task, particularly in environments with moving obstacles such as humans. We formulate this problem as a stochastic optimal control problem. Since solving the…
A $\theta$ term in lattice field theory causes the sign problem in Monte Carlo simulations. This problem can be circumvented by Fourier-transforming the topological charge distribution $P(Q)$. This strategy, however, has a limitation,…
A permanent challenge in physics and other disciplines is to solve partial differential equations, thereby a beneficial investigation is to continue searching for new procedures to do it. In this Letter, a novel Monte-Carlo Metropolis…
Fermi gases in strongly coupled regimes, such as the unitary limit, are inherently challenging for many-body methods. Although much progress has been made with purely analytic methods, quantitative results require ab initio numerical…
We formulate a path-integral Monte Carlo algorithm for simulating lattice systems consisting of fictitious particles governed by a generalized exchange statistics. This method, initially proposed for continuum systems, introduces a…
The Laplace-Beltrami operator (LBO) is a fundamental object associated to Riemannian manifolds, which encodes all intrinsic geometry of the manifolds and has many desirable properties. Recently, we proposed a novel numerical method, Point…
When one tries to simulate quantum spin systems by the Monte Carlo method, often the 'minus-sign problem' is encountered. In such a case, an application of probabilistic methods is not possible. In this paper the method has been proposed…
Although the complex Langevin method can solve the sign problem in simulations of theories with complex actions, the method will yield the wrong results if known validity conditions are not satisfied. We present a novel method to compute…
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…