Solving the Transient Dyson Equation with Quasilinear Complexity via Matrix Compression
Baptiste Lamic
TL;DR
This work tackles the computational challenge of solving the out-of-equilibrium Dyson equation in the transient regime with widely separated timescales. It introduces a Nyström-based time discretization that recasts the Dyson equation into a compact matrix form in Keldysh space and leverages Hierarchically Semi-Separable (HSS) matrix compression to reduce complexity. The resulting solver achieves quasi-linear scaling $O(N \log N)$ in time and $O(r^2 N)$ in memory, enabling simulations of voltage-driven Josephson junctions that were previously intractable on a single CPU. Through benchmarks and convergence analysis, the authors demonstrate accuracy controlled by compression tolerances and discretization steps, with Richardson acceleration improving convergence, broadening the practical capacity for transient quantum transport studies and suggesting extensions to higher-order correlation functions in quantum field theories.
Abstract
We introduce a numerical strategy to efficiently solve the out-of-equilibrium Dyson equation in the transient regime. By discretizing the equation into a compact matrix form and applying state-of-the-art matrix compression techniques, we achieve significant improvements in computational efficiency, which result in quasi-linear scaling of both time and space complexity with propagation time. This enables to compute accurate solutions even for systems with multiple and disparate time scales. We benchmark our solver by simulating a voltage-biased Josephson junction formed by a quantum dot connected to two superconducting leads.
