Faster randomized partial trace estimation
Tyler Chen, Robert Chen, Kevin Li, Skai Nzeuton, Yilu Pan, Yixin Wang
TL;DR
The paper tackles the computational bottleneck of obtaining reduced density matrices via partial traces in quantum systems where the total density matrix is exponentially large. It introduces a variance-reduced, matrix-free approach that deflates the top eigenmodes of the matrix function (notably $A=e^{-eta H}$) and employs a Lanczos-based partial-trace approximation to compute $ ext{tr}_{ ext{b}}(f(H))$ efficiently. The main contributions are a deflation-based variance reduction that yields orders-of-magnitude speedups over prior methods, a practical algorithm combining implicit partial-trace estimation with block-Lanczos deflation, and extensive numerical demonstrations on Heisenberg spin systems showing accurate entanglement spectra and ergotropy calculations. This work enables scalable thermodynamic and entanglement analyses of larger quantum many-body subsystems and highlights opportunities for cross-disciplinary collaboration between quantum physics and numerical linear algebra.
Abstract
We develop randomized matrix-free algorithms for estimating partial traces, a generalization of the trace arising in quantum physics and chemistry. Our algorithm improves on the typicality-based approach used in [T. Chen and Y-C. Cheng, \emph{Numerical computation of the equilibrium-reduced density matrix for strongly coupled open quantum systems}, J. Chem. Phys. 157, 064106 (2022)] by deflating important subspaces (e.g. corresponding to the low-energy eigenstates) explicitly. This results in a significant variance reduction, leading to several order-of-magnitude speedups over the previous state of the art. We then apply our algorithm to study the thermodynamics of several Heisenberg spin systems, particularly the entanglement spectrum and ergotropy.
