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

Cambridge University Press eBooks

Basic Algebra of Tensors

Tao Xiang

Published Aug 31, 2023• 0 citations
Publisher

Abstract

The purpose of this chapter is to introduce the diagrammatic representation of tensors and tensor network states and discuss some basic properties or formulas of matrices or tensors used in various renormalization group methods. It includes, for example, the singular value decomposition and the polar decomposition of matrices, the higher-order singular value decomposition of tensors, and the automatic differentiation and its backpropagation scheme. Several Trotter-Suzuki decomposition formulas of non-commutate operators are also introduced.

DOI
10.1017/9781009398671.003

Related papers

Matrices and Operators

David McMahon

This chapter contains sections titled: Observables The Pauli Operators Outer Products The Closure Relation Representations of Operators Using Matrices Outer Products and Matrix Representations Matrix Representation of Operators in Two-Dimensional Spaces Hermitian, Unitary, and Normal Operators Eigenvalues and Eigenvectors Spectral Decomposition The Trace of an Operator The Expectation Value of an Operator Functions of Operators Unitary Transforms Projection Operators Positive Operators Commutator Algebra The Heisenberg Uncertainty Principle Polar Decomposition and Singular Values The Postulates of Quantum Mechanics Exercises

Wiley eBooks•Mar 23, 2007•2 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

Tensor Networks and the Renormalization Group

Markus Hauru

Tensor networks are a class of methods for studying many-body systems. They give a geometrical description of the internal structure of many-body states, operators, and partition functions, that can be used to implement efficient algorithms to simulate them numerically. In this thesis, after providing a very brief overview of the field, we present new tensor network methods for three different use cases. \n \nFirst, we present a new real-space renormalization group algorithm for tensor networks. Compared to existing methods, its advantages are its low computational cost, simplicity of implementation, and applicability to any network. We benchmark it on the 2D classical Ising model and find accuracy comparable with the best existing tensor network methods. Due to its simplicity and generalizability, we consider our algorithm to be an excellent candidate for implementation of real-space renormalization in higher dimensions, and discuss some of the details and the remaining challenges in 3D. \n \nSecond, we show how certain topological conformal defects of critical lattice theories can be represented as tensor networks, using the 2D classical Ising model as an example. Furthermore, we show how such tensor network descriptions, combined with a renormalization group algorithm, can be used to obtain accurate estimates of the universal properties of these defects. We also show how coarse-graining of defects can be applied to any conformal defect (i.e. not just topological ones), and yields a set of associated scaling dimensions. \n \nFinally, we leave behind the focus on renormalization group methods, and present a method for spatially resolving the overlap between two tensor network states, to obtain localized information about the similarities and differences between them. For a given region, the similarity of two states in this region can be quantified by the Uhlmann fidelity of their reduced density matrices, and we show how such fidelities can be efficiently computed in many cases when the two states are represented as tensor networks. We demonstrate the usefulness of evaluating such subsystem fidelities with three example applications: studying local quenches, comparing critical and non-critical states, and quantifying convergence in tensor network simulations.

•Aug 24, 2018•0 citations

Tensor Cookbook: Mastering Tensors through Diagrams

Beheshteh T. Rakhshan, Guillaume Rabusseau

High-dimensional data arise naturally in many areas of science and engineering, including machine learning, signal processing, computational physics, and statistics. Such data are often represented as tensors, multi-dimensional generalizations of matrices. While tensors provide a natural representation for multi-modal structure, their direct manipulation quickly becomes challenging as the order grows: the number of parameters increases exponentially, and algebraic expressions involving many indices become difficult to interpret and implement. Tensor networks (TNs) provide an effective framework for addressing these challenges. Originally introduced by Penrose and developed extensively in quantum physics, the graphical language of tensor networks encodes contractions as edges in a graph, reducing notational overhead and revealing structural properties obscured by index notation. Despite the central role of high-dimensional tensors in modern machine learning and numerical analysis, tensor network diagrams remain underutilized outside quantum computing, partly due to the lack of a self-contained mathematical reference accessible to a broad technical audience. This manuscript provides a self-contained guide to tensor networks and their use in tensor algebra. We present the main operations on tensors, contractions, products, and reshaping through, graphical notation, and show how classical tensor decompositions and related computations are naturally expressed in this framework. We also illustrate how tensor networks simplify the derivation of gradients and the manipulation of high-dimensional probability distributions. Throughout, we show that the diagrammatic approach yields genuinely shorter and more transparent proofs of classical identities, rank bounds, and gradient formulas that would otherwise require laborious index manipulation.

arXiv:2605.16610•May 15, 2026•2 citations

Tensor Network Contraction and Multi-Linear Algebra

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

This chapter is aimed at understanding TN algorithms from the perspective of MLA Multi-linear algebra (MLA) . In Sect. 5.1, we start from a simple example with a 1D TN Tensor network (TN) stripe, which can be “contracted” by solving the eigenvalue decomposition of matrices. This relates to several important MPS techniques such as canonicalization (Orús and Vidal, Phys Rev B 78:155117, 2008) that enables to implement optimal truncations of the bond dimensions of MPSs Matrix product state (MPS) (Sect. 5.1.1). In Sect. 5.2, we discuss about super-orthogonalization (Ran et al., Phys Rev B 86:134429, 2012) inspired by Tucker decomposition (De Lathauwer et al., SIAM J Matrix Anal Appl 21(4):1324–1342, 2000) in MLA, which is also a higher-dimensional generalization of canonicalization; it is proposed to implement optimal truncations of the iPEPSs defined on trees. In Sect. 5.3.1, we explain based on the rank-1 decomposition (De Lathauwer et al., SIAM J Matrix Anal Appl 21:1253–1278, 2000) that super-orthogonalization in fact provides the “loopless approximation” of the iPEPSs Infinite projected entangled pair state (iPEPS) on regular lattices (Ran et al., Phys Rev B 88:064407, 2013); it explains how the approximations in the simple update algorithm works for the ground-state simulations on 2D regular lattices (Jiang et al., Phys Rev Lett 101:090603, 2008). In Sect. 5.4, we will discuss tensor ring decomposition (TRD) Tensor ring decomposition (TRD) (Ran, Phys Rev E 93:053310, 2016), which is a rank-N generalization of the rank-1 decomposition. TRD naturally provides a unified description of iDMRG (White, Phys Rev Lett 69:2863, 1992; Phys Rev B 48:10345–10356, 1993; McCulloch, Infinite size density matrix renormalization group, revisited, 2008. arXiv:0804.2509) Infinite density matrix renormalization group (iDMRG) , iTEBD (Vidal, Phys Rev Lett 98:070201, 2007) Infinite time-evolving block decimation (iTEBD) , and CTMRG Corner transfer matrix renormalization group (CTMRG) (Orús and Vidal, Phys Rev B 80:094403, 2009; Fishman et al., Faster methods for contracting infinite 2D tensor networks, 2017. arXiv:1711.05881) when considering the contractions of 2D TNs Tensor network (TN) .

Lecture notes in physics•Jan 1, 2020•1 citation

Bridging Relations between SVD in Tensor Networks and Common Matrix Operations in Quantum Information Theory

John. TM. Campbell

This document explores the connections between singular value decomposition (SVD) and various tensor operations in the context of quantum state calculations and tensor networks. The relationships between SVD and quantities such as trace, trace distance, Frobenius norm, and fidelity are examined, highlighting their similarities and differences. The intuition behind these mathematical connections is explained, providing insights into the underlying principles and applications of SVD and tensor operations in quantum physics and computational mathematics

arXiv:2402.02517•Feb 4, 2024•1 citation
The purpose of this chapter is to introduce the diagrammatic representation of tensors and tensor network states and discuss some basic properties or formulas of matrices or tensors used in various renormalization group methods. It includes, for example, the singular value decomposition and the polar decomposition of matrices, the higher-order singular value decomposition of tensors, and the automatic differentiation and its backpropagation scheme. Several Trotter-Suzuki decomposition formulas of non-commutate operators are also introduced.
This chapter contains sections titled: Observables The Pauli Operators Outer Products The Closure Relation Representations of Operators Using Matrices Outer Products and Matrix Representations Matrix Representation of Operators in Two-Dimensional Spaces Hermitian, Unitary, and Normal Operators Eigenvalues and Eigenvectors Spectral Decomposition The Trace of an Operator The Expectation Value of an Operator Functions of Operators Unitary Transforms Projection Operators Positive Operators Commutator Algebra The Heisenberg Uncertainty Principle Polar Decomposition and Singular Values The Postulates of Quantum Mechanics Exercises
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.
Tensor networks are a class of methods for studying many-body systems. They give a geometrical description of the internal structure of many-body states, operators, and partition functions, that can be used to implement efficient algorithms to simulate them numerically. In this thesis, after providing a very brief overview of the field, we present new tensor network methods for three different use cases. \n \nFirst, we present a new real-space renormalization group algorithm for tensor networks. Compared to existing methods, its advantages are its low computational cost, simplicity of implementation, and applicability to any network. We benchmark it on the 2D classical Ising model and find accuracy comparable with the best existing tensor network methods. Due to its simplicity and generalizability, we consider our algorithm to be an excellent candidate for implementation of real-space renormalization in higher dimensions, and discuss some of the details and the remaining challenges in 3D. \n \nSecond, we show how certain topological conformal defects of critical lattice theories can be represented as tensor networks, using the 2D classical Ising model as an example. Furthermore, we show how such tensor network descriptions, combined with a renormalization group algorithm, can be used to obtain accurate estimates of the universal properties of these defects. We also show how coarse-graining of defects can be applied to any conformal defect (i.e. not just topological ones), and yields a set of associated scaling dimensions. \n \nFinally, we leave behind the focus on renormalization group methods, and present a method for spatially resolving the overlap between two tensor network states, to obtain localized information about the similarities and differences between them. For a given region, the similarity of two states in this region can be quantified by the Uhlmann fidelity of their reduced density matrices, and we show how such fidelities can be efficiently computed in many cases when the two states are represented as tensor networks. We demonstrate the usefulness of evaluating such subsystem fidelities with three example applications: studying local quenches, comparing critical and non-critical states, and quantifying convergence in tensor network simulations.
High-dimensional data arise naturally in many areas of science and engineering, including machine learning, signal processing, computational physics, and statistics. Such data are often represented as tensors, multi-dimensional generalizations of matrices. While tensors provide a natural representation for multi-modal structure, their direct manipulation quickly becomes challenging as the order grows: the number of parameters increases exponentially, and algebraic expressions involving many indices become difficult to interpret and implement. Tensor networks (TNs) provide an effective framework for addressing these challenges. Originally introduced by Penrose and developed extensively in quantum physics, the graphical language of tensor networks encodes contractions as edges in a graph, reducing notational overhead and revealing structural properties obscured by index notation. Despite the central role of high-dimensional tensors in modern machine learning and numerical analysis, tensor network diagrams remain underutilized outside quantum computing, partly due to the lack of a self-contained mathematical reference accessible to a broad technical audience. This manuscript provides a self-contained guide to tensor networks and their use in tensor algebra. We present the main operations on tensors, contractions, products, and reshaping through, graphical notation, and show how classical tensor decompositions and related computations are naturally expressed in this framework. We also illustrate how tensor networks simplify the derivation of gradients and the manipulation of high-dimensional probability distributions. Throughout, we show that the diagrammatic approach yields genuinely shorter and more transparent proofs of classical identities, rank bounds, and gradient formulas that would otherwise require laborious index manipulation.
This chapter is aimed at understanding TN algorithms from the perspective of MLA Multi-linear algebra (MLA) . In Sect. 5.1, we start from a simple example with a 1D TN Tensor network (TN) stripe, which can be “contracted” by solving the eigenvalue decomposition of matrices. This relates to several important MPS techniques such as canonicalization (Orús and Vidal, Phys Rev B 78:155117, 2008) that enables to implement optimal truncations of the bond dimensions of MPSs Matrix product state (MPS) (Sect. 5.1.1). In Sect. 5.2, we discuss about super-orthogonalization (Ran et al., Phys Rev B 86:134429, 2012) inspired by Tucker decomposition (De Lathauwer et al., SIAM J Matrix Anal Appl 21(4):1324–1342, 2000) in MLA, which is also a higher-dimensional generalization of canonicalization; it is proposed to implement optimal truncations of the iPEPSs defined on trees. In Sect. 5.3.1, we explain based on the rank-1 decomposition (De Lathauwer et al., SIAM J Matrix Anal Appl 21:1253–1278, 2000) that super-orthogonalization in fact provides the “loopless approximation” of the iPEPSs Infinite projected entangled pair state (iPEPS) on regular lattices (Ran et al., Phys Rev B 88:064407, 2013); it explains how the approximations in the simple update algorithm works for the ground-state simulations on 2D regular lattices (Jiang et al., Phys Rev Lett 101:090603, 2008). In Sect. 5.4, we will discuss tensor ring decomposition (TRD) Tensor ring decomposition (TRD) (Ran, Phys Rev E 93:053310, 2016), which is a rank-N generalization of the rank-1 decomposition. TRD naturally provides a unified description of iDMRG (White, Phys Rev Lett 69:2863, 1992; Phys Rev B 48:10345–10356, 1993; McCulloch, Infinite size density matrix renormalization group, revisited, 2008. arXiv:0804.2509) Infinite density matrix renormalization group (iDMRG) , iTEBD (Vidal, Phys Rev Lett 98:070201, 2007) Infinite time-evolving block decimation (iTEBD) , and CTMRG Corner transfer matrix renormalization group (CTMRG) (Orús and Vidal, Phys Rev B 80:094403, 2009; Fishman et al., Faster methods for contracting infinite 2D tensor networks, 2017. arXiv:1711.05881) when considering the contractions of 2D TNs Tensor network (TN) .
This document explores the connections between singular value decomposition (SVD) and various tensor operations in the context of quantum state calculations and tensor networks. The relationships between SVD and quantities such as trace, trace distance, Frobenius norm, and fidelity are examined, highlighting their similarities and differences. The intuition behind these mathematical connections is explained, providing insights into the underlying principles and applications of SVD and tensor operations in quantum physics and computational mathematics