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:1601.01558 · Physical review. E

Fermion sign problem in imaginary-time projection continuum quantum Monte Carlo with local interaction

Francesco Calcavecchia, Markus Holzmann

Published Apr 29, 2016• 5 citations
arXivHTMLPDF

Abstract

We use the shadow wave function formalism as a convenient model to study the fermion sign problem affecting all projector quantum Monte Carlo methods in continuum space. We demonstrate that the efficiency of imaginary-time projection algorithms decays exponentially with increasing number of particles and/or imaginary-time propagation. Moreover, we derive an analytical expression that connects the localization of the system with the magnitude of the sign problem, illustrating this behavior through numerical results. Finally, we discuss the computational complexity of the fermion sign problem and methods for alleviating its severity.

DOI
10.1103/physreve.93.043321

Related papers

Sign problem of the fermionic shadow wave function

Francesco Calcavecchia, Francesco Pederiva, Malvin H. Kalos +1 more

We present a whole series of methods to alleviate the sign problem of the fermionic shadow wave function in the context of variational Monte Carlo. The effectiveness of our techniques is demonstrated on liquid ^{3}He. We found that although the variance is reduced, the gain in efficiency is restricted by the increased computational cost. Yet, this development not only extends the scope of the fermionic shadow wave function, but also facilitates highly accurate quantum Monte Carlo simulations previously thought not feasible.

arXiv:1404.6944•Physical Review E•Nov 4, 2014•17 citations

Understanding the sign problem from an exact Path Integral Monte Carlo model of interacting harmonic fermions

Sa Chin

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 studying the sign problem where the Path Integral Monte Carlo energy at any time step for any number of fermions is known analytically, or can be computed numerically. It is found that the sign problem is primarily a property of the free fermion propagator, but repulsive/attractive pairwise interaction can shift the sign problem to larger/smaller imaginary time but does not make it more severe than the non-interacting case. More surprisingly, one can prove analytically that the first closed-shell state in $D$ dimension, with $n=D+1$ fermion, has no sign problem at large imaginary time. Direct numerical simulations confirm that this is also true for higher closed-shell states in two and three-dimension. Fourth-order and newly found variable-bead algorithms are used to compute ground state energies of quantum dots with up to 110 electrons and compared to results obtained by modern neural networks.

arXiv:2601.22559•Jan 30, 2026•0 citations

Understanding the sign problem from an exact path integral Monte Carlo model of interacting harmonic fermions

Siu A. Chin

This work shows that the recently discovered operator contraction identity for solving the discrete path integral of the harmonic oscillator can be applied equally to fermions in any dimension. This then yields an exactly solvable model for studying the sign problem where the path integral Monte Carlo energy at any time step for any number of fermions is known analytically or can be computed numerically. It is found that the sign problem is primarily a property of the free fermion propagator, but repulsive/attractive pairwise interactions can shift the sign problem to larger/smaller imaginary time but do not make it more severe than the non-interacting case. More surprisingly, one can prove analytically that the first closed-shell state in D dimension, with n = D + 1 fermions, has no sign problem at large imaginary time. Direct numerical simulations confirm that this is also true for higher closed-shell states in two and three dimensions. Fourth-order and newly found variable-bead algorithms are used to compute ground state energies of quantum dots with up to 110 electrons and are compared to results obtained by modern neural networks.

The Journal of Chemical Physics•Jun 11, 2026•0 citations

Mitigating the Sign Problem through Basis Rotations

Ryan Levy, Bryan K. Clark

Quantum Monte Carlo simulations of quantum many-body systems are plagued by the Fermion sign problem. The computational complexity of simulating Fermions scales exponentially in the projection time β and system size. The sign problem is basis dependent and an improved basis, for fixed errors, leads to exponentially quicker simulations. We show how to use sign-free quantum Monte Carlo simulations to optimize over the choice of basis on large two-dimensional systems. We numerically illustrate these techniques decreasing the "badness" of the sign problem by optimizing over single-particle basis rotations on one- and two-dimensional Hubbard systems. We find a generic rotation which improves the average sign of the Hubbard model for a wide range of U and densities for L×4 systems. In one example improvement, the average sign (and hence simulation cost at fixed accuracy) for the 16×4 Hubbard model at U/t=4 and n=0.75 increases by exp[8.64(6)β]. For typical projection times of β⪆100, this accelerates such simulation by many orders of magnitude.

arXiv:1907.02076•Physical Review Letters•May 24, 2021•27 citations

Fermionic sign problem minimization by constant path integral contour shifts

Christoph Gäntgen, Evan Berkowitz, Thomas Luu +2 more

The path integral formulation of quantum mechanical problems including fermions is often affected by a severe numerical sign problem. We show how such a sign problem can be alleviated by a judiciously chosen constant imaginary offset to the path integral. Such integration contour deformations introduce no additional computational cost to the Hamiltonian Monte Carlo algorithm, while its effective sample size is greatly increased. This makes otherwise unviable simulations efficient for a wide range of parameters. Applying our method to the Hubbard model, we find that the sign problem is significantly reduced. Furthermore, we prove that it vanishes completely for large chemical potentials, a regime where the sign problem is expected to be particularly severe without imaginary offsets. In addition to a numerical analysis of such optimized contour shifts, we analytically compute the shifts corresponding to the leading and next-to-leading order corrections to the action. We find that such simple approximations, free of significant computational cost, suffice in many cases. We present a simulation of ${\mathrm{C}}_{60}$ fullerenes (buckyballs) that are successful over a wide parameter range.

arXiv:2307.06785•Physical review. B./Physical review. B•May 20, 2024•8 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
We use the shadow wave function formalism as a convenient model to study the fermion sign problem affecting all projector quantum Monte Carlo methods in continuum space. We demonstrate that the efficiency of imaginary-time projection algorithms decays exponentially with increasing number of particles and/or imaginary-time propagation. Moreover, we derive an analytical expression that connects the localization of the system with the magnitude of the sign problem, illustrating this behavior through numerical results. Finally, we discuss the computational complexity of the fermion sign problem and methods for alleviating its severity.
We present a whole series of methods to alleviate the sign problem of the fermionic shadow wave function in the context of variational Monte Carlo. The effectiveness of our techniques is demonstrated on liquid ^{3}He. We found that although the variance is reduced, the gain in efficiency is restricted by the increased computational cost. Yet, this development not only extends the scope of the fermionic shadow wave function, but also facilitates highly accurate quantum Monte Carlo simulations previously thought not feasible.
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 studying the sign problem where the Path Integral Monte Carlo energy at any time step for any number of fermions is known analytically, or can be computed numerically. It is found that the sign problem is primarily a property of the free fermion propagator, but repulsive/attractive pairwise interaction can shift the sign problem to larger/smaller imaginary time but does not make it more severe than the non-interacting case. More surprisingly, one can prove analytically that the first closed-shell state in DDD dimension, with n=D+1n=D+1n=D+1 fermion, has no sign problem at large imaginary time. Direct numerical simulations confirm that this is also true for higher closed-shell states in two and three-dimension. Fourth-order and newly found variable-bead algorithms are used to compute ground state energies of quantum dots with up to 110 electrons and compared to results obtained by modern neural networks.
This work shows that the recently discovered operator contraction identity for solving the discrete path integral of the harmonic oscillator can be applied equally to fermions in any dimension. This then yields an exactly solvable model for studying the sign problem where the path integral Monte Carlo energy at any time step for any number of fermions is known analytically or can be computed numerically. It is found that the sign problem is primarily a property of the free fermion propagator, but repulsive/attractive pairwise interactions can shift the sign problem to larger/smaller imaginary time but do not make it more severe than the non-interacting case. More surprisingly, one can prove analytically that the first closed-shell state in D dimension, with n = D + 1 fermions, has no sign problem at large imaginary time. Direct numerical simulations confirm that this is also true for higher closed-shell states in two and three dimensions. Fourth-order and newly found variable-bead algorithms are used to compute ground state energies of quantum dots with up to 110 electrons and are compared to results obtained by modern neural networks.
Quantum Monte Carlo simulations of quantum many-body systems are plagued by the Fermion sign problem. The computational complexity of simulating Fermions scales exponentially in the projection time β and system size. The sign problem is basis dependent and an improved basis, for fixed errors, leads to exponentially quicker simulations. We show how to use sign-free quantum Monte Carlo simulations to optimize over the choice of basis on large two-dimensional systems. We numerically illustrate these techniques decreasing the "badness" of the sign problem by optimizing over single-particle basis rotations on one- and two-dimensional Hubbard systems. We find a generic rotation which improves the average sign of the Hubbard model for a wide range of U and densities for L×4 systems. In one example improvement, the average sign (and hence simulation cost at fixed accuracy) for the 16×4 Hubbard model at U/t=4 and n=0.75 increases by exp[8.64(6)β]. For typical projection times of β⪆100, this accelerates such simulation by many orders of magnitude.
The path integral formulation of quantum mechanical problems including fermions is often affected by a severe numerical sign problem. We show how such a sign problem can be alleviated by a judiciously chosen constant imaginary offset to the path integral. Such integration contour deformations introduce no additional computational cost to the Hamiltonian Monte Carlo algorithm, while its effective sample size is greatly increased. This makes otherwise unviable simulations efficient for a wide range of parameters. Applying our method to the Hubbard model, we find that the sign problem is significantly reduced. Furthermore, we prove that it vanishes completely for large chemical potentials, a regime where the sign problem is expected to be particularly severe without imaginary offsets. In addition to a numerical analysis of such optimized contour shifts, we analytically compute the shifts corresponding to the leading and next-to-leading order corrections to the action. We find that such simple approximations, free of significant computational cost, suffice in many cases. We present a simulation of C60{\mathrm{C}}_{60}C60​ fullerenes (buckyballs) that are successful over a wide parameter range.
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.