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:2407.13249

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

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

Published Jul 18, 2024• 6 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2407.13249

Related papers

Efficient numerical simulations with Tensor Networks: Tensor Network Python (TeNPy)

Johannes Hauschild, Frank Pollmann

Tensor product state (TPS) based methods are powerful tools to efficiently simulate quantum many-body systems in and out of equilibrium. In particular, the one-dimensional matrix-product (MPS) formalism is by now an established tool in condensed matter theory and quantum chemistry. In these lecture notes, we combine a compact review of basic TPS concepts with the introduction of a versatile tensor library for Python (TeNPy) [1]. As concrete examples, we consider the MPS based time-evolving block decimation and the density matrix renormalization group algorithm. Moreover, we provide a practical guide on how to implement abelian symmetries (e.g., a particle number conservation) to accelerate tensor operations.

arXiv:1805.00055•SciPost Physics Lecture Notes•Oct 8, 2018•614 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 (pyTTN) package for the evaluation of dynamical properties of closed and open quantum systems that makes use of Tree Tensor Network (TTN) based representations of wave functions. 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 using subspace expansion techniques. In addition to these core features, pyTTN provides several tools for setting up efficient simulations 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 method and generalized quasi-Lindblad pseudomode methods. We present a set of applications for the package, starting with the widely used benchmark case of the photo-excitation dynamics of 24 mode pyrazine, after which we consider a more challenging model describing the exciton dynamics at the interface of an n-oligothiophene donor-C60 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 and an efficient implementation, along with an extendable design that allows for the addition of future extensions, pyTTN can be integrated into a wide range of computational modeling software.

arXiv:2503.15460•The Journal of Chemical Physics•Nov 24, 2025•13 citations

QuTree: A tree tensor network package

Roman Ellerbrock, Katherine Grace Johnson, Stefan Seritan +6 more

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.

The Journal of Chemical Physics•Mar 18, 2024•7 citations

Tensor Network Techniques for Quantum Computation

Mario Collura, Guglielmo Lami, Nishan Ranabhat +1 more

This book serves as an introductory yet thorough guide to tensor networks and their applications in quantum computation and quantum information, designed for advanced undergraduate and graduate-level readers. In Part I, foundational topics are covered, including tensor structures and network representations like Matrix Product States (MPS) and Tree Tensor Networks (TTN). These preliminaries provide readers with the core mathematical tools and concepts necessary for quantum physics and quantum computing applications, bridging the gap between multi-linear algebra and complex quantum systems. Part II explores practical applications of tensor networks in simulating quantum dynamics, with a particular focus on the efficiency they offer for systems of high computational complexity. Key topics include Hamiltonian dynamics, quantum annealing, open system dynamics, and optimization strategies using TN frameworks. A final chapter addresses the emerging role of “quantum magic” in tensor networks. It delves into non-stabilizer states and their contribution to quantum computational power beyond classical simulability, featuring methods such as stabilizer-enhanced MPS and the Clifford-dressed TDVP. In presenting tensor networks as tools for understanding quantum complexity, this book aims to foster a deeper collaboration between the many-body physics and quantum computing communities, inviting a broader audience to engage with these recent developments.

arXiv:2503.04423•Dec 1, 2024•12 citations

Time evolution of the quantum Ising model in two dimensions using tree tensor networks

Wladislaw Krinitsin, Niklas Tausendpfund, Markus Heyl +2 more

The numerical simulation of two-dimensional quantum many-body systems away from equilibrium constitutes a major challenge for all known computational methods. We investigate the utility of tree tensor network (TTN) states to solve the dynamics of the quantum Ising model in two dimensions. Within the perturbative regime of small transverse fields, TTNs faithfully reproduce analytically known, but nontrivial and physically interesting dynamics of magnetic domains, for lattices up to 16 × 16 sites. Limitations of the method related to the rapid growth of entanglement entropy are explored within more general, paradigmatic quench settings. We provide and discuss comprehensive benchmarks regarding the benefit of GPU acceleration and the impact of using local operator sums on the performance.

arXiv:2505.07612•Physical review. B./Physical review. B•Sep 29, 2025•8 citations

Application of Tensor Network State Method to 1D Quantum Systems

蕭仲評

In this thesis, we use the new numerical method multiscale entanglement renormalization ansatz (MERA) to study the one dimensional spin system. This method, MERA, utilizes a network of tensors to represent quantum many-body systems on a lattice. Other examples of tensor network state are matrix product states (MPSs) for 1D systems, tree tensor networks (TTNs) for systems with a tree shape, and projected entangled-pair states (PEPSs) for 2D systems and be- yond. The three structures dier in the graph that denes how the tensors are interconnected into a network: The graphs for MPSs, TTNs, and 2D PEPSs are, respectively, a chain, a tree, and a 2D lattice. Importantly, from these tensor networks the expectation value of local observables can be computed eciently. Developing algorithms to simulate quantum many-body systems is important for understanding and studying the physical principles. And these may become powerful tools for the analysis of quantum computation and quantum information theory. But in general ecient simulation is dicult, due to the fundamental quantum physical laws. The main method we have studied and worked on is multiscale entangle- ment renormalization ansatz (MERA) which is a variational ansatz for many- body states. MERA is a tree tensor network for 1D, 2D systems and beyond. We have developed code of ternary-MERA to compute the ground state energy, expected values of local observables, and correlators for 1D lattice systems. In a nutshell, MERA is an algorithm for entanglement renormalization which is a numerical technique based on locally reorganizing the Hilbert space of a quantum many-body system with the aim to reduce the amount of entanglement in its wave function. We use this method to study 1D Ising model, XXZ model, and J1 - J2 model, and then comparing the numerical results with exact diagonalization (ED) and density matrix renormalization group (DMRG).

•Jan 1, 2010•0 citations
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.
Tensor product state (TPS) based methods are powerful tools to efficiently simulate quantum many-body systems in and out of equilibrium. In particular, the one-dimensional matrix-product (MPS) formalism is by now an established tool in condensed matter theory and quantum chemistry. In these lecture notes, we combine a compact review of basic TPS concepts with the introduction of a versatile tensor library for Python (TeNPy) [1]. As concrete examples, we consider the MPS based time-evolving block decimation and the density matrix renormalization group algorithm. Moreover, we provide a practical guide on how to implement abelian symmetries (e.g., a particle number conservation) to accelerate tensor operations.
We present the Python Tree Tensor Network (pyTTN) package for the evaluation of dynamical properties of closed and open quantum systems that makes use of Tree Tensor Network (TTN) based representations of wave functions. 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 using subspace expansion techniques. In addition to these core features, pyTTN provides several tools for setting up efficient simulations 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 method and generalized quasi-Lindblad pseudomode methods. We present a set of applications for the package, starting with the widely used benchmark case of the photo-excitation dynamics of 24 mode pyrazine, after which we consider a more challenging model describing the exciton dynamics at the interface of an n-oligothiophene donor-C60 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 and an efficient implementation, along with an extendable design that allows for the addition of future extensions, pyTTN can be integrated into a wide range of computational modeling software.
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.
This book serves as an introductory yet thorough guide to tensor networks and their applications in quantum computation and quantum information, designed for advanced undergraduate and graduate-level readers. In Part I, foundational topics are covered, including tensor structures and network representations like Matrix Product States (MPS) and Tree Tensor Networks (TTN). These preliminaries provide readers with the core mathematical tools and concepts necessary for quantum physics and quantum computing applications, bridging the gap between multi-linear algebra and complex quantum systems. Part II explores practical applications of tensor networks in simulating quantum dynamics, with a particular focus on the efficiency they offer for systems of high computational complexity. Key topics include Hamiltonian dynamics, quantum annealing, open system dynamics, and optimization strategies using TN frameworks. A final chapter addresses the emerging role of “quantum magic” in tensor networks. It delves into non-stabilizer states and their contribution to quantum computational power beyond classical simulability, featuring methods such as stabilizer-enhanced MPS and the Clifford-dressed TDVP. In presenting tensor networks as tools for understanding quantum complexity, this book aims to foster a deeper collaboration between the many-body physics and quantum computing communities, inviting a broader audience to engage with these recent developments.
The numerical simulation of two-dimensional quantum many-body systems away from equilibrium constitutes a major challenge for all known computational methods. We investigate the utility of tree tensor network (TTN) states to solve the dynamics of the quantum Ising model in two dimensions. Within the perturbative regime of small transverse fields, TTNs faithfully reproduce analytically known, but nontrivial and physically interesting dynamics of magnetic domains, for lattices up to 16 × 16 sites. Limitations of the method related to the rapid growth of entanglement entropy are explored within more general, paradigmatic quench settings. We provide and discuss comprehensive benchmarks regarding the benefit of GPU acceleration and the impact of using local operator sums on the performance.
In this thesis, we use the new numerical method multiscale entanglement renormalization ansatz (MERA) to study the one dimensional spin system. This method, MERA, utilizes a network of tensors to represent quantum many-body systems on a lattice. Other examples of tensor network state are matrix product states (MPSs) for 1D systems, tree tensor networks (TTNs) for systems with a tree shape, and projected entangled-pair states (PEPSs) for 2D systems and be- yond. The three structures dier in the graph that denes how the tensors are interconnected into a network: The graphs for MPSs, TTNs, and 2D PEPSs are, respectively, a chain, a tree, and a 2D lattice. Importantly, from these tensor networks the expectation value of local observables can be computed eciently. Developing algorithms to simulate quantum many-body systems is important for understanding and studying the physical principles. And these may become powerful tools for the analysis of quantum computation and quantum information theory. But in general ecient simulation is dicult, due to the fundamental quantum physical laws. The main method we have studied and worked on is multiscale entangle- ment renormalization ansatz (MERA) which is a variational ansatz for many- body states. MERA is a tree tensor network for 1D, 2D systems and beyond. We have developed code of ternary-MERA to compute the ground state energy, expected values of local observables, and correlators for 1D lattice systems. In a nutshell, MERA is an algorithm for entanglement renormalization which is a numerical technique based on locally reorganizing the Hilbert space of a quantum many-body system with the aim to reduce the amount of entanglement in its wave function. We use this method to study 1D Ising model, XXZ model, and J1 - J2 model, and then comparing the numerical results with exact diagonalization (ED) and density matrix renormalization group (DMRG).