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

Physics – Condensed Matter – Strongly Correlated Electrons

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

14 pages, 7 figures, to appear in Phys. Rev. B

Scientific paper

10.1103/PhysRevB.71.155115

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A sufficient condition for the absence of the sign problem in the fermionic quantum Monte-Carlo algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A sufficient condition for the absence of the sign problem in the fermionic quantum Monte-Carlo algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A sufficient condition for the absence of the sign problem in the fermionic quantum Monte-Carlo algorithm will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-158084

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.