Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 128 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 28 tok/s Pro
GPT-5 High 27 tok/s Pro
GPT-4o 86 tok/s Pro
Kimi K2 203 tok/s Pro
GPT OSS 120B 438 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Diagrammatic Monte Carlo Method for Impurity Models with General Interactions and Hybridizations (2004.00721v2)

Published 1 Apr 2020 in cond-mat.str-el and cond-mat.mtrl-sci

Abstract: We present a diagrammatic Monte Carlo method for quantum impurity problems with general interactions and general hybridization functions. Our method uses a recursive determinant scheme to sample diagrams for the scattering amplitude. Unlike in other methods for general impurity problems, an approximation of the continuous hybridization function by a finite number of bath states is not needed, and accessing low temperature does not incur an exponential cost. We test the method for the example of molecular systems, where we systematically vary temperature, interatomic distance, and basis set size. We further apply the method to an impurity problem generated by a self-energy embedding calculation of correlated antiferromagnetic NiO. We find that the method is ideal for quantum impurity problems with a large number of orbitals but only moderate correlations.

Citations (4)

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.