Abstract
The development of polynomial cost solvers for correlated quantum impurity models, with controllable errors, is a central challenge in quantum many-body physics, where these models find applications ranging from nano-science to the dynamical mean-field theory (DMFT). Here we describe how configuration interaction (CI) approximations to exact diagonalization (ED) may be used as solvers in DMFT. CI approximations retain the main advantages of ED, such as the ability to treat general interactions and off-diagonal hybridizations and to obtain real spectral information, but are of polynomial cost. Furthermore, their errors can be controlled by monitoring the convergence of physical quantities as a function of the CI hierarchy. Using benchmark DMFT applications, such as single-site DMFT of the 1D Hubbard model and $2\times 2$ cluster DMFT of the 2D Hubbard model, we show that CI approximations allow us to obtain near-exact ED results for a tiny fraction of the cost. This is true over the entire range of interaction strengths including "difficult" regimes, such as in the pseudogap phase of the 2D Hubbard model. We use the ability of CI approximations to treat large numbers of orbitals to demonstrate convergence of the bath representation in the $2\times 2$ cluster DMFT using a 24 bath orbital representation. CI approximations thus form a promising route to extend ED to problems that are currently difficult to study using other solvers such as continuous-time quantum Monte Carlo, including impurity models with large numbers of orbitals and general interactions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.