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

Bulletin of the American Physical Society

On adaptive time-dependent DMRG based on Runge-Kutta methods

Adrian E. Feiguin

Published Mar 24, 2005• 0 citations
OpenAlex

Related papers

On adaptive time-dependent DMRG based on Trotter decompositions

Ulrich Schollwoeck

Bulletin of the American Physical Society•Mar 24, 2005•0 citations

Numerical assessment for accuracy and GPU acceleration of TD-DMRG time evolution schemes

Weitang Li, Jiajun Ren, Zhigang Shuai

The time dependent density matrix renormalization group (TD-DMRG) has become one of the cutting edge methods of quantum dynamics for complex systems. In this paper, we comparatively study the accuracy of three time evolution schemes in the TD-DMRG, the global propagation and compression method with the Runge-Kutta algorithm (P&C-RK), the time dependent variational principle based methods with the matrix unfolding algorithm (TDVP-MU), and with the projector-splitting algorithm (TDVP-PS), by performing benchmarks on the exciton dynamics of the Fenna-Matthews-Olson complex. We show that TDVP-MU and TDVP-PS yield the same result when the time step size is converged and they are more accurate than P&C-RK4, while TDVP-PS tolerates a larger time step size than TDVP-MU. We further adopt the graphical processing units to accelerate the heavy tensor contractions in the TD-DMRG, and it is able to speed up the TDVP-MU and TDVP-PS schemes by up to 73 times.

arXiv:1907.12044•The Journal of Chemical Physics•Jan 14, 2020•79 citations

Simulating Time-dependent Hamiltonian Based On High Order Runge-Kutta and Forward Euler Method

Nhat A. Nghiem

We propose a new method for simulating certain type of time-dependent Hamiltonian $H(t) = \sum_{i=1}^m γ_i(t) H_i$ where $γ_i(t)$ (and its higher order derivatives) is bounded, computable function of time $t$, and each $H_i$ is time-independent, and could be efficiently simulated. Our quantum algorithms are based on high-order Runge-Kutta method and forward Euler method, where the time interval is divided into subintervals. Then in an iterative manner, the evolution operator at given time step is built upon the evolution operator at previous time step, utilizing algorithmic operations from the recently introduced quantum singular value transformation framework.

arXiv:2410.14418•Oct 18, 2024•0 citations

New Perspectives for Time-Evolution with DMRG

Ulrich Schollwoeck

Bulletin of the American Physical Society•Mar 6, 2015•0 citations

RECENT APPLICATIONS OF THE DMRG METHOD

K. Hallberg

Recent Progress in Many-Body Theories•Jul 1, 2006•0 citations

Simultaneous integration of mixed quantum-classical systems by density matrix evolution equations using interaction representation and adaptive time step integrator

Marc Ferdinand Lensink, Janez Mavri, Herman J. C. Berendsen

A density matrix evolution method [H. J. C. Berendsen and J. Mavri, J. Phys. Chem., 97, 13464 (1993)] to simulate the dynamics of quantum systems embedded in a classical environment is applied to study the inelastic collisions of a classical particle with a five-level quantum harmonic oscillator. We improved the numerical performance by rewriting the Liouville-von Neumann equation in the interaction representation and so eliminated the frequencies of the unperturbed oscillator. Furthermore, replacement of the fixed time step fourth-order Runge-Kutta integrator with an adaptive step size control fourth-order Runge-Kutta resulted in significantly lower computational effort at the same desired accuracy. © 1996 by John Wiley & Sons, Inc.

Journal of Computational Chemistry•Aug 1, 1996•5 citations
The time dependent density matrix renormalization group (TD-DMRG) has become one of the cutting edge methods of quantum dynamics for complex systems. In this paper, we comparatively study the accuracy of three time evolution schemes in the TD-DMRG, the global propagation and compression method with the Runge-Kutta algorithm (P&C-RK), the time dependent variational principle based methods with the matrix unfolding algorithm (TDVP-MU), and with the projector-splitting algorithm (TDVP-PS), by performing benchmarks on the exciton dynamics of the Fenna-Matthews-Olson complex. We show that TDVP-MU and TDVP-PS yield the same result when the time step size is converged and they are more accurate than P&C-RK4, while TDVP-PS tolerates a larger time step size than TDVP-MU. We further adopt the graphical processing units to accelerate the heavy tensor contractions in the TD-DMRG, and it is able to speed up the TDVP-MU and TDVP-PS schemes by up to 73 times.
We propose a new method for simulating certain type of time-dependent Hamiltonian H(t)=∑i=1mγi(t)HiH(t) = \sum_{i=1}^m γ_i(t) H_iH(t)=∑i=1m​γi​(t)Hi​ where γi(t)γ_i(t)γi​(t) (and its higher order derivatives) is bounded, computable function of time ttt, and each HiH_iHi​ is time-independent, and could be efficiently simulated. Our quantum algorithms are based on high-order Runge-Kutta method and forward Euler method, where the time interval is divided into subintervals. Then in an iterative manner, the evolution operator at given time step is built upon the evolution operator at previous time step, utilizing algorithmic operations from the recently introduced quantum singular value transformation framework.
A density matrix evolution method [H. J. C. Berendsen and J. Mavri, J. Phys. Chem., 97, 13464 (1993)] to simulate the dynamics of quantum systems embedded in a classical environment is applied to study the inelastic collisions of a classical particle with a five-level quantum harmonic oscillator. We improved the numerical performance by rewriting the Liouville-von Neumann equation in the interaction representation and so eliminated the frequencies of the unperturbed oscillator. Furthermore, replacement of the fixed time step fourth-order Runge-Kutta integrator with an adaptive step size control fourth-order Runge-Kutta resulted in significantly lower computational effort at the same desired accuracy. © 1996 by John Wiley & Sons, Inc.