Quantum Information and Channels: A formalization blueprint

3 Channel Representations and Normal Forms

This chapter opens with the Choi–Jamiołkowski foundations – the maximally entangled state, the Choi matrix, and the Choi criterion for complete positivity – and the no-information-without-disturbance theorem that follows directly from them. It then collects the remaining representation material for finite-dimensional quantum channels from [ Wol12 , Chapter 2 ] : Kraus representation theorems, Stinespring and Naimark dilations, ordered completely positive maps, Radon–Nikodym and open-system representations, trace-pairing expansions, SVD and Lorentz normal forms, and the channel determinant. It also develops the finite Cauchy–Schwarz and trace-purity criteria underlying SIC–POVM overlap bounds, equality cases, and reconstruction formulas. These results are important for the later channel theory, but they are not prerequisites for the matrix-product-state Fundamental Theorem.

3.1 Maximally entangled states and Choi matrices

The maximally entangled state and the flip operator give the basic matrices used by the Choi–Jamiołkowski correspondence.

Definition 3.1.1 Maximally entangled state
#

For every \(d\in \mathbb {N}\), define \(|\Omega \rangle \! \langle \Omega |\) on \(\mathbb {C}^d\otimes \mathbb {C}^d\) using

\begin{align} |\Omega \rangle & = \frac{1}{\sqrt{d}} \sum _{j=0}^{d-1} |j,j\rangle . \label{eq:representations_max_entangled} \end{align}

When \(d\geq 1\), this is the maximally entangled state: a rank-one projector with \((|\Omega \rangle \! \langle \Omega |)_{(i_1,i_2),(j_1,j_2)} = \frac{1}{d}\delta _{i_1 i_2}\delta _{j_1 j_2}\) and \(\operatorname{tr}(|\Omega \rangle \! \langle \Omega |)=1\).

Definition 3.1.2 Flip operator
#

The flip operator \(F\) on \(\mathbb {C}^d \otimes \mathbb {C}^d\) is

\begin{align} F & = \sum _{i,j=0}^{d-1} |ij\rangle \! \langle ji|. \label{eq:representations_flip} \end{align}

Its matrix entries are

\begin{align} F_{(i_1,i_2),(j_1,j_2)} & = \begin{cases} 1, & i_1=j_2 \text{ and } i_2=j_1,\\ 0, & \text{otherwise}. \end{cases} \notag \end{align}
Definition 3.1.3 Two-dimensional antisymmetric vector
#

In \(\mathbb {C}^2 \otimes \mathbb {C}^2\), let \(v = |01\rangle - |10\rangle \). Equivalently, \(v_{(0,1)}=1\), \(v_{(1,0)}=-1\), and all other coefficients are zero.

Definition 3.1.4 Tensor product of a map with identity
#

Given a linear map \(T : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\), the tensor extension \(T \otimes \operatorname{id}\) acts on bipartite matrices \(X \in M_{D \times D}(\mathbb {C})\) by applying \(T\) to each “slice”:

\begin{align} (T \otimes \operatorname{id})(X)_{(i_1,i_2),(j_1,j_2)} & = (T(X^{(i_2,j_2)}))_{i_1 j_1}, \label{eq:representations_tensor_map_id} \end{align}

where \(X^{(i_2,j_2)}_{ab} = X_{(a,i_2),(b,j_2)}\) is the bipartite slice.

The Choi–Jamiołkowski isomorphism bends the input legs of the channel \(T\) around the maximally entangled pair \(|\Omega \rangle \), presenting the map as the matrix \(\tau =(T\otimes \operatorname{id})|\Omega \rangle \! \langle \Omega |\) on the doubled space.

Definition 3.1.5 Choi matrix

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})(|\Omega \rangle \! \langle \Omega |) \in M_{D \times D}(\mathbb {C}). \label{eq:representations_choi} \end{align}

Concretely, \(\tau _{(i_1,i_2),(j_1,j_2)} = \frac{1}{D}\, (T(E_{i_2 j_2}))_{i_1 j_1}\) where \(E_{i_2 j_2}\) is the matrix unit. This is the Choi–Jamiol\- kowski convention of [ Wol12 , Proposition 2.1 ] .

Theorem 3.1.6 Choi matrix of the identity map

The identity channel has Choi matrix \(|\Omega \rangle \! \langle \Omega |\).

Proof

Apply the identity map in the definition of the Choi matrix.

Lemma 3.1.7 The Choi correspondence is one-to-one

Let \(D\geq 1\). Two linear maps \(T,S:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) with the same Choi matrix are equal.

Proof

The \((i_2,j_2)\) slice of \(|\Omega \rangle \! \langle \Omega |\) is \(D^{-1}E_{i_2j_2}\), so equality of the Choi matrices gives \(D^{-1}T(E_{ij})=D^{-1}S(E_{ij})\) entrywise for every matrix unit \(E_{ij}\). Cancel the nonzero factor \(D^{-1}\) and extend from the matrix units to all of \(M_{D}(\mathbb {C})\) by linearity.

Let \(\theta (X)=X^T\) be matrix transposition on \(M_{D}(\mathbb {C})\), with \(D \ge 1\). Then

\begin{align} (\theta \otimes \operatorname{id})(|\Omega \rangle \! \langle \Omega |) & = \frac{1}{D}F. \label{eq:representations_transpose_choi} \end{align}

This is [ Wol12 , Equation 3.1 ] .

Proof

The \((i_2,j_2)\) slice of \(|\Omega \rangle \! \langle \Omega |\) is \(D^{-1}E_{i_2j_2}\). Transposition sends this matrix unit to \(D^{-1}E_{j_2i_2}\), whose \((i_1,j_1)\) entry is \(D^{-1}\) exactly when \(i_1=j_2\) and \(i_2=j_1\).

Theorem 3.1.9 Choi decomposition of a Kraus map

Let \(D\geq 1\) and let \(T(X)=\sum _{i=0}^{r-1}K_iXK_i^\dagger \). Define the vector \(v_i\) by \((v_i)_{(a,b)}=D^{-1/2}K_i(a,b)\), without transposing the matrix indices. Then

\begin{align} \tau _T & = \sum _{i=0}^{r-1}|v_i\rangle \! \langle v_i|. \label{eq:representations_choi_kraus_outer_product} \end{align}
Proof

The \((i_2,j_2)\) slice of \(|\Omega \rangle \! \langle \Omega |\) is \(D^{-1}E_{i_2j_2}\). Therefore the \(((i_1,i_2),(j_1,j_2))\) entry of the Choi matrix is

\begin{align} \frac{1}{D}\sum _x K_x(i_1,i_2)\overline{K_x(j_1,j_2)}, \end{align}

which is the corresponding entry of the stated sum of outer products.

Let \(D\geq 1\). A linear map \(T : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\) is completely positive (in the Kraus sense) if and only if its Choi matrix \(\tau \ge 0\). This is the \(d=d'\) specialization of [ Wol12 , Proposition 2.1 ] .

Proof

(\(\Rightarrow \)) If \(T(X) = \sum _i K_i X K_i^\dagger \), then \(\tau = \sum _i |v_i\rangle \! \langle v_i|\) where \((v_i)_{(a,b)} = c\, K_i(a,b)\) and \(c = 1/\sqrt{D}\). This is a sum of rank-one PSD matrices.

(\(\Leftarrow \)) If \(\tau \ge 0\), write \(\tau = \sum _m |v_m\rangle \! \langle v_m|\) by spectral decomposition, define \(K_m(a,b) = v_m(a,b)/c\), and recover \(T(X) = \sum _m K_m X K_m^\dagger \) by linearity on matrix units.

Unitary changes of Kraus operators preserve the corresponding completely positive map.

Theorem 3.1.11 Unitary freedom in Kraus operators

Let \(U\) be a unitary \(r \times r\) matrix (\(U^\dagger U = \mathbb {1}\)) and suppose \(K_j = \sum _\ell U_{j\ell } \tilde{K}_\ell \). Then \(\{ K_j\} \) and \(\{ \tilde{K}_\ell \} \) define the same Kraus map: for every \(X \in M_{D}(\mathbb {C})\),

\begin{align} \sum _j K_j X K_j^\dagger & = \sum _\ell \tilde{K}_\ell X \tilde{K}_\ell ^\dagger . \notag \end{align}
Proof

Substitute the combination formula, expand the triple sum over \(j,\ell ,\ell '\), swap summation order, and use the entry-wise form of \(U^\dagger U = \mathbb {1}\) to collapse to \(\ell = \ell '\) diagonal terms.

Theorem 3.1.12 Rectangular Kraus freedom
#

If \(\sum _\alpha B_\alpha X B_\alpha ^\dagger = \sum _j A_j X A_j^\dagger \) for all \(X\) and \(r_2 \le r_1\) (where \(\{ B_\alpha \} _{\alpha =0}^{r_1-1}\) is the larger family and \(\{ A_j\} _{j=0}^{r_2-1}\) the smaller), then there exists a rectangular isometry \(V\) (\(r_1 \times r_2\), \(V^\dagger V = \mathbb {1}_{r_2}\)) such that \(B_\alpha = \sum _j V_{\alpha j}\, A_j\).

Proof

Pad the smaller family by zero operators to a family \(A'\) of size \(r_1\). Evaluating equality of the two maps on matrix units and taking matrix entries gives equality of the Gram matrices of the Stinespring vectors, \(M_B^\dagger M_B=M_{A'}^\dagger M_{A'}\). Hence the assignment from each column of \(M_{A'}\) to the corresponding column of \(M_B\) is well-defined and isometric on their common span. Extend this isometry to the ambient space \(\mathbb {C}^{r_1}\) and let \(W\) be its unitary matrix. Restricting \(W\) to the original \(r_2\) coordinates gives a rectangular matrix \(V\) with \(V^\dagger V=\mathbb {1}_{r_2}\). Reading the column identity entrywise yields \(B_\alpha =\sum _jV_{\alpha j}A_j\).

3.2 Rectangular Choi matrices and range bounds

Definition 3.2.1 Matrix of a linear map in matrix-unit bases
#

Let \(\mathcal L:M_{d}(\mathbb {C})\to M_{e}(\mathbb {C})\) be complex-linear. Its coefficient matrix \(C(\mathcal L)\in M_{e^2\times d^2}(\mathbb {C})\) in the matrix-unit bases is defined by

\begin{align} C(\mathcal L)_{(a,b),(i,j)} & =(\mathcal L(E_{ij}))_{ab}. \label{eq:rectangular_choi_coefficient_matrix} \end{align}
Definition 3.2.2 Unnormalized rectangular Choi matrix
#

For a complex-linear map \(\mathcal L:M_{d}(\mathbb {C})\to M_{e}(\mathbb {C})\), its unnormalized rectangular Choi matrix \(J(\mathcal L)\in M_{de}(\mathbb {C})\) is the reshaping

\begin{align} J(\mathcal L)_{(i,a),(j,b)} & =C(\mathcal L)_{(a,b),(i,j)} =(\mathcal L(E_{ij}))_{ab}. \label{eq:rectangular_choi_entries} \end{align}

When \(d=e\), this is \(d\) times the normalized Choi matrix convention in [ Wol12 , Proposition 2.1 ] .

Theorem 3.2.3 Frobenius norm under rectangular Choi reshaping

For every complex-linear map \(\mathcal L:M_{d}(\mathbb {C})\to M_{e}(\mathbb {C})\),

\begin{align} \operatorname{Re}\operatorname{tr}\! \left(J(\mathcal L)^\dagger J(\mathcal L)\right) & = \operatorname{Re}\operatorname{tr}\! \left(C(\mathcal L)^\dagger C(\mathcal L)\right). \label{eq:rectangular_choi_parseval} \end{align}
Proof

The two traces are the sums of the squared absolute values of their respective matrix entries. The bijection

\begin{align} ((i,a),(j,b))\longmapsto ((i,j),(a,b)) \notag \end{align}

identifies the two sums by (11).

Theorem 3.2.4 Matrix-unit Parseval identity for a rectangular Choi matrix

For every complex-linear map \(\mathcal L:M_{d}(\mathbb {C})\to M_{e}(\mathbb {C})\),

\begin{align} \operatorname{Re}\operatorname{tr}\! \left(J(\mathcal L)^\dagger J(\mathcal L)\right) & = \sum _{i,j=0}^{d-1}\sum _{a,b=0}^{e-1} \left|(\mathcal L(E_{ij}))_{ab}\right|^2. \label{eq:rectangular_choi_parseval_matrix_units} \end{align}
Proof

Apply Theorem 3.2.3 and substitute (10) into the entrywise Frobenius-norm formula for \(C(\mathcal L)\).

Definition 3.2.5 Hilbert–Schmidt contraction
#

A complex-linear map \(\mathcal L:M_{d}(\mathbb {C})\to M_{e}(\mathbb {C})\) is a Hilbert–Schmidt contraction if, for every \(X\in M_{d}(\mathbb {C})\),

\begin{align} \operatorname{Re}\operatorname{tr}\! \left((\mathcal L(X))^\dagger \mathcal L(X)\right) & \leq \operatorname{Re}\operatorname{tr}(X^\dagger X). \label{eq:rectangular_hilbert_schmidt_contraction} \end{align}

If \(\mathcal L:M_{d}(\mathbb {C})\to M_{e}(\mathbb {C})\) is a Hilbert–Schmidt contraction, then

\begin{align} \left\| J(\mathcal L)\right\| _F^2 & \leq \dim _{\mathbb {C}}\operatorname{range}\mathcal L. \label{eq:rectangular_choi_rank_bound} \end{align}
Proof

Set \(G=C(\mathcal L)^\dagger C(\mathcal L)\). The contraction inequality applied in the matrix-unit bases shows that every eigenvalue of the positive semidefinite matrix \(G\) is at most one. Hence

\begin{align} \operatorname{tr}G & \leq \# \{ k:\lambda _k(G)\neq 0\} =\operatorname{rank}C(\mathcal L) =\dim _{\mathbb {C}}\operatorname{range}\mathcal L. \notag \end{align}

Theorem 3.2.3 identifies the left-hand side with \(\| J(\mathcal L)\| _F^2\).

3.3 No information without disturbance

An instrument on \(M_{d}(\mathbb {C})\) (Definition 3.12.18) is a finite family \(\{ T_\alpha :M_{d}(\mathbb {C})\to M_{d}(\mathbb {C})\} \) of completely positive maps whose sum is trace-preserving; the outcome \(\alpha \) occurs with probability \(\operatorname{tr}[T_\alpha (\rho )]\) on the input \(\rho \). The instrument leaves the input undisturbed on average when \(\sum _\alpha T_\alpha =\operatorname{id}\). In that case the outcome distribution is the same for every input, so the measurement returns no information about \(\rho \). This is the proposition “No information without disturbance” of [ Wol12 , Chapter 2 ] .

Lemma 3.3.1 Domination by the maximally entangled projector

Let \(A\) on \(\mathbb {C}^d\otimes \mathbb {C}^d\) be positive semidefinite with \(A\leq |\Omega \rangle \! \langle \Omega |\). Then \(A=a|\Omega \rangle \! \langle \Omega |\) for a non-negative scalar \(a\).

Proof

The projector \(|\Omega \rangle \! \langle \Omega |\) is the rank-one matrix built from the vector \(|\Omega \rangle \), so this is Lemma 6.12.2 with \(c=1\) and \(\psi =\Omega \), read after transporting along a bijection between the pair index set of the bipartite space \(\mathbb {C}^d\otimes \mathbb {C}^d\) and a single index set of the same cardinality \(d^2\).

Let \(d\geq 1\) and let \(\{ T_\alpha :M_{d}(\mathbb {C})\to M_{d}(\mathbb {C})\} \) be a finite family of completely positive maps with \(\sum _\alpha T_\alpha =\operatorname{id}\). Then for every \(\alpha \) there is a constant \(c_\alpha \geq 0\) with \(T_\alpha =c_\alpha \operatorname{id}\).

Proof

Pass to Choi matrices. The Choi matrix of \(\operatorname{id}\) is \(|\Omega \rangle \! \langle \Omega |\) and the Choi correspondence is linear, so the hypothesis reads \(|\Omega \rangle \! \langle \Omega |=\sum _\alpha \tau _\alpha \), where \(\tau _\alpha \) is the Choi matrix of \(T_\alpha \). Each \(\tau _\alpha \) is positive semidefinite because \(T_\alpha \) is completely positive, so every summand is dominated by the whole sum: \(\tau _\alpha \leq |\Omega \rangle \! \langle \Omega |\). Then Lemma 3.3.1 gives \(\tau _\alpha =c_\alpha |\Omega \rangle \! \langle \Omega |\) with \(c_\alpha \geq 0\). The right-hand side is the Choi matrix of \(c_\alpha \operatorname{id}\), so Lemma 3.1.7 gives \(T_\alpha =c_\alpha \operatorname{id}\).

Theorem 3.3.3 Normalization of the outcome weights

Under the hypotheses of Theorem 3.3.2 the constants satisfy \(c_\alpha \geq 0\) and \(\sum _\alpha c_\alpha =1\).

Proof

Evaluate \(\sum _\alpha T_\alpha =\operatorname{id}\) at the identity matrix and take the trace: the left-hand side gives \(d\sum _\alpha c_\alpha \) and the right-hand side gives \(d\). Divide by \(d\geq 1\).

Theorem 3.3.4 The outcome probability is independent of the input

Under the hypotheses of Theorem 3.3.2 there is, for every \(\alpha \), a constant \(c_\alpha \geq 0\) with \(\operatorname{tr}[T_\alpha (\rho )]=c_\alpha \) for every \(\rho \) of unit trace. The probability of the outcome \(\alpha \) therefore does not depend on the input, so no information is gained.

Proof

By Theorem 3.3.2, \(T_\alpha (\rho )=c_\alpha \rho \), whose trace is \(c_\alpha \operatorname{tr}(\rho )=c_\alpha \).

Corollary 3.3.5 No information without disturbance for an instrument

Let \(\{ \Phi _i\} \) be a quantum instrument on \(M_{d}(\mathbb {C})\) with \(d\geq 1\) whose total channel is the identity. Then for every outcome \(i\) the probability \(p_i(\rho )\) is a non-negative constant, the same for every \(\rho \) of unit trace.

Proof

The component maps of an instrument are completely positive and their sum is the identity by hypothesis, so Theorem 3.3.4 applies.

3.4 Representations

Section 3.1 established the maximally entangled state, the Choi matrix, the Choi criterion for complete positivity, and unitary mixing of Kraus operators. This chapter develops the remaining finite-dimensional representation results from  [ Wol12 , Chapter 2 ] , beginning with partial traces.

Definition 3.4.1 Partial traces

Let \(X \in M_{d \cdot d'}(\mathbb {C})\) be a bipartite matrix indexed by \((\{ 0,\ldots ,d-1\} \times \{ 0,\ldots ,d'-1\} )^2\). The left partial trace \(\operatorname{tr}_A(X)\) and right partial trace \(\operatorname{tr}_B(X)\) are the \(d' \times d'\) and \(d \times d\) matrices defined by

\begin{align} (\operatorname{tr}_A(X))_{ij} & = \sum _{k} X_{(k,i),(k,j)}, \notag \\ (\operatorname{tr}_B(X))_{ij} & = \sum _{k} X_{(i,k),(j,k)}. \notag \end{align}
Definition 3.4.2 Invertible matrix congruence

Let \(I\) be a finite index set and let \(C\in \mathbb C^{I\times I}\) be invertible. Congruence by \(C\) is the complex-linear equivalence

\begin{align} \mathcal C_C:\mathbb C^{I\times I}& \longrightarrow \mathbb C^{I\times I}, & \mathcal C_C(X)& =CXC^\dagger , \notag \end{align}

whose inverse is

\begin{align} \mathcal C_C^{-1}(X) & =C^{-1}X(C^\dagger )^{-1}. \notag \end{align}
Definition 3.4.3 Frobenius vectorization
#

For finite index sets \(I\) and \(J\), define

\begin{align} U_{I,J}& :\mathbb C^{I\times J}\longrightarrow \ell ^2(J\times I), \qquad \bigl(U_{I,J}(A)\bigr)_{(j,i)}=A_{ij}. \notag \end{align}

This is a complex-linear isometric equivalence when the matrix space is equipped with the Frobenius norm.

Lemma 3.4.4 Frobenius vectorization and the Hilbert–Schmidt pairing

For finite matrices \(A\) and \(B\) of the same shape,

\begin{align} \left\langle U_{I,J}(A),U_{I,J}(B)\right\rangle & =\operatorname{tr}(A^\dagger B). \notag \end{align}
Proof

Both sides equal \(\sum _{i\in I}\sum _{j\in J}\overline{A_{ij}}B_{ij}\).

Definition 3.4.5 Frobenius transport of a matrix superoperator

For a complex-linear map \(E:\mathbb C^{I\times I}\to \mathbb C^{J\times J}\), define its Frobenius transport by

\begin{align} \widehat E & =U_{J,J}\circ E\circ U_{I,I}^{-1}. \notag \end{align}
Theorem 3.4.6 Composition under Frobenius transport

For complex-linear maps \(E:\mathbb C^{I\times I}\to \mathbb C^{J\times J}\) and \(F:\mathbb C^{J\times J}\to \mathbb C^{K\times K}\),

\begin{align} \widehat{F\circ E} & =\widehat F\circ \widehat E. \notag \end{align}
Proof

Insert \(U_{J,J}^{-1}U_{J,J}=\mathbb {1}\) between the two transported maps.

Let \(E:\mathbb C^{I\times I}\to \mathbb C^{J\times J}\) be a completely positive map with a Kraus representation, and let \(E^*\) be its trace-pairing adjoint. Then the Hilbert-space adjoint of \(\widehat E\) is

\begin{align} \widehat E^\dagger & =\widehat{E^*}. \notag \end{align}

This is the adjoint identity used in the direct exponent-two specialization of [ Bei13 , Theorem 6, Equation (18) ] .

Proof

Complete positivity implies that \(E^*\) preserves adjoints. Therefore, for \(X\in \mathbb C^{J\times J}\) and \(Y\in \mathbb C^{I\times I}\),

\begin{align} \operatorname{tr}\! \left((E^*(X))^\dagger Y\right) & =\operatorname{tr}\! \left(E^*(X^\dagger )Y\right) =\operatorname{tr}\! \left(X^\dagger E(Y)\right). \notag \end{align}

The preceding lemma transports this identity to the Euclidean inner products and proves the assertion.

Single-Kraus maps satisfy \(\mathcal K_V\circ \mathcal K_W=\mathcal K_{VW}\). Trace adjoints reverse composition, and the trace adjoint of \(X\mapsto VXV^\dagger \) is \(Y\mapsto V^\dagger YV\). Frobenius vectorization transports both linear equivalences and conjugation by such equivalences.

Proof

Associativity proves the single-Kraus composition identity. The two trace-adjoint assertions follow from cyclicity and non-degeneracy of the trace pairing. The transport assertions follow by inserting the vectorization and its inverse.

Theorem 3.4.9 Iterates of a finite Kraus map
#

Let \(I\) be finite, let \((K_i)_{i\in I}\) be a family in \(M_{D}(\mathbb {C})\), and set \(E(X)=\sum _i K_iXK_i^\dagger \). For every non-negative integer \(N\),

\[ E^N(X)=\sum _{\sigma \in I^N} K_{\sigma _0}\cdots K_{\sigma _{N-1}}X K_{\sigma _{N-1}}^\dagger \cdots K_{\sigma _0}^\dagger . \]

For \(N=0\), the product is the identity matrix.

Proof

The assertion for \(N=0\) is immediate. For the induction step, apply \(E\) to the expansion for \(E^N(X)\) and distribute the finite sums. Prepending one letter to each word of length \(N\) gives every word of length \(N+1\) exactly once.

Let \(E:\mathbb C^{I\times I}\to \mathbb C^{I\times I}\) be a completely positive map with \(E(\mathbb {1})=\mathbb {1}\). Then the spectral radius of its Frobenius transport is at most one.

Proof

A unital completely positive map is contractive in the matrix operator norm, so every eigenvalue has modulus at most one. The spectral radius is the supremum of the eigenvalue moduli, so it is at most one as well, and similarity under Frobenius vectorization preserves the spectrum.

Definition 3.4.11 Full-support weighted channel map
#

For matrices \(\sigma \in \mathbb C^{I\times I}\) and \(\tau \in \mathbb C^{J\times J}\) and a complex-linear map \(\Phi :\mathbb C^{I\times I}\to \mathbb C^{J\times J}\), define

\begin{align} L(X)& =\tau ^{-1/4}\Phi (\sigma ^{1/4}X\sigma ^{1/4})\tau ^{-1/4}. \notag \end{align}

Let \(I\) and \(J\) be finite index sets, let \(\Phi :\mathbb C^{I\times I}\to \mathbb C^{J\times J}\) be completely positive and trace preserving, and let \(\sigma \) and \(\tau \) be positive definite matrices satisfying \(\Phi (\sigma )=\tau \). Then, for every \(X\),

\begin{align} \left\| \tau ^{-1/4} \Phi (\sigma ^{1/4}X\sigma ^{1/4})\tau ^{-1/4}\right\| _2 & \leq \| X\| _2. \notag \end{align}

Equivalently, \(L\) is a Hilbert–Schmidt contraction. This is the full-support exponent-two specialization of [ Bei13 , Theorem 6, Equation (18) ] ; it does not assert the support-compressed form for a singular output weight.

Proof

Write \(\Gamma _a(X)=aXa\). The completely positive map

\begin{align} E& =\Phi ^*\circ \Gamma _{\tau ^{1/2}}^{-1} \circ \Phi \circ \Gamma _{\sigma ^{1/2}} \notag \end{align}

is unital because \(\Phi (\sigma )=\tau \) and trace preservation gives \(\Phi ^*(\mathbb {1})=\mathbb {1}\). The adjoint-square of the Frobenius transport of \(L\) is similar, by congruence with \(\sigma ^{1/4}\), to the Frobenius transport of \(E\). Its spectral radius is therefore at most one. Positivity and self-adjointness of the adjoint-square identify its spectral radius with its operator norm, which proves the contraction estimate.

Let \(\tau \geq 0\), and let \(P\) be its support projection. Equal positive-semidefinite matrices have equal support projections, and taking the positive square root leaves \(P\) unchanged. If \(V:\mathbb C^K\to \mathbb C^J\) satisfies \(VV^\dagger =P\), then \(\sqrt{V^\dagger \tau V}=V^\dagger \sqrt\tau V\). Moreover, both \(P\tau ^{-1/2}_{\operatorname {supp}} =\tau ^{-1/2}_{\operatorname {supp}}\) and \(\tau ^{-1/2}_{\operatorname {supp}}P =\tau ^{-1/2}_{\operatorname {supp}}\). If, in addition, \(V^\dagger V=\mathbb {1}\), then

\begin{align} V^\dagger \tau ^{-1/2}_{\operatorname {supp}}V & =(\sqrt{V^\dagger \tau V})^{-1}, \notag \\ V^\dagger \tau ^{-1/4}_{\operatorname {supp}}V & =(\sqrt{\sqrt{V^\dagger \tau V}})^{-1}. \notag \end{align}

Independently, if \(W:\mathbb C^L\to \mathbb C^J\) satisfies \(W^\dagger W=\mathbb {1}\), then \(\| WZW^\dagger \| _2=\| Z\| _2\) for every \(Z\in \mathbb C^{L\times L}\).

Proof

The square-root identity follows from uniqueness of the positive square root. The support inverse identities follow from the corresponding cancellation relations on the positive spectral subspace. The norm identity follows by cyclicity of the trace and \(W^\dagger W=\mathbb {1}\).

Definition 3.4.14 Output-support compression
#

For a matrix \(V:\mathbb C^K\to \mathbb C^J\) and a complex-linear map \(\Phi :\mathbb C^{I\times I}\to \mathbb C^{J\times J}\), define \(\Psi (X)=V^\dagger \Phi (X)V\).

Theorem 3.4.15 Channel outputs from a faithful input lie in its image support

Let \(\Phi \) be completely positive and trace preserving, let \(\sigma {\gt}0\), set \(\tau =\Phi (\sigma )\), and let \(P\) be the support projection of \(\tau \). Then every matrix \(X\) satisfies \(P\Phi (X)=\Phi (X)=\Phi (X)P\). If \(VV^\dagger =P\), then \(\Psi (X)=V^\dagger \Phi (X)V\) is completely positive and trace preserving.

Proof

Choose Kraus operators \(A_i\) for \(\Phi \). The joint column Gram matrix of \(A_i\sqrt\sigma \) is \(\tau \), so its column support is \(P\). Since \(\sqrt\sigma \) is invertible, \(PA_i=A_i\) for every \(i\), which gives the two support identities. Cyclicity of the trace then shows that compression by \(V\) preserves the trace of every output.

Definition 3.4.16 Support-weighted channel map

Let \(\tau \geq 0\). Its support-restricted negative quarter power \(\tau ^{-1/4}_{\operatorname {supp}}\) acts by \(x^{-1/4}\) on every positive eigenspace and vanishes on the kernel. For a complex-linear map \(\Phi \), define

\begin{align} L_{\operatorname {supp}}(X) & =\tau ^{-1/4}_{\operatorname {supp}} \Phi (\sigma ^{1/4}X\sigma ^{1/4}) \tau ^{-1/4}_{\operatorname {supp}}. \notag \end{align}

Let \(\Phi :\mathbb C^{I\times I}\to \mathbb C^{J\times J}\) be completely positive and trace preserving, let \(\sigma {\gt}0\), and set \(\tau =\Phi (\sigma )\). Then, for every \(X\),

\begin{align} \left\| \tau ^{-1/4}_{\operatorname {supp}} \Phi (\sigma ^{1/4}X\sigma ^{1/4}) \tau ^{-1/4}_{\operatorname {supp}}\right\| _2 & \leq \| X\| _2. \notag \end{align}

Equivalently, \(L_{\operatorname {supp}}\) is a Hilbert–Schmidt contraction. This is the exponent-two specialization of [ Bei13 , Theorem 6, Equation (18) ] , including singular output weights.

Proof

Let \(P\) be the support projection of \(\tau \), and choose an isometry \(V:\operatorname {supp}\tau \to \mathbb C^J\) with \(VV^\dagger =P\). Since \(\sigma \) is positive definite, every Kraus operator of \(\Phi \) has range in \(\operatorname {supp}\tau \). Hence \(\Psi (A)=V^\dagger \Phi (A)V\) is completely positive and trace preserving, while \(\tau _c=V^\dagger \tau V\) is positive definite and \(\Psi (\sigma )=\tau _c\). The full-support estimate applies to \(\Psi \). Functional calculus on the support gives \(V^\dagger \tau ^{-1/4}_{\operatorname {supp}}V=\tau _c^{-1/4}\), and expansion by \(V\) preserves the Hilbert–Schmidt norm. Transporting the compressed estimate along \(V\) proves the result.

3.5 Further Choi-matrix identities

The Choi foundations were established in Section 3.1. The remaining identities express trace preservation and Hermiticity preservation in the Choi matrix.

Theorem 3.5.1 Trace preservation implies the partial-trace condition

If \(T\) is trace-preserving, then \(\operatorname{tr}_A(\tau ) = \frac{1}{D} \mathbb {1}_D\). This is the equal-dimension implication in [ Wol12 , Proposition 2.1 ] .

Proof

By trace preservation,

\begin{align} (\operatorname{tr}_A(\tau ))_{ij} & = \operatorname{tr}(T(\Omega ^{(ij)})) = \operatorname{tr}(\Omega ^{(ij)}), \notag \end{align}

where \(\Omega ^{(ij)} = \frac{1}{D} E_{ij}\) is the \((i,j)\)-slice of \(|\Omega \rangle \! \langle \Omega |\). Taking the trace gives \(\frac{1}{D}\delta _{ij}\).

Theorem 3.5.2 Hermiticity preservation and the Choi matrix

The Choi matrix \(\tau \) is Hermitian if and only if \(T(B^\dagger ) = T(B)^\dagger \) for all \(B \in M_{D}(\mathbb {C})\). This is the equal-dimension case of [ Wol12 , Proposition 2.1 ] .

Proof

The Choi matrix entries satisfy \(\tau _{(a,i),(b,j)} = \frac{1}{D}(T(E_{ij}))_{ab}\). Hermiticity of \(\tau \) says \(\overline{\tau _{(b,j),(a,i)}} = \tau _{(a,i),(b,j)}\), which unravels to \(T(E_{ji})_{ba} = \overline{T(E_{ij})_{ab}}\), i.e., \(T(E_{ij}^\dagger ) = T(E_{ij})^\dagger \). By linearity this extends to all \(B\).

Theorem 3.5.3 Trace of the Choi matrix of a trace-preserving map

If \(D\geq 1\) and \(T\) is trace-preserving, then \(\operatorname{tr}(\tau ) = 1\). This is the equal-dimension case of [ Wol12 , Proposition 2.1 ] .

Proof

One has \(\operatorname{tr}(\tau ) = \operatorname{tr}(\operatorname{tr}_A(\tau )) = \operatorname{tr}(\frac{1}{D}\mathbb {1}_D) = 1\).

3.6 Representation corollaries for channel decompositions

The next three corollaries support channel decompositions and correspond to [ Wol12 , Propositions 2.2–2.4 ] .

Theorem 3.6.1 Polarization of sesquilinear sandwiches
#

For any \(A, B, X \in M_{D}(\mathbb {C})\),

\begin{align} 4\, A X B^\dagger & = (A+B) X (A+B)^\dagger - (A-B) X (A-B)^\dagger \notag \\ & \quad + i\, (A + iB) X (A + iB)^\dagger - i\, (A - iB) X (A - iB)^\dagger . \label{eq:representations_polarization} \end{align}

Each of the four summands on the right is a single-Kraus CP map, so every sesquilinear sandwich decomposes into a signed complex linear combination of CP maps.

Proof

Working entrywise reduces the claim to the scalar polarization identity

\begin{align} 4\, \alpha \, \overline{\delta } & = \sum _{k=0}^{3} i^k (\alpha + i^k \beta )\overline{(\gamma + i^k \delta )} \notag \end{align}

in \(\mathbb {C}\), which holds after substituting \(i^2 = -1\).

Theorem 3.6.2 CP decomposition of sandwich sums

For any finite Kraus-like families \(\{ A_i\} , \{ B_i\} \), the map \(T(X) = \sum _i A_i X B_i^\dagger \) satisfies \(4\, T = T_1 - T_2 + i\, T_3 - i\, T_4\) with each \(T_k\) a CP map given explicitly by a single-side Kraus sum of the combined families. The hypothesis is that \(T\) is presented in sandwich-sum form on a single matrix algebra \(M_{D}(\mathbb {C})\); Theorem 2.6.11 decomposes an arbitrary linear map \(M_{d}(\mathbb {C})\to M_{d'}(\mathbb {C})\).

Proof

Apply the polarization identity summand-by-summand.

Theorem 3.6.3 No information without disturbance

Let \(T : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\) be linear. If \(T(|v\rangle \! \langle v|) = |v\rangle \! \langle v|\) for every \(v \in \mathbb {C}^D\), then \(T = \operatorname{id}\). In particular, a quantum channel preserving every pure state equals the identity.

Proof

Rank-one ray scalar rigidity gives \(T=c\, \operatorname{id}\) for some \(c\in \mathbb {C}\). If \(D{\gt}0\), evaluating at the first coordinate projector gives \(P_{e_0}=T(P_{e_0})=cP_{e_0}\), whose \((0,0)\) entry yields \(c=1\). For \(D=0\) the matrix algebra is trivial, so the conclusion also holds.

Theorem 3.6.4 Rank-one extensionality for linear maps
#

Let \(E\) be a complex vector space and let \(T,S:M_{D}(\mathbb {C})\to E\) be complex-linear maps. If

\begin{align} T(|v\rangle \! \langle v|)=S(|v\rangle \! \langle v|) \end{align}

for every \(v\in \mathbb {C}^D\), then \(T=S\).

Proof

Polarization expresses every outer product \(|u\rangle \! \langle v|\) as a complex linear combination of four self-outer-products. Thus \(T\) and \(S\) agree on all outer products, in particular on every matrix unit. Linearity then gives \(T=S\) on all of \(M_{D}(\mathbb {C})\).

Definition 3.6.5 Pure-state ensemble density
#

Given a finite family \(\{ \psi _i\} _{i \in \iota }\) of (unnormalized) vectors in \(\mathbb {C}^D\), its pure-ensemble density is \(\rho = \sum _i |\psi _i\rangle \! \langle \psi _i|\). Weights \(p_i \geq 0\) with \(\sum p_i = 1\) can be absorbed by replacing \(\psi _i \mapsto \sqrt{p_i} \psi _i\).

Theorem 3.6.6 Isometric mixing preserves the density

If two pure-state ensembles \(\{ \psi _i\} _{i \in \iota _1}\) and \(\{ \phi _j\} _{j \in \iota _2}\) are related by an isometric mixing matrix \(V \in \mathbb {C}^{\iota _1 \times \iota _2}\) with \(V^\dagger V = \mathbb {1}\) and \(\psi _i = \sum _j V_{ij} \phi _j\), then they induce the same pure-ensemble density operator. This is the sufficient direction of the Hughston–Jozsa–Wootters theorem; the converse is Theorem 3.6.7.

Proof

Expanding and applying the orthogonality relation \(\sum _i V_{ij}\overline{V_{ij'}} = \delta _{j j'}\) from \(V^\dagger V = \mathbb {1}\) gives

\begin{align} \sum _i |\psi _i\rangle \! \langle \psi _i| & = \sum _{j, j'} \left(\sum _i V_{ij} \overline{V_{ij'}}\right) |\phi _j\rangle \! \langle \phi _{j'}| = \sum _j |\phi _j\rangle \! \langle \phi _j|. \notag \end{align}

If two pure-state ensembles \(\{ \psi _i\} _{i \in \iota _1}\) and \(\{ \phi _j\} _{j \in \iota _2}\) induce the same pure-ensemble density operator and \(|\iota _2| \le |\iota _1|\), then there exists a tall isometric mixing matrix \(V \in \mathbb {C}^{\iota _1 \times \iota _2}\) with \(V^\dagger V = \mathbb {1}\) and \(\psi _i = \sum _j V_{ij} \phi _j\). The cardinality hypothesis is what makes \(V\) a tall isometry; the symmetric case \(|\iota _1| \le |\iota _2|\) follows by swapping the roles of the ensembles.

Proof

Embed each vector \(\psi _i\), \(\phi _j\) as the \(0\)-th column of a \(D \times D\) matrix with zeros elsewhere; call these \(K_i\), \(L_j \in M_{D}(\mathbb {C})\). A direct entry-wise computation shows that for any \(X \in M_{D}(\mathbb {C})\) both \(\sum _i K_i X K_i^\dagger \) and \(\sum _j L_j X L_j^\dagger \) collapse to \(X_{00} \cdot \rho \), so the density equality \(\rho _\psi = \rho _\phi \) forces the two Kraus families to define the same CP map. Theorem 3.7.9 then supplies an isometry \(V\) with \(V^\dagger V = \mathbb {1}\) and \(K_i = \sum _j V_{ij}\, L_j\); reading the equation off at column \(0\) recovers the vector relation \(\psi _i = \sum _j V_{ij} \phi _j\).

Under the cardinality hypothesis \(|\iota _2| \le |\iota _1|\), two pure-state ensembles induce the same density operator iff they are related by a tall isometric mixing matrix.

Proof

Combine the two directions above.

3.7 Kraus representation theorem

A Kraus representation writes the channel as \(T(\rho )=\sum _i K_i\rho K_i^\dagger \). In index form, \(T(\rho )_{ab}=\sum _{i,c,d}(K_i)_{ac}\rho _{cd}\overline{(K_i)_{bd}}\).

Theorem 3.7.1 Trace preservation implies Kraus normalization

If \(T(X) = \sum _i K_i X K_i^\dagger \) is trace-preserving, then \(\sum _i K_i^\dagger K_i = \mathbb {1}\).

Proof

For any \(N\),

\begin{align} \operatorname{tr}\left(\left(\sum _i K_i^\dagger K_i\right)N\right) & = \sum _i \operatorname{tr}(K_i^\dagger K_i N) = \sum _i \operatorname{tr}(K_i N K_i^\dagger ) = \operatorname{tr}(T(N)) = \operatorname{tr}(N). \notag \end{align}

Non-degeneracy of the trace pairing forces \(\sum _i K_i^\dagger K_i = \mathbb {1}\).

Every quantum channel \(E : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\) admits a finite family \((K_i)_i\) in \(M_{D}(\mathbb {C})\) such that, for every \(X \in M_{D}(\mathbb {C})\),

\[ E(X)=\sum _i K_i X K_i^\dagger , \]

and

\[ \sum _i K_i^\dagger K_i=\mathbb {1}. \]
Proof

Complete positivity gives a finite Kraus family satisfying \(E(X)=\sum _i K_i X K_i^\dagger \). Since \(E\) is trace-preserving, Theorem 3.7.1 gives \(\sum _i K_i^\dagger K_i=\mathbb {1}\).

Theorem 3.7.3 Kraus normalization implies trace preservation

If \(\sum _i K_i^\dagger K_i = \mathbb {1}\), then \(T(X) = \sum _i K_i X K_i^\dagger \) is trace-preserving.

Proof

One has

\begin{align} \operatorname{tr}(T(X)) & = \sum _i \operatorname{tr}(K_i X K_i^\dagger ) = \sum _i \operatorname{tr}(K_i^\dagger K_i X) = \operatorname{tr}\left(\left(\sum _i K_i^\dagger K_i\right)X\right) = \operatorname{tr}(X). \notag \end{align}
Theorem 3.7.4 Unitality implies Kraus unital normalization

If \(T(X) = \sum _i K_i X K_i^\dagger \) satisfies \(T(\mathbb {1}) = \mathbb {1}\), then \(\sum _i K_i K_i^\dagger = \mathbb {1}\).

Proof

Evaluate the Kraus formula at the identity matrix.

The unitary mixing result was proved in Theorem 3.1.11. The same calculation extends to isometric mixing between different Kraus index spaces.

Theorem 3.7.5 Isometric mixing preserves the Kraus map

Let \(W\) be an isometry between two Kraus index spaces, so \(W^\dagger W = \mathbb {1}\). If \(K_j = \sum _\ell W_{j\ell } \widetilde K_\ell \), then the Kraus families \(\{ K_j\} \) and \(\{ \widetilde K_\ell \} \) define the same completely positive map.

Proof

Expand the Kraus sums, interchange the finite summations, and use \(W^\dagger W = \mathbb {1}\) to collapse the coefficient matrix.

Theorem 3.7.6 The transition matrix of orthonormal Kraus families is unitary

Let \(\{ K_j\} _{j=0}^{r-1}\) and \(\{ K'_j\} _{j=0}^{r-1}\) be two Hilbert–Schmidt orthonormal Kraus families, and suppose \(K_j = \sum _{\ell =0}^{r-1} U_{j\ell }\, K'_\ell \). Then the transition matrix \(U\) is unitary: \(U^\dagger U = \mathbb {1}_r\).

Proof

Expand \(\operatorname{tr}(K_j^\dagger K_i)\) using the change of basis. Hilbert–Schmidt orthonormality of both Kraus families identifies the Gram matrix with the identity, yielding the matrix identity \(U U^\dagger = \mathbb {1}_r\), hence also \(U^\dagger U = \mathbb {1}_r\).

Theorem 3.7.7 Dual map equality from primal map equality
#

If two Kraus families satisfy \(\sum _\alpha B_\alpha X B_\alpha ^\dagger = \sum _j A_j X A_j^\dagger \) for all \(X\), then \(\sum _\alpha B_\alpha ^\dagger Y B_\alpha = \sum _j A_j^\dagger Y A_j\) for all \(Y\).

Proof

Use the trace pairing: for all \(X\),

\begin{align} \operatorname{tr}\left(X^\dagger \left(\sum _\alpha B_\alpha ^\dagger Y B_\alpha \right)\right) & = \operatorname{tr}\left(\left(\sum _\alpha B_\alpha X^\dagger B_\alpha ^\dagger \right)Y\right) \notag \\ & = \operatorname{tr}\left(\left(\sum _j A_j X^\dagger A_j^\dagger \right)Y\right) = \operatorname{tr}\left(X^\dagger \left(\sum _j A_j^\dagger Y A_j\right)\right). \notag \end{align}

Nondegeneracy of the trace pairing gives the result.

Theorem 3.7.8 Equal Stinespring Gramians
#

If two Kraus families define the same CPM, then \(\sum _\alpha B_\alpha ^\dagger B_\alpha = \sum _j A_j^\dagger A_j\).

Proof

Specialise Theorem 3.7.7 at \(Y = \mathbb {1}\).

Theorem 3.7.9 Rectangular Kraus freedom with general finite index types
#

Variant of Theorem 3.1.12 with general finite index sets \(\iota _1, \iota _2\) in place of standard index sets of cardinalities \(r_1\) and \(r_2\).

Proof

Reindex by choosing enumerations of those finite index sets and apply Theorem 3.1.12.

Theorem 3.7.10 Isometric freedom of Kraus representations
#

Let \(\{ B_\alpha \} _{\alpha \in \iota _1}\) and \(\{ A_j\} _{j \in \iota _2}\) be finite Kraus families with \(|\iota _2| \le |\iota _1|\). Then the following are equivalent:

  1. \(\sum _\alpha B_\alpha X B_\alpha ^\dagger = \sum _j A_j X A_j^\dagger \) for all \(X \in M_{D}(\mathbb {C})\).

  2. There exists a matrix \(V = (V_{\alpha j})\) with \(V^\dagger V = \mathbb {1}\) such that \(B_\alpha = \sum _j V_{\alpha j} A_j\) for every \(\alpha \).

Proof

The implication \((1) \Rightarrow (2)\) is Theorem 3.7.9. Conversely, expand \(\sum _\alpha B_\alpha X B_\alpha ^\dagger \) using \(B_\alpha = \sum _j V_{\alpha j} A_j\), interchange the finite sums, and use \(V^\dagger V = \mathbb {1}\) to collapse the coefficient matrix to the diagonal.

Theorem 3.7.11 Unitary freedom of Kraus representations
#

Let \(\{ B_\alpha \} _{\alpha \in \iota }\) and \(\{ A_j\} _{j \in \iota }\) be two Kraus families with the same finite index set. Then the following are equivalent:

  1. \(\sum _\alpha B_\alpha X B_\alpha ^\dagger = \sum _j A_j X A_j^\dagger \) for all \(X \in M_{D}(\mathbb {C})\).

  2. There exists a unitary matrix \(U = (U_{\alpha j})\) such that \(B_\alpha = \sum _j U_{\alpha j} A_j\) for every \(\alpha \).

Proof

Apply Theorem 3.7.10 with \(|\iota | = |\iota |\). In the square case an isometry matrix is unitary, and the converse is immediate.

Remark 3.7.12 Choi rank and minimal Kraus cardinality
#

If a completely positive map admits a Kraus representation with exactly \(r\) operators, then its Choi matrix is a sum of \(r\) rank-one outer products. Consequently, \(\operatorname{rank}(\tau _E) \le r\). Conversely, diagonalizing the positive semidefinite Choi matrix and keeping only the nonzero eigenvalue summands produces a Kraus family with exactly \(\operatorname{rank}(\tau _E)\) operators. Hence the Choi rank is precisely the minimal Kraus cardinality.

Proof

For the forward implication, expand the Choi matrix using the Kraus formula and write \(\tau _E = \sum _j v_j v_j^\dagger \) with one vector \(v_j\) for each Kraus operator. The column space of this sum lies in the span of the \(r\) vectors \(\{ v_j\} \), so the rank is at most \(r\). For the converse, use the spectral decomposition of the positive semidefinite Choi matrix, discard the zero-eigenvalue terms, and rescale the remaining eigenvectors into Kraus operators.

3.8 Choi positivity and exact Kraus-word spans

Let \(D\geq 1\), let \((K_i)_{i\in I}\) be a finite family in \(M_{D}(\mathbb {C})\), and define

\begin{align} E(X)& =\sum _{i\in I}K_iXK_i^\dagger . \notag \end{align}

For a word \(\sigma =(\sigma _0,\ldots ,\sigma _{m-1})\in I^m\), write

\begin{align} K_\sigma & =K_{\sigma _0}\cdots K_{\sigma _{m-1}}, & \mathcal S_m& =\operatorname {span}\{ K_\sigma :\sigma \in I^m\} . \notag \end{align}

The empty product is the identity matrix.

Definition 3.8.1 Eventually full vector spread
#

For \(\psi \in \mathbb {C}^D\) and \(m\in \mathbb N\), define

\begin{align} H_m(K,\psi ) & =\operatorname {span}\{ K_\sigma \psi :\sigma \in I^m\} . \notag \end{align}

The Kraus family has eventually full vector spread if, for every sufficiently large \(m\) and every nonzero \(\psi \in \mathbb {C}^D\), \(H_m(K,\psi )=\mathbb {C}^D\). This is [ Wol12 , Theorem 6.8(2) ] .

Theorem 3.8.2 Full word span gives full vector spread

If \(\mathcal S_m=M_{D}(\mathbb {C})\), then \(H_m(K,\psi )=\mathbb {C}^D\) for every nonzero \(\psi \in \mathbb {C}^D\).

Proof

Choose \(k\) with \(\psi _k\neq 0\). For \(v\in \mathbb {C}^D\), the matrix

\begin{align} X& =\sum _{j=0}^{D-1}\frac{v_j}{\psi _k}E_{jk} \notag \end{align}

satisfies \(X\psi =v\). Hence the map \(X\mapsto X\psi \) from \(M_{D}(\mathbb {C})\) to \(\mathbb {C}^D\) is surjective. If \(\mathcal S_m=M_{D}(\mathbb {C})\), its image is precisely \(H_m(K,\psi )\).

Theorem 3.8.3 Eventually full word span gives eventual vector spread

If \(\mathcal S_m=M_{D}(\mathbb {C})\) for every sufficiently large \(m\), then the Kraus family has eventually full vector spread.

Proof

Apply Theorem 3.8.2 at every sufficiently large length.

Let \(\tau _{E^m}\) be the normalized Choi matrix of the \(m\)-fold iterate of \(E\). Then

\begin{align} \tau _{E^m}{\gt}0 \quad \Longleftrightarrow \quad \mathcal S_m=M_{D}(\mathbb {C}). \label{eq:kraus_iterate_choi_posdef_iff_word_span} \end{align}
Proof

The Kraus operators of \(E^m\) are the matrices \(K_\sigma \) with \(\sigma \in I^m\). Hence

\begin{align} \tau _{E^m} & =\sum _{\sigma \in I^m}|v_\sigma \rangle \! \langle v_\sigma |, & (v_\sigma )_{(a,b)} & =D^{-1/2}(K_\sigma )_{ab}. \notag \end{align}

The matrix indices retain their row–column order. Since \(D^{-1/2}\neq 0\), the vectors \(v_\sigma \) span \(\mathbb {C}^{D\times D}\) exactly when the matrices \(K_\sigma \) span \(M_{D}(\mathbb {C})\). The finite-frame criterion now gives Equation 18.

Corollary 3.8.5 Eventual Choi positivity

The following conditions are equivalent:

  1. \(\tau _{E^m}{\gt}0\) for every sufficiently large \(m\);

  2. \(\mathcal S_m=M_{D}(\mathbb {C})\) for every sufficiently large \(m\).

Proof

Apply Equation 18 pointwise for every sufficiently large \(m\).

Suppose that \(K\) is trace preserving and that its Kraus map \(E\) is irreducible with peripheral spectrum \(\{ 1\} \). This is the implication from item 1 to items 3 and 4 of [ Wol12 , Theorem 6.8(1,3,4) ] . Then, for every sufficiently large \(m\),

\begin{align} \mathcal S_m& =M_{D}(\mathbb {C}). \notag \end{align}

Moreover,

\begin{align} \tau _{E^m}& {\gt}0. \notag \end{align}
Proof

Irreducibility gives a positive-definite density matrix \(\rho \) fixed by \(E\). Put \(N=E-P_\rho \), where \(P_\rho (X)=\operatorname {tr}(X)\rho \), and define

\begin{align} Q_F(B)& =\sum _{i,k}(B^\dagger F(e_{ik})B)_{ik}. \notag \end{align}

For every word length \(m\), expansion of the Kraus-map power gives

\begin{align} \sum _{\sigma \in I^m} \left|\operatorname {tr}(B^\dagger K_\sigma )\right|^2 & =\operatorname {Re}Q_{E^m}(B). \notag \end{align}

The trivial peripheral spectrum implies \(\lVert N^m\rVert \to 0\), while \(E^m=P_\rho +N^m\). Compactness of the unit sphere gives a constant \(\delta {\gt}0\) such that

\begin{align} \operatorname {Re}Q_{P_\rho }(B)& \geq \delta \lVert B\rVert ^2, \notag \end{align}

and the operator-norm estimate gives

\begin{align} \left|\operatorname {Re}Q_{N^m}(B)\right|& \leq D^3\lVert N^m\rVert \lVert B\rVert ^2. \notag \end{align}

Hence \(\operatorname {Re}Q_{E^m}(B){\gt}0\) for every nonzero \(B\) and all sufficiently large \(m\). The trace-pairing identity then excludes a nonzero functional annihilating \(\mathcal S_m\), so \(\mathcal S_m=M_{D}(\mathbb {C})\). Finally, Corollary 3.8.5 gives the Choi statement.

Theorem 3.8.7 Eventual Choi positivity gives eventual vector spread

If \(\tau _{E^m}{\gt}0\) for every sufficiently large \(m\), then the Kraus family has eventually full vector spread.

Proof

Corollary 3.8.5 gives \(\mathcal S_m=M_{D}(\mathbb {C})\) for every sufficiently large \(m\). Apply Theorem 3.8.3.

3.9 Equivalence of ensembles by zero-padded unitary mixing

[ Wol12 , Proposition 2.4, Equation (2.10) ] states the equivalence of ensembles without any relation between the two cardinalities: two ensembles of not necessarily normalized vectors \(\{ \psi _j\} \) and \(\{ \widetilde\psi _\ell \} \) satisfy \(\sum _j |\psi _j\rangle \! \langle \psi _j| = \sum _\ell |\widetilde\psi _\ell \rangle \! \langle \widetilde\psi _\ell |\) iff there is a unitary \(U\) with \(\psi _j = \sum _\ell U_{j\ell }\widetilde\psi _\ell \), where the smaller family is padded with zero vectors so that both are indexed by one common set. Theorem 3.6.8 carries the cardinality hypothesis \(|\iota _2| \le |\iota _1|\) and delivers a tall isometry; this section removes both restrictions.

Lemma 3.9.1 Zero padding preserves the ensemble density

Let \(e \colon \iota _1 \to \iota \) be injective and let \(\{ \Psi _k\} _{k \in \iota }\) satisfy \(\Psi _{e(i)} = \psi _i\) for all \(i \in \iota _1\) and \(\Psi _k = 0\) for every \(k\) outside the image of \(e\). Then \(\sum _{k} |\Psi _k\rangle \! \langle \Psi _k| = \sum _i |\psi _i\rangle \! \langle \psi _i|\).

Proof
\begin{align} \sum _{k \in \iota } |\Psi _k\rangle \! \langle \Psi _k| = \sum _{k \in e(\iota _1)} |\Psi _k\rangle \! \langle \Psi _k| = \sum _{i \in \iota _1} |\Psi _{e(i)}\rangle \! \langle \Psi _{e(i)}| = \sum _{i \in \iota _1} |\psi _i\rangle \! \langle \psi _i|. \end{align}

The first equality drops the terms outside the image of \(e\), which vanish because \(|0\rangle \! \langle 0| = 0\); the second reindexes along \(e\), which is injective; the third substitutes \(\Psi _{e(i)} = \psi _i\).

Two instances of Lemma 3.9.1 supply the paddings used below: extension by zero along the two inclusions of \(\iota _1\) and \(\iota _2\) into the disjoint union \(\iota _1 \sqcup \iota _2\), and extension by zero of a family of \(m\) vectors to a family of \(\max (m,n)\) vectors.

Lemma 3.9.2 Padding onto a disjoint union preserves the density

Let \(\{ \psi _i\} _{i \in \iota _1}\) and \(\{ \phi _j\} _{j \in \iota _2}\) be ensembles. Extend \(\psi \) by the zero vector on the second summand of \(\iota _1 \sqcup \iota _2\), and extend \(\phi \) by the zero vector on the first summand. Both extended families have the same density operator as the family they extend.

Proof

Apply Lemma 3.9.1 to the two inclusions \(\iota _1 \hookrightarrow \iota _1 \sqcup \iota _2\) and \(\iota _2 \hookrightarrow \iota _1 \sqcup \iota _2\), which are injective and have complementary images.

Definition 3.9.3 Zero padding along an enumerated index set
#

Let \(\{ \psi _k\} _{k {\lt} m}\) be an ensemble and let \(n\) be a natural number. The padded ensemble \(\{ \psi _k^{\mathrm{pad}}\} _{k {\lt} n}\) is \(\psi _k\) for \(k {\lt} m\) and the zero vector for \(m \le k {\lt} n\). For \(m \le n\) the padded family agrees with \(\psi \) on every index \(k {\lt} m\) and retains the whole ensemble; for \(n {\lt} m\) only the first \(n\) vectors survive. The intended use is \(m \le n\).

Lemma 3.9.4 Padding to a longer family preserves the density

For \(m \le n\) the padded ensemble of Definition 3.9.3 has the same density operator as the original ensemble.

Proof

Apply Lemma 3.9.1 to the inclusion \(\{ k : k {\lt} m\} \hookrightarrow \{ k : k {\lt} n\} \).

Theorem 3.9.5 Equivalence of ensembles, relative to a padding

Let \(\{ \Psi _k\} _{k \in \iota }\) and \(\{ \Phi _k\} _{k \in \iota }\) be ensembles on one common finite index set whose density operators agree with those of \(\{ \psi _i\} _{i \in \iota _1}\) and \(\{ \phi _j\} _{j \in \iota _2}\) respectively. Then

\begin{align} \sum _i |\psi _i\rangle \! \langle \psi _i| = \sum _j |\phi _j\rangle \! \langle \phi _j| \end{align}

iff there is a unitary \(U \in \mathbb {C}^{\iota \times \iota }\) with \(\Psi _k = \sum _\ell U_{k\ell }\Phi _\ell \).

Proof

Suppose the two density operators agree. The hypotheses on \(\Psi \) and \(\Phi \) then give \(\sum _k |\Psi _k\rangle \! \langle \Psi _k| = \sum _k |\Phi _k\rangle \! \langle \Phi _k|\), and both families are indexed by the same finite set, so the cardinality hypothesis of Theorem 3.6.7 holds with equality. That theorem supplies \(U \in \mathbb {C}^{\iota \times \iota }\) with \(U^\dagger U = \mathbb {1}\) and \(\Psi _k = \sum _\ell U_{k\ell }\Phi _\ell \). A square matrix over a finite index set with \(U^\dagger U = \mathbb {1}\) also satisfies \(U U^\dagger = \mathbb {1}\), so \(U\) is unitary.

Conversely, a unitary \(U\) satisfies \(U^\dagger U = \mathbb {1}\), so Theorem 3.6.6 gives \(\sum _k |\Psi _k\rangle \! \langle \Psi _k| = \sum _k |\Phi _k\rangle \! \langle \Phi _k|\). Together with the two density agreements this reads

\begin{align} \sum _i |\psi _i\rangle \! \langle \psi _i| = \sum _k |\Psi _k\rangle \! \langle \Psi _k| = \sum _k |\Phi _k\rangle \! \langle \Phi _k| = \sum _j |\phi _j\rangle \! \langle \phi _j|. \end{align}

Two ensembles \(\{ \psi _j\} \) and \(\{ \widetilde\psi _\ell \} \) of not necessarily normalized vectors satisfy

\begin{align} \sum _j |\psi _j\rangle \! \langle \psi _j| = \sum _\ell |\widetilde\psi _\ell \rangle \! \langle \widetilde\psi _\ell | \end{align}

iff there is a unitary \(U\) with \(\psi _j = \sum _\ell U_{j\ell }\widetilde\psi _\ell \), where both families are first padded with zero vectors onto one common index set. No relation between the two cardinalities is assumed. Two paddings are recorded: onto the disjoint union \(\iota _1 \sqcup \iota _2\) of the two index sets, and, for ensembles of \(m\) and \(n\) vectors, onto \(\{ k : k {\lt} \max (m,n)\} \).

Proof

Lemmas 3.9.2 and 3.9.4 show that either padding leaves both density operators unchanged, which is exactly the hypothesis of Theorem 3.9.5.

3.10 Stinespring dilation

For a normalized Kraus family, the Stinespring construction realizes the channel through an isometry \(V\) into a larger space, \(T(\rho )=\operatorname{tr}_E[V\rho V^\dagger ]\); tracing out the environment \(E\) returns the channel.

Definition 3.10.1 Stinespring matrix
#

Given possibly rectangular Kraus operators \(K_j:\mathbb {C}^{d_{\mathrm{in}}}\to \mathbb {C}^{d_{\mathrm{out}}}\), the Stinespring matrix \(V:\mathbb {C}^{d_{\mathrm{in}}}\to \mathbb {C}^{d_{\mathrm{out}}}\otimes \mathbb {C}^r\) is defined by

\begin{align} V_{(i,j),k} & =(K_j)_{ik}. \label{eq:representations_stinespring_entries} \end{align}

Thus \(V=\sum _j K_j\otimes |j\rangle \). It is an isometry precisely when the Kraus family satisfies the trace-preserving normalization.

Lemma 3.10.2 Entry formula for the Stinespring matrix
#

For output index \(i\), input index \(k\), and \(j\in \{ 0,\ldots ,r-1\} \), \(V_{(i,j),k}=(K_j)_{ik}\).

Definition 3.10.3 Stinespring matrix with a finite index set
#

For a Kraus family \((K_j)_{j\in J}\) indexed by an arbitrary finite set \(J\), define \((V_J)_{(i,j),k}=(K_j)_{ik}\).

Lemma 3.10.4 Entry formula for the finite-index Stinespring matrix
#

The finite-index Stinespring matrix satisfies \((V_J)_{(i,j),k}=(K_j)_{ik}\).

Theorem 3.10.5 Stinespring Gram identity
#

The Stinespring matrix satisfies

\begin{align} V^\dagger V & =\sum _{j=0}^{r-1}K_j^\dagger K_j. \label{eq:representations_stinespring_gram} \end{align}
Definition 3.10.6 Local Stinespring matrix
#

If a Stinespring matrix \(V:\mathbb {C}^{d_{\mathrm{in}}}\to \mathbb {C}^{d_{\mathrm{out}}}\) acts on the first factor while a finite-dimensional space \(R\) is left unchanged, the corresponding local Stinespring matrix is \(W=V\otimes \mathbb {1}_R\).

Theorem 3.10.7 Local Stinespring isometry

If \(V^\dagger V=\mathbb {1}\), then \((V\otimes \mathbb {1}_R)^\dagger (V\otimes \mathbb {1}_R)=\mathbb {1}\).

Proof

Use \((A\otimes B)(C\otimes D)=AC\otimes BD\) and \(\mathbb {1}\otimes \mathbb {1}=\mathbb {1}\).

Theorem 3.10.8 Stinespring dual representation

Let \(K_j:\mathbb {C}^{d}\to \mathbb {C}^{d'}\), \(j=0,\dots ,r-1\), be an arbitrary family of matrices and let \(V=\sum _j K_j\otimes |j\rangle \). Then, for every observable \(A\in M_{d'}(\mathbb {C})\) on the output space,

\begin{align} V^\dagger (A\otimes \mathbb {1}_r)V & =\sum _j K_j^\dagger A K_j, \label{eq:representations_stinespring_dual} \end{align}

an identity in \(M_{d}(\mathbb {C})\) on the input space, valid for arbitrary \(K\) independently of any channel. When the \(K_j\) are Kraus operators of a map \(T:M_{d}(\mathbb {C})\to M_{d'}(\mathbb {C})\), the right-hand side is the dual (Heisenberg-picture) map \(T^*(A)\) of 2.5.1; the square case is \(d=d'\).

Proof

Compute \((V^\dagger (A\otimes \mathbb {1}_r)V)_{ab}\) by summing over the product index \((i,j)\); the \(\delta _{jl}\) from \(\mathbb {1}_r\) collapses the sum over \(l\), giving \(\sum _j K_j^\dagger A K_j\). For Kraus operators of \(T\), the trace pairing identifies this sum with \(T^*(A)\), as displayed in the proof of Theorem 3.10.13.

Theorem 3.10.9 The Stinespring isometry condition iff trace preservation

In the square specialization \(d_{\mathrm{in}}=d_{\mathrm{out}}=D\), one has \(V^\dagger V=\mathbb {1}_D\) if and only if \(\sum _j K_j^\dagger K_j=\mathbb {1}_D\). In particular, \(V\) is an isometry precisely when the Kraus map is trace-preserving.

Proof

One has \((V^\dagger V)_{ab} =\sum _{(i,j)}\overline{V_{(i,j),a}}V_{(i,j),b} =\sum _j\sum _i\overline{(K_j)_{ia}}(K_j)_{ib} =(\sum _jK_j^\dagger K_j)_{ab}\).

Theorem 3.10.10 Stinespring Schrödinger representation

The Kraus map \(T(\rho )=\sum _jK_j\rho K_j^\dagger \) equals the partial trace over the dilation space:

\begin{align} T(\rho )_{ij} & =\sum _{k=0}^{r-1}(V\rho V^\dagger )_{(i,k),(j,k)} =\operatorname{tr}_r(V\rho V^\dagger ). \label{eq:representations_stinespring_schrodinger} \end{align}

This is the Schrödinger-picture Stinespring representation.

Proof

Expand the middle expression in (26) and sum over \(k\) to recover \(\sum _kK_k\rho K_k^\dagger \).

Theorem 3.10.11 Existence of a Stinespring dilation

Every completely positive map admits an ancilla dimension \(r\), Kraus operators \(\{ K_j\} _{j=0}^{r-1}\), and the concrete representation \(\pi (A)=A\otimes \mathbb {1}_r\) such that \(E(A)=V^\dagger \pi (A)V\).

Proof

Choose a Kraus representation of \(E\) and apply the explicit Heisenberg-picture Stinespring formula.

Theorem 3.10.12 CPTP maps admit isometric Stinespring dilations

Every quantum channel admits a Stinespring dilation whose matrix \(V\) is an isometry, equivalently \(V^\dagger V=\mathbb {1}\).

Proof

Choose Kraus operators for the channel and use trace preservation to obtain the Stinespring isometry condition \(V^\dagger V=\mathbb {1}\).

Let \(T:M_{d}(\mathbb {C})\to M_{d'}(\mathbb {C})\) be completely positive with Choi matrix \(\tau \) and dual \(T^*\). Then for every \(r\geq \operatorname{rank}(\tau )\) there is a \(V:\mathbb {C}^{d}\to \mathbb {C}^{d'}\otimes \mathbb {C}^{r}\) such that, for all \(A\in M_{d'}(\mathbb {C})\),

\begin{align} T^*(A)& =V^\dagger (A\otimes \mathbb {1}_r)V, \label{eq:stinespring_rectangular} \end{align}

and \(V\) is an isometry, \(V^\dagger V=\mathbb {1}_d\), if and only if \(T\) is trace preserving. In the Schrödinger picture one may choose the same type of dilation so that

\begin{align} T(\rho )& =\operatorname{tr}_{\mathbb {C}^r}(V\rho V^\dagger ) \label{eq:stinespring_rectangular_schrodinger} \end{align}

for every \(\rho \in M_{d}(\mathbb {C})\). In particular \(r=\operatorname{rank}(\tau )\) is an admissible ancilla dimension; by Lemma 3.10.14 no smaller ancilla dimension is admissible, and a dilation with \(r=\operatorname{rank}(\tau )\) is called minimal. This is [ Wol12 , Theorem 2.2 ] .

Proof

By minimality of the Kraus rank, \(T\) has a Kraus family of exactly \(\operatorname{rank}(\tau )\) operators; padding it with zeros gives a family \(\{ K_j\} _{j=0}^{r-1}\) for every \(r\geq \operatorname{rank}(\tau )\). Set \(V:=\sum _j K_j\otimes |j\rangle \) for an orthonormal basis \(\{ |j\rangle \} \) of \(\mathbb {C}^{r}\), so that \(V^\dagger (A\otimes \mathbb {1}_r)V=\sum _j K_j^\dagger AK_j\). The trace pairing gives

\begin{align} \operatorname{tr}\bigl[T^*(A)X\bigr] & =\operatorname{tr}\bigl[A\, T(X)\bigr] =\operatorname{tr}\Bigl[A\sum _j K_jXK_j^\dagger \Bigr] =\operatorname{tr}\Bigl[\sum _j K_j^\dagger AK_j\, X\Bigr] \label{eq:stinespring_rectangular_pairing} \end{align}

for every \(X\in M_{d}(\mathbb {C})\), and nondegeneracy of the trace pairing yields (27). Finally \(V^\dagger V=\sum _j K_j^\dagger K_j\), and the latter equals \(\mathbb {1}_d\) exactly when \(T\) is trace preserving.

Let \(T:M_{d}(\mathbb {C})\to M_{d'}(\mathbb {C})\) be a linear map with Choi matrix \(\tau \) and dual \(T^*\). If for some ancilla dimension \(r\) there is a \(V:\mathbb {C}^{d}\to \mathbb {C}^{d'}\otimes \mathbb {C}^{r}\) such that (27) holds for all \(A\in M_{d'}(\mathbb {C})\), then \(\operatorname{rank}(\tau )\le r\). Together with Theorem 3.10.13, the least admissible ancilla dimension is \(\operatorname{rank}(\tau )\), and dilations with \(r=\operatorname{rank}(\tau )\) are minimal. This is the discussion following [ Wol12 , Theorem 2.2 ] .

Proof

The Kraus operators are recovered from \(V\) as the blocks \(K_j=(\mathbb {1}_{d'}\otimes \langle j|)V\), which satisfy \(V=\sum _jK_j\otimes |j\rangle \), so that \(T^*(A)=\sum _jK_j^\dagger AK_j\) for every \(A\in M_{d'}(\mathbb {C})\). For every \(X\in M_{d}(\mathbb {C})\), the trace pairing gives

\begin{align} \operatorname{tr}\bigl[A\, T(X)\bigr] & =\operatorname{tr}\bigl[T^*(A)X\bigr] =\operatorname{tr}\Bigl[\sum _jK_j^\dagger AK_j\, X\Bigr] =\operatorname{tr}\Bigl[A\sum _jK_jXK_j^\dagger \Bigr], \label{eq:stinespring_rectangular_least_pairing} \end{align}

and nondegeneracy of the trace pairing yields \(T(X)=\sum _jK_jXK_j^\dagger \): an \(r\)-operator Kraus family of \(T\). Any \(r\)-operator Kraus family forces \(\operatorname{rank}(\tau )\le r\), the bound in the minimality of the Kraus rank.

3.11 Ordered CP maps, Radon–Nikodym, and open-system representation

The next three results form the structural part of  [ Wol12 , Theorems 2.3–2.5 ] : the ordered CP-map theorem, the Radon–Nikodym theorem for completely positive maps, and the open-system representation. They refine the Stinespring dilation by tracking how two CP maps related by domination or decomposition sit inside a common dilation space.

Definition 3.11.1 CP partial order
#

For linear maps \(S,T:M_{d_{\rm in}}(\mathbb {C})\to M_{d_{\rm out}}(\mathbb {C})\), write \(T\le S\) (in the CP order) when \(S-T\) is completely positive.

Definition 3.11.2 Wolf auxiliary matrix
#

Let \(V:\mathbb {C}^d\to \mathbb {C}^{d'}\otimes \mathbb {C}^r\) be a supplied Stinespring matrix, and let \(|\Omega \rangle =d'^{-1/2}\sum _{a=1}^{d'}|a,a\rangle \) be normalized. Wolf’s auxiliary operator is

\begin{align} W & :=(\mathbb {1}_r\otimes \langle \Omega |)(V\otimes \mathbb {1}_{d'}) :\mathbb {C}^d\otimes \mathbb {C}^{d'}\longrightarrow \mathbb {C}^r, \label{eq:ordered_cp_w_definition} \end{align}

or, in coordinates, \(W_{j,(i,a)}=d'^{-1/2}V_{(a,j),i}\).

Lemma 3.11.3 The \(V\)–\(W\) correspondence

If \(d'{\gt}0\), the assignment \(V\mapsto W\) is one-to-one. Moreover, for every \(C:\mathbb {C}^{r_2}\to \mathbb {C}^{r_1}\),

\[ V_1=(\mathbb {1}_{d'}\otimes C)V_2 \quad \Longleftrightarrow \quad W_1=CW_2. \]
Proof

The coordinate formula \(W_{j,(i,a)}=d'^{-1/2}V_{(a,j),i}\) is invertible because \(d'{\gt}0\). Equivalently, with the canonical tensor-factor identifications used in the source, \(V=d'(W\otimes \mathbb {1}_{d'})(\mathbb {1}_d\otimes |\Omega \rangle )\). The coefficient \(d'^2\) printed in the source footnote is a normalization typo; see docs/paper-gaps/wolf_lecture_notes_errata.tex. Expanding the Kronecker product shows directly that multiplication by \(\mathbb {1}_{d'}\otimes C\) on \(V\) becomes multiplication by \(C\) on \(W\).

Lemma 3.11.4 The auxiliary Gram matrix is the Choi matrix

Suppose that \(T:M_{d'}(\mathbb {C})\to M_{d}(\mathbb {C})\) has the supplied representation \(T(A)=V^\dagger (A\otimes \mathbb {1}_r)V\). If \(\tau \) is the normalized Choi matrix of \(T\), then

\begin{align} W^\dagger W=\tau . \label{eq:ordered_cp_w_gram} \end{align}
Proof

Write \(V=\sum _jK_j\otimes |j\rangle \). Then \(T(A)=\sum _jK_j^\dagger A K_j\), so \(T\) has Kraus operators \(K_j^\dagger \). Both sides of (32) have entries

\[ \frac1{d'}\sum _j \overline{(K_j)_{a i}}(K_j)_{b k} \]

at the pair of indices \((i,a),(k,b)\).

Let \(W_i:H\to R_i\) be finite-dimensional complex matrices. If

\begin{align} \lVert W_1\psi \rVert ^2 \leq \lVert W_2\psi \rVert ^2 \qquad (\psi \in H), \label{eq:ordered_cp_norm_comparison} \end{align}

then there is a contraction \(C:R_2\to R_1\) such that \(W_1=CW_2\).

Proof

Equivalently, (33) is \(W_1^\dagger W_1\leq W_2^\dagger W_2\). Take the positive square root \(S\) of \(W_2^\dagger W_2-W_1^\dagger W_1\). After adjoining zero rows, the matrices with row blocks \((W_1,S,0)\) and \((0,0,W_2)\) have the same Gram matrix. A unitary carrying the second matrix to the first has an \(R_1\times R_2\) corner \(C\) satisfying \(W_1=CW_2\); orthonormality of its columns gives \(C^\dagger C\leq \mathbb {1}_{R_2}\).

Lemma 3.11.6 Minimality makes the auxiliary matrix surjective

If the supplied dominating dilation is minimal, \(r_2=\operatorname{rank}(\tau _2)\), then \(W_2\) is surjective. Consequently a factorization \(W_1=CW_2\) determines \(C\) uniquely.

Proof

The Gram identity gives \(\operatorname{rank}(W_2)=\operatorname{rank}(W_2^\dagger W_2)=\operatorname{rank}(\tau _2)=r_2\), so \(W_2\) has full row rank and is surjective. A surjective right factor can be cancelled.

Theorem 3.11.7 Relation between ordered CP maps

Let \(T_i:M_{d'}(\mathbb {C})\to M_{d}(\mathbb {C})\) be completely positive maps with \(T_1\leq T_2\). Suppose that, for possibly distinct ancilla dimensions \(r_i\), matrices \(V_i:\mathbb {C}^d\to \mathbb {C}^{d'}\otimes \mathbb {C}^{r_i}\) are supplied and satisfy

\[ T_i(A)=V_i^\dagger (A\otimes \mathbb {1}_{r_i})V_i \qquad (A\in M_{d'}(\mathbb {C})). \]

Then there is a contraction \(C:\mathbb {C}^{r_2}\to \mathbb {C}^{r_1}\) such that

\begin{align} V_1=(\mathbb {1}_{d'}\otimes C)V_2. \label{eq:representations_ordered_intertwining} \end{align}

If \(V_2\) is minimal, in the source sense \(r_2=\operatorname{rank}(\tau _2)\), then \(C\) is unique. This is [ Wol12 , Theorem 2.3 and Equation (2.13) ] .

Proof

Complete positivity of \(T_2-T_1\) and the Choi correspondence give \(\tau _1\leq \tau _2\). By Lemma 3.11.4,

\[ W_1^\dagger W_1=\tau _1\leq \tau _2=W_2^\dagger W_2, \]

which is precisely the squared norm comparison (33). The rectangular factorization lemma gives a contraction \(C\) with \(W_1=CW_2\). Inverting (31) gives (34) with the same supplied \(V_i\).

If \(r_2=\operatorname{rank}(\tau _2)\), then \(\operatorname{rank}(W_2)=\operatorname{rank}(W_2^\dagger W_2)=\operatorname{rank}(\tau _2)=r_2\); hence \(W_2\) is surjective. Thus two coefficients satisfying \(W_1=CW_2=C'W_2\) agree, proving uniqueness.

Definition 3.11.8 Block-top contraction
#

For natural numbers \(r,s\), let \(C=C_{r,s}\in \mathbb {C}^{r\times (r+s)}\) be the rectangular \(r\times (r+s)\) matrix whose rows are the first \(r\) rows of the identity on \(\mathbb {C}^{r+s}\): \(C_{ij}=1\) if \(j=i{\lt}r\) and \(0\) otherwise.

Lemma 3.11.9 \(C\) is a co-isometry

The block-top matrix satisfies \(CC^\dagger =\mathbb {1}_r\).

Proof

Direct entrywise computation: \((CC^\dagger )_{ii'}=\sum _jC_{ij}\overline{C_{i'j}}\) collapses to \(\delta _{ii'}\).

Lemma 3.11.10 \(C\) is a contraction

The block-top matrix satisfies \(C^\dagger C\le \mathbb {1}_{r+s}\).

Proof

The matrix \(C^\dagger C\) is diagonal with a \(1\) on the first \(r\) coordinates and a \(0\) on the last \(s\), so \(\mathbb {1}-C^\dagger C\) is positive semidefinite.

Lemma 3.11.11 Intertwining of Stinespring isometries

Let \(K:\{ 0,\ldots ,r-1\} \to M_{D}(\mathbb {C})\) and \(L:\{ 0,\ldots ,s-1\} \to M_{D}(\mathbb {C})\) be two Kraus families. Write \(K\mathbin {+\! +}L\) for their concatenation as a family indexed by \(\{ 0,\ldots ,r+s-1\} \). Then

\begin{align} V_K & =(\mathbb {1}_D\otimes C_{r,s})V_{K+\! +L}. \label{eq:representations_stinespring_intertwining} \end{align}
Proof

Entrywise expansion of both sides of (35): the Kronecker product with \(C_{r,s}\) picks out the first \(r\) coordinates of the dilation space, matching the action of \(V_{K+\! +L}\) on those coordinates, which is precisely \(V_K\).

Let \(T_1,T_2:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) be CP maps with \(T_1\le T_2\). Then there exist ancilla dimensions \(r_1,m\), Heisenberg-form Stinespring matrices \(V_1:\mathbb {C}^D\to \mathbb {C}^D\otimes \mathbb {C}^{r_1}\) and \(V_2:\mathbb {C}^D\to \mathbb {C}^D\otimes \mathbb {C}^m\) realizing \(T_1,T_2\) via \(T_i(A)=V_i^\dagger (A\otimes \mathbb {1})V_i\), and a rectangular contraction \(\widetilde C:\mathbb {C}^m\to \mathbb {C}^{r_1}\) with \(\widetilde C^\dagger \widetilde C\le \mathbb {1}_m\) such that

\begin{align} V_1 & =(\mathbb {1}_D\otimes \widetilde C)V_2. \label{eq:representations_ordered_intertwining_canonical} \end{align}

This is the explicit square corollary obtained by constructing both dilation matrices, rather than the supplied-dilation statement of Theorem 3.11.7.

Proof

Choose a Heisenberg-form Kraus family \(K_1\) of \(T_1\) with Stinespring matrix \(V_1=V_{K_1}\), and Kraus operators \(L\) of the CP map \(T_2-T_1\) in Schrödinger orientation. Let \(L^\dagger \) denote the conjugate-transposed family. Set \(m=r_1+s\) and let \(K_2=K_1\mathbin {+\! +}L^\dagger \). Then

\begin{align} T_2(A) & =T_1(A)+(T_2-T_1)(A) \notag \\ & =\sum _i(K_1^i)^\dagger A K_1^i+\sum _jL_j A L_j^\dagger \notag \\ & =\sum _i(K_1^i)^\dagger A K_1^i +\sum _j(L_j^\dagger )^\dagger A L_j^\dagger . \notag \end{align}

This is the Heisenberg form for \(K_2\), yielding \(T_2(A)=V_{K_2}^\dagger (A\otimes \mathbb {1})V_{K_2}\). Taking \(\widetilde C=C_{r_1,s}\), the intertwining \(V_{K_1}=(\mathbb {1}_D\otimes \widetilde C)V_{K_2}\) is Lemma 3.11.11, and \(\widetilde C^\dagger \widetilde C\le \mathbb {1}\) is Lemma 3.11.10.

Definition 3.11.13 Block-diagonal projectors on the dilation space

For \(r,s\), let \(P_{\mathrm{top}}=C_{r,s}^\dagger C_{r,s}\) and \(P_{\mathrm{bot}}=\mathbb {1}-P_{\mathrm{top}}\). Both are PSD (for \(P_{\mathrm{bot}}\), by Lemma 3.11.10) and \(P_{\mathrm{top}}+P_{\mathrm{bot}}=\mathbb {1}\).

Theorem 3.11.14 Radon–Nikodym theorem for quantum instruments

Let \(I\) be a nonempty finite set, and let \(T_i,T:M_{d'}(\mathbb {C})\to M_{d}(\mathbb {C})\) be completely positive linear maps such that \(\sum _{i\in I}T_i=T\). Suppose that a Stinespring representation of \(T\) is supplied by a linear map \(V:\mathbb {C}^d\to \mathbb {C}^{d'}\otimes \mathbb {C}^r\) satisfying

\begin{align} T(A) & =V^\dagger (A\otimes \mathbb {1}_r)V \qquad (A\in M_{d'}(\mathbb {C})). \label{eq:representations_radon_dilation} \end{align}

Then there are positive semidefinite operators \(P_i\in M_{r}(\mathbb {C})\) such that

\begin{align} \sum _{i\in I}P_i & =\mathbb {1}_r, \label{eq:representations_radon_resolution}\\ T_i(A) & =V^\dagger (A\otimes P_i)V \qquad (i\in I,\ A\in M_{d'}(\mathbb {C})). \label{eq:representations_radon_components} \end{align}

This is the rectangular Heisenberg-picture statement of [ Wol12 , Theorem 2.4 ] . The nonempty-family condition is made explicit; see [ con26d ] .

Proof

First suppose that \(d'{\gt}0\). Choose Kraus families for the maps \(T_i\), and enumerate their disjoint union as \(B_\alpha :\mathbb {C}^{d'}\to \mathbb {C}^d\), with outcome label \(\ell (\alpha )\in I\). The aggregate Stinespring matrix \(\widehat V\), whose \(\alpha \)-th ancilla block is \(B_\alpha ^\dagger \), represents the total map \(T\).

Apply Theorem 3.11.7 to the reflexive order relation \(T\le T\), using \(\widehat V\) for the first supplied representation and \(V\) for the second. It gives a contraction \(C:\mathbb {C}^r\to \mathbb {C}^m\) such that

\begin{align} \widehat V & =(\mathbb {1}_{d'}\otimes C)V, & C^\dagger C& \leq \mathbb {1}_r. \notag \end{align}

Let \(C_i\) be the matrix obtained from \(C\) by retaining the rows labelled by \(i\) and setting all other rows to zero, and define the preliminary effect

\begin{align} E_i & =C_i^\dagger C_i. \label{eq:representations_radon_effects} \end{align}

The labelled fibres partition the rows of \(C\), so

\begin{align} E_i& \geq 0, & \sum _{i\in I}E_i& =C^\dagger C, & T_i(A)& =V^\dagger (A\otimes E_i)V. \label{eq:representations_radon_preliminary_effects} \end{align}

For a nonminimal supplied dilation the middle sum need not yet be the identity. Set \(R=\mathbb {1}_r-C^\dagger C\geq 0\). Since \(V\) and \(\widehat V\) represent the same total map, the contraction identity gives

\begin{align} V^\dagger (A\otimes R)V=0 \qquad (A\in M_{d'}(\mathbb {C})). \label{eq:representations_radon_residual_invisible} \end{align}

Choose \(i_0\in I\) and put \(P_{i_0}=E_{i_0}+R\) and \(P_i=E_i\) for \(i\ne i_0\). These operators are positive, their sum is \(\mathbb {1}_r\), and (42) shows that their Stinespring compressions still give the maps \(T_i\).

If \(d'=0\), every matrix \(A\in M_{0}(\mathbb {C})\) is zero. Choose \(i_0\in I\), set \(P_{i_0}=\mathbb {1}_r\) and \(P_i=0\) for \(i\ne i_0\), and use linearity. This separate case preserves the statement without an additional positive-dimension assumption.

Corollary 3.11.15 Square-algebra Radon–Nikodym theorem

Let \(I\) be a nonempty finite set, and let \(T_i,T:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) be completely positive linear maps such that \(\sum _{i\in I}T_i=T\). If \(V:\mathbb {C}^D\to \mathbb {C}^D\otimes \mathbb {C}^r\) satisfies \(T(A)=V^\dagger (A\otimes \mathbb {1}_r)V\), then there are positive semidefinite operators \(P_i\in M_{r}(\mathbb {C})\) satisfying \(\sum _{i\in I}P_i=\mathbb {1}_r\) and \(T_i(A)=V^\dagger (A\otimes P_i)V\) for every \(i\in I\) and \(A\in M_{D}(\mathbb {C})\).

Proof

This is the specialization of Theorem 3.11.14 to \(d'=d=D\).

Theorem 3.11.16 Binary Radon–Nikodym theorem for CP maps

Let \(T_1,T_2:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) be completely positive. There exist an ancilla dimension \(m\), a Kraus family \(K\) with Stinespring matrix \(V=V_K\), and positive semidefinite operators \(P_1,P_2:\mathbb {C}^m\to \mathbb {C}^m\) with \(P_1+P_2=\mathbb {1}_m\) such that, for \(i=1,2\) and every \(A\in M_{D}(\mathbb {C})\),

\begin{align} T_i(A) & =V^\dagger (A\otimes P_i)V. \label{eq:representations_binary_radon} \end{align}
Remark 3.11.17 Relation with Wolf’s Radon–Nikodym theorem

Theorem 3.11.14 is Wolf’s rectangular finite-family theorem relative to a supplied Stinespring dilation. Corollary 3.11.15 records the retained square-algebra API. The binary case in Theorem 3.11.16 instead constructs a common dilation from the Kraus families of \(T_1\) and \(T_2\).

Proof

Take Heisenberg-form Kraus families \(K_1\) for \(T_1\) and Schrödinger-form \(L\) for \(T_2\), and form \(K=K_1\mathbin {+\! +}L^\dagger \) on \(\mathbb {C}^{r_1+s}\). Choose \(P_1=P_{\mathrm{top}}\), \(P_2=P_{\mathrm{bot}}\) as in Definition 3.11.13. The Kronecker identity \(A\otimes (C^\dagger C) =(\mathbb {1}\otimes C)^\dagger (A\otimes \mathbb {1})(\mathbb {1}\otimes C)\) rewrites \(V^\dagger (A\otimes P_{\mathrm{top}})V\) as \(((\mathbb {1}\otimes C)V)^\dagger (A\otimes \mathbb {1})((\mathbb {1}\otimes C)V)\), which equals \(V_{K_1}^\dagger (A\otimes \mathbb {1})V_{K_1}=T_1(A)\) by Lemma 3.11.11. For the complementary block, \(A\otimes P_{\mathrm{bot}} =A\otimes \mathbb {1}-A\otimes P_{\mathrm{top}}\), and sandwiching by \(V\) yields \((T_1+T_2)(A)-T_1(A)=T_2(A)\).

Theorem 3.11.18 Open-system representation of quantum channels

Every quantum channel \(T:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) admits a Stinespring isometry \(V\) on an ancilla space \(\mathbb {C}^r\) such that

\begin{align} T(\rho )_{ij} & =\sum _{k=0}^{r-1}(V\rho V^\dagger )_{(i,k),(j,k)} =\operatorname{tr}_r(V\rho V^\dagger ). \label{eq:representations_open_system} \end{align}
Proof

Apply the existence of an isometric Stinespring dilation (Theorem 3.10.12) and the Schrödinger-picture identity (26).

Theorem 3.11.19 Open-system representation, partial-trace form

Every quantum channel \(T\) admits an isometric Stinespring dilation \(V\) such that \(T(\rho )=\operatorname{tr}_E(V\rho V^\dagger )\).

Proof

Rewrite the componentwise identity (44) as a partial trace over the ancilla factor.

Definition 3.11.20 First environment embedding
#

For \(r\geq 1\), let \(W_0:\mathbb {C}^D\to \mathbb {C}^D\otimes \mathbb {C}^r\) be the isometry \(W_0x=x\otimes e_0\).

Lemma 3.11.21 First environment embedding is an isometry

The first-environment embedding satisfies \(W_0^\dagger W_0=\mathbb {1}\).

Proof

For \(D\geq 1\), every quantum channel \(T\) on \(\mathbb {C}^D\) admits an environment dimension \(r\geq 1\) and a unitary \(U\) on \(\mathbb {C}^D\otimes \mathbb {C}^r\) such that, for every matrix \(\rho \) on \(\mathbb {C}^D\),

\begin{align} T(\rho ) & =\operatorname{tr}_E\! \left(UW_0\rho W_0^\dagger U^\dagger \right). \label{eq:representations_open_unitary} \end{align}
Proof

Take the isometric open-system representation \(T(\rho )=\operatorname{tr}_E(V\rho V^\dagger )\). Since \(V^\dagger V=\mathbb {1}=W_0^\dagger W_0\), Lemma 10.16.1 gives a unitary \(U\) with \(V=UW_0\). Substituting this identity into the partial trace formula gives (45).

Let \(d\geq 1\) and let \(T:M_{d}(\mathbb {C})\to M_{d'}(\mathbb {C})\) be completely positive and trace-preserving. Then \(d'\geq 1\), and there are a normalized vector \(\varphi \in \mathbb {C}^{d'}\otimes \mathbb {C}^{d'}\) and a unitary \(U\) on \(\mathbb {C}^d\otimes \mathbb {C}^{d'}\otimes \mathbb {C}^{d'}\), a space of total dimension \(d(d')^2\), such that, for every \(\rho \in M_{d}(\mathbb {C})\),

\begin{align} T(\rho ) & =\operatorname{tr}_{\mathbb {C}^d\otimes \mathbb {C}^{d'}}\! \left[ U\bigl(\rho \otimes |\varphi \rangle \! \langle \varphi |\bigr)U^\dagger \right]. \label{eq:representations_open_system_rectangular_unitary} \end{align}

Here the partial trace is over the first two tensor factors \(\mathbb {C}^d\otimes \mathbb {C}^{d'}\) and retains the final factor \(\mathbb {C}^{d'}\). This is [ Wol12 , Theorem 2.5, Equation (2.14) ] .

Proof

Choose the Stinespring dilation space to have dimension \(r=dd'\). The bound \(\operatorname{rank}(\tau _T)\leq dd'\) and the Schrödinger form of Theorem 3.10.13 give an isometry \(V:\mathbb {C}^d\to \mathbb {C}^{d'}\otimes \mathbb {C}^{dd'}\) satisfying \(T(\rho )=\operatorname{tr}_{\mathbb {C}^{dd'}}(V\rho V^\dagger )\). Reorder the codomain as \(\mathbb {C}^d\otimes \mathbb {C}^{d'}\otimes \mathbb {C}^{d'}\), with the retained output factor last. Choose a normalized \(\varphi \in \mathbb {C}^{d'}\otimes \mathbb {C}^{d'}\) and let \(W_\varphi x=x\otimes \varphi \). Since the reordered Stinespring map and \(W_\varphi \) are isometries, their Gram matrices agree. By Lemma 10.16.1, a unitary \(U\) on the common \(d(d')^2\)-dimensional space satisfies \(V=UW_\varphi \). Substitution, together with \(W_\varphi \rho W_\varphi ^\dagger =\rho \otimes |\varphi \rangle \! \langle \varphi |\), gives (46).

3.12 POVMs and Naimark dilation

Definition 3.12.1 Positive operator-valued measure
#

A positive operator-valued measure with \(n\) outcomes on \(\mathbb {C}^D\) is a family \(\{ E_i\} _{i=0}^{n-1}\) of positive semidefinite operators on \(\mathbb {C}^D\) satisfying the resolution of identity

\begin{align} \sum _{i=0}^{n-1}E_i & =\mathbb {1}_D. \label{eq:representations_povm_resolution} \end{align}
Lemma 3.12.2 Unnormalized POVM steering

Let \(\rho \geq 0\) act on a finite-dimensional Hilbert space, and let \(C:\mathbb {C}^r\to \mathcal H\) satisfy \(CC^\dagger =\rho \). If \(\rho =\sum _{i=0}^{n-1}\sigma _i\), where \(n\geq 1\) and every \(\sigma _i\geq 0\), then there is a POVM \(\{ P_i\} _{i=0}^{n-1}\) on \(\mathbb {C}^r\) such that

\begin{align} \sigma _i & =C P_i^{\mathsf T}C^\dagger \label{eq:representations_unnormalized_steering} \end{align}

for every \(i\).

Proof

Apply the generalized-inverse construction from quantum steering to the positive summands \(\sigma _i\). Their supports lie in the support of \(\rho \). The resulting effects sum to the projection onto the part of \(\mathbb {C}^r\) seen by \(C\); add the complementary projection to one effect. This preserves (48) and makes the effects sum to the identity.

Let \(d\geq 1\), let \(T:M_{d}(\mathbb {C})\to M_{d'}(\mathbb {C})\) be a quantum channel, and let \(V:\mathbb {C}^d\to \mathbb {C}^{d'}\otimes \mathbb {C}^r\) be a supplied Stinespring matrix such that

\begin{align} T(\rho )& =\operatorname{tr}_{\mathbb {C}^r}(V\rho V^\dagger ). \label{eq:representations_environment_instruments_stinespring} \end{align}

Suppose \(n\geq 1\) and \(T=\sum _{i=0}^{n-1}T_i\), where every \(T_i:M_{d}(\mathbb {C})\to M_{d'}(\mathbb {C})\) is completely positive. Then there is a POVM \(\{ P_i\} _{i=0}^{n-1}\) on \(\mathbb {C}^r\) such that, for every \(i\) and \(\rho \),

\begin{align} T_i(\rho ) & =\operatorname{tr}_{\mathbb {C}^r}\! \left[(\mathbb {1}_{d'}\otimes P_i) V\rho V^\dagger \right]. \label{eq:representations_environment_instruments_reduced} \end{align}

If \(k_i\) is the Kraus rank, equivalently the Choi rank, of \(T_i\), then \(k_i\leq \operatorname{rank}(P_i)\).

Proof

The supplied Stinespring matrix gives a purification \(C\) of the Choi matrix \(\tau _T\). Complete positivity and \(T=\sum _iT_i\) give a positive decomposition \(\tau _T=\sum _i\tau _{T_i}\). Lemma 3.12.2 yields a POVM satisfying \(\tau _{T_i}=CP_i^{\mathsf T}C^\dagger \). The Choi identity for inserting an environment effect gives (50). Finally,

\begin{align} k_i=\operatorname{rank}(\tau _{T_i}) =\operatorname{rank}(CP_i^{\mathsf T}C^\dagger ) \leq \operatorname{rank}(P_i). \notag \end{align}
Proposition 3.12.4 Environment-induced instruments

Let \(d\geq 1\) and let \(T:M_{d}(\mathbb {C})\to M_{d'}(\mathbb {C})\) be a quantum channel. Suppose a normalized vector \(\varphi \in \mathbb {C}^{d'}\otimes \mathbb {C}^{d'}\) and a unitary identification

\begin{align} U:\mathbb {C}^d\otimes (\mathbb {C}^{d'}\otimes \mathbb {C}^{d'}) & \longrightarrow \mathbb {C}^{dd'}\otimes \mathbb {C}^{d'} \notag \end{align}

are supplied, so both sides have dimension \(d(d')^2\), and suppose that the system-plus-environment representation from Equation (2.14) holds:

\begin{align} T(\rho ) & =\operatorname{tr}_{\mathbb {C}^{dd'}}\! \left[ U\bigl(\rho \otimes |\varphi \rangle \! \langle \varphi |\bigr)U^\dagger \right]. \label{eq:representations_environment_instruments_open_system} \end{align}

If \(n\geq 1\) and \(T=\sum _{i=0}^{n-1}T_i\) is a decomposition into completely positive maps \(T_i:M_{d}(\mathbb {C})\to M_{d'}(\mathbb {C})\), then there is a POVM \(\{ P_i\} _{i=0}^{n-1}\subset M_{dd'}(\mathbb {C})\) such that

\begin{align} T_i(\rho ) & =\operatorname{tr}_{\mathbb {C}^{dd'}}\! \left[ (P_i\otimes \mathbb {1}_{d'}) U\bigl(\rho \otimes |\varphi \rangle \! \langle \varphi |\bigr)U^\dagger \right] \label{eq:representations_environment_induced_instruments} \end{align}

for every \(i\) and \(\rho \). Moreover, the Kraus rank \(k_i\) of \(T_i\) satisfies \(k_i\leq \operatorname{rank}(P_i)\). This is [ Wol12 , Proposition (Environment induced instruments), Equation (2.15) ] .

Proof

Restrict \(U\) to inputs of the form \(x\otimes \varphi \) and reorder the output factors. This gives a supplied Stinespring matrix \(V:\mathbb {C}^d\to \mathbb {C}^{d'}\otimes \mathbb {C}^{dd'}\) satisfying (49). Apply Theorem 3.12.3 and rewrite its effect-insertion formula in the original environment-first tensor order. The result is (52), with the same rank bound.

Definition 3.12.5 Naimark Kraus square roots

For a POVM \(\{ E_i\} \), each effect \(E_i\ge 0\) admits a square-root factorisation \(E_i=M_i^\dagger M_i\) with \(M_i\in M_{D}(\mathbb {C})\). The operators \(M_i\) are the Naimark Kraus square roots.

Theorem 3.12.6 Naimark square roots satisfy the Kraus normalization

For a POVM \(\{ E_i\} \) with square roots \(E_i=M_i^\dagger M_i\), one has \(\sum _iM_i^\dagger M_i=\mathbb {1}\).

Proof

Sum the identities \(E_i=M_i^\dagger M_i\) and use the defining resolution of the identity for the POVM.

Definition 3.12.7 Naimark isometry
#

The Naimark isometry \(V:\mathbb {C}^D\to \mathbb {C}^D\otimes \mathbb {C}^n\) of a POVM is the Stinespring-type construction

\begin{align} V & =\sum _{i=0}^{n-1}M_i\otimes |i\rangle , \notag \\ V_{(a,i),k} & =(M_i)_{a,k}. \label{eq:representations_naimark_isometry} \end{align}
Definition 3.12.8 Naimark projective measurement

The Naimark projectors on \(\mathbb {C}^D\otimes \mathbb {C}^n\) are

\begin{align} P_i & =\mathbb {1}_D\otimes |i\rangle \! \langle i|, \notag \\ (P_i)_{(a,b),(c,d)} & =\delta _{a,c}\delta _{b,i}\delta _{d,i}. \label{eq:representations_naimark_projectors} \end{align}
Theorem 3.12.9 Naimark isometry condition

The Naimark isometry satisfies \(V^\dagger V=\mathbb {1}_D\).

Proof

The Stinespring Gram identity gives \(V^\dagger V=\sum _iM_i^\dagger M_i=\sum _iE_i=\mathbb {1}_D\) by the resolution of identity.

Theorem 3.12.10 Naimark projectors form a projective measurement

The Naimark projectors satisfy

\begin{align} P_i^2 & =P_i, \notag \\ P_i^\dagger & =P_i, \notag \\ i\ne j & \Rightarrow P_iP_j=0, \notag \\ \sum _iP_i & =\mathbb {1}_{\mathbb {C}^D\otimes \mathbb {C}^n}. \notag \end{align}
Proof

Each identity follows from direct entrywise computation using the delta-function form in (54).

Theorem 3.12.11 Naimark dilation

Every POVM \(\{ E_i\} _{i=0}^{n-1}\) arises as a projective measurement on a dilation: for the isometry \(V\) and projectors \(P_i\) above, \(E_i=V^\dagger P_iV\).

Proof

Computing entrywise,

\begin{align} (V^\dagger P_iV)_{k,\ell } & =\sum _a\overline{(M_i)_{a,k}}(M_i)_{a,\ell } =(M_i^\dagger M_i)_{k,\ell } =(E_i)_{k,\ell }. \notag \end{align}
Theorem 3.12.12 Existential Naimark dilation
#

For every POVM \(\{ E_i\} \) on \(\mathbb {C}^D\) there exist a dilation dimension \(r\), an isometry \(V:\mathbb {C}^D\to \mathbb {C}^D\otimes \mathbb {C}^r\), and a projective measurement \(\{ P_i\} \) on the dilation satisfying \(E_i=V^\dagger P_iV\).

Proof

Take \(r=n\) and the explicit witnesses \(V=\sum _iM_i\otimes |i\rangle \) and \(P_i=\mathbb {1}_D\otimes |i\rangle \! \langle i|\).

Definition 3.12.13 Naimark dilation as a structure

A Naimark dilation of a POVM \(\{ E_i\} \) consists of an isometry \(V\) into a larger Hilbert space together with a projective measurement \(\{ P_i\} \) there such that \(E_i=V^\dagger P_iV\) for all \(i\).

Theorem 3.12.14 Canonical dilation satisfies the Naimark dilation axioms

The explicit isometry \(V=\sum _iM_i\otimes |i\rangle \) and projectors \(P_i=\mathbb {1}_D\otimes |i\rangle \! \langle i|\) satisfy the defining axioms of a Naimark dilation.

Proof

Combine the previously proved identities \(V^\dagger V=\mathbb {1}_D\), \(P_i^2=P_i\), \(P_i^\dagger =P_i\), \(P_iP_j=0\) for \(i\ne j\), \(\sum _iP_i=\mathbb {1}\), and \(V^\dagger P_iV=E_i\).

Theorem 3.12.15 Concrete uniqueness for canonical projectors

Let \(V:\mathbb {C}^D\to \mathbb {C}^D\otimes \mathbb {C}^n\) satisfy \(V^\dagger P_iV=E_i\) for the canonical projectors \(P_i=\mathbb {1}_D\otimes |i\rangle \! \langle i|\). Then there exists an isometry \(W\) on the dilated space such that \(V=WV_0\), where \(V_0\) is the canonical Naimark isometry of \(\{ E_i\} \).

Proof

For each outcome \(i\), the \(i\)-th block of \(V\) has Gram matrix \(E_i\). Comparing with the canonical square root \(M_i\) gives \(V_i^\dagger V_i=M_i^\dagger M_i\), hence \(V_i=U_iM_i\) for a unitary \(U_i\) on \(\mathbb {C}^D\). Assemble the \(U_i\) block-diagonally to obtain an isometry \(W=\bigoplus _iU_i\) on \(\mathbb {C}^D\otimes \mathbb {C}^n\), and then \(V=W\sum _iM_i\otimes |i\rangle =WV_0\).

Let \(\{ |\psi _i\rangle \! \langle \psi _i|\} _{i=0}^{n-1}\) be a rank-one POVM on \(\mathbb {C}^d\) with \(n\) outcomes, i.e. \(\sum _i|\psi _i\rangle \! \langle \psi _i|=\mathbb {1}_d\). Then necessarily \(d\le n\), and there exists an orthonormal basis \(\{ \phi _i\} _{i=0}^{n-1}\) of \(\mathbb {C}^n\) such that each \(\psi _i\) is the restriction of \(\phi _i\) to the first \(d\) coordinates. Concretely, the rows of a unitary \(U\in U(n)\) give the \(\phi _i\), and \(\psi _i\) is recovered as \(\psi _i(j)=U_{i,\, j}\) for \(j=0,\dots ,d-1\).

Unlike 3.12.12, whose ambient Hilbert space is \(\mathbb {C}^D\otimes \mathbb {C}^n\) of dimension \(D\cdot n\), this theorem yields the sharp \(n\)-dimensional ambient space asserted by [ Wol12 , Theorem “Neumark’s theorem” ] .

The corresponding corollary starts from a positive operator-valued measure with an explicit rank-one decomposition.

Proof

Assemble the \(n\times d\) matrix \(\Psi _{i,j}:=\psi _i(j)\). From the resolution of identity one obtains \(\Psi ^\dagger \Psi =\mathbb {1}_d\). Thus \(\Psi \) is an isometry, which implies \(d\le n\). Let \(J\) be the \(n\times d\) inclusion matrix \(J_{i,j}=1\) if \(i\) equals the embedding of \(j\) into \(\{ 0,\ldots ,n{-}1\} \) and \(0\) otherwise; for \(d\le n\), \(J^\dagger J=\mathbb {1}_d\). By Lemma 10.16.1, there exists a unitary \(U\in U(n)\) with \(\Psi =UJ\), hence \(\psi _i(j)=U_{i,\iota (j)}\) where \(\iota :\{ 0,\ldots ,d{-}1\} \to \{ 0,\ldots ,n{-}1\} \) is the natural inclusion. The rows of \(U\) are the required orthonormal basis. The corollary extracts the vectors from a POVM whose effects are given in rank-one form and applies the main theorem.

Definition 3.12.17 POVM from a PSD resolution of identity on a dilation
#

Given an isometry \(V:\mathbb {C}^D\to \mathbb {C}^{d'}\) with \(V^\dagger V=\mathbb {1}_D\) and a family \(\{ P_i\} _{i=0}^{n-1}\) of positive semidefinite operators on \(\mathbb {C}^{d'}\) summing to the identity, the pulled-back operators \(E_i:=V^\dagger P_iV\) form a POVM. In particular, any projective measurement on the dilation (a special case of a PSD resolution of identity) pulls back to a POVM.

Definition 3.12.18 Quantum instrument
#

A quantum instrument with \(n\) outcomes is a family \(\{ \Phi _i\} _{i=0}^{n-1}\) of completely positive maps on \(M_{D}(\mathbb {C})\) whose sum \(\sum _i\Phi _i\) is trace-preserving.

Definition 3.12.19 Instrument operations

Associated to an instrument are the total channel \(\sum _i\Phi _i\), the unnormalized update \(\rho \mapsto \Phi _i(\rho )\) for each outcome \(i\), the outcome probability \(p_i(\rho )=\operatorname{tr}(\Phi _i(\rho ))\), and the normalized posterior state \(\Phi _i(\rho )/p_i(\rho )\) whenever \(p_i(\rho )\neq 0\).

Theorem 3.12.20 Instrument total map is a channel

The total map \(\sum _i\Phi _i\) of an instrument is a quantum channel.

Proof

Complete positivity of the sum follows from closure of CP maps under finite addition; trace preservation is built into the definition.

Theorem 3.12.21 Conservation of probability for instruments
#

For every state \(\rho \in M_{D}(\mathbb {C})\), the outcome probabilities \(p_i(\rho ):=\operatorname{tr}(\Phi _i(\rho ))\) sum to \(\operatorname{tr}(\rho )\).

Proof

Linearity of trace and trace preservation of \(\sum _i\Phi _i\) give

\begin{align} \sum _i\operatorname{tr}(\Phi _i(\rho )) & =\operatorname{tr}\left(\left(\sum _i\Phi _i\right)(\rho )\right) =\operatorname{tr}(\rho ). \notag \end{align}
Theorem 3.12.22 Non-negativity of instrument probabilities
#

If \(\rho \in M_{D}(\mathbb {C})\) is positive semidefinite, then each outcome probability \(p_i(\rho )=\operatorname{tr}(\Phi _i(\rho ))\) is a non-negative real number.

Proof

Each \(\Phi _i\) is completely positive, hence positive, so \(\Phi _i(\rho )\) is positive semidefinite and its trace is a non-negative real.

3.13 Trace-pairing expansion in transfer-matrix form

Definition 3.13.1 Trace-self-dual basis
#

A basis \(\{ \sigma _i\} _i\) of \(M_{D}(\mathbb {C})\) is trace-self-dual when its coordinate functionals are given by trace pairing:

\begin{align} X & = \sum _i \operatorname{tr}(\sigma _i X)\sigma _i. \label{eq:representations_self_dual} \end{align}
Definition 3.13.2 Trace-pairing coefficients
#

For a linear map \(T : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\) and a trace-self-dual basis \(\{ \sigma _i\} \), define coefficients \(t_{ij}:=\operatorname{tr}(\sigma _i T(\sigma _j))\).

Theorem 3.13.3 Trace-pairing expansion of a linear map

If \(\{ \sigma _i\} \) is trace-self-dual, then every linear map \(T : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\) admits the expansion

\begin{align} T(\rho ) & = \sum _i \sum _j t_{ij}\operatorname{tr}(\sigma _j\rho )\sigma _i, \label{eq:representations_trace_expansion}\\ t_{ij} & = \operatorname{tr}(\sigma _i T(\sigma _j)). \notag \end{align}
Proof

Expand \(\rho \) and each \(T(\sigma _j)\) in the chosen basis and substitute. The trace-self-dual identity (55) replaces coordinates by traces, giving the double-sum formula (56).

3.14 General matrix singular value decompositions

The results in this section are ordinary singular value decompositions in the general complex matrix-algebraic setting. They are useful for transfer matrices, but they are not the real \(3\times 3\) singular value decomposition arising from the \(\mathrm{SO}(3)\) action on the traceless Pauli block of a qubit channel in [ Wol12 , Section 2.4 ] . The Lorentz normal form theorem (Theorem 3.15.1.29) instead uses general invertible Kraus-rank-one completely positive filterings. Its proof requires the minimisation argument and Lorentz-orbit analysis in [ Wol12 , Propositions 2.9 and 2.11 ] ; see Section 3.15.

Theorem 3.14.1 SVD for positive semidefinite matrices
#

Every positive semidefinite matrix \(M \in M_{D}(\mathbb {C})\) admits a decomposition \(M=U\operatorname{diag}(\sigma )U^{\dagger }\), where \(U \in \mathcal{U}(D)\) is unitary and \(\sigma : \{ 0,\ldots ,D-1\} \to \mathbb {R}_{\ge 0}\) has non-negative entries.

Proof

The spectral theorem for Hermitian matrices provides an orthonormal eigenbasis with real eigenvalues. Positive semidefiniteness forces those eigenvalues to be non-negative, and the decomposition is written in SVD form with \(U\) the eigenvector unitary and \(\sigma \) the eigenvalue sequence.

Theorem 3.14.2 SVD existence for invertible matrices
#

Every invertible complex square matrix \(M \in M_{D}(\mathbb {C})\) admits a singular value decomposition \(M=U\operatorname{diag}(\sigma )V^{\dagger }\), with \(U,V \in \mathcal{U}(D)\) unitary and \(\sigma _i{\gt}0\) for all \(i\).

Proof

Apply the spectral theorem to the positive definite matrix \(M^{\dagger }M\) to obtain \(M^{\dagger }M=V\operatorname{diag}(\lambda )V^{\dagger }\) with \(\lambda _i{\gt}0\). Set \(\sigma _i:=\sqrt{\lambda _i}\) and \(\Sigma :=\operatorname{diag}(\sigma )\); since \(\Sigma \) is a real positive diagonal, it is self-adjoint and invertible. Define \(U:=MV\Sigma ^{-1}\). Then

\begin{align} U^{\dagger }U & = \Sigma ^{-1}V^{\dagger }(M^{\dagger }M)V\Sigma ^{-1} = \Sigma ^{-1}\operatorname{diag}(\lambda )\Sigma ^{-1} = \mathbb {1}, \notag \\ U\Sigma V^{\dagger } & = MV(\Sigma ^{-1}\Sigma )V^{\dagger } = MVV^{\dagger } = M. \notag \end{align}

Thus \(U\) is unitary and the stated decomposition holds.

Theorem 3.14.3 SVD representation of a transfer matrix
#

Every invertible transfer matrix \(\widehat{T}\) of a linear super-operator \(T : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\) admits a singular value decomposition \(\widehat{T}=U\operatorname{diag}(\sigma )V^{\dagger }\) with \(U,V\) unitary on \(\mathbb {C}^{D}\otimes \mathbb {C}^{D}\) and \(\sigma _i{\gt}0\).

Proof

Direct specialisation of Theorem 3.14.2 to the index type \(\{ 0,\ldots ,D-1\} \times \{ 0,\ldots ,D-1\} \) used by the transfer-matrix representation.

Remark 3.14.4 Sorted / unique singular values
#

Theorem 3.14.2 produces the singular values as an unordered family, without the usual convention that \(\sigma _i\) are sorted in non-increasing order or the statement that they are uniquely determined by \(M\). Applications that distinguish individual singular values may also require a non-increasing ordering and uniqueness of the resulting ordered family. These refinements are not part of the present statement.

3.15 Lorentz normal form

This section states the existence theorems from [ Wol12 , Section 2.4 ] .

3.15.1 Canonical metric blocks for the Minkowski reduction

Let \(P_n\) be the reversal permutation matrix, so that \((P_n)_{ij}=1\) exactly when \(i+j=n+1\). For a sign \(\varepsilon \in \{ 1,-1\} \), the matrix \(\varepsilon P_n\) is the signed metric block attached to a real-eigenvalue Jordan block in the sign characteristic of Gohberg–Lancaster–Rodman, Theorem 5.3.

Definition 3.15.1.1 Signed sip metric blocks

The sip matrix of size \(n\) is \(P_n\). A signed sip block is \(\varepsilon P_n\), where \(\varepsilon =1\) or \(\varepsilon =-1\). Each such block is symmetric, invertible, and its own inverse.

Definition 3.15.1.2 Real canonical Jordan blocks

A real-eigenvalue block is the ordinary real Jordan block \(J_n(a)\) with eigenvalue \(a\) and ones on its first superdiagonal. If \(a\pm \tau i\) is a non-real conjugate pair, put

\begin{align} B(a,\tau )& =\begin{pmatrix} a & \tau \\ -\tau & a \end{pmatrix}. \end{align}

Its real Jordan chain of length \(m\) has \(B(a,\tau )\) on the block diagonal and \(I_2\) on the first block superdiagonal. On the product indexing of this \(2m\)-dimensional real block, its unsigned metric reverses both the chain coordinate and the two-dimensional realification coordinate. No sign characteristic is attached to a non-real block.

Theorem 3.15.1.3 Canonical blocks are selfadjoint for their metric blocks

For every sign \(\varepsilon \) and every real Jordan block,

\begin{align} (\varepsilon P_n)J_n(a) & =J_n(a)^{\mathsf T}(\varepsilon P_n). \end{align}

The real Jordan chain for a non-real conjugate pair satisfies the analogous identity with its unsigned \(2m\)-dimensional reversal metric.

Proof

For a real-eigenvalue block, reversal changes the first superdiagonal of \(J_n(a)\) into the first subdiagonal of \(J_n(a)^{\mathsf T}\); the scalar sign multiplies both sides. For a conjugate pair, simultaneous reversal of the chain and realification coordinates also changes \(B(a,\tau )\) into \(B(a,\tau )^{\mathsf T}\), giving the unsigned identity.

Definition 3.15.1.4 Four-dimensional Minkowski selfadjointness

Let

\begin{align} M& =\operatorname {diag}(1,-1,-1,-1). \end{align}

A real matrix \(C\in M_4(\mathbb R)\) is \(M\)-selfadjoint when \(C^{\mathsf T}M=MC\).

Definition 3.15.1.5 The four VDDM block patterns
#

The four source-indexed patterns are: four real one-dimensional blocks; one two-dimensional non-real conjugate-pair block and two real one-dimensional blocks; one real Jordan block of size two and two real one-dimensional blocks; or one real Jordan block of size three and one real one-dimensional block.

The load-bearing existence statement is still open. It must construct, for every \(M\)-selfadjoint \(C\), an invertible \(X\), a real canonical Jordan matrix \(J\), and its signed metric \(N_J\) satisfying

\begin{align} C& =X^{-1}JX, & XMX^{\mathsf T}& =N_J, \end{align}

and then derive exhaustiveness of the four patterns from inertia \((1,3)\). The present library has neither real Jordan-form existence nor the simultaneous similarity–congruence theorem controlling the sign characteristic. The exact formalization boundary and the required transpose and inverse translations are recorded in [ con26b ] .

Definition 3.15.1.6 Pauli transfer matrix

Let \(\sigma _0=\mathbb {1},\sigma _1,\sigma _2,\sigma _3\) be the Pauli matrices. The Pauli transfer matrix of a linear map \(T:M_{2}(\mathbb {C})\to M_{2}(\mathbb {C})\) is \(\widehat T\in M_4(\mathbb {C})\) with entries

\begin{align} \widehat T_{ij} & =\frac12\operatorname{tr}\! \left(\sigma _iT(\sigma _j)\right), \qquad 0\leq i,j\leq 3. \label{eq:pauli_transfer_entries} \end{align}

We write

\begin{align} \widehat T & = \begin{pmatrix} \widehat T_{00} & r^{\mathsf T} \\ v & \Delta \end{pmatrix}, \label{eq:pauli_transfer_blocks} \end{align}

where \(\Delta =(\widehat T_{ij})_{i,j=1}^{3}\). Thus \(r^{\mathsf T}\) and \(v\) are exactly the two off-diagonal Pauli blocks. This is the representation used in [ Wol12 , Section 2.4, Eq. (2.39) ] .

Definition 3.15.1.7 Pauli-block diagonal truncation

Define Pauli time reversal by \(\Theta (X)=\operatorname{tr}(X)\mathbb {1}-X\). Its Pauli transfer matrix is

\begin{align} D& =\operatorname{diag}(1,-1,-1,-1). \label{eq:pauli_time_reversal_diagonal} \end{align}

For a linear map \(T:M_{2}(\mathbb {C})\to M_{2}(\mathbb {C})\), define its Pauli-block diagonal truncation by

\begin{align} T’& =\frac{T+\Theta \circ T\circ \Theta }{2}. \label{eq:pauli_block_truncation} \end{align}

This is the truncation in [ Wol12 , Proposition 2.10, Section 2.4 ] ; see also the local source Notes/WolfNoteTexSource/ch02_representations.tex, lines 984–998.

Let \(T:M_{2}(\mathbb {C})\to M_{2}(\mathbb {C})\) be Hermiticity preserving, and let \(T'\) be its Pauli-block diagonal truncation. If \(\widehat T\) is written as in 62, then

\begin{align} \widehat{T'} & =\frac{\widehat T+D\widehat T D}{2} =\begin{pmatrix} \widehat T_{00} & 0 \\ 0 & \Delta \end{pmatrix} =\widehat T_{00}\oplus \Delta . \label{eq:pauli_block_truncation_matrix} \end{align}

Equivalently, entrywise,

\begin{align} \widehat{T'}_{ij} & =\begin{cases} \widehat T_{ij},& i=j=0\text{ or }i,j\in \{ 1,2,3\} ,\\ 0,& \text{otherwise}. \end{cases} \label{eq:pauli_block_truncation_entrywise} \end{align}

If \(T\) is positive, then \(T'\) is positive. If \(T\) is completely positive, then \(T'\) is completely positive. These are precisely the forward implications proved in [ Wol12 , Proposition 2.10, Section 2.4 ] , following Eq. (2.39); the local proof is at Notes/WolfNoteTexSource/ch02_representations.tex, lines 992–998.

Proof

In the Pauli basis, pre- and postcomposition by \(\Theta \) multiply the transfer matrix by \(D\) on the right and left, respectively. Averaging with \(D\widehat T D\) therefore gives 68. Time reversal is positive, so \(\Theta \circ T\circ \Theta \) is positive whenever \(T\) is positive, and convexity gives positivity of \(T'\). If \(T(X)=\sum _iK_iXK_i^\dagger \), then \(\Theta \circ T\circ \Theta \) has Kraus operators \(\sigma _2\overline{K_i}\sigma _2\). Hence the same averaging also preserves complete positivity.

Remark 3.15.1.9 Source correction: the converse fails
#

Proposition 2.10 of [ Wol12 ] prints both preservation statements as equivalences, but its proof establishes only the forward implications in Theorem 3.15.1.8. Indeed, consider

\begin{align} T(X)& =\operatorname{tr}(X)\operatorname{diag}(3/2,-1/2). \label{eq:pauli_block_truncation_counterexample} \end{align}

This map is Hermiticity preserving but not positive, since \(T(\mathbb {1}/2)=\operatorname{diag}(3/2,-1/2)\). Its Pauli-block diagonal truncation is the completely depolarizing channel \(T'(X)=\operatorname{tr}(X)\mathbb {1}/2\), which is completely positive. Thus neither the positivity converse nor the complete-positivity converse is valid. See docs/paper-gaps/wolf_prop2_10_block_truncation_converse.tex for the focused source-correction record.

Definition 3.15.1.10 SL-filtering operation
#

An SL-filtering for \(D \times D\) matrices is a completely positive map of the form \(\Phi (X)=SXS^{\dagger }\), where \(S \in M_{D}(\mathbb {C})\) satisfies \(\det S=1\). Such maps are invertible; when \(D\geq 1\), they have Kraus rank 1.

An invertible filtering operation on \(M_{D}(\mathbb {C})\) is a completely positive map

\begin{align} \Phi _X(A)=XAX^\dagger , \qquad X\in \mathrm{GL}(D,\mathbb {C}). \label{eq:representations_invertible_filter} \end{align}

If \(T:M_{d_1}(\mathbb {C})\to M_{d_2}(\mathbb {C})\), pre- and postfiltering are written in Wolf’s order as \(\Phi _2\circ T\circ \Phi _1\). The matrices \(X\) are retained as part of the data; in particular, matrices which differ by a phase are not identified.

Let \(D\geq 1\) and let \(X\in \mathrm{GL}(D,\mathbb {C})\). There are a nonzero \(c\in \mathbb {C}\) and \(S\in \operatorname{SL}(D,\mathbb {C})\) such that

\begin{align} c^D& =\det X, & X& =cS, \label{eq:representations_filter_scalar_matrix}\\ \Phi _X& =|c|^2\Phi _S, & |c|^2& {\gt}0. \label{eq:representations_filter_scalar_map} \end{align}

Moreover, \(\Phi _X\) has Kraus rank exactly one. The matrix scalar \(c\) is complex and need not be positive real; positivity applies only to the map scalar \(|c|^2\).

Proof

Choose a \(D\)th root \(c\) of \(\det X\). Since \(X\) is invertible, both \(\det X\) and \(c\) are nonzero. Put \(S=c^{-1}X\). Multiplicativity of the determinant gives \(\det S=1\), while direct expansion of \((cS)A(cS)^\dagger \) gives \(\Phi _X=|c|^2\Phi _S\). The displayed nonzero Kraus operator gives Kraus rank at most one, and invertibility excludes Kraus rank zero.

Lemma 3.15.1.13 Scalar factors under pre- and postfiltering

Suppose \(X_i=c_iS_i\), where \(c_i\neq 0\) and \(S_i\in \operatorname{SL}(d_i,\mathbb {C})\). For every linear map \(T:M_{d_1}(\mathbb {C})\to M_{d_2}(\mathbb {C})\),

\begin{align} \Phi _{X_2}\circ T\circ \Phi _{X_1} =|c_1c_2|^2 \bigl(\Phi _{S_2}\circ T\circ \Phi _{S_1}\bigr). \label{eq:representations_filter_two_scalar} \end{align}
Proof

Substitute \(\Phi _{X_i}=|c_i|^2\Phi _{S_i}\) and use linearity of \(T\) and of the outer filtering operation. The two real scalars combine as \(|c_1|^2|c_2|^2=|c_1c_2|^2\).

Definition 3.15.1.14 Doubly-stochastic map
#

A linear map \(T : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\) is doubly-stochastic if \(T(\mathbb {1})\propto \mathbb {1}\) and the reduced density matrix \(\operatorname{tr}_{1}[\tau ]\) of its Choi matrix \(\tau =(T\otimes \operatorname{id})(|\Omega \rangle \! \langle \Omega |)\) is proportional to the identity. This is the normal form in [ Wol12 , Proposition 2.9 ] .

Lemma 3.15.1.15 Positive-definite trace lower bound

Let \(D\geq 1\), let \(M\in M_{D}(\mathbb {C})\) be positive-definite, and let \(\lambda _{\min }(M)\) be its smallest Hermitian eigenvalue. For every \(X\in M_{D}(\mathbb {C})\),

\begin{align} \lambda _{\min }(M)\operatorname{tr}(X^{\dagger }X) & \leq \operatorname{tr}(XMX^{\dagger }). \label{eq:representations_posdef_trace_bound} \end{align}
Proof

The matrix \(M-\lambda _{\min }(M)\mathbb {1}\) is positive semidefinite by the spectral theorem. Since \(X^{\dagger }X\) is also positive semidefinite, the trace product \(\operatorname{tr}\! \left(X^{\dagger }X(M-\lambda _{\min }(M)\mathbb {1})\right)\) is non-negative. Expanding this expression and cycling the trace gives (74).

Lemma 3.15.1.16 Determinant AM–GM Hilbert–Schmidt bound

Let \(A\in M_{D}(\mathbb {C})\) with \(D\geq 1\). If \(|\det A|=1\), then \(D\leq \operatorname{tr}(A^{\dagger }A)\).

Proof

The matrix \(A^{\dagger }A\) is positive semidefinite and has determinant \(|\det A|^{2}=1\). Thus the product of its Hermitian eigenvalues is one. Denoting the eigenvalues of \(A^{\dagger }A\) by \(\lambda _{1},\ldots ,\lambda _{D}\geq 0\), the arithmetic-geometric mean inequality gives

\begin{align} \frac{\lambda _{1}+\cdots +\lambda _{D}}{D} & \geq (\lambda _{1}\cdots \lambda _{D})^{1/D} =1. \notag \end{align}

Therefore \(\operatorname{tr}(A^{\dagger }A)=\lambda _{1}+\cdots +\lambda _{D}\geq D\).

Lemma 3.15.1.17 Kronecker Hilbert–Schmidt trace multiplicativity

For complex matrices \(A\) and \(B\) of compatible rectangular sizes,

\begin{align} \operatorname{tr}\! \left((A\otimes _{k}B)^{\dagger } (A\otimes _{k}B)\right) & =\operatorname{tr}(A^{\dagger }A)\operatorname{tr}(B^{\dagger }B). \label{eq:representations_kronecker_hs} \end{align}
Proof

Use \((A\otimes _{k}B)^{\dagger }=A^{\dagger }\otimes _{k}B^{\dagger }\), the mixed product identity for Kronecker products, and \(\operatorname{tr}(C\otimes _{k}D)=\operatorname{tr}(C)\operatorname{tr}(D)\). With \(C=A^{\dagger }A\) and \(D=B^{\dagger }B\), these identities give (75).

For a positive-definite operator \(\tau \) on \(\mathbb {C}^{d_2}\otimes \mathbb {C}^{d_1}\), the infimum of

\begin{align} \operatorname{tr}\! \left[(S_{2}\otimes _{k}S_{1})\tau (S_{2}\otimes _{k}S_{1})^{\dagger }\right] \notag \end{align}

over \(S_{1}\in M_{d_1}(\mathbb {C})\) and \(S_{2}\in M_{d_2}(\mathbb {C})\) with \(\det S_{1}=\det S_{2}=1\) is attained. The two tensor factors may have different dimensions.

Proof

Write \(X=S_{2}\otimes _{k}S_{1}\). Lemma 3.15.1.15 gives the trace lower bound below. Lemma 3.15.1.17 factors the Hilbert–Schmidt trace. For each \(i\in \{ 1,2\} \), Lemma 3.15.1.16 supplies the first row. Together,

\begin{align} \operatorname{tr}(S_i^\dagger S_i) & =\| S_i\| ^2\geq d_i, \notag \\ \operatorname{tr}(X\tau X^\dagger ) & \geq \lambda _{\min }(\tau )\operatorname{tr}(X^\dagger X) \notag \\ & =\lambda _{\min }(\tau ) \operatorname{tr}(S_2^\dagger S_2)\operatorname{tr}(S_1^\dagger S_1) \notag \\ & \geq \lambda _{\min }(\tau )\, d_j\, \| S_i\| ^2 \qquad (j\neq i). \notag \end{align}

Hence any point whose value is at most the value at the identity lies in a fixed Frobenius ball \(\{ \, \| S\| \leq C\, \} \). Intersecting with the closed set \(\det S=1\) produces a compact set, on which the continuous trace functional attains its minimum by the extreme-value theorem. A point outside the sublevel set has value larger than the value at the identity, so the minimiser on the compact set is a global minimiser.

Lemma 3.15.1.19 Arithmetic–geometric-mean inequality, product/sum form

For a non-negative family \(f_{0},\ldots ,f_{D-1}\) of real numbers, or more generally for a non-negative family indexed by a finite set with \(D\) elements,

\begin{align} D^{D}\prod _{i}f_{i} & \leq \left(\sum _{i}f_{i}\right)^{D}. \label{eq:representations_amgm_prod_sum} \end{align}
Proof

Apply the weighted arithmetic–geometric-mean inequality with uniform weights \(1/D\):

\begin{align} \left(\prod _{i}f_{i}\right)^{1/D} & \leq \frac{1}{D}\sum _{i}f_{i}. \notag \end{align}

Raising both sides to the \(D\)-th power gives (76).

For a positive-semidefinite \(D \times D\) matrix \(M\),

\begin{align} D^{D}\det M & \leq (\operatorname{tr}M)^{D}, \label{eq:representations_trace_det_amgm} \end{align}

and equality holds if and only if \(M=(\operatorname{tr}M/D)\mathbb {1}\). The inequality holds for a positive-semidefinite matrix whose rows and columns are indexed by any finite set with \(D\) elements; the equality characterization is stated only for \(D \times D\) matrices.

Proof

Both \(\det M=\prod _{i}\lambda _{i}\) and \(\operatorname{tr}M=\sum _{i}\lambda _{i}\) are expressed through the non-negative eigenvalues \(\lambda _i\) of \(M\). The bound is the arithmetic–geometric-mean inequality with uniform weights \(1/D\), raised to the \(D\)-th power; for a \(D \times D\) matrix, equality holds exactly when all eigenvalues coincide, that is, when \(M\) is a scalar matrix. Relabelling along a bijection with the index set of a \(D \times D\) matrix carries the inequality to an arbitrary finite index set of \(D\) elements.

Theorem 3.15.1.21 Normal form for generic \(\tau \)

Let \(\tau \in \mathcal{B}(\mathbb {C}^{d_2}\otimes \mathbb {C}^{d_1})\) be positive-definite. Then there exist \(S_i\in \mathrm{SL}(d_i,\mathbb {C})\) which attain the infimum

\begin{align} p & :={\inf }_{X_i\in \mathrm{SL}(d_i,\mathbb {C})} \operatorname{tr}\! \left[(X_2\otimes X_1)\tau (X_2\otimes X_1)^\dagger \right]. \label{eq:representations_generic_tau_infimum} \end{align}

In particular, for

\begin{align} \tau ’ & :=(S_2\otimes S_1)\tau (S_2\otimes S_1)^\dagger , \notag \end{align}

both partial traces are proportional to the respective identity matrices:

\begin{align} \operatorname{tr}_{2}[\tau ’]& =\kappa _1\mathbb {1}_{d_1}, & \operatorname{tr}_{1}[\tau ’]& =\kappa _2\mathbb {1}_{d_2} \label{eq:representations_generic_tau_marginals} \end{align}

for some \(\kappa _1,\kappa _2\in \mathbb {C}\). This is [ Wol12 , Proposition 2.8, lines 894–919 ] , with the two dimensions kept independent.

Proof

Choose a minimizing pair \((S_1,S_2)\) by Lemma 3.15.1.18. Hold \(S_2\) fixed and set

\begin{align} \rho _2 & :=(S_2\otimes \mathbb {1}_{d_1})\tau (S_2\otimes \mathbb {1}_{d_1})^\dagger , & M_1& :=\operatorname{tr}_2[\rho _2]. \notag \end{align}

Positive-definiteness of \(\tau \) and invertibility of \(S_2\) imply that \(M_1\) is positive-definite. The defining minimality of \((S_1,S_2)\) says that \(S_1\) minimizes \(\operatorname{tr}(XM_1X^\dagger )\) over \(X\in \mathrm{SL}(d_1,\mathbb {C})\). A determinant-one whitening of \(M_1\) attains the trace–determinant arithmetic–geometric-mean bound, while its equality case in Lemma 3.15.1.20 forces \(S_1M_1S_1^\dagger \) to be a scalar matrix. This matrix is \(\operatorname{tr}_2[\tau ']\). Holding \(S_1\) fixed and interchanging the two tensor factors gives \(\operatorname{tr}_1[\tau ']\propto \mathbb {1}_{d_2}\) in the same way.

Let \(T : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\) be a completely positive map whose Choi matrix is positive-definite (equivalently, \(T\) has full Kraus rank). Then there exist SL-filterings \(\Phi _{1},\Phi _{2}\) such that \(\Phi _{2}\circ T\circ \Phi _{1}\) is doubly-stochastic.

This is the equal-dimension (square) case \(T : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\) of [ Wol12 , Proposition 2.9 ] ; the rectangular form with independent dimensions is Theorem 3.15.1.24.

Proof

Let \(\tau \) be the Choi matrix of \(T\) and take the minimiser \((S_{1},S_{2})\) of

\begin{align} \operatorname{tr}\! \left[(S_{2}\otimes _{k}S_{1})\tau (S_{2}\otimes _{k}S_{1})^{\dagger }\right] \notag \end{align}

over \(\det S_{1}=\det S_{2}=1\) from Lemma 3.15.1.18. Set \(\Phi _{1},\Phi _{2}\) to be the filterings with matrices \(S_{1}^{\mathsf T}\) and \(S_{2}\), so that the Choi matrix of \(\Phi _{2}\circ T\circ \Phi _{1}\) equals \((S_{2}\otimes _{k}S_{1})\tau (S_{2}\otimes _{k}S_{1})^{\dagger }\). Holding one filtering factor fixed, the minimiser is optimal in the other coordinate, so each partial trace minimises a functional \(\operatorname{tr}(SMS^{\dagger })\) over \(\det S=1\) for a positive-semidefinite \(M\), where \(\operatorname{tr}(SMS^{\dagger })\geq D(\det M)^{1/D}\), with equality at the minimiser; by the equality case of Lemma 3.15.1.20, this forces \(SMS^{\dagger }\propto \mathbb {1}\), hence both partial traces are proportional to the identity, which is exactly the doubly-stochastic condition.

Definition 3.15.1.23 Doubly-stochastic map between matrix algebras
#

A linear map \(T : M_{d_1}(\mathbb {C}) \to M_{d_2}(\mathbb {C})\) between matrix algebras of possibly different dimensions is doubly-stochastic if \(T(\mathbb {1})\propto \mathbb {1}\) and \(T^{*}(\mathbb {1})\propto \mathbb {1}\), where \(T^{*}\) is the trace-pairing adjoint. This is the normal-form condition of [ Wol12 , Proposition 2.9 ] ; by the rectangular Choi–Jamiolkowski correspondence it is equivalent to both partial traces of the Choi matrix being proportional to the identity.

Let \(T : M_{d_1}(\mathbb {C}) \to M_{d_2}(\mathbb {C})\) be a completely positive map whose Choi matrix is positive-definite (equivalently, \(T\) has full Kraus rank). Then there exist SL-filterings \(\Phi _{1}\) on \(M_{d_1}(\mathbb {C})\) and \(\Phi _{2}\) on \(M_{d_2}(\mathbb {C})\) such that \(\Phi _{2}\circ T\circ \Phi _{1}\) is doubly-stochastic. This is [ Wol12 , Proposition 2.9 ] at the source’s generality.

Proof

Apply Theorem 3.15.1.21 to the rectangular Choi matrix \(\tau \) of \(T\), and let \(S_1,S_2\) be the resulting determinant-one matrices. Define \(\Phi _1,\Phi _2\) to be the filterings with matrices \(S_1^{\mathsf T}\) and \(S_2\), respectively. The Choi matrix of \(\Phi _2\circ T\circ \Phi _1\) is then the minimizing representative \((S_2\otimes S_1)\tau (S_2\otimes S_1)^\dagger \). Its two partial traces are scalar by Equation 79, and the rectangular Choi identities \(\operatorname{tr}_B(\tau )=T(\mathbb {1})/d_1\) and \(\operatorname{tr}_A(\tau )=(T^{*}(\mathbb {1}))^{\mathsf T}/d_1\) give the doubly-stochastic condition.

Definition 3.15.1.25 Diagonal Lorentz normal form
#

For a completely positive, trace-preserving qubit channel \(T' : M_{2}(\mathbb {C}) \to M_{2}(\mathbb {C})\), write \(\widehat{T'}\) for its matrix in the normalized Pauli basis \(\{ \sigma _{0}/\sqrt{2},\sigma _{1}/\sqrt{2}, \sigma _{2}/\sqrt{2},\sigma _{3}/\sqrt{2}\} \). The channel is in diagonal Lorentz normal form when it is unital and every off-diagonal entry of \(\widehat{T'}\) is zero.

Definition 3.15.1.26 Non-diagonal Lorentz normal form
#

For a completely positive, trace-preserving qubit channel \(T' : M_{2}(\mathbb {C}) \to M_{2}(\mathbb {C})\), write \(\widehat{T'}\) in the normalized Pauli basis. The channel is in non-diagonal Lorentz normal form when, for some \(x \in [0,1]\),

\begin{align} \widehat{T'} & = \begin{pmatrix} 1 & 0 & 0 & 0 \\ 0 & x/\sqrt{3} & 0 & 0 \\ 0 & 0 & x/\sqrt{3} & 0 \\ 2/3 & 0 & 0 & 1/3 \end{pmatrix}. \label{eq:representations_lorentz_nondiagonal} \end{align}

Trace preservation supplies the first row of the displayed matrix.

Definition 3.15.1.27 Singular Lorentz normal form
#

For a completely positive, trace-preserving qubit channel \(T' : M_{2}(\mathbb {C}) \to M_{2}(\mathbb {C})\), write \(\widehat{T'}\) in the normalized Pauli basis. The channel is in singular Lorentz normal form when

\begin{align} \widehat{T'} & = \begin{pmatrix} 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 \\ 1 & 0 & 0 & 0 \end{pmatrix}, \label{eq:representations_lorentz_singular} \end{align}

equivalently, every input state is mapped to \((1+\sigma _{3})/2\). Trace preservation supplies the first row of the displayed matrix.

Put \(q_i=p_i^2\) for the Pauli coefficients in [ VV02 , Theorem 8, Eq. (18) ] , specialized to \(A=B=\mathbb {1}\). Direct conjugation of the Pauli basis gives

\begin{align} s_1 & =q_0+q_1-q_2-q_3, & s_2 & =q_0-q_1+q_2-q_3, \\ s_3 & =q_0-q_1-q_2+q_3, & 1 & =q_0+q_1+q_2+q_3. \end{align}

Thus, in Wolf’s Pauli-transfer convention, the four candidate Bell weights are

\begin{align} q_0 & =\frac{1+s_1+s_2+s_3}{4}, & q_1 & =\frac{1+s_1-s_2-s_3}{4}, \\ q_2 & =\frac{1-s_1+s_2-s_3}{4}, & q_3 & =\frac{1-s_1-s_2+s_3}{4}. \end{align}

Verstraete–Verschelde instead print \(1-s_1-s_2-s_3\geq 0\) in Theorem 8. Their preceding Equation (16) uses \(R_\Phi \) as the Bloch transfer matrix, so the identity channel has \(R_\Phi =\operatorname {diag}(1,1,1,1)\) and violates the printed inequality. The all-minus sign is therefore inconsistent with their own convention; it is not used in this construction and no silent change of the parameter \(s_3\) is made. They sum to one. If every \(q_i\) is nonnegative, put \(p_i=\sqrt{q_i}\). Then the source family \(\{ p_0\sigma _0,p_1\sigma _1,p_2\sigma _2,p_3\sigma _3\} \) from [ VV02 , Theorem 8, Eq. (18) ] , specialized to \(A=B=\mathbb {1}\), defines a bistochastic channel whose Pauli transfer matrix is \(\operatorname {diag}(1,s_1,s_2,s_3)\). Its Choi rank is exactly \(\# \{ i\mid q_i\ne 0\} \), so all diagonal rank-drop boundaries are retained. Simultaneous nonnegativity of the four weights is equivalent to nonnegativity of their four displayed numerators. This construction shows that those inequalities suffice for the displayed Pauli family to be a channel; it makes no converse assertion for a separately specified diagonal map. Under the ordered convention \(1\geq s_1\geq s_2\geq \lvert s_3\rvert \), Wolf’s \(s_1+s_2\leq 1+s_3\) from Equation (2.40) implies all four.

For every \(x\in [0,1]\), the three Kraus operators displayed in [ VV02 , Theorem 8, Eq. (19) ] define the non-diagonal representative

\begin{align} \Delta & =\operatorname {diag}(x/\sqrt{3},x/\sqrt{3},1/3), & v& =(0,0,2/3). \end{align}

Its Choi rank, equivalently its minimal Kraus rank, is \(3\) when \(x{\lt}1\) and \(2\) when \(x=1\). The third normal form in [ VV02 , Theorem 8, Eq. (17) ] is the singular trace-to-state channel

\begin{align} X\longmapsto \operatorname{tr}(X)\, \lvert 0\rangle \! \langle 0\rvert ; \end{align}

it has \(\Delta =0\), \(v=(0,0,1)\), and Choi/Kraus rank \(2\).

These are constructions and rank calculations for the representatives in [ VV02 , Theorem 8, Eqs. (17)–(19) ] . The diagonal rank formula is the direct Bell-family calculation from Equation (18). The non-diagonal and singular rank statements agree with cases 2 and 3 of [ WC08 , Theorem 18 ] . This does not prove the Lorentz-orbit classification or derive that the non-diagonal parameter must lie in \([0,1]\). The normalized Choi convention is \(\tau =\frac14\sum _{ij}\widehat T_{ij}\sigma _i\otimes \sigma _j^{\mathsf T}\); hence its raw Pauli correlation matrix satisfies \(R_{\mathrm{raw}}(\tau )=\widehat T\operatorname {diag}(1,1,-1,1)\) because \(\sigma _2^{\mathsf T}=-\sigma _2\). Verstraete–Verschelde define \(R_\Phi \) only after taking the first-factor partial transpose of their dual state and then use it as the Bloch transfer matrix. Thus \(R_\Phi \) corresponds to \(\widehat T\), not to \(R_{\mathrm{raw}}(\tau )\); the displayed sign matrix is the explicit bridge. In particular, the partial-transpose sign has already been absorbed before their Theorem 8 parameters are introduced and cannot account for its printed all-minus constraint.

For every qubit channel \(T : M_{2}(\mathbb {C}) \to M_{2}(\mathbb {C})\), there exist invertible completely positive maps \(\Phi _{1},\Phi _{2}\), both of Kraus rank one, such that the filtered channel \(T'=\Phi _{2}\circ T\circ \Phi _{1}\) is in one of the three Lorentz normal forms: diagonal, non-diagonal, or singular. These general filters include scalar freedom and are not restricted to determinant-one \(\operatorname{SL}(2,\mathbb {C})\) filterings. Indeed, writing \(X_i=c_iS_i\) with \(S_i\in \operatorname{SL}(2,\mathbb {C})\) separates the Lorentz action from the positive map scalar \(|c_1c_2|^2\); only the latter can normalize the resulting representative to a channel. A proof still requires this scalar normalization and the classification of Lorentz orbits. The displayed diagonal, non-diagonal, and singular representatives and their ranks are already supplied by Theorem 3.15.1.28.

Every Hermitian matrix \(M\in M_2^\dagger (\mathbb {C})\) has unique real Pauli coordinates \(x=(x_0,x_1,x_2,x_3)\) such that

\begin{align} M& =M(x):=\sum _{i=0}^{3}x_i\sigma _i, & x_i& =\frac12\operatorname{tr}(\sigma _iM). \label{eq:representations_pauli_minkowski_coordinates} \end{align}

This identifies \(M_2^\dagger (\mathbb {C})\) with \(\mathbb {R}^4\). Write

\begin{align} q(x)& =x_0^2-x_1^2-x_2^2-x_3^2, & \eta & =\operatorname{diag}(1,-1,-1,-1), \label{eq:representations_minkowski_form}\\ \mathcal C_+& =\{ x\in \mathbb {R}^4:x_0\geq 0,\ q(x)\geq 0\} \label{eq:representations_future_cone} \end{align}

for the Minkowski quadratic form, its matrix, and the closed future cone. These are the coordinates used immediately before [ Wol12 , Eq. (2.41) ] ; see also the local source Notes/WolfNoteTexSource/ch02_representations.tex, lines 1040–1044.

Theorem 3.15.1.31 Determinant form and the future cone

For every \(x\in \mathbb {R}^4\),

\begin{align} \det M(x)& =q(x)=\langle x,\eta x\rangle , \label{eq:representations_pauli_minkowski_determinant}\\ M(x)\geq 0& \iff x\in \mathcal C_+. \label{eq:representations_pauli_future_cone} \end{align}
Proof

The first identity follows by substituting the four Pauli matrices into the determinant of a \(2\times 2\) matrix. For the second, a positive semidefinite Hermitian matrix has nonnegative trace and determinant, which give \(x_0\geq 0\) and \(q(x)\geq 0\). Conversely, the two real eigenvalues of \(M(x)\) have sum \(2x_0\geq 0\) and product \(q(x)\geq 0\), so both are nonnegative.

For \(X\in \operatorname{SL}(2,\mathbb {C})\), let \(L(X)\) be the real linear transformation of \(\mathbb {R}^4\) determined by Wolf’s Hermitian congruence

\begin{align} M(x)& \longmapsto XM(x)X^\dagger =M(L(X)x). \label{eq:representations_spinor_congruence} \end{align}

Its Pauli-basis entries are

\begin{align} L(X)_{ij} & =\frac12\operatorname{tr}\! \left(\sigma _iX\sigma _jX^\dagger \right). \label{eq:representations_spinor_entries} \end{align}

The trace is real. This is the four-dimensional action in [ Wol12 , Eq. (2.41) ] ; it is not the three-dimensional adjoint action \(M\mapsto UMU^{-1}\) on traceless Pauli matrices. The special orthochronous Lorentz group is described, in the row-action convention of the source, by

\begin{align} \mathrm{SO}^+(1,3) & =\{ L\in M_4(\mathbb {R}):\det L=1,\ L\eta L^{\mathsf T}=\eta ,\ L_{00}{\gt}0\} . \label{eq:representations_special_orthochronous_lorentz} \end{align}

The assignment \(X\mapsto L(X)\) is multiplicative, and for every \(X\in \operatorname{SL}(2,\mathbb {C})\),

\begin{align} \det L(X)& =1, & L(X)\eta L(X)^{\mathsf T}& =\eta , & L(X)_{00}& {\gt}0. \label{eq:representations_spinor_lorentz_membership} \end{align}

Hence \(L(X)\in \mathrm{SO}^+(1,3)\). It preserves both the Minkowski form and the closed future cone, and \(L(-X)=L(X)\).

Proof

Congruence by \(X\) preserves the determinant because \(\det X=1\); polarization then gives preservation of the Minkowski bilinear form. It preserves the future cone because congruence by an invertible matrix preserves positive semidefiniteness. Moreover, \(L(X)_{00}=\operatorname{tr}(XX^\dagger )/2{\gt}0\). The determinant of \(L(X)\) is a real multiplicative character of \(\operatorname{SL}(2,\mathbb {C})\) and is therefore trivial because \(\operatorname{SL}(2,\mathbb {C})\) equals its commutator subgroup. Associativity of congruence gives multiplicativity, and the two scalar signs cancel in \((-X)M(-X)^\dagger \).

Definition 3.15.1.34 Spinor covering homomorphism

Regard \(\mathrm{SO}^+(1,3)\) from (95) as a matrix group. The spinor action defines the homomorphism

\begin{align} \Lambda :\operatorname{SL}(2,\mathbb {C})& \longrightarrow \mathrm{SO}^+(1,3), & \Lambda (X)& =L(X). \label{eq:representations_spinor_cover_hom} \end{align}

The homomorphism \(\Lambda \) in (97) is surjective. Its fibres contain exactly two points: for all \(X,Y\in \operatorname{SL}(2,\mathbb {C})\),

\begin{align} \Lambda (X)=\Lambda (Y) & \iff X=Y\ \text{or}\ X=-Y, & \ker \Lambda & =\{ I,-I\} . \label{eq:representations_spinor_two_point_fibres} \end{align}

Thus \(\operatorname{SL}(2,\mathbb {C})\) is a double cover of \(\mathrm{SO}^+(1,3)\), as stated after [ Wol12 , Eq. (2.42) ] .

Proof

Given \(L\in \mathrm{SO}^+(1,3)\), set \(u=Le_0\). The Lorentz identities give \(q(u)=1\) and \(u_0{\gt}0\). The canonical boost \(B_u\), whose first column is \(u\), has the positive-definite spinor lift \(P_u=(M(u)+I)/\sqrt{2(1+u_0)}{\gt}0\). This is the \(P{\gt}0\) condition in Wolf’s polar decomposition immediately before [ Wol12 , Eq. (2.44) ] . The matrix \(B_u^{-1}L\) fixes \(e_0\); its Lorentz equations force the block form \(1\oplus R\) with \(R\in \mathrm{SO}(3)\). Lift \(R\) to \(U\in \mathrm{SU}(2)\). Multiplicativity then gives \(\Lambda (P_uU)=B_u(1\oplus R)=L\).

If \(\Lambda (X)=I\), congruence applied to \(M=I\) gives \(XX^\dagger =I\). Congruence applied to the Pauli basis then makes \(X\) commute with every Pauli matrix, so \(X\) is scalar. The equation \(\det X=1\) gives \(X=\pm I\). Applying this kernel computation to \(XY^{-1}\) proves (98).

Let \(n\in \mathbb {R}^3\) be a unit vector. Write \(n\cdot \sigma \) for its Pauli contraction, \(n\cdot B\) for the boost generator with time–space blocks \(n\) and \(n^{\mathsf T}\), and \(n\cdot R\) for Wolf’s rotation generator \(R_i=\sum _{j,k}\varepsilon _{ijk}\lvert k\rangle \langle j\rvert \). For every \(t\in \mathbb {R}\),

\begin{align} \begin{aligned} \exp (t\, n\cdot \sigma ) & =\cosh (t)I+\sinh (t)n\cdot \sigma ,\\ \exp (t\, n\cdot B) & =I+(\cosh (t)-1)(n\cdot B)^2+\sinh (t)n\cdot B,\\ \exp (-it\, n\cdot \sigma ) & =\cos (t)I-i\sin (t)n\cdot \sigma ,\\ \exp (t\, n\cdot R) & =I+(1-\cos (t))(n\cdot R)^2+\sin (t)n\cdot R. \end{aligned} \label{eq:representations_spinor_exponential_closed_forms} \end{align}

If \(u(n,t)=(\cosh (t),\sinh (t)n)\), then \(B_{u(n,t)}=\exp (t\, n\cdot B)\), and the spinor map satisfies

\begin{align} \begin{aligned} \Lambda \! \left(\exp \! \left(\frac{t}{2}n\cdot \sigma \right)\right) & =\exp (t\, n\cdot B),\\ \Lambda \! \left(\exp \! \left(-\frac{it}{2}n\cdot \sigma \right)\right) & =\exp (t\, n\cdot R). \end{aligned} \label{eq:representations_spinor_exponential_map} \end{align}

The positive sign in the second Lorentz exponential is the correction to the sign printed in [ Wol12 , Eq. (2.44) ] ; with the displayed Pauli matrices and column-vector convention, the printed negative sign rotates in the opposite direction.

Proof

The Pauli contraction satisfies \((n\cdot \sigma )^2=I\), the boost generator satisfies \((n\cdot B)^3=n\cdot B\), and the rotation generator satisfies \((n\cdot R)^3=-n\cdot R\). Splitting each exponential series into its even and odd terms gives the four closed forms in (99). Direct substitution of \(u(n,t)\) into the canonical boost gives \(B_{u(n,t)}=\exp (t\, n\cdot B)\). The two half-parameter matrices have determinant one, and evaluating their Pauli congruence entries with the double-angle identities gives (100).

Let \(T:M_2(\mathbb {C})\to M_2(\mathbb {C})\) be complex linear and let \(X_1,X_2\in \operatorname{SL}(2,\mathbb {C})\). If \(L_i=L(X_i)\) and \(L_{i,\mathbb {C}}\) denotes its complex scalar extension, then

\begin{align} \widehat{\Phi _{X_2}\circ T\circ \Phi _{X_1}} & =L_{2,\mathbb {C}}\, \widehat T\, L_{1,\mathbb {C}}. \label{eq:representations_pauli_transfer_spinor_action} \end{align}

If \(T\) preserves Hermiticity, then \(\widehat T\) has real entries, and Equation 101 is the real identity

\begin{align} \widehat{\Phi _{X_2}\circ T\circ \Phi _{X_1}} & =L_2\, \widehat T\, L_1, \label{eq:representations_pauli_transfer_spinor_action_real} \end{align}

in the exact order of [ Wol12 , Eq. (2.43) ] .

Proof

Expand each matrix in the four-Pauli basis using the trace pairing in Equation 61. Postfiltering by \(\Phi _{X_2}\) multiplies each transfer-matrix column on the left by \(L_{2,\mathbb {C}}\), while prefiltering by \(\Phi _{X_1}\) multiplies each row on the right by \(L_{1,\mathbb {C}}\). Combining these two finite sums gives Equation 101. For a Hermiticity-preserving map, the trace of the product of the two Hermitian matrices \(\sigma _i\) and \(T(\sigma _j)\) is real, giving the stated real specialization.

3.16 Determinant of a quantum channel

Definition 3.16.1 Channel determinant
#

For a linear map \(T : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\), the channel determinant \(\det T\) is the determinant of the matrix of \(T\) with respect to the standard matrix-unit basis of \(M_{D}(\mathbb {C})\). This is the quantity studied in [ Wol12 , Section 6.1 ] .

Remark 3.16.2 Channel determinant as an operator determinant
#

The channel determinant agrees with the ordinary determinant of the linear endomorphism \(T : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\).

Definition 3.16.3 Unitary channel
#

For a unitary matrix \(U \in \mathcal{U}(D)\), the unitary channel is \(T(\rho )=U\rho U^\dagger \). It is automatically a quantum channel.

Theorem 3.16.4 Unitary channels have determinant one

If \(T(\rho )=U\rho U^\dagger \) is a unitary channel, then \(\det T=1\) and hence \(|\det T|=1\).

Proof

Vectorization identifies \(T\) with a Kronecker product \(\overline{U}\otimes U\), whose determinant is \(\overline{\det U}^{\, D}(\det U)^D=1\).

Theorem 3.16.5 Eigenvalue disk bound for positive trace-preserving maps

Let \(D{\gt}0\), and let \(T:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) be positive and trace-preserving. If \(T(X)=\mu X\) for some nonzero \(X\), then \(|\mu |\leq 1\). This is the unit-disk conclusion of [ Wol12 , Proposition 6.1 ] .

Proof

If \(\operatorname{tr}(X)\neq 0\), trace preservation gives \(\mu =1\). Otherwise decompose \(X\) into trace-zero Hermitian and skew-Hermitian parts. Each Hermitian part is a scalar multiple of the difference of two density matrices. Positivity and trace preservation keep all iterates of those density matrices in the compact set of density matrices, so the orbit of \(X\) is bounded. Since \(T^n(X)=\mu ^nX\), this is impossible when \(|\mu |{\gt}1\).

For any positive trace-preserving map \(T : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\), \(\det T\) is real and belongs to \([-1,1]\); in particular, \(|\det T|\leq 1\). This is [ Wol12 , Theorem 6.1(1) ] .

Proof

Positivity implies Hermiticity preservation. In the matrix-unit basis, conjugating the channel matrix entrywise is the same as conjugating the map by the pair-swap involution induced by \(X\mapsto X^{\mathsf T}\). Determinant multiplicativity and involutivity therefore give \(\overline{\det T}=\det T\), which is the source’s conjugate-pair reality argument in coordinates.

Every eigenvalue \(\mu \) of \(T\) satisfies \(|\mu |\leq 1\) (positivity and trace preservation force spectral radius \(\leq 1\)). Since \(\det T\) is the product of the eigenvalues (counted with algebraic multiplicity), the bound \(|\det T|=\prod _i|\mu _i|\leq 1\) follows by induction.

Proof

Saturation forces every eigenvalue to have modulus one, so the peripheral subspace is all of \(M_{D}(\mathbb {C})\) and the peripheral projection \(T_\phi \) is the identity. Along Wolf’s Dirichlet recurrent subsequence, \(T^{n_i}\to T_\phi =\operatorname{id}\). Since \(T\) is bijective, the preimage \(X\) of a positive matrix \(A\) is the limit of the positive matrices \(T^{n_i-1}(A)\); closedness of the positive-semidefinite cone makes \(T^{-1}\) positive.

Thus \(T\) maps the positive-semidefinite cone onto itself. The already formalized cone/rank/Wigner route of Wolf Proposition 3.6 gives \(T(A)=YAY^\dagger \) or \(T(A)=YA^{\mathsf T}Y^\dagger \) with \(Y\) invertible. Trace preservation and nondegeneracy of the trace pairing imply \(Y^\dagger Y=\mathbb {1}\), so \(Y\) is unitary. Conversely, unitary conjugation has determinant one, while transposition is an involution and hence has determinant of modulus one.

Ordinary transposition on \(M_{D}(\mathbb {C})\) satisfies

\begin{align} \det (A\mapsto A^{\mathsf T}) =(-1)^{D(D-1)/2}. \end{align}

Consequently it has determinant \(-1\) exactly when \(\lfloor D/2\rfloor \) is odd. For a positive trace-preserving \(T\) in positive dimension, \(\det T=-1\) exactly when that parity condition holds and \(T(A)=UA^{\mathsf T}U^\dagger \) for a unitary \(U\). In those odd-parity dimensions, \(\det T=1\) exactly for unitary conjugations. This is [ Wol12 , Theorem 6.1(3) ] .

Proof

In the matrix-unit basis, transposition is the permutation that exchanges \(E_{ij}\) and \(E_{ji}\). It fixes the \(D\) diagonal units and partitions the remaining \(D^2-D\) units into \(D(D-1)/2\) transpositions, giving the displayed sign. Splitting \(D\) into its even and odd cases proves that \(D(D-1)/2\) and \(\lfloor D/2\rfloor \) have the same parity. The source-facing classifications then follow from determinant saturation and the fact that every unitary conjugation has determinant one.

Theorem 3.16.9 Determinant under composition
#

For linear maps \(T_1,T_2:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\),

\begin{align} \det (T_1T_2)=\det (T_1)\det (T_2), \end{align}

where \(T_1T_2=T_1\circ T_2\), so \(T_2\) acts first. This is [ Wol12 , Equation (6.22) ] .

Proof

Rewrite the channel determinant as the determinant of the underlying linear endomorphism and apply multiplicativity of the latter.

Let \(T_1,T_2:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) be positive and trace-preserving. Then

\begin{align} |\det (T_1T_2)|\leq |\det T_1|. \end{align}

For arbitrary linear maps, the equality \(|\det (T_1T_2)|=|\det T_1|\) holds exactly when

\begin{align} \det T_1=0 \quad \text{or}\quad |\det T_2|=1. \end{align}

This is the multiplicative and determinant-bound part of the monotonicity corollary following [ Wol12 , Theorem 6.1 ] .

Proof

Theorem 3.16.9 gives \(|\det (T_1T_2)|=|\det T_1|\, |\det T_2|\). The determinant bound for \(T_2\) proves the inequality. Cancelling the nonzero factor \(|\det T_1|\) proves the equality split; when that factor is zero, equality is automatic.

The source’s further replacement of \(|\det T_2|=1\) by “unitary conjugation or matrix transposition” is exactly Theorem 3.16.7; the present declaration isolates the algebraic equality split so the saturation classification remains reusable.

Let \(T:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) be a bijective complex-linear map. Write \(T^{-1}\) for the inverse linear map supplied by the associated linear equivalence; it is both a left and a right inverse of \(T\).

The inverse of a bijective trace-preserving linear map is trace preserving. If \(T\) is positive, then \(T^{-1}\) is positive exactly when \(T\) maps the positive-semidefinite cone onto itself. If both maps are positive and trace preserving, then \(|\det T|=1\).

Proof

For \(X=T^{-1}(Y)\), trace preservation of \(T\) gives \(\operatorname{tr}(T^{-1}(Y))=\operatorname{tr}(Y)\). Positivity of the inverse is equivalent to positivity of the unique preimage of every positive-semidefinite matrix. Finally, \(\det (T)\det (T^{-1})=1\), while the determinant bound places both moduli at most one, so both moduli equal one.

For a unitary \(U\), the inverse of \(A\mapsto UAU^\dagger \) is conjugation by \(U^{-1}\). The inverse of \(A\mapsto UA^{\mathsf T}U^\dagger \) is ordinary transposition after conjugation by \(U^{-1}\). Both inverse maps are positive; the reversed composition order in the transpose branch is essential.

Proof

Compose the displayed maps directly, using involutivity of ordinary transposition. Unitary conjugation, transposition, and their compositions preserve the positive-semidefinite cone.

Let \(D{\gt}0\), and let \(T:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) be positive, trace preserving, and bijective. Then \(T^{-1}\) is positive if and only if there is a unitary \(U\) for which

\begin{align} T(A)=UAU^\dagger \qquad \text{or}\qquad T(A)=UA^{\mathsf T}U^\dagger . \end{align}

This is the corollary “Positive invertible maps” following [ Wol12 , Theorem 6.1 ] .

Proof

If \(T^{-1}\) is positive, it is automatically trace preserving and the determinant bounds for \(T\) and \(T^{-1}\) force \(|\det T|=1\). Apply the source-general determinant-saturation classification. Conversely, use the explicit positive inverse of each standard form above. This is exactly Wolf’s determinant route and retains the transpose branch.

Theorem 3.16.15 Determinant one iff the channel is unitary

For a CPTP map \(T : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\),

\begin{align} |\det T|=1 & \iff \exists \, U \in \mathcal{U}(D),\quad T(\rho )=U\rho U^\dagger . \label{eq:representations_det_unitary_iff} \end{align}

This is the CPTP specialization of [ Wol12 , Theorem 6.1(2) ] ; complete positivity excludes the genuinely transpose-type branch.

Proof

Reverse direction is Theorem 3.16.4. Forward direction: \(|\det T|=1\) together with \(|\mu |\leq 1\) for every eigenvalue \(\mu \) (from trace preservation and positivity) forces every eigenvalue to satisfy \(|\mu |=1\). Determinant saturation transfers to the unital Heisenberg dual \(T^*(Y)=\sum _iK_i^\dagger YK_i\). The determinant–Hilbert–Schmidt bound and a trace-summing argument then force equality in the Kadison–Schwarz inequality on the standard matrix basis. The resulting Kraus commutation relations make \(T^*\) multiplicative on all matrices, hence a \(*\)-automorphism of \(M_{D}(\mathbb {C})\). By the Skolem–Noether theorem it is inner, and therefore \(T(\rho )=U\rho U^\dagger \) for some unitary \(U\). Kraus freedom then gives \(K_i=c_iU\) with \(\sum _i|c_i|^2=1\).

Let \(T:M_{d}(\mathbb {C})\to M_{d}(\mathbb {C})\) be a completely positive linear map with Kraus rank at most two. Then

\begin{align} \det T & \geq 0. \end{align}

No trace-preservation hypothesis is assumed. This is the proposition “Positive determinant for small Kraus rank” in [ Wol12 , Chapter 6, Equation (6.26) ] .

Proof

By minimality of Kraus rank and zero-padding, write \(T(X)=AXA^\dagger +BXB^\dagger \), including Kraus ranks zero and one. Wolf writes

\begin{align} \widehat T & =A\otimes \overline A+B\otimes \overline B. \end{align}

With the column-stacking convention of Definition 3.18.3, the two Kronecker factors are swapped, so \(\widehat T=\overline A\otimes A+\overline B\otimes B\).

First suppose \(\det A\neq 0\) and put \(C=A^{-1}B\). Equation (6.26), in this convention, is the exact factorization

\begin{align} \widehat T & =(\overline A\otimes A) (\mathbb {1}+\overline C\otimes C). \end{align}

The determinant of the first factor is \(\overline{(\det A)^d}(\det A)^d\geq 0\). For the second factor, take a unitary Schur decomposition \(C=URU^\dagger \) with diagonal entries \(\lambda _i=R_{ii}\). Unitary similarity reduces its determinant to

\begin{align} \prod _{i,j} \bigl(1+\overline{\lambda _i}\lambda _j\bigr). \end{align}

Each off-diagonal factor is paired with its complex conjugate, while the diagonal factors are \(1+|\lambda _i|^2\), so this product is nonnegative.

To remove the assumption on \(A\) without an unproved density assertion, set \(\varepsilon _n=1/(n+1)\) and \(A_n=A+\varepsilon _n\mathbb {1}\). If \(A=URU^\dagger \) is a unitary Schur decomposition, then \(A_n=U(R+\varepsilon _n\mathbb {1})U^\dagger \). Every zero diagonal entry of \(R\) becomes the nonzero number \(\varepsilon _n\), while every nonzero diagonal entry remains nonzero for all sufficiently large \(n\). Hence \(\det A_n\neq 0\) eventually. The nonsingular case applies to \((A_n,B)\); since \(A_n\to A\) and the determinant of \(\overline{A_n}\otimes A_n+\overline B\otimes B\) is continuous, passing to the limit proves the claim.

3.17 Determinant and Choi–Jamiołkowski operator

Definition 3.17.1 Purity of the Choi–Jamiołkowski operator

For a linear map \(T : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\) with Choi–Jamiołkowski operator \(\tau \), the purity of \(\tau \) is \(\operatorname{tr}[\tau ^\dagger \tau ]\), the sum

\begin{align} \operatorname{tr}[\tau ^\dagger \tau ] & = \sum _{i_1,j_1,i_2,j_2} \bigl|\tau _{(i_1,j_1),(i_2,j_2)}\bigr|^2 \label{eq:representations_purity_entries} \end{align}

of the squared moduli of the entries of \(\tau \); in particular it is non-negative.

Let \(T : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\) be a linear map, \(\widehat{T}\) its matrix with respect to the matrix-unit basis and \(\tau \) its Choi–Jamiołkowski operator. Then

\begin{align} \widehat{T}_{(i_1,i_2),(j_1,j_2)} & = D\, \tau _{(i_1,j_1),(i_2,j_2)}. \label{eq:representations_reshuffling} \end{align}

Equivalently \(\widehat{T}=D\, \tau ^{\Gamma }\), where the involution \(\tau \mapsto \tau ^{\Gamma }\) is defined by \(\langle m,n|\tau ^{\Gamma }|k,\ell \rangle =\langle m,k|\tau |n,\ell \rangle \). This is [ Wol12 , Eq. (2.22) ] .

Proof

Both sides are computed on the matrix units \(E_{ij}\):

\begin{align} \widehat{T}_{(i_1,i_2),(j_1,j_2)} & = \bigl(T(E_{j_1j_2})\bigr)_{i_1i_2}, \label{eq:representations_channel_matrix_entries}\\ \tau _{(i_1,i_2),(j_1,j_2)} & = \frac1D\bigl(T(E_{i_2j_2})\bigr)_{i_1j_1}. \label{eq:representations_choi_entries} \end{align}

Substituting \((i_1,j_1)\) for the row pair and \((i_2,j_2)\) for the column pair in (117) gives \(\frac1D\bigl(T(E_{j_1j_2})\bigr)_{i_1i_2}\), which by (116) is \(\frac1D\widehat{T}_{(i_1,i_2),(j_1,j_2)}\).

Lemma 3.17.3 Purity and the matrix representation

With the notation of Lemma 3.17.2,

\begin{align} \operatorname{tr}[\widehat{T}^\dagger \widehat{T}] & = D^2\, \operatorname{tr}[\tau ^\dagger \tau ]. \label{eq:representations_purity_factor} \end{align}

For \(D\geq 1\) this is [ Wol12 , Eq. (6.28) ] , which states it in the divided form \(\operatorname{tr}[\tau ^\dagger \tau ]=D^{-2}\operatorname{tr}[\widehat{T}^\dagger \widehat{T}]\).

Proof

The trace \(\operatorname{tr}[A^\dagger A]\) is the sum of the squared moduli of the entries of \(A\), so (115) gives

\begin{align} \operatorname{tr}[\widehat{T}^\dagger \widehat{T}] & = \sum _{i_1,i_2,j_1,j_2} \bigl|\widehat{T}_{(i_1,i_2),(j_1,j_2)}\bigr|^2 = D^2\sum _{i_1,i_2,j_1,j_2} \bigl|\tau _{(i_1,j_1),(i_2,j_2)}\bigr|^2. \label{eq:representations_purity_entry_sum} \end{align}

Reshuffling permutes the index quadruples \((i_1,i_2,j_1,j_2)\) without repetition, so the remaining sum is \(\operatorname{tr}[\tau ^\dagger \tau ]\) by (114).

Lemma 3.17.4 Determinant bound by the Hilbert–Schmidt norm

For a square complex matrix \(A\) whose index set has \(n\) elements,

\begin{align} n^{n}\, |\det A|^2 & \leq \operatorname{tr}[A^\dagger A]^{n}. \label{eq:representations_det_sq_hs_bound} \end{align}
Proof

The matrix \(A^\dagger A\) is positive semidefinite and \(\det (A^\dagger A)=|\det A|^2\), so (77) applied to \(M=A^\dagger A\) is the asserted bound. In the singular values \(s_1,\dots ,s_n\) of \(A\) it reads \(n^n\prod _i s_i^2\leq \bigl(\sum _i s_i^2\bigr)^n\).

Theorem 3.17.5 Determinant and Choi–Jamiołkowski operator

Let \(T:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) be a linear map and \(\tau \) the corresponding Choi–Jamiołkowski operator. Then

\begin{align} |\det T| & \le \operatorname{tr}[\tau ^\dagger \tau ]^{D^2/2}. \label{eq:representations_det_choi_bound} \end{align}

No positivity, trace preservation or unitality is assumed. This is [ Wol12 , Eq. (6.27) ] .

Proof

The matrix \(\widehat{T}\) is indexed by the \(D^2\) matrix units and \(\det T=\det \widehat{T}\), so (120) with \(n=D^2\), followed by (118), gives

\begin{align} (D^2)^{D^2}\, |\det T|^2 & \le \operatorname{tr}[\widehat{T}^\dagger \widehat{T}]^{D^2} = (D^2)^{D^2}\, \operatorname{tr}[\tau ^\dagger \tau ]^{D^2}. \notag \end{align}

Cancelling the positive factor \((D^2)^{D^2}\) gives \(|\det T|^2\le \operatorname{tr}[\tau ^\dagger \tau ]^{D^2}\), and taking square roots gives the stated bound.

3.18 Self-dual channels

The transfer matrix \(\widehat T_{\alpha \beta }=\operatorname{tr}(F_\alpha ^\dagger T(G_\beta ))\) of [ Wol12 , Section 2.3, Equation (2.20) ] is built from two orthonormal families. Taking one and the same family on both sides turns the Hermiticity of \(\widehat T\) into a statement about \(T\) alone, and that statement is self-duality. Orthonormality is always meant for the Hilbert–Schmidt pairing of [ Wol12 , Section 2.3, Equation (2.18) ] , that is, \(\operatorname{tr}(G_\beta ^\dagger G_{\beta '})=\delta _{\beta \beta '}\); the families are not assumed Hermitian.

Definition 3.18.1 Hilbert–Schmidt orthonormal family
#

A family \((\sigma _\alpha )\) in \(M_{d}(\mathbb {C})\) is Hilbert–Schmidt orthonormal when

\begin{align} \operatorname{tr}\bigl(\sigma _\alpha ^\dagger \sigma _\beta \bigr) & = \delta _{\alpha \beta }. \end{align}

This is the pairing \(\operatorname{tr}(PA^\dagger B)\) of [ Wol12 , Equation (2.18) ] in the case \(P=\mathbb {1}\).

Definition 3.18.2 Transfer matrix in one family
#

For a linear map \(T:M_{d}(\mathbb {C})\to M_{d}(\mathbb {C})\) and a family \((\sigma _\alpha )\) in \(M_{d}(\mathbb {C})\) used on both sides, the transfer matrix of \(T\) in \((\sigma _\alpha )\) is

\begin{align} \widehat T_{\alpha \beta } & = \operatorname{tr}\bigl(\sigma _\alpha ^\dagger T(\sigma _\beta )\bigr), \end{align}

which is [ Wol12 , Equation (2.20) ] with \(F_\alpha =G_\alpha \).

Definition 3.18.3 Transfer matrix of a matrix endomorphism
#

Let \(E_{k\ell }\) denote the matrix unit with its only nonzero entry in row \(k\) and column \(\ell \). The transfer matrix \(\widehat T\) is the matrix indexed by pairs of bond indices with entries

\begin{align} \widehat T_{(j,i),(\ell ,k)} & :=(T(E_{k\ell }))_{ij}. \end{align}

Equivalently, this is the matrix of \(T\) under the column-stacking identification \(M_D(\mathbb C)\cong \mathbb C^{D^2}\): the matrix-units special case of Definition 3.18.2.

Theorem 3.18.4 Transfer matrix of a Kraus representation
#

If \(T(X)=\sum _j K_jXK_j^\dagger \), then the column-stacking convention gives

\begin{align} \widehat T & =\sum _j \overline{K_j}\otimes K_j. \end{align}

Wolf’s Equation (2.21) prints the two Kronecker factors in the opposite order; the difference is the simultaneous product-index permutation induced by the vectorization convention.

Proof

Evaluate both sides on a matrix unit and compare the corresponding column-stacked coordinates.

Theorem 3.18.5 Channel determinant as a transfer-matrix determinant

For every linear endomorphism \(T\) of \(M_{D}(\mathbb {C})\),

\begin{align} \det T & =\det \widehat T. \end{align}

This is the basis-independence of the determinant after transporting \(T\) through column stacking.

Proof

Changing from the matrix-unit basis to column-stacked coordinates conjugates the linear endomorphism by a linear equivalence, so its determinant is unchanged.

Let \((\sigma _\alpha )\) be a Hilbert–Schmidt orthonormal basis of \(M_{d}(\mathbb {C})\). The coordinates of \(X\in M_{d}(\mathbb {C})\) in this basis are \(\operatorname{tr}(\sigma _\alpha ^\dagger X)\); consequently \(X=0\) as soon as \(\operatorname{tr}(\sigma _\alpha ^\dagger X)=0\) for every \(\alpha \). If in addition every \(\sigma _\alpha \) is Hermitian, the coordinates are \(\operatorname{tr}(\sigma _\alpha X)\), so the basis is self-dual for the bilinear trace pairing.

Proof

Expanding \(X=\sum _\beta c_\beta \sigma _\beta \) and pairing with \(\sigma _\alpha \) gives, by orthonormality,

\begin{align} \operatorname{tr}\bigl(\sigma _\alpha ^\dagger X\bigr) & = \sum _\beta c_\beta \, \operatorname{tr}\bigl(\sigma _\alpha ^\dagger \sigma _\beta \bigr) = c_\alpha . \end{align}

Vanishing of all coordinates forces \(X=0\). For Hermitian \(\sigma _\alpha \) the two pairings \(\operatorname{tr}(\sigma _\alpha ^\dagger X)\) and \(\operatorname{tr}(\sigma _\alpha X)\) agree.

Let \(T:M_{d}(\mathbb {C})\to M_{d}(\mathbb {C})\) satisfy \(T(X^\dagger )=T(X)^\dagger \). Then in any family \((\sigma _\alpha )\) used on both sides,

\begin{align} \bigl(\widehat T\bigr)^\dagger & = \widehat{T^*}, \end{align}

and the same identity holds for the transfer matrix taken in the matrix units. This is the Hermitian-map case of the sentence following [ Wol12 , Equation (2.20) ] .

Proof

Conjugating the trace and then using Hermiticity preservation and the defining identity \(\operatorname{tr}(AT^*(B))=\operatorname{tr}(T(A)B)\) of the dual map computes the \((\alpha ,\beta )\) entry of \((\widehat T)^\dagger \):

\begin{align} \overline{\operatorname{tr}\bigl(\sigma _\beta ^\dagger T(\sigma _\alpha )\bigr)} & = \operatorname{tr}\bigl(T(\sigma _\alpha )^\dagger \sigma _\beta \bigr) = \operatorname{tr}\bigl(T(\sigma _\alpha ^\dagger )\sigma _\beta \bigr) = \operatorname{tr}\bigl(\sigma _\alpha ^\dagger T^*(\sigma _\beta )\bigr). \end{align}

In the matrix units the same two steps appear entrywise. For the entrywise form of the dual map and \(E_{ij}^\dagger =E_{ji}\),

\begin{align} \overline{\bigl(T(E_{ij})\bigr)_{k\ell }} & = \bigl(T(E_{ji})\bigr)_{\ell k} = \bigl(T^*(E_{k\ell })\bigr)_{ij}, \end{align}

and these are the \(\bigl((j,i),(\ell ,k)\bigr)\) entries of \((\widehat T)^\dagger \) and of \(\widehat{T^*}\).

Lemma 3.18.8 Dual map of a Kraus family

If \(T(X)=\sum _j K_j X K_j^\dagger \) then \(T^*(X)=\sum _j K_j^\dagger X K_j\): the Kraus operators of \(T\) and of \(T^*\) differ by Hermitian conjugation, as in [ Wol12 , Section 2.2, after Proposition 2.4 ] . Such a \(T\) satisfies \(T(X^\dagger )=T(X)^\dagger \), and so does every completely positive map.

Proof

The candidate \(X\mapsto \sum _jK_j^\dagger XK_j\) satisfies the defining property of \(T^*\): for every \(N\), cyclicity of the trace gives

\begin{align} \operatorname{tr}\bigl(T^*(X)\, N\bigr) & = \sum _j\operatorname{tr}\bigl(K_j^\dagger XK_j\, N\bigr) = \sum _j\operatorname{tr}\bigl(X\, K_jNK_j^\dagger \bigr) = \operatorname{tr}\bigl(X\, T(N)\bigr), \end{align}

and nondegeneracy of the trace pairing identifies the two maps. Hermiticity preservation is the conjugate transpose of the Kraus sum, and it descends to completely positive maps by taking any Kraus representation.

Lemma 3.18.9 Hermitian recombination of a symmetrized Kraus family
#

Suppose \(T(X)=\sum _j K_j X K_j^\dagger \) and also \(T(X)=\sum _j K_j^\dagger X K_j\). Then \(T\) has a family of Hermitian Kraus operators, namely \(\tfrac 12(K_j+K_j^\dagger )\) and \(\tfrac {i}{2}(K_j-K_j^\dagger )\).

Proof

Averaging the two representations gives

\begin{align} T(X) & = \frac12\sum _j\bigl(K_jXK_j^\dagger +K_j^\dagger XK_j\bigr), \end{align}

that is, the Kraus family \((K_j,K_j^\dagger )/\sqrt2\). Mixing each such pair by the unitary \((a,b)\mapsto \bigl((a+b)/\sqrt2,\; i(a-b)/\sqrt2\bigr)\) leaves the map unchanged and produces the pair \(\tfrac 12(K_j+K_j^\dagger )\), \(\tfrac {i}{2}(K_j-K_j^\dagger )\), both of which are Hermitian.

Lemma 3.18.10 Self-duality against Hermiticity of the transfer matrix

Let \(T:M_{d}(\mathbb {C})\to M_{d}(\mathbb {C})\) satisfy \(T(X^\dagger )=T(X)^\dagger \) and let \((\sigma _\alpha )\) be a Hilbert–Schmidt orthonormal basis of \(M_{d}(\mathbb {C})\) used on both sides. Then

\begin{align} \widehat T=\widehat T^\dagger & \iff T=T^*. \end{align}
Proof

By Lemma 3.18.7, \(\widehat T^\dagger =\widehat{T^*}\). So \(\widehat T=\widehat T^\dagger \) reads \(\widehat{T^*}=\widehat T\), that is, for every \(\alpha \) and \(\beta \),

\begin{align} \operatorname{tr}\bigl(\sigma _\alpha ^\dagger (T^*-T)(\sigma _\beta )\bigr)=0 & \Rightarrow (T^*-T)(\sigma _\beta )=0 \Rightarrow T^*=T, \end{align}

where the first implication applies Lemma 3.18.6 to \((T^*-T)(\sigma _\beta )\) and the second holds because a linear map vanishing on a basis is zero. The converse substitutes \(T^*=T\) into Lemma 3.18.7.

The vectorization identity below is a generic transfer-matrix fact, with no tensor-network content; it is relocated here from the matrix-product-unitary chapter, whose transfer-matrix functoriality results cite it across the chapter boundary.

Theorem 3.18.11 Transfer matrices intertwine column stacking
#

For every \(\rho \in M_D(\mathbb C)\),

\begin{align} \widehat T\, \operatorname {vec}(\rho ) & =\operatorname {vec}(T(\rho )). \end{align}
Proof

Expand \(\rho \) in the matrix-unit basis and compare every vectorized coordinate.

For a linear map \(S:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\), let \(\lVert S\rVert _{2\to 2}\) be its operator norm for the Hilbert–Schmidt norm. Then

\begin{align} \lVert S(X)\rVert _2 & \leq \lVert S\rVert _{2\to 2}\lVert X\rVert _2,\\ \lVert S\rVert _{2\to 2} & =\lVert \widehat S\rVert _\infty , \end{align}

where the norm on the transfer matrix is its largest-singular-value norm. The transfer representation also preserves subtraction and powers.

Proof

Column vectorization is a Hilbert–Schmidt isometry, and Theorem 3.18.11 identifies the action of \(S\) with multiplication by \(\widehat S\). Thus the two induced operator norms agree. Linearity and compatibility with composition give the subtraction and power identities.

Let \(T:M_{d}(\mathbb {C})\to M_{d}(\mathbb {C})\) be completely positive and let \(\widehat T\) be its transfer matrix in the matrix units. Then

\begin{align} \widehat T=\widehat T^\dagger & \iff T=T^*. \end{align}
Proof

Complete positivity gives \(T(X^\dagger )=T(X)^\dagger \) (Lemma 3.18.8), so \(\widehat T^\dagger =\widehat{T^*}\) for the matrix-unit transfer matrix as well (Lemma 3.18.7). By Theorem 3.18.11, \(\widehat S\operatorname {vec}(\rho )=\operatorname {vec}(S(\rho ))\) for every linear map \(S\) and every \(\rho \in M_{d}(\mathbb {C})\); applied with \(S=T^*\) and \(S=T\) this turns equality of the transfer matrices into equality of the maps,

\begin{align} \widehat{T^*}=\widehat T & \Rightarrow T^*=T. \end{align}

Let \(T:M_{d}(\mathbb {C})\to M_{d}(\mathbb {C})\) be completely positive and let \((\sigma _\alpha )\) be a Hilbert–Schmidt orthonormal basis of \(M_{d}(\mathbb {C})\). The following are equivalent.

  1. \(T=T^*\).

  2. \(\widehat T=\widehat T^\dagger \), the transfer matrix being taken in the family \((\sigma _\alpha )\) on both sides.

  3. \(T\) admits a family of Hermitian Kraus operators.

This is [ Wol12 , Proposition 2.6 ] .

Proof

Conditions 1 and 2 are equivalent by Lemma 3.18.10, complete positivity supplying the Hermiticity preservation it requires. For \(3\Rightarrow 1\), a family of Hermitian Kraus operators is fixed by the exchange \(K_j\mapsto K_j^\dagger \) that carries \(T\) to \(T^*\) (Lemma 3.18.8):

\begin{align} T^*(X) & = \sum _j K_j^\dagger XK_j = \sum _j K_jXK_j^\dagger = T(X). \end{align}

For \(1\Rightarrow 3\), condition 1 turns any Kraus representation \(T(X)=\sum _jK_jXK_j^\dagger \) into a second one,

\begin{align} T(X) & = T^*(X) = \sum _j K_j^\dagger XK_j, \end{align}

and the Hermitian recombination of the symmetrized family (Lemma 3.18.9) yields condition 3.

3.19 Transfer-matrix identities

Theorem 3.19.1 Functoriality of transfer matrices
#

For linear maps \(S,T:M_D(\mathbb C)\to M_D(\mathbb C)\),

\begin{align} \widehat{\operatorname {id}} & =\mathbb {1}, \\ \widehat{S\circ T} & =\widehat S\, \widehat T. \end{align}
Proof

Expand both sides on matrix units. The identity formula is immediate, while the composition formula follows by summing over the intermediate row and column indices.

Theorem 3.19.2 Trace preservation fixes the vectorized identity on the left

If \(T:M_D(\mathbb C)\to M_D(\mathbb C)\) preserves trace and \((\Phi \rvert =\operatorname {vec}(\mathbb {1})^{\mathsf T}\), then

\begin{align} (\Phi \rvert \widehat T & =(\Phi \rvert . \end{align}
Proof

On the column indexed by the matrix unit \(E_{k\ell }\),

\begin{align} \bigl((\Phi \rvert \widehat T\bigr)_{(\ell ,k)} & =\operatorname {vec}(\mathbb {1})\mathbin {\boldsymbol \cdot } \operatorname {vec}(T(E_{k\ell })) \\ & =\operatorname{tr}(T(E_{k\ell })) =\operatorname{tr}(E_{k\ell }) =\delta _{k\ell }. \end{align}

These are precisely the coordinates of \((\Phi \rvert \).

Theorem 3.19.3 Powers and traces of transfer matrices

For every nonnegative integer \(N\),

\begin{align} \widehat{T^N} & =(\widehat T)^N, \\ \operatorname{tr}(\widehat T) & =\operatorname {Tr}(T), \end{align}

where the second trace is the operator trace of the endomorphism of \(M_D(\mathbb C)\).

Proof

Functoriality proves the power identity by induction. For the trace identity, expand the operator trace in the matrix-unit basis. The two diagonal sums differ only by exchanging the row and column indices.

3.20 Finite Cauchy–Schwarz equality

Theorem 3.20.1 Equality in finite Cauchy–Schwarz
#

Let \(S\) be a finite set and let \((x_i)_{i\in S}\) be real numbers. Then

\[ \left(\sum _{i\in S}x_i\right)^2 =|S|\sum _{i\in S}x_i^2 \]

if and only if \(x_i=x_j\) for every \(i,j\in S\).

Proof

The variance identity gives

\[ \sum _{i,j\in S}(x_i-x_j)^2 =2\left( |S|\sum _{i\in S}x_i^2- \left(\sum _{i\in S}x_i\right)^2 \right). \]

Since every summand on the left is non-negative, equality in Cauchy–Schwarz holds precisely when every difference \(x_i-x_j\) vanishes. This argument also includes the empty and singleton cases.

This criterion is the equality condition invoked for the off-diagonal overlaps and for the eigenvalues in [ Wol12 , Chapter 2, Proposition “SIC POVMs”, equations (2.31)–(2.32) ] .

3.21 Trace-square and purity equality

Definition 3.21.1 Rank-one orthogonal projection
#

A matrix \(P\in M_{D}(\mathbb {C})\) is a rank-one orthogonal projection if \(P=P^\dagger \), \(P^2=P\), and \(\operatorname{rank}P=1\).

Theorem 3.21.2 Hermitian trace-square inequality

If \(Q\in M_{D}(\mathbb {C})\) is Hermitian, then

\begin{align} \operatorname{tr}(Q)^2\le D\operatorname{tr}(Q^2). \label{eq:sic_hermitian_trace_square} \end{align}
Proof

Let \(\lambda _0,\ldots ,\lambda _{D-1}\) be the eigenvalues of \(Q\). The spectral theorem and finite Cauchy–Schwarz give

\begin{align} \operatorname{tr}(Q)^2 =\left(\sum _i\lambda _i\right)^2 \le D\sum _i\lambda _i^2 =D\operatorname{tr}(Q^2). \end{align}
Theorem 3.21.3 Equality in the Hermitian trace-square inequality

A Hermitian matrix \(Q\in M_{D}(\mathbb {C})\) satisfies equality in (149) if and only if \(Q=r\mathbb {1}\) for some \(r\in \mathbb {R}\).

Proof

Equality holds precisely when all eigenvalues of \(Q\) coincide. If their common value is \(r\), unitary diagonalization gives \(Q=U(r\mathbb {1})U^\dagger =r\mathbb {1}\). The converse follows by direct substitution. When \(D=0\), every matrix is the zero matrix, so the same conclusion holds.

Theorem 3.21.4 Trace bound at unit purity

If \(P\in M_{D}(\mathbb {C})\) is positive semidefinite and \(\operatorname{tr}(P^2)=1\), then \(\operatorname{tr}(P)\ge 1\).

Proof

Write the non-negative eigenvalues of \(P\) as \(\lambda _i\). Then

\begin{align} 1=\sum _i\lambda _i^2 \le \left(\sum _i\lambda _i\right)^2 =\operatorname{tr}(P)^2. \end{align}

Since \(\operatorname{tr}(P)=\sum _i\lambda _i\ge 0\), the assertion follows.

Theorem 3.21.5 Equality at unit purity

Suppose that \(P\in M_{D}(\mathbb {C})\) is positive semidefinite and \(\operatorname{tr}(P^2)=1\). Then \(\operatorname{tr}(P)=1\) if and only if \(P\) is a rank-one orthogonal projection.

Proof

If \(\operatorname{tr}(P)=1\), the non-negative eigenvalues satisfy

\begin{align} \sum _i\lambda _i=\sum _i\lambda _i^2=1. \end{align}

Each \(\lambda _i\) lies in \([0,1]\), and \(\sum _i\lambda _i(1-\lambda _i)=0\). Hence every eigenvalue is either zero or one. Thus \(P^2=P\), and its rank equals its trace, namely one. Conversely, a rank-one orthogonal projection has one unit eigenvalue and all remaining eigenvalues zero, so its trace is one.

3.22 The SIC–POVM overlap bound

Theorem 3.22.1 SIC–POVM overlap bound
#

Suppose that \(2\le n\), \(1\le d\le n\), and that \(P_1,\ldots ,P_n\in M_{d}(\mathbb {C})\) are positive semidefinite matrices satisfying \(\operatorname{tr}(P_i^2)=1\). Then

\begin{align} \sum _{i\ne j}\operatorname{tr}(P_iP_j)^2 \ge \frac{n(n-d)^2}{(n-1)d^2}. \label{eq:sic_povm_overlap_bound} \end{align}
Proof

Put \(Q=\sum _iP_i\) and \(T=\sum _{i\ne j}\operatorname{tr}(P_iP_j)\). Positivity gives \(\operatorname{tr}(P_iP_j)\ge 0\) and \(\operatorname{tr}(P_i)\ge 1\). Hence

\begin{align} n^2 \le \operatorname{tr}(Q)^2 \le d\operatorname{tr}(Q^2) =d(n+T), \end{align}

so \(T\ge n(n-d)/d\). Finite Cauchy–Schwarz, applied to the \(n(n-1)\) off-diagonal overlaps, gives

\begin{align} T^2\le n(n-1)\sum _{i\ne j}\operatorname{tr}(P_iP_j)^2. \end{align}

Combining the two estimates proves (153).

Theorem 3.22.2 Equality in the SIC–POVM overlap bound

Under the hypotheses of Theorem 3.22.1, equality holds in (153) if and only if

\begin{align} & P_i\text{ is a rank-one orthogonal projection for every }i, \\ & \sum _iP_i=\frac nd\mathbb {1}, \\ & \operatorname{tr}(P_iP_j)=\frac{n-d}{(n-1)d}\qquad (i\ne j). \end{align}
Proof

Equality in the final estimate forces equality at every preceding step. Thus \(\operatorname{tr}(P_i)=1\) for every \(i\), so each \(P_i\) is a rank-one orthogonal projection. Equality in the trace-square inequality makes \(Q\) scalar; its trace is \(n\), whence \(Q=(n/d)\mathbb {1}\). Equality in finite Cauchy–Schwarz makes all off-diagonal overlaps equal, and their sum then fixes their common value as \((n-d)/((n-1)d)\). Conversely, these three conditions give equality by direct substitution.

Theorem 3.22.3 Linear independence of nondegenerate equality families

Suppose, in addition, that \(d\ge 2\). Any family attaining equality in (153) is linearly independent.

Local fix (one-dimensional equality families): The corresponding assertion printed in [ Wol12 , Chapter 2, Proposition “SIC POVMs”, lines 816–823 ] is false when \(d=1{\lt}n\): every \(P_i\) then equals \([1]\). This deviation is recorded in the QICLean paper-gap note [ con26g ] .

Proof

Suppose \(\sum _i c_iP_i=0\). Taking the trace gives \(\sum _i c_i=0\). Taking the trace after multiplication by \(P_j\) gives

\begin{align} 0 =c_j+\frac{n-d}{(n-1)d}\sum _{i\ne j}c_i =\left(1-\frac{n-d}{(n-1)d}\right)c_j. \end{align}

For \(n\ge 2\) this prefactor is nonzero precisely when \(d{\gt}1\). Hence every \(c_j\) vanishes.

Theorem 3.22.4 The singleton case

A singleton family whose sole matrix \(P\) satisfies \(\operatorname{tr}(P^2)=1\) is linearly independent.

Proof

The unit-purity identity implies \(P\ne 0\), and a singleton containing a nonzero vector is linearly independent.

3.23 Symmetric informationally complete measurements

Definition 3.23.1 Symmetric informationally complete family
#

Let \(d\ge 1\). A symmetric informationally complete family in dimension \(d\) consists of \(d^2\) rank-one orthogonal projections \(P_i\in M_{d}(\mathbb {C})\) satisfying

\begin{align} \sum _iP_i=d\mathbb {1}, \qquad \operatorname{tr}(P_iP_j)=\frac{1}{d+1}\quad (i\ne j). \end{align}
Theorem 3.23.2 POVM effects and Kraus operators
#

For a symmetric informationally complete family \((P_i)_i\), the operators

\begin{align} E_i=\frac1dP_i, \qquad K_i=\frac1{\sqrt d}P_i \end{align}

are, respectively, the effects of a POVM and a trace-preserving Kraus family.

Proof

Positivity of the \(E_i\) follows from positivity of the projections, and

\begin{align} \sum _iE_i=\frac1d\sum _iP_i=\mathbb {1}. \end{align}

Since the \(P_i\) are Hermitian and idempotent,

\begin{align} \sum _iK_i^\dagger K_i =\frac1d\sum _iP_i^2 =\mathbb {1}. \end{align}
Theorem 3.23.3 Operator-basis property

The \(d^2\) projectors in a symmetric informationally complete family form a basis of \(M_{d}(\mathbb {C})\).

Proof

Suppose that \(\sum _i c_iP_i=0\). Taking the trace gives \(\sum _i c_i=0\). Pairing with \(P_j\) and using the constant overlaps gives

\begin{align} 0=c_j+\frac1{d+1}\sum _{i\ne j}c_i =\frac d{d+1}c_j. \end{align}

Since \(d\ge 1\), every \(c_j\) vanishes. Thus the projectors are linearly independent. Since \(\dim M_{d}(\mathbb {C})=d^2\), they form a basis.

Theorem 3.23.4 Diagonal representation
#

Let \((P_i)_i\) be a symmetric informationally complete family. Every \(\rho \in M_{d}(\mathbb {C})\) satisfies

\begin{align} \rho =\frac1d\sum _i \left((d+1)\operatorname{tr}(P_i\rho )-\operatorname{tr}(\rho )\right)P_i. \label{eq:sic_povm_diagonal_representation} \end{align}
Proof

Define

\begin{align} F(X)=\sum _i\operatorname{tr}(P_iX)P_i. \end{align}

For every \(j\), the constant-overlap identity and \(\sum _iP_i=d\mathbb {1}\) give

\begin{align} F(P_j) & =P_j+\frac1{d+1}\sum _{i\ne j}P_i \\ & =\frac{d}{d+1}(P_j+\mathbb {1}). \end{align}

The operator-basis property therefore yields

\begin{align} F(X)=\frac{d}{d+1}\left(X+\operatorname{tr}(X)\mathbb {1}\right) \end{align}

for every \(X\in M_{d}(\mathbb {C})\). Expanding the right-hand side of 165 and substituting this identity gives \(\rho \).

Theorem 3.23.5 SIC Kraus channel

For every \(\rho \in M_{d}(\mathbb {C})\),

\begin{align} \frac1d\sum _{i=1}^{d^2}P_i\rho P_i =\frac{\mathbb {1}\operatorname{tr}(\rho )+\rho }{d+1}. \label{eq:sic_povm_kraus_channel} \end{align}

Equivalently, the left-hand side is the quantum channel with Kraus operators \(K_i=P_i/\sqrt d\).

Proof

Rank-one sandwiching gives

\begin{align} P_i\rho P_i=\operatorname{tr}(\rho P_i)P_i. \end{align}

Summing this identity and applying the frame-operator formula in the proof of Theorem 3.23.4 proves 170. The Kraus normalization in Theorem 3.23.2 proves that this map is a quantum channel.