Related papers: Computational complexity and fundamental limitatio…
A general algorithm toward the solution of the fermion sign problem in finite-temperature quantum Monte Carlo simulations has been formulated for discretized fermion path integrals with nearest-neighbor interactions in the Trotter…
Ab initio path integral Monte Carlo (PIMC) simulations constitute the gold standard for the estimation of a broad range of equilibrium properties of a host of interacting quantum many-body systems spanning conditions from ultracold atoms to…
A method is presented to tackle the sign problem in the simulations of systems having indefinite or complex-valued measures. In general, this new approach is shown to yield statistical errors smaller than the crude Monte Carlo using…
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 present a solution to the sign problem in dynamical random matrix simulations of a two-matrix model at nonzero chemical potential. The sign problem, caused by the complex fermion determinants, is solved by gathering the matrices into…
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…
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…
We investigate the simulation of fermionic systems on a quantum computer. We show in detail how quantum computers avoid the dynamical sign problem present in classical simulations of these systems, therefore reducing a problem believed to…
Here we develop a new scheme of projective quantum Monte-Carlo (QMC) simulation combining unbiased zero-temperature (projective) determinant QMC and variational Monte-Carlo based on Gutzwiller projection wave function, dubbed as…
Quantum Monte Carlo (QMC) simulations constitute nowadays one of the most powerful methods to study strongly correlated quantum systems, provided that no "sign problem" arises. However, many systems of interest, including highly frustrated…
We consider the numerical analysis of the inchworm Monte Carlo method, which is proposed recently to tackle the numerical sign problem for open quantum systems. We focus on the growth of the numerical error with respect to the simulation…
Quantum Monte Carlo is a powerful tool for studying quantum many-body physics, yet its efficacy is often curtailed by the notorious sign problem. In this Letter, we introduce a novel criterion for the "intrinsic" sign problem in…
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…
Ab-initio studies of strongly interacting bosonic and fermionic systems is greatly facilitated by efficient Monte Carlo algorithms. This article emphasizes this requirement, and outlines the ideas behind the construction of the cluster…
We introduce a Monte Carlo scheme for sampling bold-line diagrammatic series specifying an unknown function in terms of itself. The range of convergence of this bold(-line) diagrammatic Monte Carlo (BMC) is significantly broader than that…
Quantum Monte Carlo (QMC) is a family of powerful tools for addressing quantum many-body problems. However, its applications are often plagued by the fermionic sign problem. A promising strategy is to simulate an interaction without sign…
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…
We propose a novel approach toward the general solution of the sign problem in real-time path-integral simulations. Using a recursive multilevel blocking strategy, this method circumvents the sign problem by synthesizing the phase…
The notorious sign problem severely limits the applicability of quantum Monte Carlo (QMC) simulations, as statistical errors grow exponentially with system size and inverse temperature. A recent proposal of a quantum-computing stochastic…
An efficient quantum algorithm is proposed to solve in polynomial time the parity problem, one of the hardest problems both in conventional quantum computation and in classical computation, on NMR quantum computers. It is based on the…