A sufficient condition for the absence of the sign problem in the fermionic quantum Monte-Carlo algorithm

By Congjun Wu, Shoucheng Zhang. 2004

144 citations recorded by the source corpus.

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 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.

Subfields: Atomic and Molecular Physics, and Optics, Condensed Matter Physics

View Paper: https://www.semanticscholar.org/paper/13681848468c4481bfceeca8678778d53a00a9a6