Scalable tensor network algorithm for quantum impurity problems
Zhijie Sun, Ruofan Chen, Zhenyu Li, Chu Guo
TL;DR
This work tackles the exponential scaling of GTEMPO when treating many impurity flavors by introducing a multi-flavor extension that integrates out nonessential flavors to form reduced augmented density tensors for two-point observables. The method builds on the impurity path integral and uses reduced ADTs A_pq, computed with on-the-fly zipup contractions and controlled by bond dimensions \\chi and \\chi_2, to obtain accurate Matsubara Green's functions for up to three orbitals (six flavors). Across Toulouse, single-, and multi-orbital Anderson-like models, the approach achieves CTQMC-level accuracy with modest \\chi and \\chi_2, and converges DMFT iterations on the Bethe lattice with errors around 10^-5 to 10^-2, demonstrating scalable applicability to large-scale quantum impurity problems. The results suggest that, due to partial integration of unused flavors, the method preserves accuracy while mitigating the exponential cost, and it holds promise for real-time and non-equilibrium impurity simulations on larger systems.
Abstract
The Grassmann time-evolving matrix product operator method has shown great potential as a general-purpose quantum impurity solver, as its numerical errors can be well-controlled and it is flexible to be applied on both the imaginary- and real-time axis. However, a major limitation of it is that its computational cost grows exponentially with the number of impurity flavors. In this work, we propose a multi-flavor extension of it to overcome this limitation. The key insight is that to calculate multi-time correlation functions on one or a few impurity flavors, one could integrate out the degrees of freedom of the rest flavors before hand, which could greatly simplify the calculation. The idea is particularly effective for quantum impurity problems with diagonal hybridization function, i.e., each impurity flavor is coupled to an independent bath, a setting which is commonly used in the field. We demonstrate the accuracy and scalability of our method for the imaginary time evolution of impurity problems with up to three impurity orbitals, i.e., 6 flavors, and benchmark our results against continuous-time quantum Monte Carlo calculations. Our method paves the way of scaling up tensor network algorithms to solve large-scale quantum impurity problems.
