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:2201.10291 · SIAM Journal on Numerical Analysis

Rank-Adaptive Time Integration of Tree Tensor Networks

Gianluca Ceruti, Christian Lubich, Dominik Sulz

Published Feb 22, 2023• 23 citations
arXivHTMLPDF

Abstract

Abstract. A rank-adaptive integrator for the approximate solution of high-order tensor differential equations by tree tensor networks is proposed and analyzed. In a recursion from the leaves to the root, the integrator updates bases and then evolves connection tensors by a Galerkin method in the augmented subspace spanned by the new and old bases. This is followed by rank truncation within a specified error tolerance. The memory requirements are linear in the order of the tensor and linear in the maximal mode dimension. The integrator is robust to small singular values of matricizations of the connection tensors. Up to the rank truncation error, which is controlled by the given error tolerance, the integrator preserves norm and energy for Schrödinger equations, and it dissipates the energy in gradient systems. Numerical experiments with a basic quantum spin system illustrate the behavior of the proposed algorithm.

DOI
10.1137/22m1473790

Related papers

A Parallel Basis Update and Galerkin Integrator for Tree Tensor Networks

Gianluca Ceruti, Jonas Kusch, Christian Lubich +1 more

Abstract. Computing the numerical solution to high-dimensional tensor differential equations can lead to prohibitive computational costs and memory requirements. To reduce the memory and computational footprint, dynamical low-rank approximation (DLRA) has proven to be a promising approach. DLRA represents the solution as a low-rank tensor factorization and evolves the resulting low-rank factors in time. A central challenge in DLRA is to find time integration schemes that are robust to the arising small singular values. A robust parallel basis update and Galerkin integrator, which simultaneously evolves all low-rank factors, has recently been derived for matrix differential equations. This work extends the parallel low-rank matrix integrator to Tucker tensors and general tree tensor networks, yielding an algorithm in which all bases and connecting tensors are evolved in parallel over a time step. We formulate the algorithm, provide a robust error bound, and demonstrate the efficiency of the new integrators for problems in quantum many-body physics, uncertainty quantification, and radiative transfer. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/JonasKu/Publication-Parallel-BUG-for-TTNs and in the supplementary materials ( Publication-Parallel-BUG-for-TTNs-main.zip [112 KB]). [Formula: see text]

arXiv:2412.00858•SIAM Journal on Scientific Computing•Jan 2, 2026•1 citation

Dynamical Simulations of Schrödinger's Equation via Rank-Adaptive Tensor Decompositions

N. Anders Petersson, Chase Hodges-Heilmann, Stefanie Günther

We study low-rank tensor methods for the numerical solution of Schrödinger's equation with time-independent and explicitly time-dependent Hamiltonians, motivated by large-scale simulations of many-body quantum systems and quantum computing devices subject to time-dependent control pulses. We outline the recent application of the "basis update and Galerkin" (BUG) method for tensor trains, and describe the established TDVP and TDVP-2 algorithms based on the time-dependent variational principle. For comparison, we also consider the BUG method in the Tucker format. All these approaches enable memory efficient representations of partially entangled quantum states and thereby mitigate the exponential cost of conventional state-vector formulations. The rank-adaptivity relies on the truncated singular value decomposition, in which the rank of a matrix is reduced by setting its smallest singular values to zero, based on a threshold parameter that controls the truncation error. Numerical experiments on representative time-independent and time-dependent Hamiltonian models quantify the tradeoff between accuracy and compression across methods, with particular attention to the interplay between the time-step and the truncation threshold, and how the computational effort scales with the number of sub-systems in the quantum system.

quant-pharXiv:2603.13990•Mar 17, 2026•0 citations

Time Integration of Rank-Constrained Tucker Tensors

Christian Lubich, Bart Vandereycken, Hanna Walach

Dynamical low-rank approximation in the Tucker tensor format of given large time-dependent tensors and of tensor differential equations is the subject of this paper. In particular, a discrete time integration method for rank-constrained Tucker tensors is presented and analyzed. It extends the known projector-splitting integrator for dynamical low-rank approximation of matrices to Tucker tensors and is shown to inherit the same favorable properties. The integrator is based on iteratively applying the matrix projector-splitting integrator to tensor unfoldings but with inexact solution in a substep. It has the property that it reconstructs time-dependent Tucker tensors of the given rank exactly. The integrator is also shown to be robust to the presence of small singular values in the tensor unfoldings. Numerical examples with time-dependent problems from quantum physics and tensor optimization methods illustrate our theoretical results.

arXiv:1709.02594•SIAM Journal on Numerical Analysis•Jan 1, 2018•43 citations

Time integration of tensor trains

Christian Lubich, Ivan Valer'evich Oseledets, Bart Vandereycken

Abstract. A robust and efficient time integrator for dynamical tensor approximation in the tensor train or matrix product state format is presented. The method is based on splitting the projector onto the tangent space of the tensor manifold. The algorithm can be used for updating time-dependent tensors in the given data-sparse tensor train / matrix product state format and for computing an approximate solution to high-dimensional tensor differential equations within this data-sparse format. The formulation, implementation and theoretical properties of the proposed integrator are studied, and numerical experiments with problems from quantum molecular dynamics and with iterative processes in the tensor train format are included. Key words. Tensor train, matrix product state, low-rank approximation, time-varying tensors, tensor differential equations, splitting integrator. AMS subject classifications. 15A18,15A69,65F99,65L05 1. Introduction. In

•Aug 17, 2016•159 citations

Time Integration in the Multiconfiguration Time-Dependent Hartree Method of Molecular Quantum Dynamics

Christian Lubich

A numerical integrator is proposed for solving the multiconfiguration time-dependent Hartree (MCTDH) equations of motion, which are widely used in computations of molecular quantum dynamics. In contrast to existing integrators, the proposed algorithm does not require inverses of ill-conditioned density matrices and obviates the need for their regularization, allowing for large stepsizes also in the case of near-singular density matrices. The nonlinear MCTDH equations are split into a chain of linear differential equations that can all be efficiently solved by Lanczos approximations to the action of Hermitian-matrix exponentials, alternating with orthogonal matrix decompositions. The integrator is an extension to the Tucker tensor format of recently proposed projector-splitting integrators for the dynamical low-rank approximation by matrices and tensor trains (or matrix product states). The integrator is time-reversible and preserves both the norm and the total energy.

Applied Mathematics Research eXpress•Jan 1, 2015•70 citations

Low-Rank Tree Tensor Network Operators for Long-Range Pairwise Interactions

Gianluca Ceruti, Daniel Kreßner, Dominik Sulz

Abstract. Compactly representing and efficently applying linear operators are fundamental ingredients in tensor network methods for simulating quantum many-body problems and solving high-dimensional problems in scientific computing. In this work, we study such representations for tree tensor networks, the so-called tree tensor network operators (TTNOs), paying particular attention to Hamiltonian operators that involve long-range pairwise interactions between particles. Generalizing the work by Lin, Tong, and others on matrix product operators, we establish a direct connection between the hierarchical low-rank structure of the interaction matrix and the TTNO property. This connection allows us to arrive at very compact TTNO representations by compressing the interaction matrix into a hierarchically semiseparable matrix. Numerical experiments for different quantum spin systems validate our results and highlight the potential advantages of TTNOs over matrix product operators.

arXiv:2405.09952•SIAM Journal on Scientific Computing•Aug 1, 2025•4 citations
Abstract. A rank-adaptive integrator for the approximate solution of high-order tensor differential equations by tree tensor networks is proposed and analyzed. In a recursion from the leaves to the root, the integrator updates bases and then evolves connection tensors by a Galerkin method in the augmented subspace spanned by the new and old bases. This is followed by rank truncation within a specified error tolerance. The memory requirements are linear in the order of the tensor and linear in the maximal mode dimension. The integrator is robust to small singular values of matricizations of the connection tensors. Up to the rank truncation error, which is controlled by the given error tolerance, the integrator preserves norm and energy for Schrödinger equations, and it dissipates the energy in gradient systems. Numerical experiments with a basic quantum spin system illustrate the behavior of the proposed algorithm.
Abstract. Computing the numerical solution to high-dimensional tensor differential equations can lead to prohibitive computational costs and memory requirements. To reduce the memory and computational footprint, dynamical low-rank approximation (DLRA) has proven to be a promising approach. DLRA represents the solution as a low-rank tensor factorization and evolves the resulting low-rank factors in time. A central challenge in DLRA is to find time integration schemes that are robust to the arising small singular values. A robust parallel basis update and Galerkin integrator, which simultaneously evolves all low-rank factors, has recently been derived for matrix differential equations. This work extends the parallel low-rank matrix integrator to Tucker tensors and general tree tensor networks, yielding an algorithm in which all bases and connecting tensors are evolved in parallel over a time step. We formulate the algorithm, provide a robust error bound, and demonstrate the efficiency of the new integrators for problems in quantum many-body physics, uncertainty quantification, and radiative transfer. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/JonasKu/Publication-Parallel-BUG-for-TTNs and in the supplementary materials ( Publication-Parallel-BUG-for-TTNs-main.zip [112 KB]). [Formula: see text]
We study low-rank tensor methods for the numerical solution of Schrödinger's equation with time-independent and explicitly time-dependent Hamiltonians, motivated by large-scale simulations of many-body quantum systems and quantum computing devices subject to time-dependent control pulses. We outline the recent application of the "basis update and Galerkin" (BUG) method for tensor trains, and describe the established TDVP and TDVP-2 algorithms based on the time-dependent variational principle. For comparison, we also consider the BUG method in the Tucker format. All these approaches enable memory efficient representations of partially entangled quantum states and thereby mitigate the exponential cost of conventional state-vector formulations. The rank-adaptivity relies on the truncated singular value decomposition, in which the rank of a matrix is reduced by setting its smallest singular values to zero, based on a threshold parameter that controls the truncation error. Numerical experiments on representative time-independent and time-dependent Hamiltonian models quantify the tradeoff between accuracy and compression across methods, with particular attention to the interplay between the time-step and the truncation threshold, and how the computational effort scales with the number of sub-systems in the quantum system.
Dynamical low-rank approximation in the Tucker tensor format of given large time-dependent tensors and of tensor differential equations is the subject of this paper. In particular, a discrete time integration method for rank-constrained Tucker tensors is presented and analyzed. It extends the known projector-splitting integrator for dynamical low-rank approximation of matrices to Tucker tensors and is shown to inherit the same favorable properties. The integrator is based on iteratively applying the matrix projector-splitting integrator to tensor unfoldings but with inexact solution in a substep. It has the property that it reconstructs time-dependent Tucker tensors of the given rank exactly. The integrator is also shown to be robust to the presence of small singular values in the tensor unfoldings. Numerical examples with time-dependent problems from quantum physics and tensor optimization methods illustrate our theoretical results.
Abstract. A robust and efficient time integrator for dynamical tensor approximation in the tensor train or matrix product state format is presented. The method is based on splitting the projector onto the tangent space of the tensor manifold. The algorithm can be used for updating time-dependent tensors in the given data-sparse tensor train / matrix product state format and for computing an approximate solution to high-dimensional tensor differential equations within this data-sparse format. The formulation, implementation and theoretical properties of the proposed integrator are studied, and numerical experiments with problems from quantum molecular dynamics and with iterative processes in the tensor train format are included. Key words. Tensor train, matrix product state, low-rank approximation, time-varying tensors, tensor differential equations, splitting integrator. AMS subject classifications. 15A18,15A69,65F99,65L05 1. Introduction. In
A numerical integrator is proposed for solving the multiconfiguration time-dependent Hartree (MCTDH) equations of motion, which are widely used in computations of molecular quantum dynamics. In contrast to existing integrators, the proposed algorithm does not require inverses of ill-conditioned density matrices and obviates the need for their regularization, allowing for large stepsizes also in the case of near-singular density matrices. The nonlinear MCTDH equations are split into a chain of linear differential equations that can all be efficiently solved by Lanczos approximations to the action of Hermitian-matrix exponentials, alternating with orthogonal matrix decompositions. The integrator is an extension to the Tucker tensor format of recently proposed projector-splitting integrators for the dynamical low-rank approximation by matrices and tensor trains (or matrix product states). The integrator is time-reversible and preserves both the norm and the total energy.
Abstract. Compactly representing and efficently applying linear operators are fundamental ingredients in tensor network methods for simulating quantum many-body problems and solving high-dimensional problems in scientific computing. In this work, we study such representations for tree tensor networks, the so-called tree tensor network operators (TTNOs), paying particular attention to Hamiltonian operators that involve long-range pairwise interactions between particles. Generalizing the work by Lin, Tong, and others on matrix product operators, we establish a direct connection between the hierarchical low-rank structure of the interaction matrix and the TTNO property. This connection allows us to arrive at very compact TTNO representations by compressing the interaction matrix into a hierarchically semiseparable matrix. Numerical experiments for different quantum spin systems validate our results and highlight the potential advantages of TTNOs over matrix product operators.