Tutorial 2: Tensor Decompositions
This tutorial covers the basics of decomposing tensors into products of other tensors, including:

Special tensor types: diagonal, unitary, isometric tensors

Use of singular value decomposition 'svd' to decompose tensors

Use of spectral decomposition 'eig' to decompose tensors

Use of QR decomposition 'qr' to decompose tensors

The Frobenius norm and optimal restricted rank tensor truncations
â€‹
Code examples:
The box to the right shows the code setup necessary to run the example snippets given throughout this tutorial:
T2.1: Special tensor types: diagonal, unitary, isometric
We begin by considering some special types of tensor and the diagrammatic notation used to represent them:
Fig.2.1(a)
Fig.2.1(b)
Fig.2.1(c)
Fig.2.1(a) shows the identity tensor I, equivalent to the Kronecker delta function Î´ij, which is simply depicted as a line. Fig.2.1(b) shows a diagonal matrix D with elements {Î»1, Î»2, â€¦}, which is depicted as a small solid circle (in contrast to nondiagonal matrices, which are represented as larger or colored shapes). Fig.2.1(c) shows a higher order generalization of a diagonal tensor, again depicted as a small solid circle, which takes value Î»i if the indices match, i = j = k, and is zero otherwise.
Fig.2.1(d)
Fig.2.1(e)
Fig.2.1(d) shows a unitary matrix U, which annihilates to the identity with its conjugate Uâ€ as depicted. We often draw the conjugate of a tensor with opposite vertical orientation (and here use arrows to explicitly denote tensor orientation for clarity). (e) We say that a tensor is unitary if there exists a bipartition of the indices (here denoted by the dotted line) under which the tensor could be reshaped into a unitary matrix. In many cases the shape of a tensor can be conveniently used to indicate its orientation, eliminating the need to use arrows for this purpose.
Fig.2.1(f)
Fig.2.1(g)
Fig.2.1(f) shows an isometric matrix W, where we have assumed that d1 > d2. When contracted on the larger dimensional index with its conjugate the identity is produced, Wâ€ W = I. However, contraction the other way, WWâ€ = P, produces a projector P. A projector is a Hermitian tensor that squares to itself, as illustrated in Ex.2.1(g). These properties imply that the eigenvalues of a projector P must either be 0 or 1.
Fig.2.1(h)
Fig.2.1(i)
Fig.2.1(hi) give examples of isometric tensors, which can be reshaped into isometric matrices under the partition indicated by the dotted lines, and the constraints that they satisfy.
Diagrammatic conventions: often a unitary tensor will be represented as a rectangle or trapezoid, where the longer dimension indicates the index partition under which it can be reshaped into a unitary matrix. Similarly, isometries are often represented as wedges which 'point' in the direction of the smaller dimension (i.e such that they annihilate to identity when contracted with their conjugate along the base of the wedge). These conventions allow one to indicate the partition of indices under which a tensor becomes isometric/unitary by its shape alone, eliminating the need to indicate these partitions explicitly. However, not all tensor network researchers follow these conventions.
T2.2: Tensor decompositions
In this section we discuss how several common matrix decompositions, including the singular value decomposition (SVD), the spectral decomposition and the QR decomposition are generalized to the case of tensors. These decompositions play a key role in many tensor network algorithms, particularly for their use in schemes to approximate a highorder tensor as a product of loworder tensors.
â€‹
We begin with the SVD, a widely used decomposition in many areas of mathematics, statistics, physics and engineering, which is defined for matrices of arbitrary dimension. Below are several examples:
Fig.2.2(a): SVD
Fig.2.2(b)
Fig.2.2(a) depicts the singular value decomposition of a d1Ã—d2 matrix A (where we have assumed that d1 > d2) into a product of matrices, A = USVâ€ . Here U is a d1Ã—d2 isometric matrix, V is a d2Ã—d2 unitary matrix, and S is a d2Ã—d2 diagonal matrix with positive, real elements ordered with descending magnitude (called the singular values). The cost of performing the SVD scales the square of the smaller matrix dimension times the larger dimension, i.e. as O(d1d2^2). Here we are using the 'economical' or 'thin' form of SVD, otherwise the 'full' SVD would give both U and V as unitary matrices and S as a d1Ã—d2 diagonal matrix that is padded with zeros on the larger dimension.
Fig.2.2(b) depicts the SVD of a order3 tensor A across the partition of indices specified by the dotted line. After using the appropriate 'reshape' commands the decomposition proceeds similarly to the previous example, except that tensor U is reshaped into a order3 isometry.
Aside:
the SVD is also useful for generating random unitary and isometric tensors as shown here on the left.
The spectral decomposition (or eigendecomposition) is a particularly useful decomposition for Hermitian matrices or tensors where we desire that the decomposition explicitly reserves the Hermtian character. Below are several examples:
Fig.2.2(c): spectral decomposition
Fig.2.2(d):
Fig.2.2(c) depicts the spectral decomposition (or eigendecomposition) of a dÃ—d Hermitian matrix H into a product of matrices, H = UDUâ€ . Here U is a dÃ—d unitary matrix and D is a dÃ—d diagonal matrix of the eigenvalues of H. The cost of performing the spectral decomposition scales as O(d^3). Fig.2.2(d) depicts the spectral decomposition of a order4 tensor H, which is assumed to be Hermitian w.r.t. its top vs bottom indices. After using the appropriate 'reshape' commands the decomposition proceeds similarly to the previous example, except that the number of eigenvalues is now the product of the indices on each side of H, and the tensor U is reshaped into a order3 isometry.
Fig.2.2(e): SVD versus the spectral decomposition
Aside: For any matrix A the spectral decompositions of AAâ€ and Aâ€ A are related to the SVD of A as depicted in Fig.2.2(e). More precisely, the eigenvectors U of AAâ€ and V of Aâ€ A (trimmed to remove contributions from trivial eigenvalues) are equal to the singular vectors contained in U and V from the SVD, and the (nonzero) eigenvalues in D are the squares of the singular values in S.
The final decomposition we consider is the QR decomposition which is useful to orthogonalize a tensor network, as will be discussed later in Tutorial 3.
Fig.2.2(f): QR decomposition
Fig.2.2(g):
Fig.2.2(f) depicts the QR decomposition of a d1Ã—d2 matrix A (where we have assumed that d1 > d2) into a product of matrices, A = QR. Here Q is a d1Ã—d2 isometric matrix and R is a d2Ã—d2 uppertriangular matrix. The cost of performing the QR scales as O(d1d2^2), which is the same as the SVD, although the QR decomposition tends to be faster in practice by a constant factor. Here we are using the socalled 'economical' QR decomposition, otherwise the 'full' QR would give both Q as a d1Ã—d1 unitary matrix and would pad R with zeros. Fig.2.2(g) depicts the QR decomposition of a order3 tensor A across the partition of indices specified by the dotted line. The decomposition proceeds similarly to the previous example, except that tensor Q is reshaped into a order3 isometry.
T2.3: Frobenius norm for tensors
The matrix decompositions in the previous section are useful for approximating a single tensor as a product multiple tensors. However, before discussing such approximations it is necessary to define the tensor norm that we use. A tensor norm that is particular useful for us is the Frobenius norm (or HilbertSchmidt norm). Given a matrix Aij the norm â€–Aâ€– is defined as the squareroot of the sum of the magnitude of each element squared:
Fig.2.3(a):
The generalization of the Frobenius norm to tensors with order > 2 is very straightforward; one could either extend the summation in Ex.2.3(a) to include all indices or replace the trace tr with a tensor trace Ttr as illustrated below:
Fig.2.3(b):
Fig.2.3(c):
Fig.2.3(c) depicts the tensor trace Ttr of tensor A, which is the product of A and its conjugate Aâ€ where all matching indices are contracted. A useful property of the Frobenius norm is that it has a simple expression in terms of the singular values of a tensor. Let A be a tensor whose singular values across some chosen partition are {s1, s2, s2,...}, as depicted in Fig.2.3(d), then it follows that Ttr(AAâ€ ) is simply the square root of the sum of the singular values squared:
Fig.2.3(d):
Fig.2.3(e):
Following Fig.2.3(e) this results in a simple expression for the Frobenius norm as shown on the right:
Let us assume that we wish to approximate some tensor A with another tensor B of equal size. It is useful to define the error of approximation Îµ as the difference between the tensors in the Frobenius norm divided by the norm of A:
Fig.2.3(d):
with:
T2.4: Restricted rank tensor approximations
Given some tensor A and some bipartition of its indices, we define the decomposition rank r as the minimal internal dimension such that A can be expressed as a product of tensors, A = B â‹… C, across this partition (i.e. rank r is the dimension of the index contracted between B and C). Although we will not prove this here, it can be shown that the decomposition rank r of tensor A across a partition precisely equals the number of nonzero singular values in the SVD across the partition.
A useful application of the singular value decomposition is that it allows one to find the optimal restricted rank approximation to a tensor. Given a tensor A that has decomposition rank r with respect to some specified partition of its indices, let us assume that we wish to find an equivalent sized tensor B of reduced rank, Ï‡ < r, that best approximates A (i.e. that minimizes the difference Frobenius norm difference Îµ in Fig.2.3(d)). The factorization that minimizes the truncation error Îµ can be obtained directly from the SVD of A by simply 'trimming' the smallest singular values and truncating the U and V matrices accordingly. This is demonstrated below by approximating order5 tensor A with an order5 tensor B that has rank Ï‡ = 8 across the partition indicated, using the truncated SVD:
Fig.2.4(a):
Fig.2.4(b):
Following Fig.2.4(a), the truncation error Îµ of the optimal restricted rank approximation is simply given as the squareroot of the sum of the squares of the discarded singular values, as shown on the right (assuming that the starting tensor was properly normalized, â€–Aâ€– = 1).
Fig.2.4(c):
A useful concept is the effective rank to accuracy Î” of a tensor, denoted as r(Î”), which is defined as the number of singular values greater than or equal to Î” across the decomposition. In many cases (particularly if the spectrum of singular values is sharply decaying) then the error Îµ in truncating a tensor to rank r(Î”) will be Îµ â‰ˆ Î”, since the expression Fig.2.4(c) will be dominated by the largest singular value that is truncated. Thus the value Î” often serves as a useful proxy for the true truncation error Îµ.
In Ex.2.4(d) we generate a Toeplitz matrix A and compute the effective rank at accuracy Î” = 1e2, which evaluates to r(Î” = 1e2) = 450. We then compute the truncation error of the restricted rank approximation, which is found to be Îµ â‰ˆ 4e2.
Aside: Notice also that if a tensor H was Hermitian and positive semidefinite w.r.t the index partition, then one could obtain the optimal restricted rank approximation via the spectral decomposition by truncating the smallest weight eigenvalues. This follows from the relationship between the eigenvalues and singular values of matrices as discussed in Fig.2.2(e). The factorization given from the spectral decomposition can be more useful than that from the SVD in this context, as the former explicitly preserves the Hermitian character of H, although in principle both decompositions would have the same accuracy Îµ.
Outlook: Tensor Decompositions
Optimal restricted rank tensor approximations, obtained via the SVD or the spectral decomposition, play a central role in tensor network theory and are also essential ingredients to most tensor network algorithms. In fact, most common tensor network algorithms are simply composed of some combination of contraction steps, as discussed in Tutorial 1, together with some combination of tensor decompositions. Thus we have already learned the foundational tools of tensor network methods! Subsequent tutorials will discuss how these tools can be applied and composed into algorithms for certain tasks...
Problem Set 2:
Elementwise definition:
Pb.2: Tensor A is an order4 tensor that we define elementwise as given above. Note that the difference between the MATLAB/Julia and Python definitions follows from the use of 1based indexing in the former versus the use 0based indexing in the latter, but it is still the same tensor between all three programming languages.
â€‹
(a) Assume that indices i, j are of dimension d1 and indices k, l are of dimension d2 (with d2 < d1). How does the cost of taking the SVD across the indicated partition scale with d1 and d2?
â€‹
(b) Generate the tensor A for d1 = 10 and d2 = 8. What is the norm â€–Aâ€–? After computing the norm construct the normalized tensor: A' = A / â€–Aâ€–.
â€‹
(c) Take the SVD of A' across the indicated partition. Check that the square root of the sum of the singular values squared is equal to 1. Why is this the case?
â€‹
(d) What is the effective rank r(Î”) of A' at Î” = 1e4 ?
â€‹
(e) Compute the truncation error Îµ of the restricted rank approximation r(Î”=1e4) indirectly using the singular values as per Fig.2.4(c)
â€‹
(f) Construct the optimal restricted rank approximation to A' via the truncated SVD. Compute the truncation error Îµ of this approximation and check that your answer is consistent with part (e).