Quantum Information and Channels: A formalization blueprint

2 Quantum Channels and Positive Maps

This chapter develops the theory of positive maps and quantum channels on matrix algebras, following  [ Wol12 ] .

2.1 Positive and completely positive maps

Definition 2.1.1 Positive map
#

A linear map \(E : M_{n}(\mathbb {C}) \to M_{m}(\mathbb {C})\) is positive if \(E(X) \ge 0\) whenever \(X \ge 0\), where \(X \ge 0\) means that \(X\) is positive semidefinite.

Definition 2.1.2 Trace-preserving map
#

A linear map \(E : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\) is trace-preserving if \(\operatorname{tr}(E(X)) = \operatorname{tr}(X)\) for all \(X\).

Remark 2.1.3
#

We use the Loewner order on matrices: \(X \le Y\) means \(Y - X \ge 0\).

Theorem 2.1.4 Finite frame criterion

Let \((v_i)_{i\in I}\) be a finite family in \(\mathbb {C}^n\). Then

\begin{align} \sum _{i\in I}|v_i\rangle \! \langle v_i|{\gt}0 \quad \Longleftrightarrow \quad \operatorname {span}\{ v_i:i\in I\} =\mathbb {C}^n. \notag \end{align}
Proof

Let \(B:\mathbb {C}^I\to \mathbb {C}^n\) be the synthesis map with columns \(v_i\). The frame operator is \(BB^\dagger \), while the vectors span exactly when \(B\) is surjective. A right inverse of \(B\) makes \(B^\dagger \) injective, which gives positive definiteness of \(BB^\dagger \). Conversely, if \(BB^\dagger \) is positive definite, then \(B^\dagger (BB^\dagger )^{-1}\) is a right inverse of \(B\).

Definition 2.1.5 Completely positive map
#

A linear map \(E : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\) is completely positive (CP) if it admits a Kraus representation: there exist operators \(\{ K_i\} _{i=0}^{r-1}\) with \(K_i \in M_{D}(\mathbb {C})\) such that, for every \(X \in M_{D}(\mathbb {C})\),

\begin{align} E(X) & = \sum _{i=0}^{r-1} K_i X K_i^\dagger . \label{eq:channel_kraus_representation} \end{align}

The Kraus representation also gives entrywise positivity on every positive block matrix by Theorem 2.2.1, and hence the associated completely positive map between matrix \(C^*\)-algebras in Theorem 2.2.2.

2.2 Kraus representations and complete positivity

This section proves the two complete-positivity consequences stated after Definition 2.1.5: entrywise positivity on block matrices and the associated completely positive map between matrix \(C^*\)-algebras.

Theorem 2.2.1 Entrywise complete positivity from a Kraus representation
#

Let \(E : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\) be completely positive in the Kraus sense. For every \(k\) and every positive block matrix \(M \in M_k(M_{D}(\mathbb {C}))\), the entrywise image \((E(M_{ab}))_{a,b}\) is again positive in \(M_k(M_{D}(\mathbb {C}))\).

Proof

Write \(E\) in the Kraus form (1). For each \(i\), let \(d_i\) be the block-diagonal matrix with \(K_i\) on every diagonal block. Then

\begin{align} (E(M_{ab}))_{a,b} & =\sum _i d_i M d_i^\dagger . \notag \end{align}

Each term on the right is positive because conjugation preserves positivity, and a finite sum of positive matrices is positive.

Theorem 2.2.2 Kraus maps as abstract completely positive maps

Every Kraus-represented completely positive map \(E : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\) determines a completely positive map between the matrix \(C^*\)-algebras in the entrywise positivity sense.

Proof

The defining entrywise positivity condition is exactly Theorem 2.2.1.

Thus the Kraus formulation of Definition 2.1.5 has the two consequences cited there: entrywise complete positivity and the associated abstract completely positive map.

Theorem 2.2.3 CP maps are positive

Every rectangular Kraus completely positive map is positive. In particular, every square completely positive map is positive.

Proof

By the Kraus representation (1), if \(X \ge 0\), then each summand \(K_i X K_i^\dagger \ge 0\) because conjugation preserves positive semidefiniteness. Hence their sum is positive semidefinite.

2.3 Quantum channels

Definition 2.3.1 Quantum channel
#

A linear map \(E : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\) is a quantum channel if it is both completely positive and trace-preserving (CPTP), following  [ Wol12 ] .

Theorem 2.3.2 Channels are positive

Every quantum channel is positive.

Proof

A quantum channel is completely positive by definition, so Theorem 2.2.3 applies.

2.4 Rectangular positive maps, trace bounds, and density matrices

Definition 2.4.1 Associated positive linear map
#

A positive matrix map \(E : M_{n}(\mathbb {C}) \to M_{m}(\mathbb {C})\) determines the same linear map regarded as a positive linear map: if \(A,B\in M_{n}(\mathbb {C})\) and \(A \le B\), then \(E(A) \le E(B)\) in \(M_{m}(\mathbb {C})\).

Definition 2.4.2 Positive map between matrix algebras
#

A linear map \(T : M_{D}(\mathbb {C}) \to M_{D'}(\mathbb {C})\) between matrix algebras of possibly different dimensions is positive if \(T(X) \ge 0\) whenever \(X \ge 0\), where \(X \ge 0\) means that \(X\) is positive semidefinite. For \(D' = D\) this is the notion of Definition 2.1.1.

Definition 2.4.3 Trace-preserving map between matrix algebras
#

A linear map \(T : M_{D}(\mathbb {C}) \to M_{D'}(\mathbb {C})\) between matrix algebras of possibly different dimensions is trace-preserving if \(\operatorname{tr}(T(X)) = \operatorname{tr}(X)\) for all \(X\). For \(D' = D\) this is the notion of Definition 2.1.2.

Theorem 2.4.4 The trace bounds a positive matrix

Let \(D\geq 1\) and let \(P\in M_{D}(\mathbb {C})\) be positive semidefinite. Then

\begin{align} P & \preceq \operatorname{tr}(P)\mathbb {1}. \label{eq:channel_psd_trace_bound} \end{align}
Proof

Diagonalize \(P\) with non-negative eigenvalues \(\lambda _1,\ldots ,\lambda _D\). Each is at most their sum \(\operatorname{tr}(P)\), so every eigenvalue of \(\operatorname{tr}(P)\mathbb {1}-P\) is non-negative.

Theorem 2.4.5 Positive maps preserve Hermiticity
#

If \(E:M_{n}(\mathbb {C})\to M_{m}(\mathbb {C})\) is positive and \(X\in M_{n}(\mathbb {C})\) satisfies \(X = X^\dagger \), then \(E(X) = E(X)^\dagger \) in \(M_{m}(\mathbb {C})\).

Proof

Regard \(E\) as the associated positive linear map (Definition 2.4.1). For positive linear maps between matrix \(C^*\)-algebras, \(E(Y^\ast )=E(Y)^\ast \). Since \(X=X^\dagger \) means \(X=X^\ast \), one obtains \(E(X)^\dagger =E(X)^\ast =E(X^\ast )=E(X)\).

Definition 2.4.6 Density matrices
#

The set of density matrices in \(M_{D}(\mathbb {C})\) is

\begin{align} \mathcal{D}_D & =\{ \rho \in M_{D}(\mathbb {C}) : \rho \ge 0,\ \operatorname{tr}(\rho ) = 1\} . \label{eq:channel_density_matrices} \end{align}
Proof

The spectral decomposition expresses every density matrix as a convex combination of its unit rank-one eigenprojectors, with the eigenvalues as nonnegative weights summing to one. Conversely, positivity forces every positive summand dominated by a rank-one projector to lie on the same nonnegative ray; the trace-one condition fixes its coefficient to one.

2.5 Trace adjoints and rectangular Kraus maps

Definition 2.5.1 Trace-pairing adjoint
#

The trace-pairing adjoint \(E^* : M_{D'}(\mathbb {C}) \to M_{D}(\mathbb {C})\) of a linear map \(E : M_{D}(\mathbb {C}) \to M_{D'}(\mathbb {C})\) between matrix algebras of possibly different dimensions is the adjoint for the bilinear pairing \((A,B)\mapsto \operatorname{tr}(AB)\).

Definition 2.5.2 Completely positive map in rectangular Kraus form
#

A linear map \(\mathcal S\) between matrix algebras is completely positive in rectangular Kraus form if there are finitely many operators \(A_i:H\to K\) such that

\begin{align} \mathcal S(X)& =\sum _i A_iXA_i^\dagger . \notag \end{align}

No trace-preservation normalization is imposed.

Lemma 2.5.3 Agreement with square-map complete positivity
#

When the input and output matrix algebras agree, rectangular Kraus complete positivity is equivalent to the square-map notion of complete positivity.

Lemma 2.5.4 Basic properties of rectangular Kraus complete positivity

A map in rectangular Kraus form sends positive semidefinite matrices to positive semidefinite matrices. Every trace-preserving completely positive Kraus map is a completely positive Kraus map.

Lemma 2.5.5 Sum of rectangular Kraus maps
#

The sum of two completely positive maps in rectangular Kraus form is completely positive in rectangular Kraus form.

Proof

Concatenating Kraus families for the two summands gives a Kraus family for their sum.

Definition 2.5.6 Trace-preserving completely positive map
#

A linear map \(\mathcal{S}\) between matrix algebras is trace-preserving completely positive if it has a Kraus form \(\mathcal{S}(X)=\sum _i A_iXA_i^\dagger \) with \(\sum _i A_i^\dagger A_i=I\). The Kraus operators may be rectangular, so the input and output dimensions need not agree.

Theorem 2.5.7 Trace preservation completes a Kraus channel

A completely positive map in rectangular Kraus form that preserves the matrix trace is trace-preserving completely positive.

Proof

If \((A_i)_i\) is a Kraus family, trace preservation and cyclicity give \(\operatorname{tr}((\sum _i A_i^\dagger A_i)X)=\operatorname{tr}(X)\) for every \(X\). Nondegeneracy of the trace pairing implies \(\sum _i A_i^\dagger A_i=\mathbb {1}\).

Theorem 2.5.8 Trace preservation from a Kraus resolution
#

Every trace-preserving completely positive map in rectangular Kraus form preserves the matrix trace.

Proof

If \(\mathcal S(X)=\sum _a A_aXA_a^\dagger \) and \(\sum _a A_a^\dagger A_a=I\), cyclicity gives

\begin{align} \operatorname{tr}\mathcal S(X) & =\sum _a\operatorname{tr}(A_aXA_a^\dagger ) =\operatorname{tr}\left(\left(\sum _a A_a^\dagger A_a\right)X\right) =\operatorname{tr}X. \notag \end{align}

If \(\mathcal S:M_{D}(\mathbb {C})\to M_{D'}(\mathbb {C})\) is trace-preserving and completely positive, then its trace-pairing adjoint satisfies

\begin{align} \mathcal S^*(\mathbb {1}_{D'}) & =\mathbb {1}_D. \notag \end{align}

This is the Schrödinger–Heisenberg duality of [ Wol12 , Section 1.2 ] .

Proof

For every \(X\in M_{D}(\mathbb {C})\), trace duality and trace preservation give

\begin{align} \operatorname{tr}\bigl(\mathcal S^*(\mathbb {1}_{D'})X\bigr) & =\operatorname{tr}\bigl(\mathcal S(X)\bigr) =\operatorname{tr}(X) =\operatorname{tr}(\mathbb {1}_DX). \notag \end{align}

Nondegeneracy of the trace pairing proves the identity.

Lemma 2.5.10 Positivity preservation for Kraus maps
#

If \(\mathcal S\) is trace-preserving completely positive and \(X\geq 0\), then \(\mathcal S(X)\geq 0\).

2.6 The Choi–Jamiolkowski representation of maps between matrix algebras

Fix \(d,d'\geq 1\). For a linear map \(T:M_{d}(\mathbb {C})\to M_{d'}(\mathbb {C})\) between matrix algebras of possibly different dimensions, write \(\Omega _d\) for the maximally entangled vector on the input factor and \(\tau \) for the associated operator on \(\mathbb {C}^{d'}\otimes \mathbb {C}^{d}\), with the output factor first. The partial trace over the output factor is written \(\operatorname{tr}_A\) and the partial trace over the input factor is written \(\operatorname{tr}_B\).

Definition 2.6.1 Choi matrix of a map between matrix algebras

The Choi matrix of a linear map \(T:M_{d}(\mathbb {C})\to M_{d'}(\mathbb {C})\) is

\begin{align} \tau & = (T\otimes \operatorname {id}_d) \bigl(|\Omega _d\rangle \! \langle \Omega _d|\bigr), \notag \end{align}

an operator on \(\mathbb {C}^{d'}\otimes \mathbb {C}^{d}\). This is the correspondence of [ Wol12 , Proposition 2.1 ] .

Lemma 2.6.2 Linearity of the Choi assignment

Write \(\tau _T\) for the Choi matrix of \(T\). For all linear maps \(T,S:M_{d}(\mathbb {C})\to M_{d'}(\mathbb {C})\), all \(c\in \mathbb {C}\), all finite index sets \(s\) and all families \((T_i)_{i\in s}\),

\begin{align} \tau _{T+S} & = \tau _T + \tau _S, \label{eq:choi_rect_linear_add}\\ \tau _{cT} & = c\, \tau _T, \label{eq:choi_rect_linear_smul}\\ \tau _{\sum _{i\in s}T_i} & = \sum _{i\in s}\tau _{T_i}. \label{eq:choi_rect_linear_sum} \end{align}
Proof

Each entry \(\tau _{(i_1,i_2),(j_1,j_2)}\) is the value of \(T\) at a fixed matrix, read off at a fixed pair of indices, so (4) and (5) hold entrywise. They make \(T\mapsto \tau _T\) a complex linear map, and (6) is the image of a finite sum under it.

Theorem 2.6.3 Mutual inverses of the Choi correspondence

The assignments \(T\mapsto \tau \) and \(\tau \mapsto T\), the latter defined entrywise by

\begin{align} T(B)_{i_1 j_1} & = d\sum _{i_2,j_2=0}^{d-1} \tau _{(i_1,i_2),(j_1,j_2)}\, B_{i_2 j_2}, \notag \end{align}

are mutual inverses: every linear map is recovered from its Choi matrix, and every operator on \(\mathbb {C}^{d'}\otimes \mathbb {C}^{d}\) is the Choi matrix of the map it defines. This is [ Wol12 , Proposition 2.1, Equation (2.4) ] .

Proof

The \((i_2,j_2)\)-slice of \(|\Omega _d\rangle \! \langle \Omega _d|\) is the matrix unit \(E_{i_2 j_2}\) scaled by \(1/d\); substituting it into the defining entries and using linearity gives both compositions.

Theorem 2.6.4 Trace-pairing formula

For every \(A\in M_{d'}(\mathbb {C})\) and \(B\in M_{d}(\mathbb {C})\),

\begin{align} \operatorname{tr}\! \bigl(A\, T(B)\bigr) & = d\, \operatorname{tr}\! \bigl(\tau \, (A\otimes B^{T})\bigr). \notag \end{align}

This is the second line of [ Wol12 , Proposition 2.1, Equation (2.1) ] .

Proof

Expand \(\operatorname{tr}(A\, T(B))\) entrywise, insert the inverse assignment of Theorem 2.6.3, and identify the resulting four-fold sum with \(d\, \operatorname{tr}(\tau \, (A\otimes B^{T}))\).

Theorem 2.6.5 Hermiticity preservation

The Choi matrix is Hermitian, \(\tau =\tau ^\dagger \), if and only if \(T(B^\dagger )=T(B)^\dagger \) for every \(B\in M_{d}(\mathbb {C})\). This is the Hermiticity clause of [ Wol12 , Proposition 2.1 ] .

Proof

The entries of \(\tau \) along the diagonal slices are the entries of \(T(E_{i_2 j_2})\) scaled by \(1/d\), so Hermiticity of \(\tau \) is the relation \(T(E_{j_2 i_2})=T(E_{i_2 j_2})^\dagger \) on matrix units; both directions then follow by linearity.

The map \(T\) is completely positive, in the sense that it admits a Kraus representation \(T(X)=\sum _{j}K_jXK_j^\dagger \) with \(K_j\in M_{d'\times d}(\mathbb {C})\), if and only if \(\tau \geq 0\). This is the complete-positivity clause of [ Wol12 , Proposition 2.1 ] .

Proof

If \(T(X)=\sum _j K_jXK_j^\dagger \), then \(\tau =\sum _j|\psi _j\rangle \! \langle \psi _j|\) with \((\psi _j)_{(i_1,i_2)}=(K_j)_{i_1 i_2}/\sqrt{d}\), so \(\tau \geq 0\). Conversely, a positive semidefinite \(\tau \) decomposes into rank-one outer products \(\sum _j|\psi _j\rangle \! \langle \psi _j|\), and rescaling the vectors \(\psi _j\) by \(\sqrt{d}\) gives Kraus operators via the inverse assignment.

The input-factor partial trace of the Choi matrix is \(\operatorname{tr}_B(\tau )=T(\mathbb {1}_d)/d\); hence \(T(\mathbb {1}_d)=\mathbb {1}_{d'}\) if and only if \(\operatorname{tr}_B(\tau )=\mathbb {1}_{d'}/d\). This is the unitality clause of [ Wol12 , Proposition 2.1 ] .

Proof

The diagonal slices of \(|\Omega _d\rangle \! \langle \Omega _d|\) sum to \(\mathbb {1}_d/d\), so linearity gives \(\operatorname{tr}_B(\tau )=T(\mathbb {1}_d)/d\); cancelling the factor \(1/d\) gives the equivalence.

The output-factor partial trace of the Choi matrix is \(\operatorname{tr}_A(\tau )=(T^*(\mathbb {1}_{d'}))^{T}/d\), where \(T^*\) is the trace-pairing adjoint; hence \(T^*(\mathbb {1}_{d'})=\mathbb {1}_d\), equivalently \(T\) preserves the trace, if and only if \(\operatorname{tr}_A(\tau )=\mathbb {1}_d/d\). This is the trace-preservation clause of [ Wol12 , Proposition 2.1 ] .

Proof

The output-factor partial trace has entries \(\operatorname{tr}(T(E_{i_2 j_2}))/d\), which are the entries of \((T^*(\mathbb {1}_{d'}))^{T}/d\) by the defining trace pairing of the adjoint. The equivalence \(\operatorname{tr}(T(X))=\operatorname{tr}(X)\Leftrightarrow T^*(\mathbb {1}_{d'})=\mathbb {1}_d\) is the nondegeneracy of the trace pairing, and transposition and the factor \(1/d\) cancel.

Theorem 2.6.9 Trace normalization

The full trace of the Choi matrix is \(\operatorname{tr}(\tau )=\operatorname{tr}(T^*(\mathbb {1}_{d'}))/d\). This is the normalization clause of [ Wol12 , Proposition 2.1 ] .

Proof

Take the trace of the identity \(\operatorname{tr}_A(\tau )=(T^*(\mathbb {1}_{d'}))^{T}/d\) of Theorem 2.6.8.

Theorem 2.6.10 Doubly-stochastic maps

The conditions \(T(\mathbb {1}_d)\propto \mathbb {1}_{d'}\) and \(T^*(\mathbb {1}_{d'})\propto \mathbb {1}_d\) hold if and only if \(\operatorname{tr}_B(\tau )\propto \mathbb {1}_{d'}\) and \(\operatorname{tr}_A(\tau )\propto \mathbb {1}_d\). This is the doubly-stochastic clause of [ Wol12 , Proposition 2.1 ] .

Proof

Immediate from the partial-trace identities \(\operatorname{tr}_B(\tau )=T(\mathbb {1}_d)/d\) and \(\operatorname{tr}_A(\tau )=(T^*(\mathbb {1}_{d'}))^{T}/d\) of Theorems 2.6.7 and 2.6.8.

Every linear map \(T:M_{d}(\mathbb {C})\to M_{d'}(\mathbb {C})\) is a complex linear combination of four completely positive maps. If \(T\) is Hermitian, that is \(T(B^\dagger )=T(B)^\dagger \) for every \(B\in M_{d}(\mathbb {C})\), then \(T\) is a real linear combination of two of them. This is [ Wol12 , Proposition 2.2 ] .

Proof

The assignment \(T\leftrightarrow \tau \) is linear by Lemma 2.6.2 and one-to-one by Theorem 2.6.3, so it suffices to decompose \(\tau \). The identity

\begin{align} \tau & = \frac{\tau +\tau ^\dagger }{2} + i\, \frac{i\tau ^\dagger -i\tau }{2} \label{eq:choi_rect_hermitian_split} \end{align}

presents \(\tau \) as a complex linear combination of two Hermitian operators, and the spectral decomposition writes each of them as the difference of its positive and negative parts, both positive semidefinite. Every positive semidefinite operator on \(\mathbb {C}^{d'}\otimes \mathbb {C}^{d}\) is the Choi matrix of a completely positive map, so carrying the four positive semidefinite pieces back through the correspondence produces the four completely positive maps, with coefficients \(1,-1,i,-i\). If \(T\) is Hermitian then \(\tau \) is Hermitian by Theorem 2.6.5, so the second summand of (7) vanishes and the positive and negative parts of \(\tau \) alone give two completely positive maps, with coefficients \(1\) and \(-1\).

2.7 The Kraus representation theorem for rectangular matrix algebras

Let \(T(X)=\sum _{j=1}^{r}K_jXK_j^\dagger \) with \(K_j\in M_{d'\times d}(\mathbb {C})\). Then \(T\) is trace preserving if and only if \(\sum _j K_j^\dagger K_j=\mathbb {1}_d\), and unital if and only if \(\sum _j K_jK_j^\dagger =\mathbb {1}_{d'}\). This is item 1 of [ Wol12 , Theorem 2.1 ] .

Proof

Cyclicity of the trace gives \(\operatorname{tr}\bigl(\bigl(\sum _j K_j^\dagger K_j\bigr)X\bigr)=\operatorname{tr}(T(X))\) for every \(X\), so the trace-preserving equivalence follows from nondegeneracy of the trace pairing; the unital equivalence is the evaluation at \(X=\mathbb {1}_d\).

Definition 2.7.2 Kraus cardinality and Kraus rank

A map \(T:M_{d}(\mathbb {C})\to M_{d'}(\mathbb {C})\) has Kraus cardinality \(r\) if it has an exact \(r\)-operator Kraus representation. Its Kraus rank (Choi rank) is the rank of its Choi matrix, \(r=\operatorname {rank}(\tau )\); following [ Wol12 , Theorem 2.1, footnote ] , this is distinguished from the rank of \(T\) as a linear map.

The minimal number of Kraus operators of a completely positive map \(T:M_{d}(\mathbb {C})\to M_{d'}(\mathbb {C})\) is \(r=\operatorname {rank}(\tau )\leq dd'\). This is item 2 of [ Wol12 , Theorem 2.1 ] .

Proof

Every \(r\)-operator Kraus family gives \(\tau =\sum _{j=1}^{r}|\psi _j\rangle \! \langle \psi _j|\), so \(\operatorname {rank}(\tau )\leq r\). Conversely, the spectral decomposition of \(\tau \geq 0\) into \(\operatorname {rank}(\tau )\) rank-one outer products yields a Kraus family of exactly \(\operatorname {rank}(\tau )\) operators by Theorem 2.6.6, and \(\operatorname {rank}(\tau )\leq dd'\) since \(\tau \) acts on a \(dd'\)-dimensional space.

Theorem 2.7.4 Orthogonal minimal Kraus family

Every completely positive map \(T:M_{d}(\mathbb {C})\to M_{d'}(\mathbb {C})\) admits a Kraus representation with \(r=\operatorname {rank}(\tau )\) Hilbert–Schmidt orthogonal Kraus operators, \(\operatorname{tr}[K_i^\dagger K_j]\propto \delta _{ij}\); the off-diagonal traces vanish and the diagonal traces are nonzero. This is item 3 of [ Wol12 , Theorem 2.1 ] .

Proof

Choose the \(\psi _j\) in the spectral decomposition of Theorem 2.7.3 to be orthogonal eigenvectors; the corresponding Kraus operators then satisfy \(\operatorname{tr}[K_i^\dagger K_j]=d\, \lambda _i\, \delta _{ij}\), where \(\lambda _i\) is the \(i\)-th nonzero eigenvalue of \(\tau \).

Two sets of Kraus operators \(\{ K_j\} \) and \(\{ \widetilde{K}_\ell \} \) represent the same completely positive map if and only if there is a unitary \(U\) with \(K_j=\sum _\ell U_{j\ell }\widetilde{K}_\ell \), where the smaller set is padded with zero operators; equivalently, after padding, the families are related by an isometry \(V\) with \(V^\dagger V=\mathbb {1}\). This is item 4 of [ Wol12 , Theorem 2.1 ] .

Proof

An isometric combination preserves the map by the orthogonality relations of the mixing matrix. Conversely, equal maps have equal trace-pairing adjoints, hence equal Gram matrices for the vectorized Kraus operators \((K_j)_{ab}\); equal Gram matrices are related by a unitary, whose rectangular submatrix is the claimed isometry after zero-padding.

2.8 Tensor-factor maps and controlled partial traces

Definition 2.8.1 Map on the second tensor factor
#

For a linear map \(\Psi _B\) and a bipartite matrix \(\rho _{AB}\), define

\begin{align} (\operatorname{id}_A\otimes \Psi _B)(\rho _{AB}) & =\Sigma _{B'A}\bigl((\Psi _B\otimes \operatorname{id}_A) (\Sigma _{AB}(\rho _{AB}))\bigr), \notag \end{align}

where \(\Sigma \) denotes the canonical exchange of the two tensor factors.

Definition 2.8.2 Independent maps on both tensor factors
#

For linear maps \(\Phi _A\) and \(\Psi _B\), set

\begin{align} (\Phi _A\otimes \Psi _B)(\rho ) & =(\operatorname{id}_{A'}\otimes \Psi _B) ((\Phi _A\otimes \operatorname{id}_B)(\rho )). \notag \end{align}
Lemma 2.8.3 Positivity under a map on the first tensor factor
#

If \(\Phi _A\) is trace-preserving completely positive and \(\rho _{AB}\geq 0\), then \((\Phi _A\otimes \operatorname{id}_B)(\rho )\geq 0\).

Lemma 2.8.4 Positivity under a map on the second tensor factor

If \(\Psi _B\) is trace-preserving completely positive and \(\rho _{AB}\geq 0\), then \((\operatorname{id}_A\otimes \Psi _B)(\rho )\geq 0\).

Lemma 2.8.5 Positivity under independent maps

If \(\Phi _A\) and \(\Psi _B\) are trace-preserving completely positive and \(\rho _{AB}\geq 0\), then \((\Phi _A\otimes \Psi _B)(\rho )\geq 0\).

Definition 2.8.6 Controlled dependent partial trace
#

Let

\begin{align} H & =\bigoplus _{i\in I}(A_i\otimes B_i), \notag \\ K & =\bigoplus _{i\in I}A_i. \notag \end{align}

The controlled dependent partial trace discards the off-diagonal blocks between distinct \(i\) and applies \(\operatorname{tr}_{B_i}\) to the \(i\)th diagonal block.

Theorem 2.8.7 Diagonal blocks of the controlled dependent partial trace

If \(X_{ii}\) denotes the \(i\)th diagonal block of \(X\), then \([\mathcal C_{\operatorname{tr}}(X)]_{ii}=\operatorname{tr}_{B_i}(X_{ii})\).

Proof

If \((K_{i,j})_j\) is the Kraus family chosen for \(\operatorname{tr}_{B_i}\), then the diagonal-block formula gives

\begin{align} [\mathcal C_{\operatorname{tr}}(X)]_{ii} & =\sum _j K_{i,j}X_{ii}K_{i,j}^\dagger =\operatorname{tr}_{B_i}(X_{ii}). \notag \end{align}
Theorem 2.8.8 The controlled dependent partial trace is trace-preserving completely positive

The controlled dependent partial trace is trace-preserving and completely positive.

Proof

Choose Kraus operators \((V_{i,a})_a\) for \(\operatorname{tr}_{B_i}\) and extend each \(V_{i,a}\) by zero outside the \(i\)th summand. Their controlled family satisfies

\begin{align} \sum _{i,a}\widetilde V_{i,a}^{\dagger }\widetilde V_{i,a} & =\bigoplus _i\left(\sum _aV_{i,a}^{\dagger }V_{i,a}\right) =\bigoplus _i \mathbb {1}_{A_i\otimes B_i} =\mathbb {1}_H. \notag \end{align}

Its Kraus form gives complete positivity, and the displayed resolution of the identity gives trace preservation.

2.9 Irreducibility

Definition 2.9.1 Orthogonal projection
#

A matrix \(P \in M_{D}(\mathbb {C})\) is an orthogonal projection if \(P = P^\dagger \) and \(P^2 = P\).

Definition 2.9.2 Irreducible map
#

A linear map \(E : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\) is irreducible if whenever \(P\) is an orthogonal projection satisfying \(E(P M_{D}(\mathbb {C}) P) \subseteq P M_{D}(\mathbb {C}) P\), then \(P = 0\) or \(P = \mathbb {1}\). This is [ Wol12 , Theorem 6.2(1) ] . The definition applies to any linear map; complete positivity is not required.

Theorem 2.9.3 Orthogonal projections and involutive-algebra projections

For a complex square matrix, the two descriptions \(P=P^\dagger \), \(P^2=P\) and \(P^*=P\), \(P^2=P\) are equivalent.

Proof

Since the involution on \(M_{D}(\mathbb {C})\) is conjugate transpose, \(P^*=P^\dagger \). Therefore \(P^\dagger =P\), \(P^2=P\) if and only if \(P^*=P\), \(P^2=P\).

Theorem 2.9.4 Coisometric transport of a star projection

Let \(Q\) be a self-adjoint idempotent on a finite-dimensional space, and let \(U\) be a coisometry onto that space, so that \(UU^\dagger =\mathbb {1}\). Then \(U^\dagger Q U\) is self-adjoint and idempotent.

Proof

Self-adjointness follows from \((U^\dagger Q U)^\dagger =U^\dagger Q^\dagger U=U^\dagger Q U\). Idempotence follows from

\begin{align} (U^\dagger Q U)^2 & =U^\dagger Q(UU^\dagger )QU =U^\dagger Q^2U =U^\dagger Q U. \notag \end{align}
Theorem 2.9.5 Vectorized identity realizes the trace pairing
#

For every square complex matrix \(X\),

\begin{align} \operatorname {vec}(\mathbb {1})\mathbin {\boldsymbol \cdot } \operatorname {vec}(X)& =\operatorname{tr}(X). \end{align}
Proof

Expanding column stacking gives

\begin{align} \sum _{i,j}(\mathbb {1})_{ij}X_{ij} & =\sum _{i,j}\delta _{ij}X_{ij} =\sum _iX_{ii} =\operatorname{tr}(X). \end{align}
Lemma 2.9.6 Pairwise orthogonality from a projection resolution

Let \((Q_k)_k\) be a finite family of orthogonal projections satisfying \(\sum _k Q_k=\mathbb {1}\). If \(k\ne \ell \), then \(Q_kQ_\ell =0\).

Proof

Multiplying the resolution of the identity on both sides by \(Q_k\) gives \(\sum _j Q_kQ_jQ_k=Q_k\). Each summand is positive semidefinite because \(Q_kQ_jQ_k=(Q_jQ_k)^*(Q_jQ_k)\), while the \(j=k\) summand is already \(Q_k\). Subtracting that term and taking traces gives

\begin{align} 0 & =\sum _{j\ne k}\operatorname{tr}((Q_jQ_k)^*(Q_jQ_k)) =\sum _{j\ne k}\lVert Q_jQ_k\rVert _{\mathrm F}^{2}. \notag \end{align}

Hence \(Q_jQ_k=0\) for \(j\ne k\), and taking adjoints gives \(Q_kQ_j=0\).

Theorem 2.9.7 Complement of an orthogonal projection

If \(P \in M_{D}(\mathbb {C})\) is an orthogonal projection, then \(\mathbb {1}-P\) is an orthogonal projection.

Proof

In the involutive algebra \(M_{D}(\mathbb {C})\), \(P\) satisfies \(P^\dagger =P\) and \(P^2=P\). Hence \((\mathbb {1}-P)^\dagger =\mathbb {1}-P\) and \((\mathbb {1}-P)^2=\mathbb {1}-2P+P^2=\mathbb {1}-P\). Thus \(\mathbb {1}-P\) is an orthogonal projection.

The transfer map and injectivity predicate below are relocated here from the matrix-product-vector chapter: both are stated for an arbitrary finite matrix family (a family indexed by a physical dimension \(d\), with no tensor-network content of its own), and the peripheral-spectrum and Perron–Frobenius theorems of this and the following chapters cite them across the chapter boundary.

Definition 2.9.8 Transfer map
#

The transfer map associated to a finite matrix family \(A\) is the finite Kraus map of that family; the notation \(\mathcal{E}_A\) abbreviates the linear map \(M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\) defined by

\begin{align} \mathcal{E}_A(X) & = \sum _{i=0}^{d-1} A^i X (A^i)^\dagger . \label{eq:mps_transfer_map} \end{align}
Definition 2.9.9 Injectivity
#

A finite matrix family \(A\) is injective if its matrices span the full matrix algebra: \(\operatorname{span}_{\mathbb {C}}\{ A^i : i = 0,\ldots ,d{-}1\} = M_{D}(\mathbb {C})\).

Theorem 2.9.10 Injectivity implies irreducibility

If \(A\) is an injective MPS tensor, then its transfer map \(\mathcal{E}_A\) is irreducible.

Proof

If \(P\) is an invariant projection for \(\mathcal{E}_A\), then \((\mathbb {1}-P)A^iP=0\) for all \(i\). Since the \(\{ A^i\} \) span \(M_{D}(\mathbb {C})\), \((\mathbb {1}-P)MP=0\) for all \(M\), so \(P=0\) or \(P=\mathbb {1}\).

2.10 Transfer maps

Theorem 2.10.1 Transfer map is CP

The transfer map \(\mathcal{E}_A(X)=\sum _i A^iX(A^i)^\dagger \) is completely positive.

Proof

It is already written in the Kraus form (1), with Kraus operators \(\{ A^i\} \).

Theorem 2.10.2 Trace adjointness of a Kraus map

For matrices \(\rho \) and \(X\) and a finite family \((K_i)_i\),

\begin{align} \operatorname{tr}\! \left(\rho \sum _i K_iXK_i^\dagger \right) & =\operatorname{tr}\! \left(\left(\sum _iK_i^\dagger \rho K_i\right)X\right). \end{align}
Proof

Apply Lemma 6.13.1 to the Kraus map determined by \((K_i)_i\).

Lemma 2.10.3 Trace adjointness of a transfer map

The trace-adjoint identity of Theorem 2.10.2 holds when the Kraus family is the family of matrices of an MPS tensor and the two Kraus maps are written as transfer maps.

Proof

Apply the Kraus-map trace identity directly, since transfer-map notation abbreviates the finite Kraus maps of the two matrix families.

Lemma 2.10.4 Left-canonical transfer maps preserve trace

If \(A\) is left canonical, then, for every bond matrix \(X\),

\begin{align} \operatorname{tr}(\mathcal{E}_A(X))& =\operatorname{tr}(X). \notag \end{align}
Proof

Cyclicity of trace gives

\begin{align} \operatorname{tr}(\mathcal{E}_A(X)) & =\operatorname{tr}\! \left(\left(\sum _i(A^i)^\dagger A^i\right)X\right) =\operatorname{tr}(X), \notag \end{align}

since left canonicity makes the sum in parentheses equal to the identity.

Theorem 2.10.5 Transfer map is a channel

If \(\sum _i(A^i)^\dagger A^i=\mathbb {1}\), then the transfer map \(\mathcal{E}_A(X)=\sum _i A^iX(A^i)^\dagger \) is a quantum channel (CPTP).

Proof

Complete positivity is Theorem 2.10.1. Trace preservation follows by cyclicity and the normalization hypothesis:

\begin{align} \operatorname{tr}(\mathcal{E}_A(X)) & =\sum _i\operatorname{tr}(A^iX(A^i)^\dagger ) =\operatorname{tr}\! \left(\left(\sum _i(A^i)^\dagger A^i\right)X\right) =\operatorname{tr}(X). \notag \end{align}

2.11 Peripheral spectrum and primitivity

Definition 2.11.1 Peripheral spectrum
#

The peripheral spectrum of a bounded linear operator \(T\) is the set of spectral values \(\mu \) with \(|\mu |\) equal to the spectral radius of \(T\).

Definition 2.11.2 Peripheral eigenvalues
#

The peripheral eigenvalues of a linear map \(E\) on a finite-dimensional space are the eigenvalues \(\lambda \) on the unit circle: \(|\lambda | = 1\). For a channel, the spectral radius is \(1\) [ Wol12 , Proposition 6.1 ] , so these coincide with the eigenvalues of maximal modulus.

The condition \(|\lambda | = 1\) is appropriate for channels, since the spectral radius of a channel is \(1\); for a general linear map with spectral radius \(r \neq 1\) the condition would generalise to \(|\lambda | = r\).

Lemma 2.11.3 Unit spectral radius forces positive matrix size

Let \(T:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) be a bounded linear map. If its spectral radius is one, then \(D\geq 1\).

Proof

If \(D=0\), then the matrix space and its endomorphism algebra contain only zero, so every endomorphism has spectral radius zero.

Remark 2.11.4 Peripheral conventions for channels

The spectral-radius convention of Definition 2.11.1 is the usual bounded-operator notion. For channels the spectral radius is \(1\), so the channel arguments below use the unit-circle set of Definition 2.11.2.

Theorem 2.11.5 Russo–Dye estimate for positive matrix maps

Let \(D\geq 1\), and let \(T:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) be positive. Then, for every \(X\in M_{D}(\mathbb {C})\),

\begin{align} \| T(X)\| _\infty & \leq \| T(\mathbb {1})\| _\infty \, \| X\| _\infty . \label{eq:positive_map_russo_dye_estimate} \end{align}

This is the Russo–Dye estimate invoked in the proof of [ Wol12 , Proposition 6.1 ] , at local source line 84. Here \(\| \cdot \| _\infty \) is the C\(^*\)-operator norm, rather than the Frobenius norm or a row-sum norm.

Proof

Put \(c=\| T(\mathbb {1})\| _\infty \). If \(c{\gt}0\), normalize the map by \(S=c^{-1}T\). Positivity gives \(T(\mathbb {1})\geq 0\), and the operator-norm order bound gives \(T(\mathbb {1})\leq c\mathbb {1}\); hence \(S(\mathbb {1})\leq \mathbb {1}\). For a contraction \(A\), one has \(A^\dagger A\leq \mathbb {1}\). Apply Theorem 7.1.2.2 to \(S\), with dominant operator \(\mathbb {1}\), to obtain

\begin{align} S(A)^\dagger S(A) & \leq S(\mathbb {1})\leq \mathbb {1}. \notag \end{align}

The C\(^*\)-identity therefore gives \(\| S(A)\| _\infty \leq 1\). If \(c=0\), the same argument applied directly to \(T\) gives \(T(A)^\dagger T(A)\leq T(\mathbb {1})=0\), and thus \(T(A)=0\). Finally, rescale an arbitrary nonzero \(X\) to the contraction \(A=\| X\| _\infty ^{-1}X\). This proves (12) with coefficient one.

Theorem 2.11.6 Spectral-radius bound for positive matrix maps

Let \(D\geq 1\), and let \(T:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) be positive. Every eigenvalue \(\mu \) of \(T\) satisfies

\begin{align} |\mu |& \leq \| T(\mathbb {1})\| _\infty , \tag {6.3} \end{align}

and consequently

\begin{align} \varrho (T)& \leq \| T(\mathbb {1})\| _\infty . \tag {6.2} \end{align}

This is [ Wol12 , Proposition 6.1 ] .

Proof

If \(T(X)=\mu X\) for a nonzero \(X\), then Theorem 2.11.5 gives

\begin{align} |\mu |\, \| X\| _\infty & =\| T(X)\| _\infty \leq \| T(\mathbb {1})\| _\infty \, \| X\| _\infty . \notag \end{align}

Division by \(\| X\| _\infty {\gt}0\) proves (6.3). In finite dimension the spectral values are precisely the eigenvalues, so taking the supremum of their moduli proves (6.2).

Let \(D\geq 1\), and let \(T:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) be positive and unital. Then \(1\) is an eigenvalue of \(T\), every eigenvalue belongs to the closed unit disk, and \(\varrho (T)=1\). No complete-positivity assumption is made.

Proof

Unitality gives \(T(\mathbb {1})=\mathbb {1}\), so the nonzero identity matrix is an eigenvector with eigenvalue \(1\). Theorem 2.11.6 gives \(|\mu |\leq \| \mathbb {1}\| _\infty =1\) for every eigenvalue \(\mu \) and \(\varrho (T)\leq 1\). The eigenvalue \(1\) gives the reverse inequality.

Let \(D\geq 1\), and let \(T:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) be positive and trace-preserving. Then \(1\) is an eigenvalue with a nonzero positive semidefinite eigenvector, every eigenvalue belongs to the closed unit disk, and \(\varrho (T)=1\). No complete-positivity assumption is made.

Proof

Theorem 3.16.5 places every eigenvalue in the closed unit disk. Theorem 8.9.8 supplies a nonzero positive semidefinite fixed point, so \(1\) is an eigenvalue. Hence \(\varrho (T)\leq 1\) and \(\varrho (T)\geq 1\), respectively.

Definition 2.11.9 Primitive map
#

A linear map is primitive if its only peripheral eigenvalue is \(\lambda = 1\), i.e. \(\mathrm{peripheral}(E) = \{ 1\} \). For channels this corresponds to [ Wol12 , Theorem 6.7 ] . This definition applies to any linear endomorphism, not only to channels.

Theorem 2.11.10 Eigenvalue bound for a trace-preserving Kraus map

Let \(\{ K_i\} _{i=0}^{d-1}\) be matrices in \(M_{D}(\mathbb {C})\) with \(\sum _{i=0}^{d-1}K_i^\dagger K_i=\mathbb {1}\), and let

\begin{align} \mathcal K_K(X) & =\sum _{i=0}^{d-1}K_iXK_i^\dagger \notag \end{align}

be the associated Kraus map. Every eigenvalue \(\mu \) of \(\mathcal K_K\) satisfies \(|\mu | \le 1\). This is the trace-preserving specialization of [ Wol12 , Proposition 6.1 ] .

Proof

Trace preservation of \(\mathcal K_K\) is the cyclicity computation

\begin{align} \operatorname{tr}(\mathcal K_K(X)) & =\sum _{i=0}^{d-1}\operatorname{tr}(K_iXK_i^\dagger ) =\operatorname{tr}\Big(\Big(\sum _{i=0}^{d-1}K_i^\dagger K_i\Big)X\Big) =\operatorname{tr}(X), \notag \end{align}

and \(\mathcal K_K\) is completely positive by Definition 6.1.1. For \(D\geq 1\), Theorem 3.16.5 therefore gives \(|\mu |\leq 1\). For \(D=0\) the algebra \(M_{0}(\mathbb {C})\) is trivial, so \(\mathcal K_K\) has no eigenvector and the bound is vacuous.

Theorem 2.11.11 Spectral-radius bound for a trace-preserving Kraus map

Let \(\{ K_i\} _{i=0}^{d-1}\) be a trace-preserving Kraus family on \(M_{D}(\mathbb {C})\). The spectral radius of its Kraus map \(\mathcal K_K\) is at most \(1\).

Proof

The spectral radius is the supremum of the moduli of the spectral values,

\begin{align} \varrho (\mathcal K_K) & =\sup _{\mu \in \operatorname {spec}(\mathcal K_K)}|\mu |, \notag \end{align}

and on the finite-dimensional space \(M_{D}(\mathbb {C})\) the spectral values are exactly the eigenvalues. Theorem 2.11.10 bounds each of them by \(1\).

Definition 2.11.12 Spectral radius of a rectangular mixed Kraus map
#

Let \(\{ A_i\} _{i=0}^{d-1}\subseteq M_{D_1}(\mathbb {C})\) and \(\{ B_i\} _{i=0}^{d-1}\subseteq M_{D_2}(\mathbb {C})\). Their rectangular mixed Kraus map is the endomorphism of \(M_{D_1\times D_2}(\mathbb {C})\) given by

\begin{align} \mathcal M_{A,B}(X) & =\sum _{i=0}^{d-1}A_iXB_i^\dagger . \notag \end{align}

Its spectral radius is denoted by \(\varrho (\mathcal M_{A,B})\).

Theorem 2.11.13 Eigenvalue bound for a trace-preserving mixed Kraus map

Suppose that

\begin{align} \sum _{i=0}^{d-1}A_i^\dagger A_i& =\mathbb {1}_{D_1}, \notag \\ \sum _{i=0}^{d-1}B_i^\dagger B_i& =\mathbb {1}_{D_2}. \notag \end{align}

Every eigenvalue \(\mu \) of \(\mathcal M_{A,B}\) satisfies \(|\mu |\leq 1\).

Proof

For each \(i\), set \(C_i=\require{mathtools}\begin{psmallmatrix} A_i& 0\\ 0& B_i\end{psmallmatrix}\) and embed a rectangular matrix \(X\) as \(J(X)=\require{mathtools}\begin{psmallmatrix} 0& X\\ 0& 0\end{psmallmatrix}\). Then

\begin{align} \sum _{i=0}^{d-1}C_i^\dagger C_i & =\begin{pmatrix} \mathbb {1}_{D_1} & 0 \\ 0 & \mathbb {1}_{D_2} \end{pmatrix}, \notag \\ \mathcal K_C(J(X)) & =J\bigl(\mathcal M_{A,B}(X)\bigr). \notag \end{align}

Hence a nonzero eigenvector \(X\) of \(\mathcal M_{A,B}\) with eigenvalue \(\mu \) gives the nonzero eigenvector \(J(X)\) of the trace-preserving Kraus map \(\mathcal K_C\) with the same eigenvalue. Theorem 2.11.10 gives \(|\mu |\leq 1\).

Theorem 2.11.14 Spectral-radius bound for a trace-preserving mixed Kraus map

Suppose that

\begin{align} \sum _{i=0}^{d-1}A_i^\dagger A_i& =\mathbb {1}_{D_1}, \notag \\ \sum _{i=0}^{d-1}B_i^\dagger B_i& =\mathbb {1}_{D_2}. \notag \end{align}

Then \(\varrho (\mathcal M_{A,B})\leq 1\).

Proof

On the finite-dimensional space \(M_{D_1\times D_2}(\mathbb {C})\), every spectral value is an eigenvalue. Theorem 2.11.13 bounds the modulus of each spectral value by \(1\), so the spectral radius is at most \(1\).

2.12 Fixed-point projection

Definition 2.12.1 Fixed-point projection
#

Given a linear map \(E:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) and a fixed point \(\rho \) with \(E(\rho )=\rho \) and \(\operatorname{tr}(\rho )\neq 0\), the fixed-point projection is the rank-one map

\begin{align} P(X) & =\frac{\operatorname{tr}(X)}{\operatorname{tr}(\rho )}\rho . \label{eq:channel_fixed_point_proj} \end{align}

This projects onto the span of \(\rho \) along the kernel of the trace functional. When the fixed point is unique up to scaling, this span is the full fixed-point space.

Theorem 2.12.2 Power decomposition

If \(E\) is trace-preserving and \(E(\rho )=\rho \), then, for \(n\geq 1\),

\begin{align} E^n & =P+(E-P)^n, \label{eq:channel_power_decomp} \end{align}

where \(P\) is the fixed-point projection.

Proof

By (15), \(P\) is idempotent. The fixed-point relation \(E(\rho )=\rho \) gives \(E\circ P=P\), and trace preservation gives \(P\circ E=P\). These imply \((E-P)\circ P=0\) and \(P\circ (E-P)=0\), so in the binomial expansion of \((P+(E-P))^n\) all cross terms vanish, yielding (16).

2.13 Peripheral eigenvalues and powering

Theorem 2.13.1 \(1\) is a peripheral eigenvalue
#

If \(E\) has a nonzero fixed point \(\rho \neq 0\) with \(E(\rho )=\rho \), then \(1\) is a peripheral eigenvalue of \(E\).

Proof

\(\rho \) is an eigenvector with eigenvalue \(1\), and \(|1|=1\).

Theorem 2.13.2 Finiteness of peripheral eigenvalues
#

On a finite-dimensional space, the set of peripheral eigenvalues is finite.

Proof

Peripheral eigenvalues are a subset of all eigenvalues, which is a finite set in finite dimensions.

Theorem 2.13.3 Power-stable peripheral eigenvalues are roots of unity

Let \(E\) be a linear endomorphism on a finite-dimensional space. If \(\mu \) is a peripheral eigenvalue of \(E\) and \(\mu ^n\) is an eigenvalue of \(E\) for every \(n\geq 1\), then \(\mu \) is a root of unity.

Proof

Since \(\mu ^n\) is an eigenvalue for every positive \(n\), the pigeonhole principle on the finite eigenvalue set gives \(\mu ^a=\mu ^b\) for some \(a\neq b\), hence \(\mu ^{|a-b|}=1\).

Theorem 2.13.4 Peripheral powers imply root of unity

If the set of peripheral eigenvalues of a linear endomorphism \(E\) on a finite-dimensional space is closed under powers (\(\mu \in \mathrm{peripheral}(E)\) and \(n\geq 1\) imply \(\mu ^n\in \mathrm{peripheral}(E)\)), then every peripheral eigenvalue is a root of unity.

Proof

The closure hypothesis provides \(\mu ^n\in \mathrm{peripheral}(E)\) for all positive \(n\), which in particular means \(\mu ^n\) is an eigenvalue. Theorem 2.13.3 then gives \(\mu ^p=1\) for some \(p{\gt}0\).

2.13.1 Periodicity removal by powering

Remark 2.13.1.1
#

The results in this subsection are purely spectral: they use only finiteness of a set of complex numbers and the spectral mapping theorem for powers. In particular, they do not rely on complete positivity. For transfer maps, replacing a tensor by its \(p\)-blocked tensor replaces \(\mathcal{E}_A\) by \(\mathcal{E}_A^p\), so this powering step is the operator-theoretic form of blocking.

Lemma 2.13.1.2 Common exponent for a finite set of roots of unity
#

Let \(s\subseteq \mathbb {C}\) be a finite set. Assume that for every \(\mu \in s\) there exists an exponent \(p_\mu {\gt}0\) with \(\mu ^{p_\mu }=1\). Then there exists \(p{\gt}0\) such that \(\mu ^p=1\) for all \(\mu \in s\).

Proof

Take \(p\) to be the least common multiple of the exponents \(p_\mu \).

Lemma 2.13.1.3 Powering collapses peripheral eigenvalues

Let \(E:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) be a linear map, and assume that \(E\) has a nonzero fixed point \(\rho \neq 0\). Let \(p{\gt}0\). If every peripheral eigenvalue \(\mu \) of \(E\) satisfies \(\mu ^p=1\), then \(\mathrm{peripheral}(E^p)=\{ 1\} \).

Proof

The fixed point \(\rho \) gives \(1\in \mathrm{peripheral}(E^p)\). For the reverse inclusion, let \(\nu \in \mathrm{peripheral}(E^p)\). Spectral mapping gives \(\nu =\mu ^p\) for some \(\mu \in \operatorname{spec}(E)\). From \(|\nu |=1\) and \(p{\gt}0\) we obtain \(|\mu |=1\), hence \(\mu \in \mathrm{peripheral}(E)\). The hypothesis \(\mu ^p=1\) then forces \(\nu =1\).

For a normalized MPS tensor, the transfer map is naturally trace-preserving but need not be unital. In general one should not expect a single gauge choice to make it both unital and trace-preserving.

Remark 2.13.1.4 Bi-canonical special case
#

When a Kraus map happens to be both unital and trace-preserving (the “bi-canonical” case), the Kadison–Schwarz equality at peripheral eigenvectors (Theorem 6.2.3) shows directly that the peripheral eigenvalues are closed under powers, and hence are roots of unity by Theorem 2.13.4. It requires both normalizations simultaneously. The more general adjoint-fixed-point formulation below covers the case where only unitality and a positive definite adjoint fixed point are available.

2.13.2 Peripheral closure via adjoint fixed point

The Kraus map, its adjoint, and the unital normalization are those of Definitions 6.1.1, 6.1.2, and 6.1.3. The following results combine the canonical Kadison–Schwarz and multiplicative-domain theorems of Chapter 6 with a positive definite fixed point of the adjoint map, replacing trace preservation by the weighted-trace argument in [ CPGSV16 , Appendix A ] .

Let \(E(X)=\sum _iK_iXK_i^\dagger \) be a Kraus map that is unital (\(\sum _iK_iK_i^\dagger =\mathbb {1}\)), and assume:

  1. the adjoint Kraus map \(E^*(X)=\sum _iK_i^\dagger XK_i\) has a positive definite fixed point \(\rho {\gt}0\), and

  2. \(E\) is irreducible.

Then \(\mathrm{peripheral}(E)\) is closed under powers: if \(\mu \in \mathrm{peripheral}(E)\), then \(\mu ^n\in \mathrm{peripheral}(E)\) for every \(n\in \mathbb {N}\).

Proof

Let \(E(X)=\mu X\) with \(|\mu |=1\), and set \(G:=E(X^\dagger X)-E(X)^\dagger E(X)\). By (3), \(G\geq 0\). Since \(E^*(\rho )=\rho \),

\begin{align} \operatorname{tr}(\rho G) & =\operatorname{tr}(\rho E(X^\dagger X)) -\operatorname{tr}(\rho E(X)^\dagger E(X)) \notag \\ & =\operatorname{tr}(E^*(\rho )X^\dagger X) -\operatorname{tr}(\rho E(X)^\dagger E(X)) \notag \\ & =\operatorname{tr}(\rho X^\dagger X) -|\mu |^2\operatorname{tr}(\rho X^\dagger X) =0. \end{align}

Because \(\rho {\gt}0\) and \(G\geq 0\), this forces \(G=0\), so \(E(X^\dagger X)=E(X)^\dagger E(X)=X^\dagger X\). Hence \(X^\dagger X\) is a positive semidefinite fixed point, which is positive definite by irreducibility (Theorem 8.3.11). Thus \(X\) is invertible. Theorem 6.2.2 gives the corresponding intertwining relation with each Kraus operator. Iterating the multiplicative identity of Theorem 6.2.5 gives \(E(X^n)=\mu ^nX^n\), so \(\mu ^n\) is peripheral.

Let \(E(X)=\sum _iK_iXK_i^\dagger \) be a Kraus map that is unital, and assume that the adjoint Kraus map \(E^*(X)=\sum _iK_i^\dagger XK_i\) has a positive definite fixed point and that \(E\) is irreducible. Then every peripheral eigenvalue of \(E\) is a root of unity.

Proof

Combine the closure-under-powers result (Lemma 2.13.2.1) with Theorem 2.13.4.

Theorem 2.13.2.3 Unitality of the conjugate-transposed Kraus family

If a Kraus family \((K_i)_i\) satisfies \(\sum _i K_i^\dagger K_i=\mathbb {1}\), then the family \((K_i^\dagger )_i\) is unital.

Theorem 2.13.2.4 Adjoint map of the conjugate-transposed family

The adjoint Kraus map associated with \((K_i^\dagger )_i\) is the Kraus map associated with \((K_i)_i\).

Theorem 2.13.2.5 Irreducibility under conjugate transposition

If the Kraus map associated with \((K_i)_i\) is irreducible, then so is the Kraus map associated with \((K_i^\dagger )_i\).

Theorem 2.13.2.6 Peripheral spectrum under conjugate transposition

The peripheral spectrum of the Kraus map associated with \((K_i^\dagger )_i\) is the complex conjugate of the peripheral spectrum associated with \((K_i)_i\).

Proof

Choose a normalized Kraus representation \(E(X)=\sum _iK_iXK_i^\dagger \) using Theorem 3.7.2, and set \(L_i=K_i^\dagger \). The normalization \(\sum _iK_i^\dagger K_i=\mathbb {1}\) makes the Kraus map associated with \((L_i)_i\) unital. Theorem 8.1.20 gives a nonzero positive-semidefinite fixed point \(\rho \) of \(E\), and irreducibility makes \(\rho \) positive definite by Theorem 8.3.11.

The adjoint of the Kraus map associated with \((L_i)_i\) is \(E\), so \(\rho \) is a positive-definite fixed point of that adjoint map. Irreducibility is preserved on passing from \((K_i)_i\) to \((K_i^\dagger )_i\), while a peripheral eigenvalue \(\mu \) of \(E\) becomes the peripheral eigenvalue \(\overline\mu \) of the latter Kraus map. Theorem 2.13.2.2 gives \(\overline\mu ^{\, p}=1\) for some \(p{\gt}0\). Taking complex conjugates yields \(\mu ^p=1\).

Remark 2.13.2.8
#

Lemma 2.13.2.1 and Theorem 2.13.2.2 cover the bi-canonical (unital + TP) case as well: trace preservation gives \(E^*(\mathbb {1})=\mathbb {1}\), which is a positive definite fixed point of the adjoint. The adjoint-fixed-point formulation matches the argument in [ CPGSV16 , Appendix A ] , which uses a faithful invariant state rather than bi-canonicality. Theorem 2.13.2.2 establishes the root-of-unity conclusion in this adjoint-fixed-point formulation. In the same adjoint-fixed-point formulation, Section 9.2 proves the corresponding cyclic structure: the cyclic group of peripheral eigenvalues is Theorem 9.1.1, and the cyclic projection decomposition is Theorem 9.2.1.1.

Definition 2.13.2.9 Channel period
#

The period of a channel \(E\) is the number of peripheral eigenvalues, counted without multiplicity: \(p(E):=|\mathrm{peripheral}(E)|\).

2.14 Primitivity and the complementary transfer-map gap

Theorem 2.14.1 Primitivity equals period one

A linear map with a nonzero fixed point is primitive if and only if its period is \(1\).

Proof

If \(\mathrm{peripheral}(E)=\{ 1\} \), then \(|\mathrm{peripheral}(E)|=1\). Conversely, if \(|\mathrm{peripheral}(E)|=1\), then \(1\in \mathrm{peripheral}(E)\) by Theorem 2.13.1, so the only element is \(1\).

Remark 2.14.2 Period-one characterization

The period \(p(E)\) counts peripheral eigenvalues without multiplicity. Theorem 2.14.1 is therefore the period-one characterization of primitivity. The spectral estimates below are stated directly with Definition 2.11.9, since they use the absence of peripheral eigenvalues other than \(1\), not a separate counting hypothesis.

Theorem 2.14.3 Complementary transfer-map gap for primitive maps

Let \(E:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) be trace-preserving, and let \(\rho \neq 0\) satisfy \(E(\rho )=\rho \) and \(\operatorname{tr}(\rho )\neq 0\). Let \(P\) be the fixed-point projection associated to \(\rho \), as defined in (15). Assume that:

  1. \(E\) is primitive;

  2. every eigenvalue \(\mu \) of \(E\) satisfies \(|\mu |\le 1\);

  3. whenever \(E(X)=X\) and \(\operatorname{tr}(X)=0\), one has \(X=0\).

Then every eigenvalue \(\nu \) of \(E-P\) satisfies \(|\nu |{\lt}1\).

Proof

Let \((E-P)(X)=\nu X\) with \(X\neq 0\). Then \(E(X)=\nu X+P(X)\). If \(\operatorname{tr}(X)=0\), then \(P(X)=0\), so \(E(X)=\nu X\) and hence \(\nu \) is an eigenvalue of \(E\) with \(|\nu |\le 1\). If \(|\nu |=1\), primitivity forces \(\nu =1\), so \(X\) is a trace-zero fixed point of \(E\); by assumption this implies \(X=0\), a contradiction. Thus \(|\nu |{\lt}1\).

If instead \(\operatorname{tr}(X)\neq 0\), trace preservation and \(\operatorname{tr}(P(X))=\operatorname{tr}(X)\), which follows from (15), give

\begin{align} \operatorname{tr}(X) & =\operatorname{tr}(E(X)) =\nu \operatorname{tr}(X)+\operatorname{tr}(P(X)) =\nu \operatorname{tr}(X)+\operatorname{tr}(X). \notag \end{align}

Hence \(\nu \operatorname{tr}(X)=0\) and therefore \(\nu =0\). In either case, \(|\nu |{\lt}1\).