Efficient Quantum Implementation of Dynamical Mean Field Theory for Correlated Materials
Norman Hogan, Efekan Kökcü, Thomas Steckmann, Liam P. Doak, Carlos Mejuto-Zaera, Daan Camps, Roel Van Beeumen, Wibe A. de Jong, A. F. Kemper
TL;DR
This work addresses the bottleneck of solving impurity dynamics in dynamical mean field theory (DMFT) for strongly correlated materials by presenting a quantum-classical framework that represents the impurity ground state as a sum of fermionic Gaussian states (FGS) and uses subspace diagonalization (SGS) to keep the heavy lifting on classical hardware while implementing a low-depth, algebraically compressed quantum time-evolution circuit to compute the impurity Green's function. The SGS leverages a low-energy subspace and allows reuse across DMFT iterations (via Eigenvector Continuation), while partial circuit compression exploits the free-fermionic nature of the bath to dramatically reduce gate counts, enabling practical hardware demonstrations. Hardware experiments on IBM devices (with $N_I=1$, $N_B=3$, i.e., 8 qubits plus ancilla) show that error mitigation and PSD de-noising/extension can recover the impurity GF signals, allowing reconstruction of the Matsubara GF $\mathcal{G}_{\text{imp}}(i\omega_n)$ for DMFT self-consistency. The approach offers a near-term path toward quantum advantage in embedding theories for correlated materials and can be extended to multi-impurity (cluster) DMFT and related quantum-embedded frameworks.
Abstract
The accurate theoretical description of materials with strongly correlated electrons is a formidable challenge in condensed matter physics and computational chemistry. Dynamical Mean Field Theory (DMFT) is a successful approach that predicts behaviors of such systems by incorporating some of the correlated behavior using an impurity model, but it is limited by the need to calculate the impurity Green's function. This work proposes a framework for DMFT calculations on quantum computers, focusing on near-term applications. It leverages the structure of the impurity problem, combining a low-rank Gaussian subspace representation of the ground state and a compressed, short-depth quantum circuit that joins state preparation with time evolution to compute Green's functions. We demonstrate the convergence of the DMFT algorithm using the Gaussian subspace in a noise-free setting, and show the hardware viability of circuit compression by extracting the impurity Green's function on IBM quantum processors for a single impurity coupled to three bath orbitals (8 qubits, 1 ancilla). We discuss potential paths toward realizing this quantum computing use case in materials science.
