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:1408.5056 · Physical review. B./Physical review. B

Unifying time evolution and optimization with matrix product states

Jutho Haegeman, Christian Lubich, Ivan Valer'evich Oseledets, Bart Vandereycken, Frank Verstraete

Published Oct 10, 2016• 800 citations
arXivHTMLPDF

Abstract

We show that the time-dependent variational principle provides a unifying framework for time-evolution methods and optimization methods in the context of matrix product states. In particular, we introduce a new integration scheme for studying time evolution, which can cope with arbitrary Hamiltonians, including those with long-range interactions. Rather than a Suzuki-Trotter splitting of the Hamiltonian, which is the idea behind the adaptive time-dependent density matrix renormalization group method or time-evolving block decimation, our method is based on splitting the projector onto the matrix product state tangent space as it appears in the Dirac-Frenkel time-dependent variational principle. We discuss how the resulting algorithm resembles the density matrix renormalization group (DMRG) algorithm for finding ground states so closely that it can be implemented by changing just a few lines of code and it inherits the same stability and efficiency. In particular, our method is compatible with any Hamiltonian for which ground-state DMRG can be implemented efficiently. In fact, DMRG is obtained as a special case of our scheme for imaginary time evolution with infinite time step.

DOI
10.1103/physrevb.94.165116

Related papers

Time-dependent density-matrix renormalization-group using adaptive effective Hilbert spaces

Andrew J. Daley, Corinna Kollath, Ulrich Schollwöck +1 more

An algorithm for the simulation of the evolution of slightly entangled quantum states has been recently proposed as a tool to study time-dependent phenomena in one-dimensional quantum systems. Its key feature is a time-evolving block-decimation (TEBD) procedure to identify and dynamically update the relevant, conveniently small, subregion of the otherwise exponentially large Hilbert space. Potential applications of the TEBD algorithm are the simulation of time-dependent Hamiltonians, transport in quantum systems far from equilibrium and dissipative quantum mechanics. In this paper we translate the TEBD algorithm into the language of matrix product states in order to both highlight and exploit its resemblances to the widely used density-matrix renormalization-group (DMRG) algorithms. The TEBD algorithm, being based on updating a matrix product state in time, is very accessible to the DMRG community and it can be enhanced by using well-known DMRG techniques, for instance in the event of good quantum numbers. More importantly, we show how it can be simply incorporated into existing DMRG implementations to produce a remarkably effective and versatile ‘adaptive time-dependent DMRG’ variant, that we also test and compare to previous proposals.

arXiv:cond-mat/0403313•Journal of Statistical Mechanics Theory and Experiment•Apr 1, 2004•1,155 citations

Variational optimization algorithms for uniform matrix product states

Valentin Zauner-Stauber, Laurens Vanderstraeten, Matthew Fishman +2 more

We combine the density matrix renormalization group (DMRG) with matrix product state tangent space concepts to construct a variational algorithm for finding ground states of one-dimensional quantum lattices in the thermodynamic limit. A careful comparison of this variational uniform matrix product state algorithm (VUMPS) with infinite density matrix renormalization group (IDMRG) and with infinite time evolving block decimation (ITEBD) reveals substantial gains in convergence speed and precision. We also demonstrate that VUMPS works very efficiently for Hamiltonians with long-range interactions and also for the simulation of two-dimensional models on infinite cylinders. The new algorithm can be conveniently implemented as an extension of an already existing DMRG implementation.

arXiv:1701.07035•Physical review. B./Physical review. B•Jan 25, 2018•267 citations

Diversifying time evolution of matrix product states using BUGs

Kornél Kapás, Dominik Sulz, Charlotte Verhoeven +3 more

Time evolution of tensor-network states is a central tool for studying nonequilibrium dynamics in strongly correlated quantum systems. In the past decade, using the time-dependent variational principle (TDVP) discretized by projector-splitting has become the gold standard for evolving matrix product states (MPS) with long-range Hamiltonians. More recently, a conceptually different class of discretizations of the TDVP, the class of Basis Update and Galerkin (BUG) integrators, has been developed within the framework of dynamical low-rank approximation, offering an alternative, more flexible approach. In this work, we formulate two BUG integrators explicitly for MPS. The BUG integrators result in "single-site" MPS integrators that are robust with respect to small singular values, avoid backward-in-time substeps, and naturally allow for the adaptive choice of bond dimensions. We consider the augmented BUG integrator of first order and the midpoint BUG integrator of second order and clarify their relation to the projector-splitting discretization of the TDVP. Using representative models of strongly correlated quantum systems, like the XY spin model with long-range interaction and two-dimensional lattice models of fermions and spins of various lengths, we perform a systematic numerical comparison between BUG and projector-splitting time discretizations of the continuous-time TDVP, focusing on scalability, numerical complexity, and accuracy. We find that BUG integrators, due to their reduced numerical cost and the flexibility of the concept, provide a competitive and, in certain regimes, advantageous alternative to the well-established time-stepping by projector-splitting in TDVP, especially in models with large local dimensions, and in cases where observables are extracted with high temporal resolution.

cond-mat.str-elCross-listedarXiv:2609.12848•Sep 14, 2026•0 citations

Parallel time-dependent variational principle algorithm for matrix product states

Paul Secular, Nikita Gourianov, Michael Lubasch +3 more

Combining the time-dependent variational principle (TDVP) algorithm with the parallelization scheme introduced by Stoudenmire and White for the density matrix renormalization group (DMRG), we present the first parallel matrix product state (MPS) algorithm capable of time evolving one-dimensional (1D) quantum lattice systems with long-range interactions. We benchmark the accuracy and performance of the algorithm by simulating quenches in the long-range Ising and XY models. We show that our code scales well up to 32 processes, with parallel efficiencies as high as $86%$. Finally, we calculate the dynamical correlation function of a 201-site Heisenberg XXX spin chain with $1/{r}^{2}$ interactions, which is challenging to compute sequentially. These results pave the way for the application of tensor networks to increasingly complex many-body systems.

arXiv:1912.06127•Physical review. B./Physical review. B•Jun 5, 2020•40 citations

Large-Scale Quantum Dynamics with Matrix Product States

Alberto Baiardi, Markus Reiher

Dynamical electronic- and vibrational-structure theories have received a growing interest in the past few years due to their ability to simulate spectra recorded with ultrafast experimental techniques. The exact time evolution of a molecular system can, in principle, be obtained from the time-dependent version of full configuration interaction. Such an approach is, however, limited to few-atom systems due to the exponential increase of its cost with the system dimension. In the present work, we overcome this unfavorable scaling by employing the time-dependent density matrix renormalization group (TD-DMRG) which parametrizes the time-dependent wave function as a matrix product state. The time-dependent Schrödinger equation is then integrated with a sweep-based algorithm, as in standard time-independent DMRG. Unlike other TD-DMRG approaches, the one presented here leads to a set of coupled equations that can be integrated exactly. The resulting theory enables us to study real- and imaginary-time evolutions of Hamiltonians comprising more than 20 degrees of freedom that are challenging for current state-of-the-art quantum dynamics algorithms. We apply our algorithm to the simulation of quantum dynamics of models of increasing complexity, ranging from simple excitonic Hamiltonians to more complex ab initio vibronic ones.

arXiv:1903.10622•Journal of Chemical Theory and Computation•May 8, 2019•105 citations

Time-Dependent Methods

Tao Xiang

This chapter introduces the method for solving time-dependent problems of quantum many-body systems. It includes the pace-keeping DMRG, time-evolving block decimation (TEBD), adaptive time-dependent DMRG, and folded transfer matrix methods. The pace-keeping DMRG, which solves the time-dependent Schrodinger equation, works independently of the dimensionality, nor the model Hamiltonian, with or without impurities. The time-evolving block decimation (TEBD) is more efficient than the pace-keeping DMRG if a one-dimensional Hamiltonian with the nearest-neighboring interactions is studied. The adaptive time-dependent DMRG provides an efficient scheme to implement TEBD with the skill of DMRG. On the other hand, the folded transfer matrix method handles the transfer matrix like TMRG by folding the transfer matrix so that the entanglement entropy along the positive and negative time evolution directions can partially cancel each other. This folding scheme significantly extends the time scale within which a time-dependent problem can be reliably investigated.

Cambridge University Press eBooks•Aug 31, 2023•0 citations
We show that the time-dependent variational principle provides a unifying framework for time-evolution methods and optimization methods in the context of matrix product states. In particular, we introduce a new integration scheme for studying time evolution, which can cope with arbitrary Hamiltonians, including those with long-range interactions. Rather than a Suzuki-Trotter splitting of the Hamiltonian, which is the idea behind the adaptive time-dependent density matrix renormalization group method or time-evolving block decimation, our method is based on splitting the projector onto the matrix product state tangent space as it appears in the Dirac-Frenkel time-dependent variational principle. We discuss how the resulting algorithm resembles the density matrix renormalization group (DMRG) algorithm for finding ground states so closely that it can be implemented by changing just a few lines of code and it inherits the same stability and efficiency. In particular, our method is compatible with any Hamiltonian for which ground-state DMRG can be implemented efficiently. In fact, DMRG is obtained as a special case of our scheme for imaginary time evolution with infinite time step.
An algorithm for the simulation of the evolution of slightly entangled quantum states has been recently proposed as a tool to study time-dependent phenomena in one-dimensional quantum systems. Its key feature is a time-evolving block-decimation (TEBD) procedure to identify and dynamically update the relevant, conveniently small, subregion of the otherwise exponentially large Hilbert space. Potential applications of the TEBD algorithm are the simulation of time-dependent Hamiltonians, transport in quantum systems far from equilibrium and dissipative quantum mechanics. In this paper we translate the TEBD algorithm into the language of matrix product states in order to both highlight and exploit its resemblances to the widely used density-matrix renormalization-group (DMRG) algorithms. The TEBD algorithm, being based on updating a matrix product state in time, is very accessible to the DMRG community and it can be enhanced by using well-known DMRG techniques, for instance in the event of good quantum numbers. More importantly, we show how it can be simply incorporated into existing DMRG implementations to produce a remarkably effective and versatile ‘adaptive time-dependent DMRG’ variant, that we also test and compare to previous proposals.
We combine the density matrix renormalization group (DMRG) with matrix product state tangent space concepts to construct a variational algorithm for finding ground states of one-dimensional quantum lattices in the thermodynamic limit. A careful comparison of this variational uniform matrix product state algorithm (VUMPS) with infinite density matrix renormalization group (IDMRG) and with infinite time evolving block decimation (ITEBD) reveals substantial gains in convergence speed and precision. We also demonstrate that VUMPS works very efficiently for Hamiltonians with long-range interactions and also for the simulation of two-dimensional models on infinite cylinders. The new algorithm can be conveniently implemented as an extension of an already existing DMRG implementation.
Time evolution of tensor-network states is a central tool for studying nonequilibrium dynamics in strongly correlated quantum systems. In the past decade, using the time-dependent variational principle (TDVP) discretized by projector-splitting has become the gold standard for evolving matrix product states (MPS) with long-range Hamiltonians. More recently, a conceptually different class of discretizations of the TDVP, the class of Basis Update and Galerkin (BUG) integrators, has been developed within the framework of dynamical low-rank approximation, offering an alternative, more flexible approach. In this work, we formulate two BUG integrators explicitly for MPS. The BUG integrators result in "single-site" MPS integrators that are robust with respect to small singular values, avoid backward-in-time substeps, and naturally allow for the adaptive choice of bond dimensions. We consider the augmented BUG integrator of first order and the midpoint BUG integrator of second order and clarify their relation to the projector-splitting discretization of the TDVP. Using representative models of strongly correlated quantum systems, like the XY spin model with long-range interaction and two-dimensional lattice models of fermions and spins of various lengths, we perform a systematic numerical comparison between BUG and projector-splitting time discretizations of the continuous-time TDVP, focusing on scalability, numerical complexity, and accuracy. We find that BUG integrators, due to their reduced numerical cost and the flexibility of the concept, provide a competitive and, in certain regimes, advantageous alternative to the well-established time-stepping by projector-splitting in TDVP, especially in models with large local dimensions, and in cases where observables are extracted with high temporal resolution.
Combining the time-dependent variational principle (TDVP) algorithm with the parallelization scheme introduced by Stoudenmire and White for the density matrix renormalization group (DMRG), we present the first parallel matrix product state (MPS) algorithm capable of time evolving one-dimensional (1D) quantum lattice systems with long-range interactions. We benchmark the accuracy and performance of the algorithm by simulating quenches in the long-range Ising and XY models. We show that our code scales well up to 32 processes, with parallel efficiencies as high as 8686%86. Finally, we calculate the dynamical correlation function of a 201-site Heisenberg XXX spin chain with 1/r21/{r}^{2}1/r2 interactions, which is challenging to compute sequentially. These results pave the way for the application of tensor networks to increasingly complex many-body systems.
Dynamical electronic- and vibrational-structure theories have received a growing interest in the past few years due to their ability to simulate spectra recorded with ultrafast experimental techniques. The exact time evolution of a molecular system can, in principle, be obtained from the time-dependent version of full configuration interaction. Such an approach is, however, limited to few-atom systems due to the exponential increase of its cost with the system dimension. In the present work, we overcome this unfavorable scaling by employing the time-dependent density matrix renormalization group (TD-DMRG) which parametrizes the time-dependent wave function as a matrix product state. The time-dependent Schrödinger equation is then integrated with a sweep-based algorithm, as in standard time-independent DMRG. Unlike other TD-DMRG approaches, the one presented here leads to a set of coupled equations that can be integrated exactly. The resulting theory enables us to study real- and imaginary-time evolutions of Hamiltonians comprising more than 20 degrees of freedom that are challenging for current state-of-the-art quantum dynamics algorithms. We apply our algorithm to the simulation of quantum dynamics of models of increasing complexity, ranging from simple excitonic Hamiltonians to more complex ab initio vibronic ones.
This chapter introduces the method for solving time-dependent problems of quantum many-body systems. It includes the pace-keeping DMRG, time-evolving block decimation (TEBD), adaptive time-dependent DMRG, and folded transfer matrix methods. The pace-keeping DMRG, which solves the time-dependent Schrodinger equation, works independently of the dimensionality, nor the model Hamiltonian, with or without impurities. The time-evolving block decimation (TEBD) is more efficient than the pace-keeping DMRG if a one-dimensional Hamiltonian with the nearest-neighboring interactions is studied. The adaptive time-dependent DMRG provides an efficient scheme to implement TEBD with the skill of DMRG. On the other hand, the folded transfer matrix method handles the transfer matrix like TMRG by folding the transfer matrix so that the entanglement entropy along the positive and negative time evolution directions can partially cancel each other. This folding scheme significantly extends the time scale within which a time-dependent problem can be reliably investigated.