A Multi-level Algorithm for Quantum-impurity Models

Physics – Condensed Matter – Strongly Correlated Electrons

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages, 8 figures

Scientific paper

10.1103/PhysRevE.71.036708

A continuous-time path integral Quantum Monte Carlo method using the directed-loop algorithm is developed to simulate the Anderson single-impurity model in the occupation number basis. Although the method suffers from a sign problem at low temperatures, the new algorithm has many advantages over conventional algorithms. For example, the model can be easily simulated in the Kondo limit without time discretization errors. Further, many observables including the impurity susceptibility and a variety of fermionic observables can be calculated efficiently. Finally the new approach allows us to explore a general technique, called the multi-level algorithm, to solve the sign problem. We find that the multi-level algorithm is able to generate an exponentially large number of configurations with an effort that grows as a polynomial in inverse temperature such that configurations with a positive sign dominate over those with negative signs. Our algorithm can be easily generalized to other multi-impurity problems.

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 Multi-level Algorithm for Quantum-impurity Models 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 Multi-level Algorithm for Quantum-impurity Models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Multi-level Algorithm for Quantum-impurity Models will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-500339

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