Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:hep-lat/9605007

A new approach to significantly reduce the negative sign problem in quantum Monte Carlo

Galli, A.

Published May 8, 1996• 1 citation
arXivHTMLPDF

Abstract

We present a new approach for Monte Carlo simulations of lattice quantum spin systems which is able to eliminate the negative sign problem. Its complexity is linear in the volume of the lattice. Its efficiency is tested on a simple 2-dimensional fermionic model.
DOI
10.48550/arxiv.hep-lat/9605007

Related papers

Suppression of the negative sign problem in quantum Monte Carlo

Galli, A.

We present a new Monte Carlo algorithm for simulating quantum spin systems which is able to suppress the negative sign problem. This algorithm has only a linear complexity in the lattice size used for the simulation. A general description and a rigorous proof of its correctness is given. Its efficiency is tested on a simple 2-dimensional fermionic model. For this model we show that our algorithm eliminates the sign problem.

arXiv:hep-lat/9605026•May 22, 1996•2 citations

On the Monte Carlo Method for Fermions in Multi-Dimensional Systems

Masatoshi Imada

The negative sign problem is a serious difficulty with most existing Monte Carlo methods of evaluating fermion systems of greater than one-dimension because it makes the computation of physical variables practically impossible. A simple and general averaging method is proposed for many-fermion systems. This method is completely free of the negative sign problem. The efficiency and convergence are verified in the Feynman's path integral calculations of a few simple models.

Journal of the Physical Society of Japan•Sep 15, 1984•14 citations

Computational Complexity and Fundamental Limitations to Fermionic Quantum Monte Carlo Simulations

Matthias Troyer, U.‐J. Wiese

Quantum Monte Carlo simulations, while being efficient for bosons, suffer from the "negative sign problem" when applied to fermions--causing an exponential increase of the computing time with the number of particles. A polynomial time solution to the sign problem is highly desired since it would provide an unbiased and numerically exact method to simulate correlated quantum systems. Here we show that such a solution is almost certainly unattainable by proving that the sign problem is nondeterministic polynomial (NP) hard, implying that a generic solution of the sign problem would also solve all problems in the complexity class NP in polynomial time.

arXiv:cond-mat/0408370•Physical Review Letters•May 4, 2005•1,250 citations

Reduction of the sign problem near T=0 in quantum Monte Carlo simulations

Jonathan D’Emidio, Stefan Weßel, Frédéric Mila

Building on a recent investigation of the Shastry-Sutherland model [S. Wessel et al., Phys. Rev. B 98, 174432 (2018)], we develop a general strategy to eliminate the Monte Carlo sign problem near the zero-temperature limit in frustrated quantum spin models. If the Hamiltonian of interest and the sign-problem-free Hamiltonian, obtained by making all off-diagonal elements negative in a given basis, have the same ground state and this state is a member of the computational basis, then the average sign returns to one as the temperature goes to zero. We illustrate this technique by studying the triangular and kagome lattice Heisenberg antiferrromagnet in a magnetic field above saturation, as well as the Heisenberg antiferromagnet on a modified Husimi cactus in the dimer basis. We also provide detailed Appendices on using linear programming techniques to automatically generate efficient directed loop updates in quantum Monte Carlo simulations.

arXiv:2003.13356•Physical review. B./Physical review. B•Aug 20, 2020•8 citations

Solving the fermion sign problem in quantum Monte Carlo simulations by Majorana representation

Zixiang Li, Yi‐Fan Jiang, Hong Yao

Much attention has been devoted recently to identify possible ways to overcome the notorious sign problem encountered in quantum Monte Carlo simulations. The authors of this paper propose a new method based on Majorana representation of complex fermions, which they dub Majorana Quantum Monte Carlo (MQMC). They find a class of SU(N) fermionic models which are sign-free in MQMC but cannot be solved with other available methods.

arXiv:1408.2269•Physical Review B•Jun 30, 2015•193 citations

Minus Sign Problem in the Monte Carlo Simulation of Lattice Fermion Systems

Nobuo Furukawa, Masatoshi Imada

The minus sign problem, as a problem of the non-positive-definite measure of the path integrals, is examined in the Monte Carlo simulation of the Hubbard model. A new correction method in terms of the ratio of two measured quantities is proposed to calculate physical properties. The momentum distribution and the spin correlation as well as the energy in the ground state are tested against the exactly diagonalized results. The results show that this ratio correction method is a promising prescription to reduce the minus sign problem.

Journal of the Physical Society of Japan•Mar 15, 1991•32 citations
Quantum Monte Carlo simulations, while being efficient for bosons, suffer from the "negative sign problem" when applied to fermions--causing an exponential increase of the computing time with the number of particles. A polynomial time solution to the sign problem is highly desired since it would provide an unbiased and numerically exact method to simulate correlated quantum systems. Here we show that such a solution is almost certainly unattainable by proving that the sign problem is nondeterministic polynomial (NP) hard, implying that a generic solution of the sign problem would also solve all problems in the complexity class NP in polynomial time.
Building on a recent investigation of the Shastry-Sutherland model [S. Wessel et al., Phys. Rev. B 98, 174432 (2018)], we develop a general strategy to eliminate the Monte Carlo sign problem near the zero-temperature limit in frustrated quantum spin models. If the Hamiltonian of interest and the sign-problem-free Hamiltonian, obtained by making all off-diagonal elements negative in a given basis, have the same ground state and this state is a member of the computational basis, then the average sign returns to one as the temperature goes to zero. We illustrate this technique by studying the triangular and kagome lattice Heisenberg antiferrromagnet in a magnetic field above saturation, as well as the Heisenberg antiferromagnet on a modified Husimi cactus in the dimer basis. We also provide detailed Appendices on using linear programming techniques to automatically generate efficient directed loop updates in quantum Monte Carlo simulations.
The minus sign problem, as a problem of the non-positive-definite measure of the path integrals, is examined in the Monte Carlo simulation of the Hubbard model. A new correction method in terms of the ratio of two measured quantities is proposed to calculate physical properties. The momentum distribution and the spin correlation as well as the energy in the ground state are tested against the exactly diagonalized results. The results show that this ratio correction method is a promising prescription to reduce the minus sign problem.