Generalized Spectral Decomposition for Quantum Impurity Problems
Jun-Bin Wang, Dongchen Huang, Yi-feng Yang
TL;DR
This work tackles the challenge of solving multi-impurity quantum impurity problems with a shared bath by introducing a general strategy to disentangle the bath into $N_A$ auxiliary baths via an $\omega$-independent transformation $w_{\mu p}$, recasting the problem as a spectral-decomposition of the matrix $\rho_{\mu\nu}(\omega)$. It establishes exact decompositions for highly symmetric cases: Theorem 1 handles regular $N$-gons with circulant symmetry, and Theorem 2 extends to block circulant matrices using $w^{(n)}\otimes U$, with extensions to $C_n\otimes C_m$; Theorem 3 further shows any configuration whose graph embeds into a larger circulant-symmetric graph can be exactly decomposed (potentially with $N_A>N$). When exact decomposition is impractical, a graph-based embedding approach or an approximate HOSVD-based decomposition (yielding a reduced set of auxiliary baths) enables tractable NRG calculations for realistic multi-impurity systems. Collectively, the paper provides a unifying framework linking quantum impurity problems to graph theory and offers concrete procedures to extend NRG to complex impurity configurations with controlled approximations.
Abstract
Solving quantum impurity problems may advance our understanding of strongly correlated electron physics, but its development in multi-impurity systems has been greatly hindered due to the presence of shared bath. Here, we propose a general operation strategy to disentangle the shared bath into multiple auxiliary baths and relate the problem to a spectral decomposition problem of function matrix for applying the numerical renormalization group (NRG). We prove exactly that such decomposition is possible for models satisfying (block) circulant symmetry, and show how to construct the auxiliary baths for arbitrary impurity configuration by mapping its graph structure to the subgraph of a regular impurity configuration. We further propose an approximate decomposition algorithm to reduce the number of auxiliary baths and save the computational workload. Our work reveals a deep connection between quantum impurity problems and the graph theory, and provides a general scheme to extend the NRG applications for realistic multi-impurity systems.
