Solving the Transient Dyson Equation with Quasilinear Complexity via Matrix Compression
Baptiste Lamic

TL;DR
This paper presents a novel numerical method that uses matrix compression to solve the transient Dyson equation efficiently, enabling simulations of complex quantum systems with multiple time scales.
Contribution
The authors develop a matrix compression-based approach that achieves quasi-linear complexity for solving the out-of-equilibrium Dyson equation in the transient regime.
Findings
Achieves significant computational efficiency improvements
Enables accurate simulations of systems with multiple time scales
Benchmarked on a voltage-biased Josephson junction
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum chaos and dynamical systems · Matrix Theory and Algorithms · Model Reduction and Neural Networks
