Related papers: A simple approach towards the sign problem using p…
Thimble regularization as a solution to the sign problem has been successfully put at work for a few toy models. Given the non trivial nature of the method (also from the algorithmic point of view) it is compelling to provide evidence that…
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…
In a recent paper, Parikh and Boyd describe a method for solving a convex optimization problem, where each iteration involves evaluating a proximal operator and projection onto a subspace. In this paper we address the critical practical…
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 consider simulating an $n$-qubit Hamiltonian with nearest-neighbor interactions evolving for time $t$ on a quantum computer. We show that this simulation has gate complexity $(nt)^{1+o(1)}$ using product formulas, a straightforward…
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…
Constrained optimization problems appear in a wide variety of challenging real-world problems, where constraints often capture the physics of the underlying system. Classic methods for solving these problems rely on iterative algorithms…
Sign problem in quantum Monte Carlo (QMC) simulation appears to be an extremely hard yet interesting problem. In this article, we present a pedagogical overview on the origin of the sign problem in various quantum Monte Carlo simulation…
The complex Langevin method is a leading candidate for solving the so-called sign problem occurring in various physical situations. Its most vexing problem is that in some cases it produces `convergence to the wrong limit'. In the first…
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…
We study the fermion sign problem in a theory of non-relativistic fermions with a spin-independent repulsive interaction. We work in polar co-ordinates in momentum space, which makes it straightforward to keep only the low-energy degrees of…
Quantum Monte Carlo (QMC) methods for the frustrated quantum spin systems occasionally suffer from the negative sign problem, which makes simulations exponentially harder for larger systems at lower temperatures and severely limits QMC's…
I answer the question in the title for the relativistic Bose gas at finite chemical potential using numerical lattice simulations, complemented with analytical understanding.
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted graph matching problem as a least-square problem on the set…
Many research programs aiming to deal with the sign problem were proposed since the advent of lattice field theory. Several of these try to achieve this by exploiting properties of analytic functions. This is also the case for our study.…
Direct numerical evaluation of the real-time path integral has a well-known sign problem that makes convergence exponentially slow. One promising remedy is to use Picard-Lefschetz theory to flow the domain of the field variables into the…
A new method for the stabilization of the sign problem in the Green Function Monte Carlo technique is proposed. The method is devised for real lattice Hamiltonians and is based on an iterative ''stochastic reconfiguration'' scheme which…
We propose a practical way of circumventing the sign problem in lattice QCD simulations with a theta-vacuum term. This method is the reweighting method for the QCD Lagrangian after the U_A(1) transformation. In the Lagrangian, the P-odd…
Estimating the orientations of nodes in a pose graph from relative angular measurements is challenging because the variables live on a manifold product with nontrivial topology and the maximum-likelihood objective function is non-convex and…
We perform the real-time lattice simulation of an open quantum system, which is based on the Schwinger-Keldysh path integral representation of the Lindblad formalism. Although the real-time simulation generally suffers from the sign…