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:1805.00055 · SciPost Physics Lecture Notes

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

Johannes Hauschild, Frank Pollmann

Published Oct 8, 2018• 614 citations
arXivHTMLPDF

Abstract

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.

DOI
10.21468/scipostphyslectnotes.5

Related papers

Review of Tensor Network Contraction Approaches

Shi-Ju Ran, Emanuele Tirrito, Cheng Peng +3 more

Tensor network (TN), a young mathematical tool of high vitality and great potential, has been undergoing extremely rapid developments in the last two decades, gaining tremendous success in condensed matter physics, atomic physics, quantum information science, statistical physics, and so on. In this lecture notes, we focus on the contraction algorithms of TN as well as some of the applications to the simulations of quantum many-body systems. Starting from basic concepts and definitions, we first explain the relations between TN and physical problems, including the TN representations of classical partition functions, quantum many-body states (by matrix product state, tree TN, and projected entangled pair state), time evolution simulations, etc. These problems, which are challenging to solve, can be transformed to TN contraction problems. We present then several paradigm algorithms based on the ideas of the numerical renormalization group and/or boundary states, including density matrix renormalization group, time-evolving block decimation, coarse-graining/corner tensor renormalization group, and several distinguished variational algorithms. Finally, we revisit the TN approaches from the perspective of multi-linear algebra (also known as tensor algebra or tensor decompositions) and quantum simulation. Despite the apparent differences in the ideas and strategies of different TN algorithms, we aim at revealing the underlying relations and resemblances in order to present a systematic picture to understand the TN contraction approaches.

•Aug 30, 2017•22 citations

Codebase release 1.0 for TeNPy

Johannes Hauschild, Jakob Unfried, Sajant Anand +27 more

TeNPy (short for ‘Tensor Network Python’) is a python library for the simulation of strongly correlated quantum systems with tensor networks. The philosophy of this library is to achieve a balance of readability and usability for new-comers, while at the same time providing powerful algorithms for experts. The focus is on MPS algorithms for 1D and 2D lattices, such as DMRG ground state search, as well as dynamics using TEBD, TDVP, or MPO evolution. This article is a companion to the recent version 1.0 release of TeNPy and gives a brief overview of the package.

arXiv:2408.02010•SciPost Physics Codebases•Nov 26, 2024•98 citations

Pushing the boundaries of Matrix Product States in quantum many-body physics and computing

Guglielmo Lami

The Thesis explores the application of Matrix Product States (MPS) in the domain of quantum many-body systems and quantum computing, show casing the versatility and effectiveness of MPS for addressing complex com putational challenges. The opening chapter introduces essential tools for Tensor Networks, addressing the curse of dimensionality and elucidating the main characteristics of Matrix Product States and Matrix Product Op erators. The discussion encompasses also important numerical techniques, including Density Matrix Renormalization Group and Time Evolving Block Decimation. Furthermore, the relation between MPS and quantum circuits is discussed. The subsequent Chapters delve into specific applications of MPS. In the second Chapter, we introduce a Tensor Network ansatz inspired by the backflow transformation for correlated systems. This extension of the MPS representation ensures an area law for entanglement in dimensions one or greater. We employ an optimization scheme combining DMRG and variational Monte Carlo algorithms for efficient ground-state search. Bench marking against spin models demonstrates high accuracy. The third Chapter explores quantum annealing for optimizing complex classical spin Hamil tonians, as the Hopfield model and the binary perceptron. We introduce an efficient Tensor Network representation for the adiabatic time evolution of quantum annealing, enabling scalable classical simulations. The use of MPS in mitigating Trotter errors and mapping to quantum circuits is also explored. In the fourth Chapter we present a novel method for evaluating the amount of nonstabilizerness (also known as quantum magic) contained in an MPS. We overcome the exponentially hard evaluation of this quan tity by employing a simple perfect sampling technique of Pauli string. Our innovative MPS approach enables efficient computation. Benchmarked on magic states and the quantum Ising chain ground state, this method offers easy access to the non-equilibrium dynamics of nonstabilizerness following a quantum quench. The Appendices provide additional insights, including: an introduction to variational Monte Carlo, technical details on MPS simula tions for the quantum annealing and a comprehensive overview on stabilizer formalism and nonstabilizerness.

•Dec 18, 2023•0 citations

Symmetry-protected tensor networks

Claudius Hubig

The simulation and numerical study of large, strongly correlated quantum systems containing Fermions or using real-time evolution in finite dimensions is still an essentially unsolved problem, primarily due to the exponential growth of the Hilbert state space with system size and the occurrence of the so-called sign problem in Monte Carlo studies. In this area, the use of tensor-network methods, for one-dimensional systems chief among them the density matrix renormalisation group (DMRG) and matrix-product states (MPS), has grown in importance in recent years. This thesis first recapitulates the use of non-abelian symmetries such as SU(2)-Spin in arbitrary tensor networks with an extensive review of the published literature including detailed algorithms and implementation hints. Implementing such symmetries can lead to a considerably more efficient representation of states in the tensor network. This part is intended to be suitable as an implementation-oriented introduction to tensor networks in general and the implementation of non-abelian symmetries in particular. Second, it introduces a series of technical improvements for the MPS methods. These improvements include a faster convergence scheme for MPS-DMRG, a systematic approach to the construction of matrix-product operators and an improved Krylov time evolution method as well as the combination of several well-known techniques into a single tensor network toolkit, SYTEN. The effectiveness of these improvements is demonstrated in numerical examples. Third, the toolkit is applied to the study of two models of current research interest: A one-dimensional spin chain in a staggered external magnetic field is studied and confinement of the elementary spinon excitations, as predicted by analytical arguments, found numerically using real-time evolution and evaluation of the dynamical structure factor. Additionally, the Hubbard model in two dimensions is studied extensively at various system sizes, geometries, interaction strengths U and filling factors n using up to 30'000 SU(2)-Spin-symmetric states equivalent to approx. 100'000 states in other MPS-DMRG implementations. Hints of a possible phase coexistence in the region 0.85 < n < 0.95 are found at intermediate interaction strengths U = 4 and U = 6 as well as a consistently striped ground state in the region n ≈ 0.875.

•Jan 1, 2017•37 citations

Introduction to matrix-product states and tensor networks

Grégoire Misguich

These notes provide an introduction to tensor-network methods in quantum many-body physics, with an emphasis on matrix-product states (MPS). They develop the basic tensor-network language, including graphical notation, virtual indices, bond dimensions, gauge freedom, canonical forms, QR and singular-value decompositions, and the role of entanglement in controlling the efficiency of the representation. The main MPS algorithms are then introduced, including contractions, correlation functions, matrix-product operators, DMRG, and time-evolution methods. The notes also briefly discuss projected entangled-pair states (PEPS) as a higher-dimensional generalization of MPS, together with the basic ideas behind approximate PEPS contraction. Finally, tensor-network representations of mixed states, quantum channels, and Lindblad dynamics are presented, with applications to thermal states and open quantum systems. The presentation is accompanied by short Julia code examples based on ITensor, ITensorMPS, and TensorMixedStates. These notes were written for the 9th Les Houches Summer School on Computational Physics: Open Quantum Systems, held in June 2026.

cond-mat.str-elCross-listedarXiv:2606.24803•Jun 24, 2026•3 citations

PyTeNet: A concise Python implementation of quantum tensor network algorithms

Christian B. Mendl

The simulation of strongly correlated quantum systems on classical computers is an essential tool for investigating and understanding quantum materials.Due to the inherent "curse of dimensionality" of quantum systems, such simulations pose a challenging task, and have spurred the development of several computational approaches and approximations.For quasi one-dimensional lattice systems, the density matrix renormalization group (DMRG) framework (Schollwöck, 2005;White, 1992White, , 1993) has emerged as one of the most successful methods.Modern formulations are based on matrix product states (MPS) and operators (MPO) (Schollwöck, 2011): briefly speaking, a matrix product state is an Ansatz for the quantum many-body wavefunction amendable to efficient numerical manipulation.The favorable approximation properties of matrix product states have been theoretically proven for ground states of gapped Hamiltonians with local interactions (Hastings, 2007;Verstraete & Cirac, 2006), and recent work has extended this to quantum systems at finite temperature (Barthel, 2017).Over the years many variations and generalizations of the DMRG framework have been devised (Barthel, 2013;Stoudenmire & White, 2010;Verstraete, Murg, & Cirac, 2008;Vidal, 2003Vidal, , 2008)), and further developments and improvements of associated algorithms remain an active field of research.

The Journal of Open Source Software•Oct 16, 2018•9 citations
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.
Tensor network (TN), a young mathematical tool of high vitality and great potential, has been undergoing extremely rapid developments in the last two decades, gaining tremendous success in condensed matter physics, atomic physics, quantum information science, statistical physics, and so on. In this lecture notes, we focus on the contraction algorithms of TN as well as some of the applications to the simulations of quantum many-body systems. Starting from basic concepts and definitions, we first explain the relations between TN and physical problems, including the TN representations of classical partition functions, quantum many-body states (by matrix product state, tree TN, and projected entangled pair state), time evolution simulations, etc. These problems, which are challenging to solve, can be transformed to TN contraction problems. We present then several paradigm algorithms based on the ideas of the numerical renormalization group and/or boundary states, including density matrix renormalization group, time-evolving block decimation, coarse-graining/corner tensor renormalization group, and several distinguished variational algorithms. Finally, we revisit the TN approaches from the perspective of multi-linear algebra (also known as tensor algebra or tensor decompositions) and quantum simulation. Despite the apparent differences in the ideas and strategies of different TN algorithms, we aim at revealing the underlying relations and resemblances in order to present a systematic picture to understand the TN contraction approaches.
TeNPy (short for ‘Tensor Network Python’) is a python library for the simulation of strongly correlated quantum systems with tensor networks. The philosophy of this library is to achieve a balance of readability and usability for new-comers, while at the same time providing powerful algorithms for experts. The focus is on MPS algorithms for 1D and 2D lattices, such as DMRG ground state search, as well as dynamics using TEBD, TDVP, or MPO evolution. This article is a companion to the recent version 1.0 release of TeNPy and gives a brief overview of the package.
The Thesis explores the application of Matrix Product States (MPS) in the domain of quantum many-body systems and quantum computing, show casing the versatility and effectiveness of MPS for addressing complex com putational challenges. The opening chapter introduces essential tools for Tensor Networks, addressing the curse of dimensionality and elucidating the main characteristics of Matrix Product States and Matrix Product Op erators. The discussion encompasses also important numerical techniques, including Density Matrix Renormalization Group and Time Evolving Block Decimation. Furthermore, the relation between MPS and quantum circuits is discussed. The subsequent Chapters delve into specific applications of MPS. In the second Chapter, we introduce a Tensor Network ansatz inspired by the backflow transformation for correlated systems. This extension of the MPS representation ensures an area law for entanglement in dimensions one or greater. We employ an optimization scheme combining DMRG and variational Monte Carlo algorithms for efficient ground-state search. Bench marking against spin models demonstrates high accuracy. The third Chapter explores quantum annealing for optimizing complex classical spin Hamil tonians, as the Hopfield model and the binary perceptron. We introduce an efficient Tensor Network representation for the adiabatic time evolution of quantum annealing, enabling scalable classical simulations. The use of MPS in mitigating Trotter errors and mapping to quantum circuits is also explored. In the fourth Chapter we present a novel method for evaluating the amount of nonstabilizerness (also known as quantum magic) contained in an MPS. We overcome the exponentially hard evaluation of this quan tity by employing a simple perfect sampling technique of Pauli string. Our innovative MPS approach enables efficient computation. Benchmarked on magic states and the quantum Ising chain ground state, this method offers easy access to the non-equilibrium dynamics of nonstabilizerness following a quantum quench. The Appendices provide additional insights, including: an introduction to variational Monte Carlo, technical details on MPS simula tions for the quantum annealing and a comprehensive overview on stabilizer formalism and nonstabilizerness.
The simulation and numerical study of large, strongly correlated quantum systems containing Fermions or using real-time evolution in finite dimensions is still an essentially unsolved problem, primarily due to the exponential growth of the Hilbert state space with system size and the occurrence of the so-called sign problem in Monte Carlo studies. In this area, the use of tensor-network methods, for one-dimensional systems chief among them the density matrix renormalisation group (DMRG) and matrix-product states (MPS), has grown in importance in recent years. This thesis first recapitulates the use of non-abelian symmetries such as SU(2)-Spin in arbitrary tensor networks with an extensive review of the published literature including detailed algorithms and implementation hints. Implementing such symmetries can lead to a considerably more efficient representation of states in the tensor network. This part is intended to be suitable as an implementation-oriented introduction to tensor networks in general and the implementation of non-abelian symmetries in particular. Second, it introduces a series of technical improvements for the MPS methods. These improvements include a faster convergence scheme for MPS-DMRG, a systematic approach to the construction of matrix-product operators and an improved Krylov time evolution method as well as the combination of several well-known techniques into a single tensor network toolkit, SYTEN. The effectiveness of these improvements is demonstrated in numerical examples. Third, the toolkit is applied to the study of two models of current research interest: A one-dimensional spin chain in a staggered external magnetic field is studied and confinement of the elementary spinon excitations, as predicted by analytical arguments, found numerically using real-time evolution and evaluation of the dynamical structure factor. Additionally, the Hubbard model in two dimensions is studied extensively at various system sizes, geometries, interaction strengths U and filling factors n using up to 30'000 SU(2)-Spin-symmetric states equivalent to approx. 100'000 states in other MPS-DMRG implementations. Hints of a possible phase coexistence in the region 0.85 < n < 0.95 are found at intermediate interaction strengths U = 4 and U = 6 as well as a consistently striped ground state in the region n ≈ 0.875.
These notes provide an introduction to tensor-network methods in quantum many-body physics, with an emphasis on matrix-product states (MPS). They develop the basic tensor-network language, including graphical notation, virtual indices, bond dimensions, gauge freedom, canonical forms, QR and singular-value decompositions, and the role of entanglement in controlling the efficiency of the representation. The main MPS algorithms are then introduced, including contractions, correlation functions, matrix-product operators, DMRG, and time-evolution methods. The notes also briefly discuss projected entangled-pair states (PEPS) as a higher-dimensional generalization of MPS, together with the basic ideas behind approximate PEPS contraction. Finally, tensor-network representations of mixed states, quantum channels, and Lindblad dynamics are presented, with applications to thermal states and open quantum systems. The presentation is accompanied by short Julia code examples based on ITensor, ITensorMPS, and TensorMixedStates. These notes were written for the 9th Les Houches Summer School on Computational Physics: Open Quantum Systems, held in June 2026.
The simulation of strongly correlated quantum systems on classical computers is an essential tool for investigating and understanding quantum materials.Due to the inherent "curse of dimensionality" of quantum systems, such simulations pose a challenging task, and have spurred the development of several computational approaches and approximations.For quasi one-dimensional lattice systems, the density matrix renormalization group (DMRG) framework (Schollwöck, 2005;White, 1992White, , 1993) has emerged as one of the most successful methods.Modern formulations are based on matrix product states (MPS) and operators (MPO) (Schollwöck, 2011): briefly speaking, a matrix product state is an Ansatz for the quantum many-body wavefunction amendable to efficient numerical manipulation.The favorable approximation properties of matrix product states have been theoretically proven for ground states of gapped Hamiltonians with local interactions (Hastings, 2007;Verstraete & Cirac, 2006), and recent work has extended this to quantum systems at finite temperature (Barthel, 2017).Over the years many variations and generalizations of the DMRG framework have been devised (Barthel, 2013;Stoudenmire & White, 2010;Verstraete, Murg, & Cirac, 2008;Vidal, 2003Vidal, , 2008)), and further developments and improvements of associated algorithms remain an active field of research.