Sufficient condition for absence of the sign problem in the fermionic quantum Monte Carlo algorithm

  • Wu C
  • Zhang S
  • 38


    Mendeley users who have this article in their library.
  • 60


    Citations of this article.


Quantum Monte-Carlo (QMC) simulations involving fermions have the notorious sign problem. Some well-known exceptions of the auxiliary field QMC algorithm rely on the factorizibility of the fermion determinant. Recently, a fermionic QMC algorithm [1] has been found in which the fermion determinant may not necessarily factorizable, but can instead be expressed as a product of complex conjugate pairs of eigenvalues, thus eliminating the sign problem for a much wider class of models. In this paper, we present general conditions for the applicability of this algorithm and point out that it is deeply related to the time reversal symmetry of the fermion matrix. We apply this method to various models of strongly correlated systems at all doping levels and lattice geometries, and show that many novel phases can be simulated without the sign problem.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Congjun Wu

  • Shou Cheng Zhang

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free