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

Journal of the Physical Society of Japan

Data Analysis for Quantum Monte Carlo Simulations with the Negative-Sign Problem

Naomichi Hatano

Published May 15, 1994• 13 citations
Publisher

Abstract

Methods of analyzing data of quantum Monte Carlo simulations with the negative-sign problem are studied. It is pointed out that naive data analyses yield an overestimated statistical error or a quite unstable result. Two proper ways of analyzing the data are presented.
DOI
10.1143/jpsj.63.1691

Related papers

Reweighting Method for Quantum Monte Carlo Simulations with the Negative-Sign Problem

Tota Nakamura, Naomichi Hatano, Hidetoshi Nishimori

We propose a new method for quantum Monte Carlo simulations with the negative-sign problem. In the conventional method, one simulates a virtual system whose Boltzmann factors are the absolute values of the original one, and analyzes the data so that the correct expression for physical quantities may be recovered. We simulate a different virtual system with properties closer to the original system and yet without the negative-sign problem. Comparison between the present method and the conventional one is made for the antiferromagnetic Heisenberg model on the 4×h4 square lattice with frustrations ( J 1 - J 2 model). We conclude that the present method is useful in the low-temperature region where the negative-sign problem becomes serious. It is also shown that the method is considerably efficient on the point that quantities for different parameters can be obtained in a single run.

Journal of the Physical Society of Japan•Oct 15, 1992•24 citations

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

Reweighting method for quantum Monte Carlo simulations with the negative-sign problem

秀稔 西森, Hidetoshi Nishimori

•Oct 1, 1992•0 citations

Sign-resolved statistics and the origin of bias in quantum Monte Carlo

Ryan Larson, Rubem Mondaini, Richard T. Scalettar

Quantum simulations are a powerful tool for exploring strongly correlated many-body phenomena. Yet, their reach is limited by the fermion sign problem, which causes configuration weights to become negative, compromising statistical sampling. In auxiliary-field Quantum Monte Carlo calculations of the doped Hubbard model, neglecting the sign ${\cal S}$ of the weight leads to qualitatively wrong results -- most notably, an apparent suppression rather than enhancement of $d$-wave pairing at low temperature. Here we approach the problem from a different perspective: instead of identifying negative-weight paths, we examine the statistics of measured observables in a sign-resolved manner. By analyzing histograms of key quantities (kinetic energy, antiferromagnetic structure factor, and pair susceptibilities) for configurations with ${\cal S}=\pm1$, we derive an exact relation linking the bias from ignoring the sign to the difference between sign-resolved means, $Δμ$, and the average sign, $\langle {\cal S}\rangle$. Our framework provides a precise diagnostic of the origin of measurement bias in Quantum Monte Carlo and clarifies why observables such as the $d$-wave susceptibility are especially sensitive to the sign problem.

arXiv:2512.04056•Physical review. B./Physical review. B•Apr 29, 2026•0 citations

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

Galli, A.

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.

arXiv:hep-lat/9605007•May 8, 1996•1 citation

Sign Problem in Quantum Monte Carlo Simulation

Gaopei Pan, Zi Yang Meng

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 techniques, ranging from the world-line and stochastic series expansion Monte Carlo for boson and spin systems to the determinant and momentum-space quantum Monte Carlo for interacting fermions. We point out the basis dependency of the sign problem and summarize the progresses to cure, ease and even make use of the sign problem over the years, such as symmetry analysis of the underlying Hamiltonian, basis optimization in writting down the partition functions and many others. Moreover, we state that although traditional lore saying that in case of sign problem, the average sign in QMC simulation approaches zero exponentially fast with the space-time volume of the configurational space, there are recent breakthroughs showing this is not always the case and based on the properties of the partition function for finite size systems, one could distinguish when the average sign has the usual exponential scaling and when it is bestowed with an algebraic scaling at the low temperature limit. Fermionic QMC simulations with such algebraic sign problems have been successfully carried out for extended Hubbard-type and quantum Moiré lattice models.

arXiv:2204.08777•Apr 19, 2022•7 citations
We propose a new method for quantum Monte Carlo simulations with the negative-sign problem. In the conventional method, one simulates a virtual system whose Boltzmann factors are the absolute values of the original one, and analyzes the data so that the correct expression for physical quantities may be recovered. We simulate a different virtual system with properties closer to the original system and yet without the negative-sign problem. Comparison between the present method and the conventional one is made for the antiferromagnetic Heisenberg model on the 4×h4 square lattice with frustrations ( J 1 - J 2 model). We conclude that the present method is useful in the low-temperature region where the negative-sign problem becomes serious. It is also shown that the method is considerably efficient on the point that quantities for different parameters can be obtained in a single run.
Quantum simulations are a powerful tool for exploring strongly correlated many-body phenomena. Yet, their reach is limited by the fermion sign problem, which causes configuration weights to become negative, compromising statistical sampling. In auxiliary-field Quantum Monte Carlo calculations of the doped Hubbard model, neglecting the sign S{\cal S}S of the weight leads to qualitatively wrong results -- most notably, an apparent suppression rather than enhancement of ddd-wave pairing at low temperature. Here we approach the problem from a different perspective: instead of identifying negative-weight paths, we examine the statistics of measured observables in a sign-resolved manner. By analyzing histograms of key quantities (kinetic energy, antiferromagnetic structure factor, and pair susceptibilities) for configurations with S=±1{\cal S}=\pm1S=±1, we derive an exact relation linking the bias from ignoring the sign to the difference between sign-resolved means, ΔμΔμΔμ, and the average sign, ⟨S⟩\langle {\cal S}\rangle⟨S⟩. Our framework provides a precise diagnostic of the origin of measurement bias in Quantum Monte Carlo and clarifies why observables such as the ddd-wave susceptibility are especially sensitive to the sign problem.
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 techniques, ranging from the world-line and stochastic series expansion Monte Carlo for boson and spin systems to the determinant and momentum-space quantum Monte Carlo for interacting fermions. We point out the basis dependency of the sign problem and summarize the progresses to cure, ease and even make use of the sign problem over the years, such as symmetry analysis of the underlying Hamiltonian, basis optimization in writting down the partition functions and many others. Moreover, we state that although traditional lore saying that in case of sign problem, the average sign in QMC simulation approaches zero exponentially fast with the space-time volume of the configurational space, there are recent breakthroughs showing this is not always the case and based on the properties of the partition function for finite size systems, one could distinguish when the average sign has the usual exponential scaling and when it is bestowed with an algebraic scaling at the low temperature limit. Fermionic QMC simulations with such algebraic sign problems have been successfully carried out for extended Hubbard-type and quantum Moiré lattice models.