Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2110.06120 · Advances in Computational Mathematics

A fast time domain solver for the equilibrium Dyson equation

Jason Kaye, Hugo U. R. Strand

Published Aug 1, 2023• 24 citations
arXivHTMLPDF

Abstract

Abstract We consider the numerical solution of the real-time equilibrium Dyson equation, which is used in calculations of the dynamical properties of quantum many-body systems. We show that this equation can be written as a system of coupled, nonlinear, convolutional Volterra integro-differential equations, for which the kernel depends self-consistently on the solution. As is typical in the numerical solution of Volterra-type equations, the computational bottleneck is the quadratic-scaling cost of history integration. However, the structure of the nonlinear Volterra integral operator precludes the use of standard fast algorithms. We propose a quasilinear-scaling FFT-based algorithm which respects the structure of the nonlinear integral operator. The resulting method can reach large propagation times and is thus well-suited to explore quantum many-body phenomena at low energy scales. We demonstrate the solver with two standard model systems: the Bethe graph and the Sachdev-Ye-Kitaev model.

DOI
10.1007/s10444-023-10067-7

Related papers

Low rank compression in the numerical solution of the nonequilibrium Dyson equation

Jason Kaye, Denis Golež

We propose a method to improve the computational and memory efficiency of numerical solvers for the nonequilibrium Dyson equation in the Keldysh formalism. It is based on the empirical observation that the nonequilibrium Green's functions and self energies arising in many problems of physical interest, discretized as matrices, have low rank off-diagonal blocks, and can therefore be compressed using a hierarchical low rank data structure. We describe an efficient algorithm to build this compressed representation on the fly during the course of time stepping, and use the representation to reduce the cost of computing history integrals, which is the main computational bottleneck. For systems with the hierarchical low rank property, our method reduces the computational complexity of solving the nonequilibrium Dyson equation from cubic to near quadratic, and the memory complexity from quadratic to near linear. We demonstrate the full solver for the Falicov-Kimball model exposed to a rapid ramp and Floquet driving of system parameters, and are able to increase feasible propagation times substantially. We present examples with 262 144 time steps, which would require approximately five months of computing time and 2.2 TB of memory using the direct time stepping method, but can be completed in just over a day on a laptop with less than 4 GB of memory using our method. We also confirm the hierarchical low rank property for the driven Hubbard model in the weak coupling regime within the GW approximation, and in the strong coupling regime within dynamical mean-field theory.

arXiv:2010.06511•SciPost Physics•Apr 26, 2021•66 citations

Quantum simulation of non-Markovian dynamical systems

Abtin Ameri, Arkopal Dutt, Hari Krovi

Existing quantum algorithms for simulating dynamical systems -- from Hamiltonian simulation to linear and nonlinear differential equations solvers -- simulate Markovian dynamics, in which the system's future evolution depends solely on its current state. We turn our attention to developing quantum algorithms for non-Markovian dynamical systems where the system's future evolution depends on its past history and thus has memory. Specifically, we develop efficient algorithms for linear Volterra integro-differential equations (VIDEs) with a convolution memory kernel that output a quantum state encoding the state description over a time interval or at a particular time. Given efficient circuits for the problem inputs, our algorithms achieve an exponential speedup in system size over existing classical algorithms. We develop an algorithm for general kernels assuming that $\textsf{M} < 1$, where $\textsf{M}$ characterizes the strength of the memory term relative to the dissipation of the Markovian part of the dynamics. We complement this with lower bounds for general-kernel VIDEs when $\textsf{M} \geq 1$, showing that the problem becomes intractable for a family of systems. However, by specializing to structured kernels which admit concise decompositions over exponentials, we develop efficient quantum algorithms even when $\textsf M \geq 1$ by converting the VIDE into a larger set of ODEs, a procedure which we call Markovianization. As an application of the overall framework, we discuss the Mori-Zwanzig formalism used in open quantum systems and fluid dynamics. Overall, our results expand the range of dynamical systems that quantum computers can simulate efficiently.

quant-pharXiv:2608.13533•Aug 14, 2026•2 citations

Legendre-spectral Dyson equation solver with super-exponential convergence

Xinyang Dong, Dominika Zgid, Emanuel Gull +1 more

Quantum many-body systems in thermal equilibrium can be described by the imaginary time Green’s function formalism. However, the treatment of large molecular or solid ab initio problems with a fully realistic Hamiltonian in large basis sets is hampered by the storage of the Green’s function and the precision of the solution of the Dyson equation. We present a Legendre-spectral algorithm for solving the Dyson equation that addresses both of these issues. By formulating the algorithm in Legendre coefficient space, our method inherits the known faster-than-exponential convergence of the Green’s function’s Legendre series expansion. In this basis, the fast recursive method for Legendre polynomial convolution enables us to develop a Dyson equation solver with quadratic scaling. We present benchmarks of the algorithm by computing the dissociation energy of the helium dimer He2 within dressed second-order perturbation theory. For this system, the application of the Legendre spectral algorithm allows us to achieve an energy accuracy of 10−9Eh with only a few hundred expansion coefficients.

arXiv:2001.11603•The Journal of Chemical Physics•Apr 2, 2020•39 citations

Excitations and spectra from equilibrium real-time Green's functions

Xinyang Dong, Emanuel Gull, Hugo U. R. Strand

The real-time contour formalism for Green's functions provides time-dependent information of quantum many-body systems. In practice, the long-time simulation of systems with a wide range of energy scales is challenging due to both the storage requirements of the discretized Green's function and the computational cost of solving the Dyson equation. In this paper, we apply a real-time discretization based on a piecewise high-order orthogonal-polynomial expansion to address these issues. We present a superconvergent algorithm for solving the real-time equilibrium Dyson equation using the Legendre spectral method and the recursive algorithm for Legendre convolution. We show that the compact high-order discretization in combination with our Dyson solver enables long-time simulations using far fewer discretization points than needed in conventional multistep methods. As a proof of concept, we compute the molecular spectral functions of ${\mathrm{H}}_{2}$, LiH, ${\mathrm{He}}_{2}$, and ${\mathrm{C}}_{6}{\mathrm{H}}_{4}{\mathrm{O}}_{2}$ using self-consistent second-order perturbation theory and compare the results with standard quantum chemistry methods as well as the auxiliary second-order Green's function perturbation theory method.

arXiv:2206.04181•Physical review. B./Physical review. B•Sep 30, 2022•15 citations

Solving the transient Dyson equation with quasilinear complexity via matrix compression

Baptiste Lamic

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 results in quasilinear scaling of both time and space complexity with propagation time. This enables us to compute accurate solutions even for systems with multiple and disparate timescales. We benchmark our solver by simulating a voltage-biased Josephson junction formed by a quantum dot connected to two superconducting leads.

arXiv:2410.11057•Physical review. B./Physical review. B•Nov 14, 2025•5 citations

Approximate but accurate quantum dynamics from the Mori formalism. II. Equilibrium time correlation functions

Andrés Montoya−Castillo, David R. Reichman

The ability to efficiently and accurately calculate equilibrium time correlation functions of many-body condensed phase quantum systems is one of the outstanding problems in theoretical chemistry. The Nakajima-Zwanzig-Mori formalism coupled to the self-consistent solution of the memory kernel has recently proven to be highly successful for the computation of nonequilibrium dynamical averages. Here, we extend this formalism to treat symmetrized equilibrium time correlation functions for the spin-boson model. Following the first paper in this series [A. Montoya-Castillo and D. R. Reichman, J. Chem. Phys. 144, 184104 (2016)], we use a Dyson-type expansion of the projected propagator to obtain a self-consistent solution for the memory kernel that requires only the calculation of normally evolved auxiliary kernels. We employ the approximate mean-field Ehrenfest method to demonstrate the feasibility of this approach. Via comparison with numerically exact results for the correlation function Czz(t)=Re⟨σz(0)σz(t)⟩, we show that the current scheme affords remarkable boosts in accuracy and efficiency over bare Ehrenfest dynamics. We further explore the sensitivity of the resulting dynamics to the choice of kernel closures and the accuracy of the initial canonical density operator.

arXiv:1610.04242•The Journal of Chemical Physics•Feb 24, 2017•38 citations
Abstract We consider the numerical solution of the real-time equilibrium Dyson equation, which is used in calculations of the dynamical properties of quantum many-body systems. We show that this equation can be written as a system of coupled, nonlinear, convolutional Volterra integro-differential equations, for which the kernel depends self-consistently on the solution. As is typical in the numerical solution of Volterra-type equations, the computational bottleneck is the quadratic-scaling cost of history integration. However, the structure of the nonlinear Volterra integral operator precludes the use of standard fast algorithms. We propose a quasilinear-scaling FFT-based algorithm which respects the structure of the nonlinear integral operator. The resulting method can reach large propagation times and is thus well-suited to explore quantum many-body phenomena at low energy scales. We demonstrate the solver with two standard model systems: the Bethe graph and the Sachdev-Ye-Kitaev model.
We propose a method to improve the computational and memory efficiency of numerical solvers for the nonequilibrium Dyson equation in the Keldysh formalism. It is based on the empirical observation that the nonequilibrium Green's functions and self energies arising in many problems of physical interest, discretized as matrices, have low rank off-diagonal blocks, and can therefore be compressed using a hierarchical low rank data structure. We describe an efficient algorithm to build this compressed representation on the fly during the course of time stepping, and use the representation to reduce the cost of computing history integrals, which is the main computational bottleneck. For systems with the hierarchical low rank property, our method reduces the computational complexity of solving the nonequilibrium Dyson equation from cubic to near quadratic, and the memory complexity from quadratic to near linear. We demonstrate the full solver for the Falicov-Kimball model exposed to a rapid ramp and Floquet driving of system parameters, and are able to increase feasible propagation times substantially. We present examples with 262 144 time steps, which would require approximately five months of computing time and 2.2 TB of memory using the direct time stepping method, but can be completed in just over a day on a laptop with less than 4 GB of memory using our method. We also confirm the hierarchical low rank property for the driven Hubbard model in the weak coupling regime within the GW approximation, and in the strong coupling regime within dynamical mean-field theory.
Existing quantum algorithms for simulating dynamical systems -- from Hamiltonian simulation to linear and nonlinear differential equations solvers -- simulate Markovian dynamics, in which the system's future evolution depends solely on its current state. We turn our attention to developing quantum algorithms for non-Markovian dynamical systems where the system's future evolution depends on its past history and thus has memory. Specifically, we develop efficient algorithms for linear Volterra integro-differential equations (VIDEs) with a convolution memory kernel that output a quantum state encoding the state description over a time interval or at a particular time. Given efficient circuits for the problem inputs, our algorithms achieve an exponential speedup in system size over existing classical algorithms. We develop an algorithm for general kernels assuming that M<1\textsf{M} < 1M<1, where M\textsf{M}M characterizes the strength of the memory term relative to the dissipation of the Markovian part of the dynamics. We complement this with lower bounds for general-kernel VIDEs when M≥1\textsf{M} \geq 1M≥1, showing that the problem becomes intractable for a family of systems. However, by specializing to structured kernels which admit concise decompositions over exponentials, we develop efficient quantum algorithms even when M≥1\textsf M \geq 1M≥1 by converting the VIDE into a larger set of ODEs, a procedure which we call Markovianization. As an application of the overall framework, we discuss the Mori-Zwanzig formalism used in open quantum systems and fluid dynamics. Overall, our results expand the range of dynamical systems that quantum computers can simulate efficiently.
Quantum many-body systems in thermal equilibrium can be described by the imaginary time Green’s function formalism. However, the treatment of large molecular or solid ab initio problems with a fully realistic Hamiltonian in large basis sets is hampered by the storage of the Green’s function and the precision of the solution of the Dyson equation. We present a Legendre-spectral algorithm for solving the Dyson equation that addresses both of these issues. By formulating the algorithm in Legendre coefficient space, our method inherits the known faster-than-exponential convergence of the Green’s function’s Legendre series expansion. In this basis, the fast recursive method for Legendre polynomial convolution enables us to develop a Dyson equation solver with quadratic scaling. We present benchmarks of the algorithm by computing the dissociation energy of the helium dimer He2 within dressed second-order perturbation theory. For this system, the application of the Legendre spectral algorithm allows us to achieve an energy accuracy of 10−9Eh with only a few hundred expansion coefficients.
The real-time contour formalism for Green's functions provides time-dependent information of quantum many-body systems. In practice, the long-time simulation of systems with a wide range of energy scales is challenging due to both the storage requirements of the discretized Green's function and the computational cost of solving the Dyson equation. In this paper, we apply a real-time discretization based on a piecewise high-order orthogonal-polynomial expansion to address these issues. We present a superconvergent algorithm for solving the real-time equilibrium Dyson equation using the Legendre spectral method and the recursive algorithm for Legendre convolution. We show that the compact high-order discretization in combination with our Dyson solver enables long-time simulations using far fewer discretization points than needed in conventional multistep methods. As a proof of concept, we compute the molecular spectral functions of H2{\mathrm{H}}_{2}H2​, LiH, He2{\mathrm{He}}_{2}He2​, and C6H4O2{\mathrm{C}}_{6}{\mathrm{H}}_{4}{\mathrm{O}}_{2}C6​H4​O2​ using self-consistent second-order perturbation theory and compare the results with standard quantum chemistry methods as well as the auxiliary second-order Green's function perturbation theory method.
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 results in quasilinear scaling of both time and space complexity with propagation time. This enables us to compute accurate solutions even for systems with multiple and disparate timescales. We benchmark our solver by simulating a voltage-biased Josephson junction formed by a quantum dot connected to two superconducting leads.
The ability to efficiently and accurately calculate equilibrium time correlation functions of many-body condensed phase quantum systems is one of the outstanding problems in theoretical chemistry. The Nakajima-Zwanzig-Mori formalism coupled to the self-consistent solution of the memory kernel has recently proven to be highly successful for the computation of nonequilibrium dynamical averages. Here, we extend this formalism to treat symmetrized equilibrium time correlation functions for the spin-boson model. Following the first paper in this series [A. Montoya-Castillo and D. R. Reichman, J. Chem. Phys. 144, 184104 (2016)], we use a Dyson-type expansion of the projected propagator to obtain a self-consistent solution for the memory kernel that requires only the calculation of normally evolved auxiliary kernels. We employ the approximate mean-field Ehrenfest method to demonstrate the feasibility of this approach. Via comparison with numerically exact results for the correlation function Czz(t)=Re⟨σz(0)σz(t)⟩, we show that the current scheme affords remarkable boosts in accuracy and efficiency over bare Ehrenfest dynamics. We further explore the sensitivity of the resulting dynamics to the choice of kernel closures and the accuracy of the initial canonical density operator.