Cluster Algorithms for Quantum Impurity Models and Mesoscopic Kondo Physics

Physics – Condensed Matter – Mesoscale and Nanoscale Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

4 pages, 3 figures

Scientific paper

10.1103/PhysRevB.71.201309

Nanoscale physics and dynamical mean field theory have both generated increased interest in complex quantum impurity problems and so have focused attention on the need for flexible quantum impurity solvers. Here we demonstrate that the mapping of single quantum impurity problems onto spin-chains can be exploited to yield a powerful and extremely flexible impurity solver. We implement this cluster algorithm explicitly for the Anderson and Kondo Hamiltonians, and illustrate its use in the ``mesoscopic Kondo problem''. To study universal Kondo physics, a large ratio between the effective bandwidth $D_\mathrm{eff}$ and the temperature $T$ is required; our cluster algorithm treats the mesoscopic fluctuations exactly while being able to approach the large $D_\mathrm{eff}/T$ limit with ease. We emphasize that the flexibility of our method allows it to tackle a wide variety of quantum impurity problems; thus, it may also be relevant to the dynamical mean field theory of lattice 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

Cluster Algorithms for Quantum Impurity Models and Mesoscopic Kondo Physics 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 Cluster Algorithms for Quantum Impurity Models and Mesoscopic Kondo Physics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cluster Algorithms for Quantum Impurity Models and Mesoscopic Kondo Physics will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-87094

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