On the Sign Problem in the Hirsch-Fye Algorithm for Impurity Problems

Details On the Sign Problem in the Hirsch-Fye Algorithm for Impurity Problems On the Sign Problem in the Hirsch-Fye Algorithm for Impurity Problems

2004-12-31

arxiv.org/abs/cond-mat/0412771v2

J. Phys. A: Math. Gen. 38 (2005) 10307-10310

Physics

Condensed Matter

Strongly Correlated Electrons

2 pages, no figure; published version

Scientific paper

10.1088/0305-4470/38/48/004

We show that there is no fermion sign problem in the Hirsch and Fye algorithm for the single-impurity Anderson model. Beyond the particle-hole symmetric case for which a simple proof exists, this has been known only empirically. Here we prove the nonexistence of a sign problem for the general case by showing that each spin trace for a given Ising configuration is separately positive. We further use this insight to analyze under what conditions orbitally degenerate Anderson models or the two-impurity Anderson model develop a sign.

Affiliated with

Also associated with

No associations

Rating

On the Sign Problem in the Hirsch-Fye Algorithm for Impurity Problems 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 On the Sign Problem in the Hirsch-Fye Algorithm for Impurity Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Sign Problem in the Hirsch-Fye Algorithm for Impurity Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-346747