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

Physical review. B./Physical review. B

Achieving optimal time scaling of Kadanoff-Baym equations for open systems

Y. Pavlyukh

Published Mar 16, 2026• 0 citations
Publisher
DOI
10.1103/473j-dx3m

Related papers

Stochastic Interpretation of Kadanoff–Baym Equations and Their Relation to Langevin Processes

Carsten Greiner, Stefan Leupold

arXiv:hep-ph/9802312•Annals of Physics•Dec 1, 1998•97 citations

Kadanoff–Baym Equations: History and Perspectives

International Conference on Progress in Nonequilibrium Green's Functions (PNGF)•May 1, 2000•0 citations

VARIATIONAL PRINCIPLE FOR LINEARIZED KADANOFF-BAYM EQUATIONS

Anatoly Yu. Zakharov

International Conference on Progress in Nonequilibrium Green's Functions (PNGF)•May 1, 2000•0 citations

Adaptive numerical solution of Kadanoff-Baym equations

Francisco Meirinhos, Michael Kajan, Johann Kroha +1 more

A time-stepping scheme with adaptivity in both the step size and the integration order is presented in the context of non-equilibrium dynamics described via Kadanoff-Baym equations. The accuracy and effectiveness of the algorithm are analysed by obtaining numerical solutions of exactly solvable models. We find a significant reduction in the number of time-steps compared to fixed-step methods. Due to the at least quadratic scaling of Kadanoff-Baym equations, reducing the amount of steps can dramatically increase the accessible integration time, opening the door for the study of long-time dynamics in interacting systems. A selection of illustrative examples is provided, among them interacting and open quantum systems as well as classical stochastic processes. An open-source implementation of our algorithm in the scientific-computing language Julia is made available.

arXiv:2110.04793•SciPost Physics Core•May 27, 2022•27 citations

Unimportance of memory for the time nonlocal components of the Kadanoff-Baym equations

Cian C. Reeves, Yuanran Zhu, Chao Yang +1 more

The generalized Kadanoff-Baym ansatz (GKBA) is an approximation to the Kadanoff-Baym equations (KBEs) that neglects certain memory effects that contribute to the Green's function at nonequal times. Here we present arguments and numerical results to demonstrate the practical insignificance of the quantities neglected when deriving the GKBA at conditions at which KBE and GKBA are appropriate. We provide a mathematical proof that places a scaling bound on the neglected terms, further reinforcing that these terms are typically small in comparison to terms that are kept in the GKBA. We perform calculations in a range of models, including different system sizes and filling fractions, as well as experimentally relevant nonequilibrium excitations. We find that both the GKBA and KBE capture the dynamics of interacting systems with moderate and even strong interactions well. We explicitly compute terms neglected in the GKBA approximation and show, in the scenarios tested here, that they are orders of magnitude smaller than the terms that are accounted for, i.e., they offer only a small correction when included in the full KBEs.

Physical review. B./Physical review. B•Sep 25, 2023•10 citations

NUMERICAL SOLUTIONS OF THE KADANOFF–BAYM EQUATIONS

Hannes Köhler, N. H. Kwong, Rolf H. Binder +2 more

International Conference on Progress in Nonequilibrium Green's Functions (PNGF)•May 1, 2000•1 citation
A time-stepping scheme with adaptivity in both the step size and the integration order is presented in the context of non-equilibrium dynamics described via Kadanoff-Baym equations. The accuracy and effectiveness of the algorithm are analysed by obtaining numerical solutions of exactly solvable models. We find a significant reduction in the number of time-steps compared to fixed-step methods. Due to the at least quadratic scaling of Kadanoff-Baym equations, reducing the amount of steps can dramatically increase the accessible integration time, opening the door for the study of long-time dynamics in interacting systems. A selection of illustrative examples is provided, among them interacting and open quantum systems as well as classical stochastic processes. An open-source implementation of our algorithm in the scientific-computing language Julia is made available.
The generalized Kadanoff-Baym ansatz (GKBA) is an approximation to the Kadanoff-Baym equations (KBEs) that neglects certain memory effects that contribute to the Green's function at nonequal times. Here we present arguments and numerical results to demonstrate the practical insignificance of the quantities neglected when deriving the GKBA at conditions at which KBE and GKBA are appropriate. We provide a mathematical proof that places a scaling bound on the neglected terms, further reinforcing that these terms are typically small in comparison to terms that are kept in the GKBA. We perform calculations in a range of models, including different system sizes and filling fractions, as well as experimentally relevant nonequilibrium excitations. We find that both the GKBA and KBE capture the dynamics of interacting systems with moderate and even strong interactions well. We explicitly compute terms neglected in the GKBA approximation and show, in the scenarios tested here, that they are orders of magnitude smaller than the terms that are accounted for, i.e., they offer only a small correction when included in the full KBEs.