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

The Journal of Chemical Physics

QuTree: A tree tensor network package

Roman Ellerbrock, Katherine Grace Johnson, Stefan Seritan, Hannes Hoppe, J. H. Zhang, Tim Lenzen, Thomas Weike, Uwe Manthe, Todd J. Martı́nez

Published Mar 18, 2024• 7 citations
Publisher

Abstract

We present QuTree, a C++ library for tree tensor network approaches. QuTree provides class structures for tensors, tensor trees, and related linear algebra functions that facilitate the fast development of tree tensor network approaches such as the multilayer multiconfigurational time-dependent Hartree approach or the density matrix renormalization group approach and its various extensions. We investigate the efficiency of relevant tensor and tensor network operations and show that the overhead for managing the network structure is negligible, even in cases with a million leaves and small tensors. QuTree focuses on providing simple, high-level routines while retaining easy access to the backend to facilitate novel developments. We demonstrate the capabilities of the package by computing the eigenstates of coupled harmonic oscillator Hamiltonians and performing random circuit simulations on a virtual quantum computer.

DOI
10.1063/5.0180233

Related papers

PyTreeNet: A Python Library for easy Utilisation of Tree Tensor Networks

Richard M. Milbradt, Qunsheng Huang, Christian B. Mendl

In recent years, tree tensor network methods have proven capable of simulating quantum many-body and other high-dimensional systems. This work is a user guide to our Python library PyTreeNet. It includes code examples and exercises to introduce the library's functions and familiarise the reader with the concepts and methods surrounding tree tensor networks. PyTreeNet implements all the tools required to implement general tree tensor network methods, such as tensor decompositions and arbitrary tree structures. The main focus is on the time evolution of quantum systems. This includes an introduction to tree tensor network states and operators and the time-evolving block decimation and time-dependent variational principle. The library's capabilities are showcased with the example of a modified transverse field Ising model on tree structures that go far beyond the ability of common state vector methods.

arXiv:2407.13249•Jul 18, 2024•2 citations

TTNOpt: Tree tensor network package for high-rank tensor compression

Ryo Watanabe, Hidetaka Manabe, Toshiya Hikihara +1 more

We have developed TTNOpt, a software package that utilizes tree tensor networks (TTNs) for quantum spin systems and high-dimensional data analysis. TTNOpt provides efficient and powerful TTN computations by locally optimizing the network structure, guided by the entanglement pattern of the target tensors. For quantum spin systems, TTNOpt searches for the ground state of Hamiltonians with bilinear spin interactions and magnetic fields, and computes physical properties of these states, including the variational energy, bipartite entanglement entropy (EE), single-site expectation values, and two-site correlation functions. Additionally, TTNOpt can target the lowest-energy state within a specified subspace, provided that the Hamiltonian conserves total magnetization. For high-dimensional data analysis, TTNOpt factorizes complex tensors into TTN states that maximize fidelity to the original tensors by optimizing the tensors and the network. When a TTN is provided as input, TTNOpt reconstructs the network based on the EE without referencing the fidelity of the original state. We present three demonstrations of TTNOpt:(1) Ground-state search for the hierarchical chain model with a system size of $256$. The entanglement patterns of the ground state manifest themselves in a tree structure, and TTNOpt successfully identifies the tree.(2) Factorization of a quantic tensor of the $2^{24}$ dimensions representing a three-variable function where each variant has a weak bit-wise correlation. The optimized TTN shows that its structure isolates the variables from each other.(3) Reconstruction of the matrix product network representing a $16$-variable normal distribution characterized by a tree-like correlation structure. TTNOpt can reveal hidden correlation structures of the covariance matrix.

arXiv:2505.05908•Computer Physics Communications•Oct 30, 2025•2 citations

pyTTN: An Open Source Toolbox for Open and Closed System Quantum Dynamics Simulations Using Tree Tensor Networks

Lachlan P. Lindoy, Daniel Rodrigo-Albert, Yannic Rath +1 more

We present the Python Tree Tensor Network package (pyTTN) for the evaluation of dynamical properties of closed and open quantum systems that makes use of Tree Tensor Network (TTN), or equivalently the multi-layer multiconfiguration time-dependent Hartree (ML-MCTDH), based representations of wavefunctions. This package includes several features allowing for easy setup of zero- and finite-temperature calculations for general Hamiltonians using single and multi-set TTN ansätze with an adaptive bond dimension through the use of subspace expansion techniques. All core features are implemented in C++ with Python bindings provided to simplify the use of this package. In addition to these core features, pyTTN provides several tools for setting up efficient simulation of open quantum system dynamics, including the use of the TTN ansatz to represent the auxiliary density operator space for the simulation of the Hierarchical Equation of Motion (HEOM) method and generalised pseudomode methods; furthermore we demonstrate that the two approaches are equivalent up to a non-unitary normal mode transformation acting on the pseudomode degrees of freedom. We present a set of applications of the package, starting with the widely used benchmark case of the photo-excitation dynamics of 24 mode pyrazine, following which we consider a more challenging model describing the exciton dynamics at the interface of a $n$-oligothiophene donor-C$_{60}$ fullerene acceptor system. Finally, we consider applications to open quantum systems, including the spin-boson model, a set of extended dissipative spin models, and an Anderson impurity model. By combining ease of use, an efficient implementation, as well as an extendable design allowing for the addition of future extensions, pyTTN can be integrated in a wide range of computational modelling software.

arXiv:2503.15460•Mar 19, 2025•0 citations

Tree Tensor Networks Methods for Efficient Calculation of Molecular Vibrational Spectra

Shuo Sun, Richard M. Milbradt, Stefan Knecht +2 more

We develop and employ general Tree Tensor Networks (TTNs) to compute the vibrational spectra for two model systems: a set of 64-dimensional coupled oscillators and acetonitrile. We explore various tree architectures, ranging from the simple linear structure of Matrix Product States (MPS), to trees where only the leaf nodes carry a physical leg -- as commonly seen in the underlying ansatz of the Multilayer Multiconfiguration Time-Dependent Hartree (ML-MCTDH) method -- and further to more general trees in which all nodes are allowed to possess a physical leg. In addition, we implement Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) methods and Inverse Iteration methods as eigensolvers. Benchmarking runtime and accuracy shows that all tested topologies can reach high accuracy. For acetonitrile, inverse-iteration refinement brings all 84 computed states below 1~cm$^{-1}$ error, while the fork-4 tree, a comb-like tree with four backbone nodes, provides the best overall balance between accuracy and cost. MPS remains computationally attractive, whereas more connected trees generally improve accuracy at fixed bond dimension. All numerical simulations were performed using PyTreeNet, a Python package designed for flexible tensor network computations.

physics.chem-phCross-listedarXiv:2512.15875•The Journal of Chemical Physics•Dec 19, 2025•0 citations

Efficient tree tensor network states (TTNS) for quantum chemistry: Generalizations of the density matrix renormalization group algorithm

Naoki Nakatani, Garnet Kin-Lic Chan

We investigate tree tensor network states for quantum chemistry. Tree tensor network states represent one of the simplest generalizations of matrix product states and the density matrix renormalization group. While matrix product states encode a one-dimensional entanglement structure, tree tensor network states encode a tree entanglement structure, allowing for a more flexible description of general molecules. We describe an optimal tree tensor network state algorithm for quantum chemistry. We introduce the concept of half-renormalization which greatly improves the efficiency of the calculations. Using our efficient formulation we demonstrate the strengths and weaknesses of tree tensor network states versus matrix product states. We carry out benchmark calculations both on tree systems (hydrogen trees and π-conjugated dendrimers) as well as non-tree molecules (hydrogen chains, nitrogen dimer, and chromium dimer). In general, tree tensor network states require much fewer renormalized states to achieve the same accuracy as matrix product states. In non-tree molecules, whether this translates into a computational savings is system dependent, due to the higher prefactor and computational scaling associated with tree algorithms. In tree like molecules, tree network states are easily superior to matrix product states. As an illustration, our largest dendrimer calculation with tree tensor network states correlates 110 electrons in 110 active orbitals.

arXiv:1302.2298•The Journal of Chemical Physics•Apr 4, 2013•184 citations

Accurate, full-dimensional computations of thousands of complex vibrational eigenstates with tree tensor network states

Henrik R. Larsson, Brieuc Le Dé, Gino E. Gamboni

Tree tensor network states (TTNSs) combined with the density matrix renormalization group (DMRG) are emerging as powerful tools for vibrational and vibronic structure simulations in molecules with strong coupling and fluxionality. In this Perspective, we discuss how TTNS methods enable accurate, full-dimensional computations of thousands of eigenstates for molecular systems ranging from quartic-force-field benchmarks to molecules with strong vibronic coupling and protonated water clusters as large as the 33-dimensional Eigen ion, H$_3$O$^+$$\cdot$(H$_2$O)$_3$. We emphasize the close connection and interoperability between DMRG-based TTNS methods and the multilayer multiconfiguration time-dependent Hartree method (ML-MCTDH), which share the same underlying ansatz. We also highlight practical challenges of predictive simulations, including robust error estimation, convergence of observables such as infrared intensities, and optimization of tensor network tree structures. Finally, we outline recent advances toward direct targeting of excited states and discuss opportunities for broader applications in molecular spectroscopy and quantum dynamics.

physics.chem-phCross-listedarXiv:2605.00998•The Journal of Physical Chemistry Letters•May 5, 2026•0 citations
We present QuTree, a C++ library for tree tensor network approaches. QuTree provides class structures for tensors, tensor trees, and related linear algebra functions that facilitate the fast development of tree tensor network approaches such as the multilayer multiconfigurational time-dependent Hartree approach or the density matrix renormalization group approach and its various extensions. We investigate the efficiency of relevant tensor and tensor network operations and show that the overhead for managing the network structure is negligible, even in cases with a million leaves and small tensors. QuTree focuses on providing simple, high-level routines while retaining easy access to the backend to facilitate novel developments. We demonstrate the capabilities of the package by computing the eigenstates of coupled harmonic oscillator Hamiltonians and performing random circuit simulations on a virtual quantum computer.
In recent years, tree tensor network methods have proven capable of simulating quantum many-body and other high-dimensional systems. This work is a user guide to our Python library PyTreeNet. It includes code examples and exercises to introduce the library's functions and familiarise the reader with the concepts and methods surrounding tree tensor networks. PyTreeNet implements all the tools required to implement general tree tensor network methods, such as tensor decompositions and arbitrary tree structures. The main focus is on the time evolution of quantum systems. This includes an introduction to tree tensor network states and operators and the time-evolving block decimation and time-dependent variational principle. The library's capabilities are showcased with the example of a modified transverse field Ising model on tree structures that go far beyond the ability of common state vector methods.
We have developed TTNOpt, a software package that utilizes tree tensor networks (TTNs) for quantum spin systems and high-dimensional data analysis. TTNOpt provides efficient and powerful TTN computations by locally optimizing the network structure, guided by the entanglement pattern of the target tensors. For quantum spin systems, TTNOpt searches for the ground state of Hamiltonians with bilinear spin interactions and magnetic fields, and computes physical properties of these states, including the variational energy, bipartite entanglement entropy (EE), single-site expectation values, and two-site correlation functions. Additionally, TTNOpt can target the lowest-energy state within a specified subspace, provided that the Hamiltonian conserves total magnetization. For high-dimensional data analysis, TTNOpt factorizes complex tensors into TTN states that maximize fidelity to the original tensors by optimizing the tensors and the network. When a TTN is provided as input, TTNOpt reconstructs the network based on the EE without referencing the fidelity of the original state. We present three demonstrations of TTNOpt:(1) Ground-state search for the hierarchical chain model with a system size of 256256256. The entanglement patterns of the ground state manifest themselves in a tree structure, and TTNOpt successfully identifies the tree.(2) Factorization of a quantic tensor of the 2242^{24}224 dimensions representing a three-variable function where each variant has a weak bit-wise correlation. The optimized TTN shows that its structure isolates the variables from each other.(3) Reconstruction of the matrix product network representing a 161616-variable normal distribution characterized by a tree-like correlation structure. TTNOpt can reveal hidden correlation structures of the covariance matrix.
We present the Python Tree Tensor Network package (pyTTN) for the evaluation of dynamical properties of closed and open quantum systems that makes use of Tree Tensor Network (TTN), or equivalently the multi-layer multiconfiguration time-dependent Hartree (ML-MCTDH), based representations of wavefunctions. This package includes several features allowing for easy setup of zero- and finite-temperature calculations for general Hamiltonians using single and multi-set TTN ansätze with an adaptive bond dimension through the use of subspace expansion techniques. All core features are implemented in C++ with Python bindings provided to simplify the use of this package. In addition to these core features, pyTTN provides several tools for setting up efficient simulation of open quantum system dynamics, including the use of the TTN ansatz to represent the auxiliary density operator space for the simulation of the Hierarchical Equation of Motion (HEOM) method and generalised pseudomode methods; furthermore we demonstrate that the two approaches are equivalent up to a non-unitary normal mode transformation acting on the pseudomode degrees of freedom. We present a set of applications of the package, starting with the widely used benchmark case of the photo-excitation dynamics of 24 mode pyrazine, following which we consider a more challenging model describing the exciton dynamics at the interface of a nnn-oligothiophene donor-C60_{60}60​ fullerene acceptor system. Finally, we consider applications to open quantum systems, including the spin-boson model, a set of extended dissipative spin models, and an Anderson impurity model. By combining ease of use, an efficient implementation, as well as an extendable design allowing for the addition of future extensions, pyTTN can be integrated in a wide range of computational modelling software.
We develop and employ general Tree Tensor Networks (TTNs) to compute the vibrational spectra for two model systems: a set of 64-dimensional coupled oscillators and acetonitrile. We explore various tree architectures, ranging from the simple linear structure of Matrix Product States (MPS), to trees where only the leaf nodes carry a physical leg -- as commonly seen in the underlying ansatz of the Multilayer Multiconfiguration Time-Dependent Hartree (ML-MCTDH) method -- and further to more general trees in which all nodes are allowed to possess a physical leg. In addition, we implement Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) methods and Inverse Iteration methods as eigensolvers. Benchmarking runtime and accuracy shows that all tested topologies can reach high accuracy. For acetonitrile, inverse-iteration refinement brings all 84 computed states below 1~cm−1^{-1}−1 error, while the fork-4 tree, a comb-like tree with four backbone nodes, provides the best overall balance between accuracy and cost. MPS remains computationally attractive, whereas more connected trees generally improve accuracy at fixed bond dimension. All numerical simulations were performed using PyTreeNet, a Python package designed for flexible tensor network computations.
We investigate tree tensor network states for quantum chemistry. Tree tensor network states represent one of the simplest generalizations of matrix product states and the density matrix renormalization group. While matrix product states encode a one-dimensional entanglement structure, tree tensor network states encode a tree entanglement structure, allowing for a more flexible description of general molecules. We describe an optimal tree tensor network state algorithm for quantum chemistry. We introduce the concept of half-renormalization which greatly improves the efficiency of the calculations. Using our efficient formulation we demonstrate the strengths and weaknesses of tree tensor network states versus matrix product states. We carry out benchmark calculations both on tree systems (hydrogen trees and π-conjugated dendrimers) as well as non-tree molecules (hydrogen chains, nitrogen dimer, and chromium dimer). In general, tree tensor network states require much fewer renormalized states to achieve the same accuracy as matrix product states. In non-tree molecules, whether this translates into a computational savings is system dependent, due to the higher prefactor and computational scaling associated with tree algorithms. In tree like molecules, tree network states are easily superior to matrix product states. As an illustration, our largest dendrimer calculation with tree tensor network states correlates 110 electrons in 110 active orbitals.
Tree tensor network states (TTNSs) combined with the density matrix renormalization group (DMRG) are emerging as powerful tools for vibrational and vibronic structure simulations in molecules with strong coupling and fluxionality. In this Perspective, we discuss how TTNS methods enable accurate, full-dimensional computations of thousands of eigenstates for molecular systems ranging from quartic-force-field benchmarks to molecules with strong vibronic coupling and protonated water clusters as large as the 33-dimensional Eigen ion, H3_33​O+^++⋅\cdot⋅(H2_22​O)3_33​. We emphasize the close connection and interoperability between DMRG-based TTNS methods and the multilayer multiconfiguration time-dependent Hartree method (ML-MCTDH), which share the same underlying ansatz. We also highlight practical challenges of predictive simulations, including robust error estimation, convergence of observables such as infrared intensities, and optimization of tensor network tree structures. Finally, we outline recent advances toward direct targeting of excited states and discuss opportunities for broader applications in molecular spectroscopy and quantum dynamics.