Tensor Network Theory: A formalization blueprint

22 Positive but Not Completely Positive Maps

Following [ Wol12 , Chapter 3 ] , this chapter first treats trace normalization of positive maps and trace inequalities for the positive semidefinite cone. It then develops the hierarchy of \(k\)-positive maps and its connection with Schmidt rank, Choi compressions, and entanglement detection. Ky Fan’s maximum principle gives the extremal Schmidt-rank overlap, while the Choi criteria lead to the strict positivity thresholds of the reduction family. The chapter concludes with positive maps outside complete positivity, the partial transpose and PPT property, separable states, Schmidt number, and the full reduction criterion.

22.1 Trace normalization and the Lorentz cone

Let \(T:M_{D}(\mathbb {C})\to M_{D'}(\mathbb {C})\) be a positive map for which \(T^*(\mathbb {1})\) is positive definite. Then there exists an invertible \(X\in M_{D}(\mathbb {C})\) such that \(\rho \mapsto T(X\rho X^\dagger )\) is a trace-preserving positive map [ Wol12 , Chapter 3, Lemma “Making positive maps trace preserving” ] .

Proof

Take \(X=(T^*(\mathbb {1}))^{-1/2}\). It is invertible by Lemma I.1.5, and Theorem I.1.6 gives directly that \(\rho \mapsto T(X\rho X^\dagger )\) is positive and trace-preserving. The normalization behind that theorem is Lemma I.1.4, which gives \(X^\dagger T^*(\mathbb {1})X=\mathbb {1}\). Indeed, the trace-pairing identity and cyclicity then give, for every \(\rho \),

\begin{align} \operatorname{tr}\! (T(X\rho X^\dagger )) & =\operatorname{tr}\! (\rho X^\dagger T^*(\mathbb {1})X) =\operatorname{tr}(\rho ). \notag \end{align}
Theorem 22.1.2 Forward Lorentz-cone trace inequality

If \(A \in M_{D}(\mathbb {C})\) is positive semidefinite, then

\begin{align} \operatorname{Re}\operatorname{tr}(A^2) & \le \left(\operatorname{Re}\operatorname{tr}(A)\right)^2. \label{eq:channel_lorentz_forward} \end{align}
Proof

Diagonalize \(A\) with non-negative eigenvalues \(\lambda _i\). Then \(\operatorname{tr}(A^2)=\sum _i\lambda _i^2\) and \(\operatorname{tr}(A)=\sum _i\lambda _i\), so the desired inequality is \(\sum _i\lambda _i^2\le (\sum _i\lambda _i)^2\), which follows because all mixed products are non-negative.

Theorem 22.1.3 Trace-non-negative Lorentz-cone converse

Let \(A\in M_{D}(\mathbb {C})\) be Hermitian and suppose that \(\operatorname{Re}\operatorname{tr}(A)\ge 0\). If

\begin{align} (D-1)\operatorname{Re}\operatorname{tr}(A^2) & \le \left(\operatorname{Re}\operatorname{tr}(A)\right)^2, \label{eq:channel_lorentz_converse} \end{align}

then \(A\) is positive semidefinite.

This is the trace-non-negative form of the converse in [ Wol12 , Proposition 3.9 ] . The unrestricted squared implication printed there is false without a trace-sign condition: for \(A=-\mathbb {1}\), one has \(\operatorname{tr}(A)^2=D^2\ge D(D-1)=(D-1)\operatorname{tr}(A^2)\), although \(A\) is not positive semidefinite.

Proof

Diagonalize \(A\) with real eigenvalues \(\lambda _i\). Suppose that some eigenvalue \(\lambda _0\) is negative. Set \(T=\sum _i\lambda _i\) and \(R=\sum _{i\ne 0}\lambda _i\). Since \(T\ge 0\) and \(T=\lambda _0+R\), one has \(T{\lt}R\), and hence \(T^2{\lt}R^2\). Cauchy’s inequality gives

\begin{align} R^2 & \le (D-1)\sum _{i\ne 0}\lambda _i^2 \le (D-1)\sum _i\lambda _i^2, \notag \end{align}

contradicting (??). Thus all eigenvalues are non-negative.

22.2 \(k\)-positive maps, Schmidt rank, and Choi compression

This section develops the \(k\)-positive-map criteria of [ Wol12 , Chapter 3 ] . Schmidt-rank bounds convert positivity of ampliations into quadratic-form conditions on the Choi matrix, while Ky Fan’s maximum principle controls the extremal overlap with vectors of bounded Schmidt rank. The right-factor compression criteria give rectangular and rank-\(k\) projection forms of the same condition.

22.2.1 Two-positive maps and the generalized Schwarz inequality

Definition 22.2.1.1 \(k\)-positive map
#

A linear map \(E : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\) is \(k\)-positive if \(E \otimes \operatorname{id}_{k}\) is positive on \(M_{D}(\mathbb {C}) \otimes M_{k}(\mathbb {C})\).

Definition 22.2.1.2 Two-positive map
#

A linear map is two-positive if it is \(2\)-positive.

Theorem 22.2.1.3 Completely positive implies two-positive

Every completely positive map is two-positive.

Proof

Let \(E(X)=\sum _i K_iXK_i^\dagger \) be a Kraus representation. For every \(Y\geq 0\) in \(M_{D}(\mathbb {C})\otimes M_{2}(\mathbb {C})\),

\[ (E\otimes \operatorname{id}_2)(Y) =\sum _i (K_i\otimes \mathbb {1}_2)Y(K_i\otimes \mathbb {1}_2)^\dagger \geq 0, \]

because each summand is positive semidefinite. Thus \(E\otimes \operatorname{id}_2\) is positive, so \(E\) is two-positive.

Theorem 22.2.1.4 Two-positive implies positive

Every two-positive map is positive.

Proof

If \(X\geq 0\), then \(X\otimes E_{11}\geq 0\) in \(M_{D}(\mathbb {C})\otimes M_{2}(\mathbb {C})\). Two-positivity gives

\[ (E\otimes \operatorname{id}_2)(X\otimes E_{11})=E(X)\otimes E_{11}\geq 0. \]

Its \((1,1)\) corner is \(E(X)\), hence \(E(X)\geq 0\). Therefore \(E\) is positive.

Definition 22.2.1.5 Unital linear map
#

A linear map \(E\) is unital if \(E(\mathbb {1})=\mathbb {1}\).

Theorem 22.2.1.6 Kadison–Schwarz for unital two-positive maps

If \(E\) is unital and two-positive, then for all \(X\in M_{D}(\mathbb {C})\), \(E(X^\dagger X)\ge E(X)^\dagger E(X)\).

Proof

Form the \(2\times 2\) block matrix \((\begin{smallmatrix} \mathbb {1} & X \\ X^\dagger & X^\dagger X \end{smallmatrix})\ge 0\). Apply \(E\otimes \operatorname{id}_{2}\) (positive by \(2\)-positivity) and take the Schur complement of the top-left identity block: \(E(X^\dagger X)-E(X)^\dagger E(X)\ge 0\).

Definition 22.2.1.7 Blockwise ampliation
#

For a linear map \(E : M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\), its \(k\)-fold ampliation acts on block matrices by

\begin{align} E^{(k)}(X)_{(i,p),(j,q)} & =E((X_{(a,p),(b,q)})_{a,b})_{i,j}. \label{eq:schwarz_blockwise_ampliation} \end{align}
Theorem 22.2.1.8 \(k\)-positivity as positivity of the ampliation

A linear map is \(k\)-positive if and only if its blockwise ampliation is positive on \(M_{D}(\mathbb {C})\otimes M_{k}(\mathbb {C})\).

Proof

This is precisely the preceding definition of the ampliation.

Definition 22.2.1.9 Schmidt rank

A vector \(\psi \in \mathbb {C}^{D}\otimes \mathbb {C}^{k}\) is identified with its coefficient matrix \(C_\psi \in M_{D,k}(\mathbb {C})(\mathbb {C})\). Its Schmidt rank is \(\operatorname{SR}(\psi )=\operatorname{rank}(C_\psi )\). We write \(\operatorname{SR}(\psi )\le r\) for the corresponding bounded-rank condition.

The zero vector has Schmidt rank zero, every vector satisfies \(\operatorname{SR}(\psi )\le \min (D,k)\), and every product vector \(u\otimes v\) has Schmidt rank at most one.

Proof

The zero-vector claim is \(\operatorname{rank}(0)=0\). For the dimension bounds, \(\operatorname{SR}(\psi )=\operatorname{rank}(C_\psi )\le D\) and \(\operatorname{SR}(\psi )=\operatorname{rank}(C_\psi )\le k\) follow from the row-rank and column-rank bounds on a \(D\times k\) matrix, hence \(\operatorname{SR}(\psi )\le \min (D,k)\). For a product vector, each column of \(C_{u\otimes v}\) is a scalar multiple of \(u\), so the column span has dimension at most one.

Definition 22.2.1.11 Schmidt singular values
#

The Schmidt singular values of a vector \(\psi \in \mathbb {C}^{D}\otimes \mathbb {C}^k\) are the singular values of the coefficient matrix \(C_\psi \), viewed as a linear map \(\mathbb {C}^k\to \mathbb {C}^D\).

The Schmidt singular values are indexed from zero. The nonzero Schmidt singular values of \(\psi \) are exactly those with index below \(\operatorname{SR}(\psi )\). Equivalently, for zero-based indexing, \(s_k(\psi )=0\) if and only if \(\operatorname{SR}(\psi )\le k\).

Proof

For a finite-dimensional linear map, the support of the singular-value sequence is the initial interval whose length is the dimension of the range. The coefficient matrix \(C_\psi \) represents the corresponding map \(\mathbb {C}^k\to \mathbb {C}^D\), and this range dimension is \(\operatorname{rank}(C_\psi )\).

22.2.2 Schmidt rank and maximal overlap

The monotonicity, rank-factorization, reduced-density, Rayleigh, and Parseval steps used below are proved in Section I.2. The two extremal projection bounds behind Ky Fan’s maximum principle are proved in Section I.3.

Definition 22.2.2.1 Sum of the largest eigenvalues
#

Let \(A\in M_{D}(\mathbb {C})\) be Hermitian with eigenvalues \(\lambda _1\ge \lambda _2\ge \cdots \ge \lambda _D\) listed in decreasing order. For \(0\le k\le D\), set

\begin{align} S_k(A) & =\sum _{i=1}^{k}\lambda _i. \label{eq:channel_largest_eigenvalue_sum} \end{align}

This is the sum of the \(k\) largest signed eigenvalues. Indices beyond \(D\) contribute zero, so the value stabilizes at \(\operatorname{Re}\operatorname{tr}(A)\) once \(k\) reaches \(D\).

The Ky-Fan \(k\)-norm \(\| A\| _{(k)}\) is by definition the sum of the \(k\) largest singular values of \(A\). It agrees with \(S_k(A)\) exactly when \(A\) is positive semidefinite, where eigenvalues and singular values coincide; for an indefinite Hermitian \(A\) the two differ. For \(A=\operatorname{diag}(1,-2)\), one has \(S_1(A)=1\) but \(\| A\| _{(1)}=2\). The results below concern \(S_k(A)\) for arbitrary Hermitian \(A\), so on the positive-semidefinite cone they are statements about the Ky-Fan norm.

Theorem 22.2.2.2 Ky Fan’s maximum principle

Let \(A\in M_{D}(\mathbb {C})\) be Hermitian and \(0\le k{\lt}D\). Then the sum of its \(k\) largest eigenvalues is the largest value of \(\operatorname{Re}\operatorname{tr}(PA)\) attained by an orthogonal projection \(P\) of rank \(k\):

\begin{align} S_k(A) & =\max _{\substack {P^2=P=P^\dagger \\ \begin{bgroup} \operatorname{tr}(P)=k \end{bgroup}}}\operatorname{Re}\operatorname{tr}(PA). \label{eq:channel_ky_fan_maximum} \end{align}

This is Ky Fan’s maximum principle [ Fan49 ] ; see also [ Bha97 , Problem I.6.15, Exercise II.1.13 ] . For a positive semidefinite \(A\), where \(S_k(A)\) coincides with the Ky-Fan norm \(\| A\| _{(k)}\), it gives the extremal overlap of [ Wol12 , Lemma 3.1 ] .

Proof

Theorem I.3.1 provides a rank-\(k\) projection whose trace against \(A\) equals \(S_k(A)\), so the value is attained. Theorem I.3.2 shows that no rank-\(k\) projection exceeds it. Hence \(S_k(A)\) is the maximum.

Theorem 22.2.2.3 Maximal overlap with a fixed Schmidt rank

Let \(\phi \in \mathbb {C}^{D}\otimes \mathbb {C}^k\) be a normalized vector with reduced density matrix \(\rho =\operatorname{tr}_2|\phi \rangle \! \langle \phi |\) on the first factor, and let \(1\le n{\lt}D\). The largest squared overlap \(|\langle \phi | \psi \rangle |^2\) attained by a normalized vector \(\psi \) of Schmidt rank at most \(n\) is the Ky-Fan \(n\)-norm of \(\rho \):

\begin{align} \max _{\substack {\operatorname{SR}(\psi )\le n\\ \begin{bgroup} \| \psi \| =1 \end{bgroup}}} |\langle \phi | \psi \rangle |^2 & =\| \rho \| _{(n)}. \label{eq:schwarz_maximal_schmidt_overlap} \end{align}

Because \(\rho \) is positive semidefinite, this norm is the sum of its \(n\) largest eigenvalues, which coincide there with its singular values. This is [ Wol12 , Lemma 3.1 ] for \(1\le n{\lt}D\); the top index \(n=D\), where the value is \(\operatorname{tr}\rho =1\), is Theorem 22.2.2.4.

Proof

Write \(C\) for the coefficient matrix of \(\phi \), so that \(\rho =CC^\dagger \) and the overlap with a vector \(\psi \) of coefficient matrix \(B\) is the Frobenius pairing \(\langle \phi | \psi \rangle =\operatorname{tr}(C^\dagger B)\); normalization reads \(\operatorname{tr}(B^\dagger B)=1\) and the Schmidt-rank constraint reads \(\operatorname{rank}(B)\le n\).

For the upper bound, let \(P\) be the orthogonal projection onto the column space of \(B\), so \(\operatorname{rank}(P)\le n\) and \(PB=B\). The Cauchy–Schwarz inequality for the Frobenius pairing gives

\begin{align} |\operatorname{tr}(C^\dagger B)|^2 & =|\operatorname{tr}((PC)^\dagger B)|^2 \le \operatorname{tr}\! ((PC)^\dagger (PC))\operatorname{tr}(B^\dagger B) =\operatorname{tr}(P\rho ). \notag \end{align}

Since \(P\) has rank at most \(n\) and \(\rho \) is positive semidefinite, the positive-semidefinite form of Ky Fan’s maximum principle (Theorem 22.2.2.2) gives \(\operatorname{tr}(P\rho )\le \| \rho \| _{(n)}\). Thus \(|\langle \phi | \psi \rangle |^2\le \| \rho \| _{(n)}\) for every admissible \(\psi \).

For the converse, let \(P_n\) be the eigenprojection of \(\rho \) onto its \(n\) largest eigenvalues, so \(\operatorname{tr}(P_n\rho )=\| \rho \| _{(n)}\), and set

\begin{align} B & =\| \rho \| _{(n)}^{-1/2}P_nC. \label{eq:schwarz_schmidt_overlap_witness} \end{align}

Then \(\operatorname{rank}(B)\le \operatorname{rank}(P_n)=n\) and \(\operatorname{tr}(B^\dagger B)=\| \rho \| _{(n)}^{-1}\operatorname{tr}(P_n\rho )=1\), while

\begin{align} |\operatorname{tr}(C^\dagger B)|^2 & =\| \rho \| _{(n)}^{-1}|\operatorname{tr}(P_n\rho )|^2 =\| \rho \| _{(n)}. \notag \end{align}

Thus the bound is attained. For a normalized \(\phi \) with \(1\le n\), one has \(\| \rho \| _{(n)}\ge \| \rho \| _{(1)}{\gt}0\), since \(\operatorname{tr}\rho =1\), which justifies the normalization in (??).

Theorem 22.2.2.4 Maximal overlap at the top Schmidt rank

At the top index \(n=D\), the Schmidt-rank constraint \(\operatorname{SR}(\psi )\le D\) is vacuous, so the largest squared overlap is the Ky-Fan \(D\)-norm of \(\rho \):

\begin{align} \max _{\| \psi \| =1}|\langle \phi | \psi \rangle |^2 & =\| \rho \| _{(D)}. \label{eq:schwarz_maximal_overlap_top} \end{align}

The maximum is attained at \(\psi =\phi \). The Ky-Fan \(D\)-norm sums all eigenvalues, so for a normalized \(\phi \) it reduces to \(\| \rho \| _{(D)}=\operatorname{tr}\rho =1\). Together with Theorem 22.2.2.3, this covers the full range \(1\le n\le D\) of [ Wol12 , Lemma 3.1 ] .

Proof

The Ky-Fan \(D\)-norm sums all eigenvalues of \(\rho \), so \(\| \rho \| _{(D)}=\operatorname{tr}\rho =\| \phi \| ^2=1\). The bound \(1\) is attained at \(\psi =\phi \), whose Schmidt rank is at most \(D\); for any normalized \(\psi \), the Cauchy–Schwarz inequality gives \(|\langle \phi | \psi \rangle |^2\le \| \phi \| ^2\| \psi \| ^2=1\).

Definition 22.2.2.5 Reduced density of an eigenvector
#

Let \(\tau \) be a Hermitian operator on \(\mathbb {C}^{D'}\otimes \mathbb {C}^{D}\) with normalized eigenvectors \(\phi _i\). The reduced density operator of the \(i\)-th eigenvector on the first factor is \(\rho _i=\operatorname{tr}_2|\phi _i\rangle \! \langle \phi _i|\).

Theorem 22.2.2.6 Spectral lower bound for the Schmidt-rank expectation

Let \(\tau \) be a Hermitian operator on \(\mathbb {C}^{D'}\otimes \mathbb {C}^{D}\) with eigenvalues \(\nu _i\) and normalized eigenvectors \(\phi _i\), and write \(\rho _i=\operatorname{tr}_2|\phi _i\rangle \! \langle \phi _i|\) for the reduced density operator of \(\phi _i\) on the first factor. Let \(1\le n{\lt}D'\) and let \(\nu _0\ge 0\) be a lower bound for the positive eigenvalues (the smallest positive eigenvalue). Then every normalized vector \(\psi \) of Schmidt rank at most \(n\) satisfies

\begin{align} \nu _0+\sum _{i:\nu _i\le 0} (\nu _i-\nu _0)\| \rho _i\| _{(n)} & \le \langle \psi |\tau |\psi \rangle . \label{eq:schwarz_spectral_schmidt_lower} \end{align}

Hence the same bound holds for the infimum over such vectors. This is the lower bound of [ Wol12 , Chapter 3, Proposition 3.2 ] for \(n{\lt}D'\); the top index \(n=D'\) is Theorem 22.2.2.8.

Proof

By (??), \(\langle \psi |\tau |\psi \rangle =\sum _i\nu _i|\langle \phi _i | \psi \rangle |^2\), while (??) gives \(\sum _i|\langle \phi _i | \psi \rangle |^2=\| \psi \| ^2=1\). Subtracting \(\nu _0\) times the latter from the former gives

\begin{align} \langle \psi |\tau |\psi \rangle & =\nu _0+\sum _i(\nu _i-\nu _0) |\langle \phi _i | \psi \rangle |^2. \label{eq:schwarz_spectral_lower_expansion} \end{align}

For an eigenvalue \(\nu _i{\gt}0\), the factor \(\nu _i-\nu _0\) is non-negative, so those terms only increase the sum and may be dropped. For an eigenvalue \(\nu _i\le 0\), the factor \(\nu _i-\nu _0\) is nonpositive, and Theorem 22.2.2.3 gives \(|\langle \phi _i | \psi \rangle |^2\le \| \rho _i\| _{(n)}\). Multiplication by the nonpositive factor reverses the inequality, which gives (??).

Theorem 22.2.2.7 Spectral upper bound for the Schmidt-rank expectation

With \(\tau \), \(\phi _i\), and \(\rho _i\) as above, let \(1\le n{\lt}D'\) and suppose every eigenvalue of \(\tau \) is at most \(\nu \). For any eigenvector index \(j\), there is a normalized vector \(\psi \) of Schmidt rank at most \(n\) with

\begin{align} \langle \psi |\tau |\psi \rangle & \le \nu +(\nu _j-\nu )\| \rho _j\| _{(n)}. \label{eq:schwarz_spectral_schmidt_upper} \end{align}

Hence the infimum over such vectors lies below that value. Taking \(\nu \) to be the largest positive eigenvalue and \(j\) the index of the unique non-positive eigenvalue \(\nu _-\) recovers the upper bound \(\nu +(\nu _--\nu )\| \rho _-\| _{(n)}\) of [ Wol12 , Chapter 3, Proposition 3.2 ] . The statement is for \(n{\lt}D'\); the top index \(n=D'\) is Theorem 22.2.2.8.

Proof

Replacing \(\nu _0\) by \(\nu \) in (??) gives

\begin{align} \langle \psi |\tau |\psi \rangle & =\nu +\sum _i(\nu _i-\nu )|\langle \phi _i | \psi \rangle |^2. \notag \end{align}

Every factor \(\nu _i-\nu \) is nonpositive, so all terms are nonpositive and keeping only the \(i=j\) term gives \(\langle \psi |\tau |\psi \rangle \le \nu +(\nu _j-\nu )|\langle \phi _j | \psi \rangle |^2\). Theorem 22.2.2.3 supplies a normalized \(\psi \) of Schmidt rank at most \(n\) attaining \(|\langle \phi _j | \psi \rangle |^2=\| \rho _j\| _{(n)}\); at that vector the right-hand side is the expression in (??).

Theorem 22.2.2.8 Spectral criterion at the top Schmidt rank

At the top index \(n=D'\), the Schmidt-rank constraint is vacuous and each Ky-Fan \(D'\)-norm reduces to \(\| \rho _i\| _{(D')}=\operatorname{tr}\rho _i=1\). Thus the lower and upper bounds of [ Wol12 , Chapter 3, Proposition 3.2 ] reduce to the Rayleigh characterization of the least eigenvalue: the lower bound becomes \(\nu _{\min }\le \langle \psi |\tau |\psi \rangle \) for every normalized \(\psi \), and the upper bound on the infimum becomes the existence of a normalized eigenvector with \(\langle \psi |\tau |\psi \rangle =\nu _{\min }\). Together they give

\begin{align} \inf _{\| \psi \| =1}\langle \psi |\tau |\psi \rangle & =\nu _{\min }. \label{eq:schwarz_spectral_schmidt_top} \end{align}

There is no Schmidt-rank restriction. Together with Theorems 22.2.2.6 and 22.2.2.7, this covers the full range \(1\le n\le D'\) of [ Wol12 , Chapter 3, Proposition 3.2 ] .

Proof

The eigenbasis expansion (??), together with Parseval’s identity (??), bounds each weight \(\nu _i\) below by \(\nu _{\min }\), giving \(\nu _{\min }\le \langle \psi |\tau |\psi \rangle \). Evaluating at the eigenvector \(\phi _j\) for a least-eigenvalue index \(j\) gives \(\langle \phi _j|\tau |\phi _j\rangle =\nu _j=\nu _{\min }\), so the lower bound is attained and the infimum is (??).

Theorem 22.2.2.9 Rank-one test for \(k\)-positivity

A linear map \(E:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) is \(k\)-positive if and only if, for every vector \(\phi \in \mathbb {C}^D\otimes \mathbb {C}^k\), \(E^{(k)}(|\phi \rangle \! \langle \phi |)\ge 0\). This is the pure-state reduction used in [ Wol12 , Chapter 3, Proposition 3.1 ] .

Proof

The forward implication is the definition of \(k\)-positivity, since \(|\phi \rangle \! \langle \phi |\) is positive semidefinite. Conversely, every positive semidefinite matrix on \(\mathbb {C}^D\otimes \mathbb {C}^k\) is a finite sum \(\sum _i|\phi _i\rangle \! \langle \phi _i|\), and

\begin{align} E^{(k)}\! \left(\sum _i|\phi _i\rangle \! \langle \phi _i|\right) & =\sum _iE^{(k)}(|\phi _i\rangle \! \langle \phi _i|)\ge 0. \notag \end{align}

by linearity of \(E^{(k)}\), the hypothesis, and closure of the positive semidefinite cone under finite sums.

22.2.3 Choi compression criteria

The right-tensor identities, parametrizations of bounded Schmidt rank, and projection factorizations used in this subsection are proved in Section I.4.

Definition 22.2.3.1 Right compression of the Choi matrix

For \(X\in M_{D,k}(\mathbb {C})(\mathbb {C})\) and a Choi matrix \(\tau \), the right-factor compression in the blockwise ampliation index convention has entries

\begin{align} C_{(i,p),(j,q)} & =\sum _{a,b}X_{a,p}\tau _{(i,a),(j,b)} \overline{X_{b,q}}. \label{eq:schwarz_right_choi_compression} \end{align}

The associated vector has coefficients \(D^{-1/2}X_{i,p}\).

Definition 22.2.3.2 Right tensor factor for Choi compression
#

For \(X\in M_{D,k}(\mathbb {C})(\mathbb {C})\), let \(R_X\) be the matrix from \(\mathbb {C}^D\otimes \mathbb {C}^D\) to \(\mathbb {C}^D\otimes \mathbb {C}^k\) with entries

\begin{align} (R_X)_{(i,p),(j,a)} & =\delta _{i,j}X_{a,p}. \label{eq:schwarz_right_tensor_factor} \end{align}
Theorem 22.2.3.3 Schmidt-rank Choi expectation from \(k\)-positivity

Assume \(D{\gt}0\). If \(T\) is \(k\)-positive, then \(\langle \psi ,\tau _T\psi \rangle \ge 0\) for every \(\psi \in \mathbb {C}^D\otimes \mathbb {C}^D\) with \(\operatorname{SR}(\psi )\le k\).

Proof

Write \(\psi =R_X^\dagger \eta \) using Lemma I.4.7. By Theorem 22.2.3.6, the compression \(C_T(X)\) is positive semidefinite. Its quadratic form at \(\eta \) is therefore non-negative, and (??) identifies this number with \(\langle \psi ,\tau _T\psi \rangle \).

Theorem 22.2.3.4 Converse Schmidt-rank Choi test

Assume \(D{\gt}0\). If \(\langle \psi ,\tau _T\psi \rangle \ge 0\) for every \(\psi \in \mathbb {C}^D\otimes \mathbb {C}^D\) with \(\operatorname{SR}(\psi )\le k\), then \(T\) is \(k\)-positive.

Proof

By Theorem 22.2.3.6, it is enough to prove that \(C_T(X)\) is positive semidefinite for each \(X\in M_{D,k}(\mathbb {C})(\mathbb {C})\). For any \(\eta \), (??) identifies \(\langle \eta ,C_T(X)\eta \rangle \) with \(\langle R_X^\dagger \eta ,\tau _T R_X^\dagger \eta \rangle \), and Lemma I.4.6 gives \(\operatorname{SR}(R_X^\dagger \eta )\le k\). Thus every quadratic form of \(C_T(X)\) is non-negative. Over a complex finite-dimensional space, polarization recovers Hermiticity from this real non-negative quadratic-form condition, so \(C_T(X)\) is positive semidefinite.

Theorem 22.2.3.5 Schmidt-rank Choi criterion

Assume \(D{\gt}0\). Then \(T\) is \(k\)-positive if and only if \(\langle \psi ,\tau _T\psi \rangle \ge 0\) for every \(\psi \in \mathbb {C}^D\otimes \mathbb {C}^D\) with \(\operatorname{SR}(\psi )\le k\).

Proof

Combine Theorem 22.2.3.3 with Theorem 22.2.3.4.

Theorem 22.2.3.6 Rectangular Choi-compression test for \(k\)-positivity

Assume \(D{\gt}0\). A linear map \(T:M_{D,D}(\mathbb {C})(\mathbb {C})\to M_{D,D}(\mathbb {C})(\mathbb {C})\) is \(k\)-positive if and only if, for every \(X\in M_{D,k}(\mathbb {C})(\mathbb {C})\), the right-factor compression of the Choi matrix of \(T\) by \(X\) is positive semidefinite.

Proof

The forward direction applies the rank-one \(k\)-positivity test to the vector \(\psi _X\) in (??), then uses Lemma I.4.9 in the form

\begin{align} (T\otimes \operatorname{id}_k)(|\psi _X\rangle \! \langle \psi _X|) & =C_T(X). \label{eq:schwarz_ampliation_compression} \end{align}

Conversely, given a vector \(\psi \) on the ampliated space, take \(X_{i,p}=D^{1/2}\psi _{(i,p)}\). Since \(D{\gt}0\), this choice satisfies \(D^{-1/2}X_{i,p}=\psi _{(i,p)}\). Substituting this vector in (??) gives \((T\otimes \operatorname{id}_k)(|\psi \rangle \! \langle \psi |)=C_T(X)\). Positivity of \(C_T(X)\) is therefore positivity of the ampliation on the rank-one matrix \(|\psi \rangle \! \langle \psi |\), and the rank-one test gives \(k\)-positivity.

Theorem 22.2.3.7 Right tensor Choi sandwiches of a \(k\)-positive map

Assume \(D{\gt}0\). If \(T:M_{D,D}(\mathbb {C})(\mathbb {C})\to M_{D,D}(\mathbb {C})(\mathbb {C})\) is \(k\)-positive, then, for every \(X\in M_{D,k}(\mathbb {C})(\mathbb {C})\),

\begin{align} R_X\tau R_X^\dagger & \ge 0, \label{eq:schwarz_k_positive_choi_sandwich} \end{align}

where \(\tau \) is the Choi matrix of \(T\).

Proof

By Theorem 22.2.3.6, \(C_T(X)\ge 0\) for every \(X\in M_{D,k}(\mathbb {C})(\mathbb {C})\). The sandwich formula (??) identifies \(R_X\tau R_X^\dagger \) with \(C_T(X)\).

Theorem 22.2.3.8 Rank-\(k\) right projections in the Choi criterion

Assume \(D{\gt}0\). Let \(T:M_{D,D}(\mathbb {C})(\mathbb {C})\to M_{D,D}(\mathbb {C})(\mathbb {C})\) be \(k\)-positive, with Choi matrix \(\tau \). If \(P\in M_{D,D}(\mathbb {C})(\mathbb {C})\) is Hermitian, satisfies \(P^2=P\), and has rank \(k\), then \(R_P\tau R_P^\dagger \geq 0\). This is the forward rank-\(k\) projection-compression direction of [ Wol12 , Chapter 3, Proposition 3.1 ] .

Proof

By Lemma I.4.16, write \(P=VV^\dagger \) with \(V\in M_{D,k}(\mathbb {C})(\mathbb {C})\). The conclusion is then exactly Theorem I.4.15.

Theorem 22.2.3.9 Projection-compression converse for the Choi criterion

Assume \(D{\gt}0\) and \(k\le D\). Let \(T:M_{D,D}(\mathbb {C})(\mathbb {C})\to M_{D,D}(\mathbb {C})(\mathbb {C})\) have Choi matrix \(\tau \). Suppose that \(R_P\tau R_P^\dagger \geq 0\) for every Hermitian projection \(P\in M_{D,D}(\mathbb {C})(\mathbb {C})\) of rank \(k\). Then \(T\) is \(k\)-positive.

Proof

By Theorem 22.2.3.6, it is enough to prove positivity of the right-factor compression by an arbitrary \(X\in M_{D,k}(\mathbb {C})(\mathbb {C})\). Choose a rank-\(k\) Hermitian projection \(P\) with \(PX=X\) using Lemma I.4.12. The assumed positivity of \(R_P\tau R_P^\dagger \), together with Lemma I.4.11, gives positivity of the rectangular compression by \(X\).

Theorem 22.2.3.10 Rank-\(k\) projection form of the Choi criterion

Assume \(D{\gt}0\) and \(k\le D\). A linear map \(T:M_{D,D}(\mathbb {C})(\mathbb {C})\to M_{D,D}(\mathbb {C})(\mathbb {C})\) is \(k\)-positive if and only if, for every Hermitian projection \(P\in M_{D,D}(\mathbb {C})(\mathbb {C})\) of rank \(k\), \(R_P\tau R_P^\dagger \geq 0\), where \(\tau \) is the Choi matrix of \(T\). This is the rank-\(k\) projection formulation of [ Wol12 , Chapter 3, Proposition 3.1 ] .

Proof

The forward direction is Theorem 22.2.3.8. The reverse direction is Theorem 22.2.3.9.

22.3 Trace adjoints and the positivity hierarchy

The trace-pairing adjoint was introduced in Definition 5.3.1. Its compatibility with ampliation makes \(k\)-positivity invariant under trace adjoints and identifies the endpoints of the positivity hierarchy. Routine closure properties of the cones of \(k\)-positive maps are collected in Section I.5.

Theorem 22.3.1 Trace-pairing adjoint of an ampliation

For every linear map \(E : M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\), the trace-pairing adjoint commutes with ampliation:

\begin{align} (E^{(k)})^* & =(E^*)^{(k)}. \label{eq:schwarz_trace_adjoint_ampliation} \end{align}
Proof

For block matrices write \(\rho _{pq}\) and \(X_{pq}\) for their \(M_{D}(\mathbb {C})\)-valued blocks. Expanding the trace by blocks and applying (??) gives

\begin{align} \operatorname{tr}((E^*)^{(k)}(\rho )X) & =\sum _{p,q}\operatorname{tr}(E^*(\rho _{pq})X_{qp}) =\sum _{p,q}\operatorname{tr}(\rho _{pq}E(X_{qp})) =\operatorname{tr}(\rho E^{(k)}(X)). \notag \end{align}

Nondegeneracy of the trace pairing identifies the two adjoints, proving (??).

Theorem 22.3.2 Trace-pairing adjoint of a \(k\)-positive map

If \(E\) is \(k\)-positive, then \(E^*\) is \(k\)-positive.

Proof

Since \(E\) is \(k\)-positive, its ampliation \(E^{(k)}\) is positive. The trace-pairing adjoint of this positive map is positive, and (??) identifies that adjoint with \((E^*)^{(k)}\).

Theorem 22.3.3 \(k\)-positivity is trace-adjoint invariant

A linear map is \(k\)-positive if and only if its trace-pairing adjoint is \(k\)-positive.

Proof

One direction is Theorem 22.3.2. The other follows by applying the same theorem to \(E^*\) and using Theorem A.1.4.

Theorem 22.3.4 Completely positive maps are \(k\)-positive
#

Every completely positive map is \(k\)-positive for all \(k \ge 1\).

Proof

Choose a Kraus representation \(E(X)=\sum _i K_iXK_i^\dagger \). For every \(Y\succeq 0\) in \(M_{D}(\mathbb {C})\otimes M_{k}(\mathbb {C})\),

\begin{align} (E\otimes \operatorname{id}_k)(Y) & =\sum _i (K_i\otimes \mathbb {1}_k)Y(K_i\otimes \mathbb {1}_k)^\dagger \succeq 0. \notag \end{align}

Thus every ampliation \(E\otimes \operatorname{id}_k\) is positive.

Theorem 22.3.5 One-positive maps are positive

A linear map is \(1\)-positive if and only if it is positive.

Proof

The ampliation by \(M_{1}(\mathbb {C})\) is identified with the original matrix algebra: all block indices have the unique value, so positivity of \(E\otimes \operatorname{id}_1\) is exactly positivity of \(E\).

Theorem 22.3.6 \(D\)-positive maps on nonzero \(M_{D}(\mathbb {C})\) are completely positive

For maps \(E:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) with \(D\ge 1\), complete positivity is equivalent to \(D\)-positivity.

Proof

Complete positivity implies \(k\)-positivity for every \(k\). Conversely, assume \(D\ge 1\). If \(E\) is \(D\)-positive, apply \(E\otimes \operatorname{id}_D\) to the maximally entangled projector \(|\Omega \rangle \! \langle \Omega |\). The result is the Choi matrix of \(E\), hence it is positive semidefinite. Choi’s theorem then gives complete positivity.

22.4 Elementary positive-map examples

The reduction map and the automorphisms of the positive semidefinite cone are basic structural examples of positive maps. The reduction map has a simple trace form and an explicit Choi matrix; the automorphisms preserve the order cone and map it onto itself.

22.4.1 The reduction map

Definition 22.4.1.1 Reduction map
#

The reduction map on \(M_{D}(\mathbb {C})\), for \(k\in \mathbb {N}\), is

\begin{align} T_k(X) & =\operatorname{tr}(X)\mathbb {1}-k^{-1}X. \label{eq:channel_reduction_map} \end{align}
Theorem 22.4.1.2 The first reduction map is positive

For \(D\ge 1\), the map \(T_1(X)=\operatorname{tr}(X)\mathbb {1}-X\) on \(M_{D}(\mathbb {C})\) is positive.

Proof

If \(X\ge 0\), diagonalize \(X\). Its eigenvalues \(\lambda _1,\ldots ,\lambda _D\) are non-negative, and each satisfies \(\lambda _j\le \sum _{i=1}^D\lambda _i=\operatorname{tr}(X)\). Therefore all eigenvalues of \(\operatorname{tr}(X)\mathbb {1}-X\) are non-negative.

Theorem 22.4.1.3 Self-duality of the reduction map

The reduction map is self-dual for the trace pairing:

\begin{align} \operatorname{tr}(T_k(\rho )X) & =\operatorname{tr}(\rho T_k(X)). \label{eq:channel_reduction_self_dual} \end{align}
Proof

Expanding both sides of (??) using (??) and bilinearity of the trace gives \(\operatorname{tr}(\rho )\operatorname{tr}(X)-k^{-1}\operatorname{tr}(\rho X)\) in each case.

Theorem 22.4.1.4 Choi matrix of the reduction map

For \(D\ge 1\), the Choi matrix of the reduction map is

\begin{align} \tau (T_k) & =D^{-1}\mathbb {1}-k^{-1}|\Omega \rangle \langle \Omega |. \label{eq:channel_reduction_choi} \end{align}
Proof

The trace term sends the \((a,b)\) slice of \(|\Omega \rangle \langle \Omega |\) to its trace times the identity, giving the contribution \(D^{-1}\mathbb {1}\). The second term is the Choi matrix of \(k^{-1}\) times the identity map, namely \(k^{-1}|\Omega \rangle \langle \Omega |\).

22.4.2 Automorphisms of the positive semidefinite cone

Invertible conjugations, with or without transposition, do more than preserve positivity: they are surjective on the positive semidefinite cone.

Definition 22.4.2.1 Maps preserving the positive semidefinite cone
#

A linear map \(T:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) maps the positive semidefinite cone onto itself if \(T\) is positive and every positive semidefinite matrix is the image under \(T\) of a positive semidefinite matrix. This is condition (1) of [ Wol12 , Proposition 3.8 ] .

Theorem 22.4.2.2 Conjugations preserve the positive semidefinite cone

Let \(Y\in M_{D}(\mathbb {C})\) be invertible. Then the map \(X\mapsto YXY^\dagger \) and the map \(X\mapsto YX^TY^\dagger \) each map the positive semidefinite cone onto itself. This is the implication (3) \(\Rightarrow \) (1) of [ Wol12 , Proposition 3.8 ] .

Proof

Conjugation by any matrix preserves positive semidefiniteness. Moreover, if \(W=C^\dagger C\), then \(W^T=C^T\overline C=\overline C^\dagger \overline C\geq 0\); hence transposition also preserves positive semidefiniteness, and both maps send the cone into itself. For surjectivity onto the cone, given a positive semidefinite \(A\), set \(W=Y^{-1}A(Y^{-1})^\dagger \), which is again positive semidefinite. Then \(YWY^\dagger =A\) proves the conjugation case, and \(Y(W^T)^TY^\dagger =A\) proves the transpose case, with \(W\) and \(W^T\) positive semidefinite.

22.5 Positivity hierarchy and two-positive maps

The following family exhibits the strict hierarchy of positivity conditions and supplies the threshold statements used in the reduction criterion below.

22.5.1 The map \(T_\eta \) and strictness of the chain

The cones of \(k\)-positive maps form a decreasing chain from the completely positive maps, at the top amplification dimension, down to the merely positive maps. This subsection shows that every inclusion between consecutive dimensions, below the top one, is strict. The witnesses come from a one-parameter family of maps whose positivity threshold is the parameter itself, so that tuning the parameter between two integers separates the two adjacent cones.

Definition 22.5.1.1 The family \(T_\eta \)
#

For a real parameter \(\eta \), the map \(T_\eta \) on \(M_{D}(\mathbb {C})\) is

\begin{align} T_\eta (\rho ) & =\operatorname{tr}(\rho ) \mathbb {1}-\eta ^{-1}\rho . \notag \end{align}

The map is defined for every real \(\eta \); at \(\eta =0\) it reduces to \(\rho \mapsto \operatorname{tr}(\rho ) \mathbb {1}\), and the positivity threshold below assumes \(\eta {\gt}0\).

Theorem 22.5.1.2 Choi matrix of \(T_\eta \)

For \(D\ge 1\), the Choi matrix of \(T_\eta \) is

\begin{align} \tau _\eta & =D^{-1}\mathbb {1}-\eta ^{-1}|\Omega \rangle \langle \Omega |. \notag \end{align}
Proof

The Choi matrix is linear in the map, so it splits over the two terms of \(T_\eta \). The trace term contributes \(\tau (\rho \mapsto \operatorname{tr}(\rho ) \mathbb {1})=D^{-1}\mathbb {1}\), since each elementary slice of \(|\Omega \rangle \langle \Omega |\) contributes its trace times the identity. The identity map contributes \(\tau (\operatorname{id})=|\Omega \rangle \langle \Omega |\). Subtracting \(\eta ^{-1}\) times the second from the first gives \(\tau _\eta =D^{-1}\mathbb {1}-\eta ^{-1}|\Omega \rangle \langle \Omega |\).

Theorem 22.5.1.3 Positivity threshold of \(T_\eta \)

Let \(\eta {\gt}0\) and \(1\le k{\lt}D\). Then \(T_\eta \) is \(k\)-positive if and only if \(\eta \ge k\). This is [ Wol12 , Equation (3.11) ] for \(1\le k{\lt}D\); the top index \(k=D\), where \(k\)-positivity is complete positivity, is Theorem 22.5.1.4.

Proof

By the Schmidt-rank Choi criterion, \(k\)-positivity is the nonnegativity of the Choi quadratic form on all vectors of Schmidt rank at most \(k\). For a normalized such vector \(\psi \), the Choi matrix \(\tau _\eta =D^{-1}\mathbb {1}-\eta ^{-1}|\Omega \rangle \langle \Omega |\) gives \(\langle \psi |\tau _\eta |\psi \rangle =D^{-1}-\eta ^{-1}|\langle \Omega | \psi \rangle |^2\). The reduced density of \(|\Omega \rangle \) on the first factor is \(\mathbb {1}/D\), so by the maximal-overlap principle the supremum of \(|\langle \Omega | \psi \rangle |^2\) over Schmidt-rank-\(k\) normalized vectors is \(\| \mathbb {1}/D\| _{(k)}=k/D\). The infimum of the quadratic form is therefore \(D^{-1}-\eta ^{-1}(k/D)=D^{-1}(1-k/\eta )\), which is non-negative precisely when \(\eta \ge k\). Degree-two homogeneity extends the bound from normalized vectors to all vectors of Schmidt rank at most \(k\).

Theorem 22.5.1.4 Positivity threshold of \(T_\eta \) at the top index

Let \(\eta {\gt}0\) and \(D\ge 1\). Then \(T_\eta \) is \(D\)-positive if and only if \(\eta \ge D\). Together with Theorem 22.5.1.3 this is [ Wol12 , Equation (3.11) ] over the full range \(1\le k\le D\), where the top index \(k=D\) is complete positivity.

Proof

On \(M_{D}(\mathbb {C})\), \(D\)-positivity is complete positivity, which is positive semidefiniteness of the Choi operator \(\tau _\eta =D^{-1}\mathbb {1}-\eta ^{-1}|\Omega \rangle \langle \Omega |\). Its quadratic form on a vector \(\psi \) is \(D^{-1}\| \psi \| ^2-\eta ^{-1}|\langle \Omega | \psi \rangle |^2\); since \(|\Omega \rangle \) is normalized, Cauchy–Schwarz gives \(|\langle \Omega | \psi \rangle |^2\le \| \psi \| ^2\) with equality at \(\psi =\Omega \), so the form is non-negative for all \(\psi \) precisely when \(\eta \ge D\).

Corollary 22.5.1.5 Strictness of the positivity chain

Let \(1\le k\) with \(k+1{\lt}D\). Then there is a map on \(M_{D}(\mathbb {C})\) that is \(k\)-positive but not \((k+1)\)-positive; the cone of \(k\)-positive maps strictly contains the cone of \((k+1)\)-positive maps. Every inclusion between consecutive amplification dimensions below the top one is therefore strict.

Proof

Take \(T_\eta \) at \(\eta =k\). By the threshold equivalence it is \(k\)-positive, since \(\eta =k\ge k\), but not \((k+1)\)-positive, since \(\eta =k{\lt}k+1\).

Theorem 22.5.1.6 Kraus-form Kadison–Schwarz as a special case
#

Let \(K=(K_i)_{i=0}^{d-1}\) be a unital Kraus family, that is, \(\sum _i K_i K_i^\dagger =\mathbb {1}\). Then for all \(X\in M_{D}(\mathbb {C})\), \(\mathcal{K}(X^\dagger X)\ge \mathcal{K}(X)^\dagger \mathcal{K}(X)\), where \(\mathcal{K}(Y)=\sum _i K_i Y K_i^\dagger \).

22.6 The reduction criterion

The reduction map and the family \(T_\eta \) are the same map under two parametrizations: the natural-number parameter \(k\) and the real parameter \(\eta \) agree at \(\eta =k\). Identifying them lets the positivity threshold and the Choi formula carry over to the reduction map without restating them. Wolf attaches to this map the entanglement witness \(W_n=D^{-1}\mathbb {1}-n^{-1}|\Omega \rangle \langle \Omega |\) and the operator inequality [ Wol12 , Equation (3.18) ] that constrains the reduced densities of a bipartite state whose Schmidt number is at most \(n\).

Theorem 22.6.1 The reduction map is the family \(T_\eta \) at integer parameter

For every \(k\in \mathbb {N}\) the reduction map \(T_k\) equals the family map \(T_\eta \) at \(\eta =k\): \(T_k=T_\eta \big|_{\eta =k}\).

Proof

The two maps differ only in the scalar coefficient of \(X\), namely \(k^{-1}\) against \(\eta ^{-1}\) at \(\eta =k\). The natural-number and real casts of \(k\) into the complex scalars coincide, so the coefficients agree and the maps are equal.

Theorem 22.6.2 The reduction map \(T_k\) is \(k\)-positive

For \(1\le k\le D\) the reduction map \(T_k\) on \(M_{D}(\mathbb {C})\) is \(k\)-positive.

Proof

The reduction map equals the family map \(T_\eta \) at \(\eta =k\), and \(T_\eta \) is \(k\)-positive exactly when \(\eta \ge k\); the threshold is met with equality at \(\eta =k\). For \(k{\lt}D\) this is the Schmidt-rank threshold, and the top index \(k=D\) is the completely positive endpoint supplied by the dimension-indexed threshold.

Theorem 22.6.3 The reduction map \(T_k\) is not \((k+1)\)-positive

For \(1\le k{\lt}D\) the reduction map \(T_k\) on \(M_{D}(\mathbb {C})\) is not \((k+1)\)-positive.

Proof

The reduction map equals \(T_\eta \) at \(\eta =k\). For \(k+1{\lt}D\) the threshold gives that \(T_\eta \) is \((k+1)\)-positive iff \(\eta \ge k+1\), so \(T_k\) would require \(k\ge k+1\), which is false. For \(k+1=D\) the dimension-indexed threshold gives that \(T_\eta \) is \(D\)-positive iff \(\eta \ge D\), so \(T_k\) would require \(k\ge D\), contradicting \(k{\lt}D\).

Remark 22.6.4
#

Together with the \(k\)-positivity of \(T_k\) (22.6.2), this shows that \(T_k\) is exactly \(k\)-positive for \(1\le k{\lt}D\): every inclusion in Wolf’s chain \(T_{\mathrm{cp}}=T_D\subsetneq \cdots \subsetneq T_1\) is strict.

Definition 22.6.5 Reduction witness
#

The reduction witness on \(M_{D}(\mathbb {C})\otimes M_{D}(\mathbb {C})\), for \(n\in \mathbb {N}\), is

\begin{align} W_n & =D^{-1}\mathbb {1}-n^{-1}|\Omega \rangle \langle \Omega |. \notag \end{align}
Theorem 22.6.6 The Choi matrix of the reduction map is the witness

For \(D\ge 1\) the Choi matrix of \(T_n\) is the reduction witness:

\begin{align} \tau (T_n) & =W_n=D^{-1}\mathbb {1}-n^{-1}|\Omega \rangle \langle \Omega |. \notag \end{align}
Proof

The reduction map is \(T_\eta \) at \(\eta =n\), whose Choi matrix is \(D^{-1}\mathbb {1}-n^{-1}|\Omega \rangle \langle \Omega |\), which is exactly \(W_n\).

Theorem 22.6.7 Reduction-criterion identity
#

Applying \(T_\eta \) to the first factor of a bipartite matrix \(\rho \) gives

\begin{align} (T_\eta \otimes \operatorname{id})(\rho ) & =\mathbb {1}\otimes \rho _2-\eta ^{-1}\rho , \notag \end{align}

where \(\rho _2\) is the reduced density of \(\rho \) on the second factor.

Proof

Fix block indices \(i_2,j_2\) on the second factor and write \(\rho ^{(i_2,j_2)}\) for the \(D\times D\) slice \(\rho ^{(i_2,j_2)}_{i_1 j_1}=\rho _{(i_1,i_2),(j_1,j_2)}\) on the first factor. Its trace is the corresponding entry of \(\rho _2\):

\begin{align} \operatorname{tr}(\rho ^{(i_2,j_2)}) & =\sum _{i_1}\rho _{(i_1,i_2),(i_1,j_2)} =(\rho _2)_{i_2 j_2}. \notag \end{align}

Applying \(T_\eta \) entry by entry gives

\begin{align} ((T_\eta \otimes \operatorname{id})(\rho ))_{(i_1,i_2),(j_1,j_2)} & =\operatorname{tr}(\rho ^{(i_2,j_2)}) \delta _{i_1 j_1} -\eta ^{-1}\rho _{(i_1,i_2),(j_1,j_2)} \notag \\ & =(\rho _2)_{i_2 j_2} \delta _{i_1 j_1} -\eta ^{-1}\rho _{(i_1,i_2),(j_1,j_2)}, \notag \end{align}

and the first term is exactly the \((i_1,i_2),(j_1,j_2)\) entry of \(\mathbb {1}\otimes \rho _2\).

Theorem 22.6.8 Operator-implication step of the reduction criterion

Let \(n\ge 1\) and let \(\rho \) be a bipartite matrix, with \(\rho ^{F}\) its image under the factor swap \(\rho ^{F}_{(i_2,i_1),(j_2,j_1)}=\rho _{(i_1,i_2),(j_1,j_2)}\). If \((T_n\otimes \operatorname{id})(\rho )\ge 0\) then \(n\, \mathbb {1}\otimes \rho _2\ge \rho \), and if \((T_n\otimes \operatorname{id})(\rho ^{F})\ge 0\) then \(n\, \rho _1\otimes \mathbb {1}\ge \rho \), where \(\rho _1\) and \(\rho _2\) are the reduced densities of \(\rho \) on the first and second factors. Because the factor swap is a unitary reindexing, \((\operatorname{id}\otimes T_n)(\rho )\ge 0 \iff (T_n\otimes \operatorname{id})(\rho ^{F})\ge 0\), so the second hypothesis is Wolf’s symmetric condition \((\operatorname{id}\otimes T_n)(\rho )\ge 0\) expressed through the swap.

This is the second step of Wolf’s two-step argument for [ Wol12 , Equation (3.18) ] . The source states the inequalities under the premise that \(\rho \) has Schmidt number at most \(n\), and reaches \((T_n\otimes \operatorname{id})(\rho )\ge 0\) from that premise by the \(n\)-positivity of \(T_n\); that first step is taken here as the hypothesis rather than derived. The first step and the composed full criterion with the Schmidt-number premise are Theorem 22.13.11.

Proof

By the reduction-criterion identity, \((T_n\otimes \operatorname{id})(\rho )\) equals \(\mathbb {1}\otimes \rho _2-n^{-1}\rho \). Scaling a positive semidefinite operator by \(n{\gt}0\) preserves positivity, so \(n\, \mathbb {1}\otimes \rho _2-\rho \ge 0\), which is the first inequality. For the second, the factor swap \(F\) satisfies \(F^2=\operatorname{id}\) and is a unitary reindexing, so it preserves positive semidefiniteness and the order, and it exchanges the reduced densities and the two tensor slots: \((\rho ^{F})_2=\rho _1\) and \((\mathbb {1}\otimes (\rho ^{F})_2-n^{-1}\rho ^{F})^{F} =\rho _1\otimes \mathbb {1}-n^{-1}\rho \). Applying the first form to \(\rho ^{F}\) gives \(n\, \mathbb {1}\otimes (\rho ^{F})_2-\rho ^{F}\ge 0\); conjugating by \(F\) turns this into \(n\, \rho _1\otimes \mathbb {1}-\rho \ge 0\).

22.7 The Breuer–Hall map

A second concrete positive map of [ Wol12 , Chapter 3, Example 3.1 ] is built from an antisymmetric contraction \(U\) on \(\mathbb {C}^{D}\), a matrix with \(U^{\mathsf T}=-U\) and \(U^{\dagger }U\le \mathbb {1}\). The associated Breuer–Hall map [ Wol12 , Equation (3.19) ] is \(T_{\mathrm{BH}}(X)=\operatorname{tr}(X) \mathbb {1}-X-U\, X^{\mathsf T}U^{\dagger }\). It is positive; whether it is decomposable, and the threshold beyond which it fails to be completely positive, are not treated here.

Definition 22.7.1 Breuer–Hall map
#

For a matrix \(U\) on \(M_{D}(\mathbb {C})\), the Breuer–Hall map on \(M_{D}(\mathbb {C})\) is

\begin{align} T_{\mathrm{BH}}(X) & =\operatorname{tr}(X) \mathbb {1}-X-U\, X^{\mathsf T}U^{\dagger }. \notag \end{align}
Lemma 22.7.2 The Breuer–Hall map on rank-one operators

If \(U\) is antisymmetric, \(U^{\mathsf T}=-U\), and a contraction, \(U^{\dagger }U\le \mathbb {1}\), then for every vector \(v\) the image \(T_{\mathrm{BH}}(|v\rangle \langle v|)\) of the rank-one operator \(|v\rangle \langle v|\) is positive semidefinite.

Proof

On \(|v\rangle \langle v|\) the image is

\begin{align} T_{\mathrm{BH}}(|v\rangle \langle v|) & =\lVert v\rVert ^{2} \mathbb {1}-|v\rangle \langle v| -|U\overline{v}\rangle \langle U\overline{v}|, \notag \end{align}

with \(\overline{v}\) the entrywise conjugate of \(v\). The two vectors \(v\) and \(U\overline{v}\) are orthogonal: antisymmetry of \(U\) gives

\begin{align} \langle v | U\overline{v} \rangle & =\overline{v}^{\, \mathsf T}U\, \overline{v} =\overline{v}^{\, \mathsf T}(-U^{\mathsf T})\overline{v} =-\langle v | U\overline{v} \rangle , \notag \end{align}

hence \(\langle v | U\overline{v} \rangle =0\). The contraction bound gives \(\lVert U\overline{v}\rVert \le \lVert v\rVert \). For any \(w\) the quadratic form is \(\lVert v\rVert ^{2}\lVert w\rVert ^{2} -\lvert \langle v | w \rangle \rvert ^{2} -\lvert \langle U\overline{v} | w \rangle \rvert ^{2}\), which is non-negative because the two-vector Bessel inequality for the orthogonal pair \(v\), \(U\overline{v}\) with \(\lVert U\overline{v}\rVert \le \lVert v\rVert \) gives \(\lvert \langle v | w \rangle \rvert ^{2} +\lvert \langle U\overline{v} | w \rangle \rvert ^{2} \le \lVert v\rVert ^{2}\lVert w\rVert ^{2}\).

Theorem 22.7.3 The Breuer–Hall map is positive

If \(U\) is antisymmetric, \(U^{\mathsf T}=-U\), and a contraction, \(U^{\dagger }U\le \mathbb {1}\), then the Breuer–Hall map \(T_{\mathrm{BH}}\) sends every positive semidefinite matrix to a positive semidefinite matrix.

Proof

A positive semidefinite matrix is a sum of rank-one operators \(|v\rangle \langle v|\). By Lemma 22.7.2 the Breuer–Hall map sends each such operator to a positive semidefinite matrix, and a sum of positive semidefinite matrices is positive semidefinite, so \(T_{\mathrm{BH}}\) is positive.

22.8 Choi-type maps

The Choi-type maps in Wolf’s Example 3.1 are built from the diagonal projection \(D(X)\) and cyclic shifts \(U_{k0}\):

\begin{align} T_C(X) & =(d-n)D(X)-X+\sum _{k=1}^nD(U_{k0}XU_{k0}^{\dagger }). \notag \end{align}

The formal statements below record the map and the rank-one reduction used in the standard positivity argument. Positivity is proved for the case \(d=3\), \(n=1\) and, for every \(d\ge 3\), at the top of the range, \(n=d-2\); the scalar input for the latter is a reciprocal inequality valid for an arbitrary permutation in place of the cyclic shift. The positivity assertion for the remaining range \(1\le n\le d-3\) and the indecomposability assertion remain open. The missing general positivity step is a cyclic reciprocal estimate for the weights in the rank-one reduction; it does not follow merely from equality of the total numerator and denominator weights. The general estimate is classical: the case \(n=d-2\) is due to Ando, the case \(n=1\) to Tanahashi and Tomiyama  [ TT88 ] , and the whole range to Yamagami  [ Yam93 ] , whose proof is a variational argument on the boundary of a projective simplex.

Definition 22.8.1 Choi-type map
#

On the cyclic index set \(\mathbb {Z}/d\mathbb {Z}\), the Choi-type map is

\begin{align} T_C(X) & =(d-n)D(X)-X+\sum _{k=1}^nD(U_{k0}XU_{k0}^{\dagger }), \notag \end{align}

where \(D\) keeps the diagonal of a matrix and \(U_{k0}\) is the cyclic shift by \(k\).

Lemma 22.8.2 The Choi-type map on rank-one projectors
#

For a vector \(v\) on \(\mathbb {Z}/d\mathbb {Z}\),

\begin{align} T_C(|v\rangle \! \langle v|) & = \operatorname{diag}\! \left((d-n)|v_i|^2+\sum _{k=1}^n |v_{i-k}|^2\right) -|v\rangle \! \langle v|. \notag \end{align}
Proof

The diagonal projection of a shifted rank-one projector records the shifted squared moduli: \(D(U_{k0}|v\rangle \! \langle v|U_{k0}^{\dagger })_{ii}=|v_{i-k}|^2\). Substituting this into the definition of \(T_C\) gives the displayed diagonal matrix minus the original rank-one projector.

Definition 22.8.3 The Choi rank-one diagonal weight
#

For a vector \(v\) on \(\mathbb {Z}/d\mathbb {Z}\), set

\begin{align} a_i & =(d-n)|v_i|^2+\sum _{k=1}^n |v_{i-k}|^2. \notag \end{align}
Lemma 22.8.4 Rank-one complement from a unit bound

If \(p\) is a vector with \(\sum _i |p_i|^2\le 1\), then \(\mathbb {1}-|p\rangle \! \langle p|\ge 0\).

Proof

For every vector \(w\), \(\langle w|(\mathbb {1}-|p\rangle \! \langle p|)|w\rangle =\| w\| ^2-|\langle p | w \rangle |^2\). Since \(\| p\| ^2=\sum _i |p_i|^2\le 1\), Cauchy’s inequality gives \(|\langle p | w \rangle |^2\le \| p\| ^2\| w\| ^2\le \| w\| ^2\), so the quadratic form is non-negative.

Lemma 22.8.5 Diagonal rank-one Schur-complement criterion

Let \(a_i\ge 0\) and suppose \(v_i=0\) whenever \(a_i=0\). If, with the convention that \(|v_i|^2/a_i\) is read as \(0\) when \(a_i=0\), \(\sum _i |v_i|^2/a_i\le 1\), then \(\operatorname{diag}(a_i)-|v\rangle \! \langle v|\ge 0\).

Proof

Put \(p_i=0\) when \(a_i=0\) and \(p_i=v_i/\sqrt{a_i}\) otherwise. Then

\begin{align} \| p\| ^2 & =\sum _i |p_i|^2 =\sum _i \frac{|v_i|^2}{a_i} \le 1 \notag \end{align}

under the same zero-term convention. Lemma 22.8.4 gives \(\mathbb {1}-|p\rangle \! \langle p|\ge 0\). If \(S=\operatorname{diag}(\sqrt{a_i})\), then the support condition gives \(S(\mathbb {1}-|p\rangle \! \langle p|)S^\dagger =\operatorname{diag}(a_i)-|v\rangle \! \langle v|\). Conjugation by \(S\) preserves positive semidefiniteness, which proves the claim.

Lemma 22.8.6 Rank-one positivity from the cyclic reciprocal bound

Assume \(n\le d-2\). If, with the convention that the summand is \(0\) at indices where \(a_i=0\), \(\sum _i |v_i|^2/a_i\le 1\), where \(a_i\) is the weight of Definition 22.8.3, then \(T_C(|v\rangle \! \langle v|)\ge 0\).

Proof

The matrix in Lemma 22.8.2 has the form \(\operatorname{diag}(a_i)-|v\rangle \! \langle v|\). Each \(a_i\) is non-negative. Since \(n\le d-2\), the coefficient \(d-n\) is positive; hence \(a_i=0\) forces \(v_i=0\). The hypotheses of Lemma 22.8.5 therefore apply and give the stated positivity.

Lemma 22.8.7 The first Choi rank-one positivity subcase

For \(d=3\) and \(n=1\), every vector \(v=(v_0,v_1,v_2)\) satisfies \(T_C(|v\rangle \! \langle v|)\ge 0\). Equivalently, with \(x=|v_0|^2\), \(y=|v_1|^2\), and \(z=|v_2|^2\), the needed cyclic estimate is

\begin{align} \frac{x}{2x+z}+\frac{y}{2y+x}+\frac{z}{2z+y} & \le 1. \notag \end{align}

The zero-denominator terms are read as \(0\), as in the preceding Schur-complement criterion. This is only the \(3\times 3\) rank-one subcase; the cyclic estimate for all \(1\le n\le d-2\) remains open.

Proof

First assume that the denominators are nonzero. After multiplying by their product, the inequality is equivalent to \(x^2y+y^2z+z^2x\ge 3xyz\). This follows from AM–GM applied to the three non-negative numbers \(x^2y\), \(y^2z\), and \(z^2x\). If one of the denominators vanishes, the corresponding two variables vanish. For example, if \(2x+z=0\), then \(x=z=0\), and the remaining term is \(y/(2y)\le 1/2\le 1\) when \(y{\gt}0\), while all terms vanish when \(y=0\). The rank-one positivity then follows from Lemma 22.8.6.

Lemma 22.8.8 Positivity from rank-one positivity

A linear map on matrices that sends every rank-one projector \(|w\rangle \! \langle w|\) to a positive semidefinite matrix sends every positive semidefinite matrix to a positive semidefinite matrix.

Proof

Let \(\Phi \) be the map and let \(X\ge 0\). Scaling the eigenvectors of \(X\) by the square roots of its non-negative eigenvalues produces vectors \(w_\alpha \) with \(X=\sum _\alpha |w_\alpha \rangle \! \langle w_\alpha |\). Linearity gives \(\Phi (X)=\sum _\alpha \Phi (|w_\alpha \rangle \! \langle w_\alpha |)\), each summand is positive semidefinite by hypothesis, and a sum of positive semidefinite matrices is positive semidefinite.

Theorem 22.8.9 The first Choi map is positive

For \(d=3\) and \(n=1\), the Choi-type map \(T_C\) sends every positive semidefinite matrix to a positive semidefinite matrix.

Proof

Combine Lemma 22.8.7 with Lemma 22.8.8.

Lemma 22.8.10 Permutation reciprocal inequality
#

Let \(x_i\ge 0\) be indexed by a finite set, let \(T=\sum _j x_j\), and let \(\sigma \) be a permutation of the index set. Then, with zero-denominator summands read as \(0\),

\begin{align} \sum _i \frac{x_i}{T+x_i-x_{\sigma (i)}} & \le 1. \notag \end{align}
Proof

If \(T=0\), every summand vanishes. Otherwise write \(\delta _i=x_i-x_{\sigma (i)}\). Each summand obeys

\begin{align} \frac{x_i}{T+\delta _i} & \le \frac{x_iT-x_i\delta _i+\delta _i^2/2}{T^2}. \notag \end{align}

For \(\sigma (i)=i\) both sides equal \(x_i/T\), and for \(\sigma (i)\ne i\) the difference of the two sides is

\begin{align} \frac{\delta _i^2(T-x_i-x_{\sigma (i)})}{2T^2(T+\delta _i)} & \ge 0, \notag \end{align}

by the pair bound \(x_i+x_{\sigma (i)}\le T\) and \(T+\delta _i\ge 2x_i\ge 0\); a vanishing denominator forces \(x_i=0\) and leaves a non-negative right-hand side. Because \(\sigma \) permutes the entries, \(\sum _i x_{\sigma (i)}^2=\sum _i x_i^2\), which gives the identity \(\sum _i x_i\delta _i=\tfrac 12\sum _i\delta _i^2\). Summing the term bounds therefore yields

\begin{align} \sum _i\frac{x_i}{T+\delta _i} & \le \frac{T^2-\sum _i x_i\delta _i+\tfrac 12\sum _i\delta _i^2}{T^2} =1. \notag \end{align}
Lemma 22.8.11 The Choi weight at the top of the range

Let \(d\ge 3\) and \(n=d-2\). With \(x_i=|v_i|^2\) and \(T=\sum _j x_j\), the Choi rank-one diagonal weight equals

\begin{align} a_i & =(d-n)x_i+\sum _{k=1}^{n}x_{i-k} =T+x_i-x_{i+1}. \notag \end{align}
Proof

For \(n=d-2\) the backward shifts \(i-1,\ldots ,i-(d-2)\) run over every index of \(\mathbb {Z}/d\mathbb {Z}\) except \(i\) and \(i+1\), so the shifted sum equals \(T-x_i-x_{i+1}\) and \(a_i=2x_i+T-x_i-x_{i+1}\).

Lemma 22.8.12 Rank-one positivity at the top of the range

For \(d\ge 3\) and \(n=d-2\), every vector \(v\) satisfies \(T_C(|v\rangle \! \langle v|)\ge 0\).

Proof

By Lemma 22.8.11, the reciprocal weight sum is \(\sum _i x_i/(T+x_i-x_{i+1})\) with \(x_i=|v_i|^2\). Lemma 22.8.10, applied to the cyclic shift \(\sigma (i)=i+1\), bounds this sum by \(1\), and Lemma 22.8.6 turns the bound into rank-one positivity.

Theorem 22.8.13 Choi-type maps at the top of the range are positive

For every \(d\ge 3\) and \(n=d-2\), the Choi-type map \(T_C\) sends every positive semidefinite matrix to a positive semidefinite matrix. This is the case \(n=d-2\) of the positivity assertion of Wolf’s Example 3.1 and subsumes the case \(d=3\), \(n=1\).

Proof

Combine Lemma 22.8.12 with Lemma 22.8.8.

22.9 Transposition

Transposition is the basic example of a positive map that is not completely positive. Its positivity is used in the decomposable-map construction below, while the failure of complete positivity follows from its Choi matrix.

Theorem 22.9.1 Transposition is positive and trace-preserving

The matrix transposition map \(\theta (X)=X^T\) on \(M_{D}(\mathbb {C})\) is positive and trace-preserving.

Proof

If \(X \ge 0\), write \(X=C^\dagger C\). Then \(X^T=C^T\overline C=\overline C^\dagger \overline C\), so \(X^T \ge 0\). Trace preservation is the identity \(\operatorname{tr}(X^T)=\operatorname{tr}(X)\).

If \(D \ge 2\), the matrix transposition map \(\theta (X)=X^T\) on \(M_{D}(\mathbb {C})\) is not completely positive.

Proof

If \(\theta \) were completely positive, its Choi matrix would be positive semidefinite. By Theorem 4.5.7, this Choi matrix is \(D^{-1}F\). For the antisymmetric vector \(v=|01\rangle -|10\rangle \),

\begin{align} \langle v|\, D^{-1}F\, |v\rangle & =-\frac{2}{D}{\lt}0, \notag \end{align}

contradicting positive semidefiniteness.

22.10 Decomposable positive maps

The Choi-type maps are stated in Wolf’s Example 3.1 as positive and indecomposable. The formal language for the second adjective is the following standard one: a positive map is decomposable when it is the sum of a completely positive map and a completely copositive map.

Definition 22.10.1 Decomposable and indecomposable positive maps

A map \(\Phi \colon M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) is completely copositive if \(\Phi \circ \theta \) is completely positive, where \(\theta \) is transposition. It is decomposable if \(\Phi =\Phi _{\mathrm{cp}}+\Phi _{\mathrm{ccp}}\) with \(\Phi _{\mathrm{cp}}\) completely positive and \(\Phi _{\mathrm{ccp}}\) completely copositive. It is indecomposable if it is positive and not decomposable.

Lemma 22.10.2 Completely copositive maps are positive

If \(\Phi \) is completely copositive, then \(\Phi \) is positive.

Proof

Let \(X\ge 0\). Transposition preserves positivity, so \(\theta (X)\ge 0\). Since \(\Phi \circ \theta \) is completely positive, \((\Phi \circ \theta )(\theta (X))\ge 0\). Because \(\theta ^2=\operatorname{id}\), this is exactly \(\Phi (X)\ge 0\).

Lemma 22.10.3 Decomposable maps are positive

If \(\Phi \) is decomposable, then \(\Phi \) is positive.

Proof

Write \(\Phi =\Phi _{\mathrm{cp}}+\Phi _{\mathrm{ccp}}\), with \(\Phi _{\mathrm{cp}}\) completely positive and \(\Phi _{\mathrm{ccp}}\) completely copositive. For \(X\ge 0\), the two preceding positivity results give \(\Phi _{\mathrm{cp}}(X)\ge 0\) and \(\Phi _{\mathrm{ccp}}(X)\ge 0\). Their sum is positive, hence \(\Phi (X)\ge 0\).

22.11 The partial transpose and the PPT property

Transposition is a positive map that is not completely positive, so applying it to one factor of a bipartite operator can break positivity. The resulting operation, the partial transpose [ Wol12 , Equation (3.16) ] , sends \(\rho \in M_{d}(\mathbb {C})\otimes M_{d'}(\mathbb {C})\) to the operator \(\rho ^{T_1}\) obtained by transposing the first tensor factor while leaving the second untouched, and the property \(\rho ^{T_1}\ge 0\)—positive partial transpose, or PPT—is the criterion [ Wol12 , Equation (3.17) ] that separates many entangled states from the separable ones.

Definition 22.11.1 Partial transpose over the first factor
#

For a bipartite matrix \(\rho \) on \(M_{d}(\mathbb {C})\otimes M_{d'}(\mathbb {C})\), the partial transpose over the first factor is the matrix \(\rho ^{T_1}\) with entries

\begin{align} (\rho ^{T_1})_{(i,k),(j,l)} & =\rho _{(j,k),(i,l)}, \notag \end{align}

transposing the first index pair \(i,j\) and fixing the second pair \(k,l\).

Definition 22.11.2 Partial transpose over the second factor
#

For a bipartite matrix \(\rho \) on \(M_{d}(\mathbb {C})\otimes M_{d'}(\mathbb {C})\), the partial transpose over the second factor is the matrix \(\rho ^{T_2}\) with entries

\begin{align} (\rho ^{T_2})_{(i,k),(j,l)} & =\rho _{(i,l),(j,k)}, \notag \end{align}

transposing the second index pair \(k,l\) and fixing the first pair \(i,j\).

Theorem 22.11.3 The partial transpose is an involution

Applying the first-factor partial transpose twice returns the original matrix: \((\rho ^{T_1})^{T_1}=\rho \).

Proof

Both entries equal \(\rho _{(i,k),(j,l)}\): the first transposition exchanges the first index pair, the second restores it.

Theorem 22.11.4 The partial transpose preserves the trace

The first-factor partial transpose preserves the trace: \(\operatorname{tr}(\rho ^{T_1})=\operatorname{tr}(\rho )\).

Proof

On the diagonal the row and column indices coincide, so the index exchange in the definition is the identity and each diagonal entry is unchanged.

Theorem 22.11.5 The partial transpose preserves Hermiticity

If \(\rho \) is Hermitian then so is its first-factor partial transpose \(\rho ^{T_1}\).

Proof

The entry \((\rho ^{T_1})_{(i,k),(j,l)}=\rho _{(j,k),(i,l)}\) has complex conjugate \(\overline{\rho _{(j,k),(i,l)}}=\rho _{(i,l),(j,k)}\) by Hermiticity of \(\rho \), which is the \(((j,l),(i,k))\) entry of \(\rho ^{T_1}\).

Theorem 22.11.6 The two partial transposes differ by a global transposition

The second-factor partial transpose is the full transpose of the first-factor one: \(\rho ^{T_2}=(\rho ^{T_1})^{\mathsf T}\).

Proof

Transposing both factors is the full transpose, so transposing the first factor and then the whole operator transposes only the second factor.

Definition 22.11.7 Positive partial transpose property
#

A bipartite matrix \(\rho \) has the positive-partial-transpose (PPT) property when its first-factor partial transpose is positive semidefinite, \(\rho ^{T_1}\ge 0\).

Theorem 22.11.8 The PPT property is symmetric in the two factors

A bipartite matrix has the PPT property if and only if its second-factor partial transpose is positive semidefinite: \(\rho ^{T_1}\ge 0\iff \rho ^{T_2}\ge 0\).

Proof

The two partial transposes differ by a global transposition, and transposition preserves positive semidefiniteness, so one is positive exactly when the other is.

Theorem 22.11.9 Basis-change law for the partial transpose

For matrices \(U,V\) on the first factor and a bipartite matrix \(\rho \), conjugating inside by \(V\) and \(U\), taking the first-factor partial transpose, and conjugating outside by \(U\) and \(V\) produces the original partial transpose conjugated by \(U U^{\mathsf T}\) and \(V^{\mathsf T}V\):

\begin{align} (U\otimes \mathbb {1}) \left[((V\otimes \mathbb {1}) \rho \, (U\otimes \mathbb {1}))^{T_1}\right] (V\otimes \mathbb {1}) & =((U U^{\mathsf T})\otimes \mathbb {1}) \rho ^{T_1} ((V^{\mathsf T}V)\otimes \mathbb {1}). \notag \end{align}
Proof

Expanding the conjugated operator entry by entry as a double sum over the first factor, the partial transpose exchanges the two summation indices and reverses the roles of the left and right conjugating matrices, leaving them transposed; collecting the Kronecker factors gives the stated form.

Theorem 22.11.10 Conjugation invariance of the partial transpose

Let \(U\) be any matrix on the first factor. If \(\rho \) has the PPT property then

\begin{align} & (U\otimes \mathbb {1}) \Bigl[\bigl((U^\dagger \otimes \mathbb {1}) \rho (U\otimes \mathbb {1})\bigr)^{T_1}\Bigr] (U^\dagger \otimes \mathbb {1}) \notag \end{align}

is positive semidefinite; no invertibility or unitarity of \(U\) is required. Specializing to a unitary \(U\) this is the partial transpose taken in the basis changed by \(U\), so the positivity of the partial transpose is independent of the local basis, recovering Wolf’s basis-independence statement [ Wol12 , Equation (3.17) ] .

Proof

By the basis-change law with \(V=U^\dagger \), the new-basis partial transpose equals \(((U U^{\mathsf T})\otimes \mathbb {1}) \rho ^{T_1} ((U U^{\mathsf T})\otimes \mathbb {1})^\dagger \), a conjugation of \(\rho ^{T_1}\) that preserves positive semidefiniteness.

Definition 22.11.11 Transposition witness
#

For matrices \(A,B\) on \(M_{d}(\mathbb {C})\) and the SWAP operator \(F\) on \(M_{d}(\mathbb {C})\otimes M_{d}(\mathbb {C})\), the transposition witness is \(W=(A\otimes B)\, F\, (A\otimes B)^\dagger \). These are the entanglement witnesses associated with the transposition map.

Theorem 22.11.12 Transposition witnesses are Hermitian

Every transposition witness \(W=(A\otimes B)\, F\, (A\otimes B)^\dagger \) is Hermitian.

Proof

The SWAP operator is self-adjoint, \(F^\dagger =F\), so taking the adjoint of \((A\otimes B)\, F\, (A\otimes B)^\dagger \) returns the same operator.

22.12 Separable states and the PPT criterion

A bipartite state is separable when it is a convex combination of pure product states \(\sum _i p_i\, |a_i\rangle \langle a_i|\otimes |b_i\rangle \langle b_i|\). Each pure product state is a Kronecker product of two rank-one positive semidefinite matrices, the non-negative weight \(p_i\) is absorbed into one factor, and conversely a positive semidefinite matrix is a non-negative combination of rank-one projectors. Up to normalization this gives the equivalent description of separable states as finite sums of Kronecker products of positive semidefinite matrices, the cone generated by the product positive operators, which is the form used below.

Definition 22.12.1 Separable bipartite matrix
#

A bipartite matrix \(\rho \) on \(M_{d}(\mathbb {C})\otimes M_{d'}(\mathbb {C})\) is separable when it is a finite sum of Kronecker products of positive semidefinite matrices,

\begin{align} \rho & =\sum _i A_i\otimes B_i, \notag \\ A_i& \ge 0, \notag \\ B_i& \ge 0. \notag \end{align}
Theorem 22.12.2 A Kronecker product of positive operators is separable
#

For positive semidefinite \(A\) on \(M_{d}(\mathbb {C})\) and \(B\) on \(M_{d'}(\mathbb {C})\), the Kronecker product \(A\otimes B\) is separable.

Proof

It is the one-term sum \(\sum _i A_i\otimes B_i\) with the single index taking the value \(A\otimes B\).

Theorem 22.12.3 Separable matrices are closed under addition
#

If \(\rho \) and \(\sigma \) are separable then so is \(\rho +\sigma \).

Proof

Concatenating the two index families realizes \(\rho +\sigma \) as a single sum of Kronecker products of positive semidefinite matrices.

Theorem 22.12.4 Separable matrices are closed under non-negative scaling
#

If \(\rho \) is separable and \(c\ge 0\) is real then \(c\, \rho \) is separable.

Proof

Absorbing \(c\) into the first factor of each Kronecker product keeps every factor positive semidefinite, since a non-negative multiple of a positive semidefinite matrix is positive semidefinite.

Theorem 22.12.5 A separable matrix is positive semidefinite
#

Every separable matrix is positive semidefinite.

Proof

Each summand \(A_i\otimes B_i\) is a Kronecker product of positive semidefinite matrices, hence positive semidefinite, and a finite sum of positive semidefinite matrices is positive semidefinite.

Theorem 22.12.6 The partial transpose distributes over a finite sum
#

For a finite family of bipartite matrices, \((\sum _i f_i)^{T_1}=\sum _i f_i^{T_1}\).

Proof

The first-factor partial transpose is an entrywise reindexing of the matrix, so it commutes with the entrywise finite sum.

Theorem 22.12.7 PPT criterion, forward direction

Every separable matrix has the positive-partial-transpose property: if \(\rho \) is separable then \(\rho ^{T_1}\ge 0\). A negative partial transpose therefore certifies that a state is entangled.

Proof

The first-factor partial transpose is linear and acts on a Kronecker product by transposing the first factor, \((A\otimes B)^{T_1}=A^{\mathsf T}\otimes B\). Writing \(\rho =\sum _i A_i\otimes B_i\) with each factor positive semidefinite, the partial transpose is \(\sum _i A_i^{\mathsf T}\otimes B_i\). The transpose of a positive semidefinite matrix is positive semidefinite, so each summand is a Kronecker product of positive semidefinite matrices, and the sum is positive semidefinite.

Theorem 22.12.8 Applying a map to one factor distributes over a finite sum
#

For a linear map \(T\) on the first factor and a finite family of bipartite matrices, \((T\otimes \operatorname{id})(\sum _i f_i)=\sum _i (T\otimes \operatorname{id})(f_i)\).

Proof

Applying a map to the first factor is linear in the bipartite matrix, so it commutes with the finite sum.

Theorem 22.12.9 Reduction map at the first level on a separable state

For \(d\ge 1\) and a separable matrix \(\rho \) on \(M_{d}(\mathbb {C})\otimes M_{d'}(\mathbb {C})\), applying the reduction map \(T_1(X)=\operatorname{tr}(X)\mathbb {1}-X\) to the first factor keeps the result positive semidefinite: \((T_1\otimes \operatorname{id})(\rho )\ge 0\). This is the separability instance of the operator inequality underlying the reduction criterion at the first level.

Proof

The reduction map \(T_1\) is positive, so it maps each positive semidefinite first factor \(A_i\) of \(\rho =\sum _i A_i\otimes B_i\) to a positive semidefinite matrix. The ampliation acts by \((T_1\otimes \operatorname{id})(A_i\otimes B_i)=T_1(A_i)\otimes B_i\), each summand is a Kronecker product of positive semidefinite matrices, and the sum is positive semidefinite.

22.13 The Schmidt number and the full reduction criterion

The Schmidt number of a bipartite state is the smallest \(n\) for which the state has a convex decomposition into pure states each of Schmidt rank at most \(n\). Separable states are precisely those of Schmidt number one, and a state of Schmidt number at most \(n\) satisfies the reduction criterion

\begin{align} n\, \rho _1\otimes \mathbb {1}& \ge \rho , \notag \\ n\, \mathbb {1}\otimes \rho _2 & \ge \rho , \notag \end{align}

which is [ Wol12 , Equation (3.18) ] . The bound on the Schmidt number is recorded as a finite sum of pure-state projectors of Schmidt rank at most \(n\), the unnormalized form of the convex decomposition; rescaling a vector by the square root of its weight scales its coefficient matrix and so leaves the Schmidt rank unchanged.

Definition 22.13.1 Bounded Schmidt number
#

A bipartite matrix \(\rho \) on \(M_{d}(\mathbb {C})\otimes M_{d'}(\mathbb {C})\) has Schmidt number at most \(n\) when it is a finite sum of pure-state projectors of Schmidt rank at most \(n\),

\begin{align} \rho & =\sum _i|\psi _i\rangle \langle \psi _i|, \notag \\ \operatorname{SR}(\psi _i) & \le n. \notag \end{align}
Theorem 22.13.2 Basic properties of bounded Schmidt number

A matrix of Schmidt number at most \(n\) is positive semidefinite. States of Schmidt number at most \(n\) are closed under addition and under multiplication by a non-negative real scalar, and a bound on the Schmidt number relaxes to any larger bound.

Proof

Each summand \(|\psi _i\rangle \langle \psi _i|\) is a rank-one positive semidefinite matrix, and a finite sum of positive semidefinite matrices is positive semidefinite. Concatenating two pure-state families realizes a sum as a single finite sum of pure-state projectors of Schmidt rank at most \(n\), and a pure summand of Schmidt rank at most \(n\) also has Schmidt rank at most any larger bound. Multiplication by a non-negative real \(a\) rescales each pure summand \(\psi _i\) to \(\sqrt a\, \psi _i\), which leaves its Schmidt rank unchanged and reproduces \(a\) times the original state.

A bipartite matrix has Schmidt number at most one if and only if it is separable.

Proof

A pure state of Schmidt rank at most one has a coefficient matrix of rank at most one, which factors as \(\psi (i,j)=u_i v_j\); its projector is the Kronecker product \(|u\rangle \langle u|\otimes |v\rangle \langle v|\) of two rank-one positive semidefinite matrices, hence separable, and separable matrices are closed under addition. Conversely a Kronecker product \(A\otimes B\) of positive semidefinite matrices, after expanding each factor into rank-one projectors, is a double sum of product-vector projectors, each of Schmidt rank at most one, so it has Schmidt number at most one; a separable matrix is a finite sum of such products.

Theorem 22.13.4 Convexity of the Schmidt-number set

For each \(n\) the set \(S_n\) of bipartite states of Schmidt number at most \(n\) is convex.

Proof

A convex combination \(a x + b y\) with \(a,b\ge 0\) is a sum of two non-negatively scaled states of Schmidt number at most \(n\), and that bound is preserved under non-negative scaling and under addition; rescaling a vector by a non-negative scalar scales its coefficient matrix and so does not increase the Schmidt rank.

Theorem 22.13.5 Compactness of the Schmidt-number state set

For each \(n\) the set \(S_n\) of trace-one bipartite states of Schmidt number at most \(n\) is compact.

Proof

A trace-one state of Schmidt number at most \(n\) is a convex combination of pure states \(|\psi \rangle \langle \psi |\) whose vector \(\psi \) has unit norm and Schmidt rank at most \(n\), so \(S_n\) is the convex hull of the set \(P_n\) of those pure states. The set \(P_n\) is the image, under the continuous projector map \(\psi \mapsto |\psi \rangle \langle \psi |\), of the unit vectors of Schmidt rank at most \(n\). In the Euclidean norm those unit vectors form the unit sphere, which is compact in finite dimension, intersected with the closed set on which the Schmidt rank is at most \(n\) (the coefficient matrix depends continuously on the vector and the matrices of rank at most \(n\) form a closed set); hence \(P_n\) is compact. The trace of \(|\psi \rangle \langle \psi |\) is the squared Euclidean norm of \(\psi \), so the trace-one constraint is exactly the unit-norm constraint and the weights of the convex decomposition are the squared norms, summing to the trace. The convex hull of a compact set is compact in a finite-dimensional real normed space.

For a pure state \(|\psi \rangle \langle \psi |\) on the square bipartite system \(M_{D}(\mathbb {C})\otimes M_{D}(\mathbb {C})\) with \(\operatorname{SR}(\psi )\le n\) and \(1\le n{\lt}D\), applying \(T_n\) to the first factor keeps the result positive semidefinite: \((T_n\otimes \operatorname{id})(|\psi \rangle \langle \psi |)\ge 0\).

Proof

The map \(T_n\) is \(n\)-positive for \(1\le n{\lt}D\). Write \(\psi \) through the maximally entangled vector as \(\psi =\psi _X\) for a square matrix \(X\) on the right factor with \(\operatorname{rank}(X)=\operatorname{SR}(\psi )\le n\). Then \((T_n\otimes \operatorname{id})(|\psi \rangle \langle \psi |)\) is the right-factor Choi compression of \(T_n\) by \(X\). Its quadratic form on any vector \(\eta \) is the Choi quadratic form of \(T_n\) on \(R_X^\dagger \eta \), whose Schmidt rank is at most \(\operatorname{rank}(X)\le n\). The Schmidt-rank Choi criterion makes that form non-negative, so the compression is positive semidefinite.

For a pure state \(|\psi \rangle \langle \psi |\) on the square bipartite system \(M_{D}(\mathbb {C})\otimes M_{D}(\mathbb {C})\) with \(\operatorname{SR}(\psi )\le n\) and any \(n\)-positive map \(T\), applying \(T\) to the first factor keeps the result positive semidefinite: \((T\otimes \operatorname{id})(|\psi \rangle \langle \psi |)\ge 0\).

Proof

Write \(\psi \) through the maximally entangled vector as \(\psi =\psi _X\) for a square matrix \(X\) on the right factor with \(\operatorname{rank}(X)=\operatorname{SR}(\psi )\le n\). Then \((T\otimes \operatorname{id})(|\psi \rangle \langle \psi |)\) is the right-factor Choi compression of \(T\) by \(X\), and its quadratic form on a vector \(\eta \) equals the Choi quadratic form \(C_T\) of \(T\) evaluated on \(R_X^\dagger \eta \), a vector of Schmidt rank at most \(\operatorname{rank}(X)\le n\). Because \(T\) is \(n\)-positive, \(\langle R_X^\dagger \eta ,\, C_T\, R_X^\dagger \eta \rangle \ge 0\), so the compression is positive semidefinite.

Theorem 22.13.8 Positive maps and entanglement, only-if direction

A bipartite state on the square system \(M_{D}(\mathbb {C})\otimes M_{D}(\mathbb {C})\) of Schmidt number at most \(n\) satisfies \((T\otimes \operatorname{id})(\rho )\ge 0\) for every \(n\)-positive map \(T\). This is the square case \(d=d'=D\) of the only-if direction of Wolf’s Proposition 3.4 for a general bipartite system \(M_{d}(\mathbb {C})\otimes M_{d'}(\mathbb {C})\) [ Wol12 , Chapter 3, Proposition 3.4 ] .

Proof

The state is a finite sum of pure-state projectors of Schmidt rank at most \(n\). Applying \(T\) to the first factor is linear, so it distributes over the sum; the pure-state step makes each summand positive semidefinite, and a finite sum of positive semidefinite matrices is positive semidefinite.

Theorem 22.13.9 Only-if direction for a general bipartite system

On a general bipartite system \(M_{d}(\mathbb {C})\otimes M_{d'}(\mathbb {C})\), with no relation imposed between the two factors, a state of Schmidt number at most \(n\) satisfies \((T\otimes \operatorname{id})(\rho )\ge 0\) for every \(n\)-positive map \(T\) on \(M_{d}(\mathbb {C})\). This is the only-if direction of Wolf’s Proposition 3.4, the first step of eq. (3.18) [ Wol12 , Chapter 3, Proposition 3.4 ] , with no restriction on the bipartite dimensions.

Proof

Pad the bipartite state to the square system \(M_{D}(\mathbb {C})\otimes M_{D}(\mathbb {C})\) with \(D=\max (d,d')\) by zero rows and columns: when \(d'\le d\) the second factor is padded up to \(d\); when \(d\le d'\) the first factor is padded up to \(d'\) and \(T\) is extended to a map on \(M_{d'}(\mathbb {C})\) that preserves \(n\)-positivity. Padding preserves the Schmidt-number bound, the square result makes the padded ampliation positive semidefinite, and the original ampliation is its principal submatrix, hence positive semidefinite.

Theorem 22.13.10 Reduction step from the Schmidt-number premise

For \(1\le n{\lt}D\), a bipartite state on the square system \(M_{D}(\mathbb {C})\otimes M_{D}(\mathbb {C})\) of Schmidt number at most \(n\) satisfies \((T_n\otimes \operatorname{id})(\rho )\ge 0\).

Proof

The state is a finite sum of pure-state projectors of Schmidt rank at most \(n\). Applying \(T_n\) to the first factor is linear, so it distributes over the sum; the pure-state step makes each summand positive semidefinite, and a finite sum of positive semidefinite matrices is positive semidefinite.

On a general bipartite system \(M_{d}(\mathbb {C})\otimes M_{d'}(\mathbb {C})\), a state of Schmidt number at most \(n\) satisfies the reduction criterion

\begin{align} n\, \mathbb {1}\otimes \rho _2 & \ge \rho & & (1\le n{\lt}d), \notag \\ n\, \rho _1\otimes \mathbb {1}& \ge \rho & & (1\le n{\lt}d’), \notag \end{align}

with \(\rho _1\) and \(\rho _2\) the reduced densities on the first and second factors. No relation is imposed between \(d\) and \(d'\); each inequality carries only the \(n\)-positivity threshold of \(T_n\) on its acting factor.

Proof

The Schmidt-number premise gives \((T_n\otimes \operatorname{id})(\rho )\ge 0\) on the general system (first step), and the dimension-general operator implication then yields \(n\, \mathbb {1}\otimes \rho _2\ge \rho \). The factor swap of a state of Schmidt number at most \(n\) again has Schmidt number at most \(n\), since it sends each pure summand \(\psi \) to \(\psi \circ \mathrm{swap}\), whose Schmidt coefficient matrix is the transpose \(M_{\psi \circ \mathrm{swap}}=M_\psi ^{\mathsf T}\) of that of \(\psi \) and so has the same rank; applying the first step to the swapped state (whose first factor is \(d'\)) and the operator implication in its symmetric form gives \(n\, \rho _1\otimes \mathbb {1}\ge \rho \).

Theorem 22.13.12 Trace-form representation of a real-linear functional
#

Every real-linear functional \(g\) on the space of square complex matrices is the trace form of a Hermitian matrix: there is a Hermitian \(H_0\) with \(g(X)=\operatorname{Re}\operatorname{tr}(X H_0)\) for every Hermitian \(X\).

Proof

The real bilinear pairing \((X,H)\mapsto \operatorname{Re}\operatorname{tr}(X H)\) is nondegenerate, because on the diagonal pair \((H,H^{\dagger })\) it equals the squared Frobenius norm \(\operatorname{Re}\operatorname{tr}(H H^{\dagger })=\sum _{i,j}\lvert H_{ij}\rvert ^2\), which is positive unless \(H=0\). Hence the map sending \(H\) to the functional \(X\mapsto \operatorname{Re}\operatorname{tr}(X H)\) is an injective real-linear map from the matrix space to its real dual. These two spaces have the same finite real dimension, so the map is also surjective, and every \(g\) is represented by some \(H\). Replacing \(H\) by its Hermitian part \(\tfrac 12(H+H^{\dagger })\) keeps the value on Hermitian inputs, since \(\operatorname{tr}(X H^{\dagger })=\overline{\operatorname{tr}(X H)}\) when \(X\) is Hermitian, and produces a Hermitian representing matrix.

Theorem 22.13.13 Entanglement witness from a separating hyperplane

Let \(\rho \) be a trace-one Hermitian bipartite state whose Schmidt number exceeds \(n\). Then there is a Hermitian operator \(W\) such that, for every \(\psi \) of Schmidt rank at most \(n\),

\begin{align} \operatorname{Re}\operatorname{tr}(W\rho ) & {\lt}0, \notag \\ \operatorname{Re}\langle \psi |W|\psi \rangle & \ge 0. \notag \end{align}

This is the only-if direction of Wolf’s Proposition 3.3 [ Wol12 , Chapter 3, Proposition 3.3 ] : a state of Schmidt number larger than \(n\) is detected by an entanglement witness for \(S_n\).

Proof

The set \(S_n\) of trace-one states of Schmidt number at most \(n\) is convex and compact, and \(\rho \notin S_n\). The geometric Hahn–Banach theorem separates the closed convex set \(\{ \rho \} \) from the compact convex set \(S_n\) by a continuous real-linear functional \(f\) and a constant \(c\) with \(f(\rho ){\lt}c{\lt}f(\sigma )\) for every \(\sigma \in S_n\). Representing \(f\) as the trace form of a Hermitian \(H_0\) and setting \(W=H_0-c\, \mathbb {1}\) gives \(\operatorname{Re}\operatorname{tr}(W\rho )=f(\rho )-c{\lt}0\). For a vector \(\psi \) of Schmidt rank at most \(n\) the projector \(|\psi \rangle \langle \psi |\), after normalization by \(\lVert \psi \rVert ^2\), is a trace-one state of \(S_n\), so its value under \(f\) is at least \(c\); multiplying back by the squared norm gives \(\operatorname{Re}\langle \psi |W|\psi \rangle \ge 0\), with the zero vector giving the value \(0\) directly.

Theorem 22.13.14 Witness criterion for Schmidt number

Let \(\rho \) be a trace-one Hermitian bipartite state. Then the Schmidt number of \(\rho \) exceeds \(n\) if and only if there is a Hermitian operator \(W\) such that, for every \(\psi \) of Schmidt rank at most \(n\),

\begin{align} \operatorname{Re}\operatorname{tr}(W\rho ) & {\lt}0, \notag \\ \operatorname{Re}\langle \psi |W|\psi \rangle & \ge 0. \notag \end{align}

This is Wolf’s Proposition 3.3 [ Wol12 , Chapter 3, Proposition 3.3 ] : a state has Schmidt number larger than \(n\) exactly when it is detected by an entanglement witness for \(S_n\).

Proof

The forward implication is the separating-hyperplane construction (22.13.13). For the converse, suppose \(\rho \) had Schmidt number at most \(n\), so \(\rho =\sum _i|\psi _i\rangle \langle \psi _i|\) with each \(\psi _i\) of Schmidt rank at most \(n\). By linearity of the trace, \(\operatorname{Re}\operatorname{tr}(W\rho )=\sum _i\operatorname{Re}\operatorname{tr}\! (W|\psi _i\rangle \langle \psi _i|)\), a sum of non-negative terms, contradicting \(\operatorname{Re}\operatorname{tr}(W\rho ){\lt}0\). This converse uses no density-matrix hypotheses on \(\rho \).

Theorem 22.13.15 Surjectivity of the Choi correspondence
#

Assume \(D{\gt}0\). Every bipartite matrix \(W\) on \(\mathbb {C}^D\otimes \mathbb {C}^D\) is the Choi matrix \(\tau _T=(T\otimes \mathbb {1})(|\Omega \rangle \langle \Omega |)\) of some linear map \(T\colon M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\).

Proof

The Choi correspondence \(T\mapsto \tau _T\) is complex-linear and injective. Its domain, the space of linear maps on \(M_{D}(\mathbb {C})\), and its codomain, the bipartite matrix space on \(\mathbb {C}^D\otimes \mathbb {C}^D\), both have complex dimension \(D^4\), so the injective map is also surjective. Hence every \(W\) is a Choi matrix.

Theorem 22.13.16 A witness is the Choi matrix of an \(n\)-positive map

Assume \(D{\gt}0\). Let \(W\) be a Hermitian operator on \(\mathbb {C}^D\otimes \mathbb {C}^D\) with \(\operatorname{Re}\langle \psi |W|\psi \rangle \ge 0\) for every \(\psi \) of Schmidt rank at most \(n\). Then \(W\) is the Choi matrix of an \(n\)-positive map \(T\). This is the Choi–Jamiołkowski translation of the entanglement witness of Wolf’s Proposition 3.3 into the \(n\)-positive map of Wolf’s Proposition 3.4 [ Wol12 , Chapter 3, Proposition 3.4 ] .

Proof

By the surjectivity of the Choi correspondence (22.13.15) there is a linear map \(T\) with \(\tau _T=W\). Because \(W\) is Hermitian, the Choi quadratic form \(\langle \psi |W|\psi \rangle \) is real, and it equals the witness expectation \(\operatorname{tr}(W|\psi \rangle \langle \psi |)\); the witness condition makes it non-negative on every vector of Schmidt rank at most \(n\). This is exactly the Schmidt-rank Choi criterion (22.2.3.5) for \(n\)-positivity of \(T\).

Theorem 22.13.17 Choi trace pairing through the trace-pairing adjoint

For a linear map \(T\colon M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) with Choi matrix \(\tau _T\) and any bipartite matrix \(\rho \) on \(\mathbb {C}^D\otimes \mathbb {C}^D\),

\begin{align} \operatorname{tr}(\tau _T\, \rho ) & =\langle \Omega |(T^{*}\otimes \mathbb {1})(\rho )|\Omega \rangle , \notag \end{align}

where \(T^{*}\) is the trace-pairing adjoint of \(T\).

Proof

Since \(\tau _T=(T\otimes \mathbb {1})(|\Omega \rangle \langle \Omega |)\), cyclicity of the trace gives \(\operatorname{tr}(\tau _T\rho )=\operatorname{tr}(\rho \, (T\otimes \mathbb {1})(|\Omega \rangle \langle \Omega |))\). The \(\mathbb {1}\)-ampliation of the trace-pairing adjoint is the trace-pairing adjoint of the ampliation, so moving \(T\) across the trace pairing replaces \((T\otimes \mathbb {1})\) by \((T^{*}\otimes \mathbb {1})\) acting on \(\rho \) and turns the pairing against \(|\Omega \rangle \langle \Omega |\) into the quadratic form \(\langle \Omega | \cdot \, |\Omega \rangle \).

Let \(\rho \) be a trace-one Hermitian bipartite state on \(\mathbb {C}^D\otimes \mathbb {C}^D\) whose Schmidt number exceeds \(n\). Then there is an \(n\)-positive map \(T\colon M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) such that \((T\otimes \mathbb {1})(\rho )\) is not positive semidefinite. This is the if direction of Wolf’s Proposition 3.4 [ Wol12 , Chapter 3, Proposition 3.4 ] .

Proof

The entanglement witness \(W\) for \(\rho \) (22.13.13) is the Choi matrix of an \(n\)-positive map \(P\) (22.13.16). Its trace-pairing adjoint \(T=P^{*}\) is again \(n\)-positive (22.3.2). By the Choi trace pairing through the trace-pairing adjoint (22.13.17), \(\langle \Omega |(T\otimes \mathbb {1})(\rho )|\Omega \rangle =\operatorname{tr}(W\rho )\), whose real part is negative. A positive semidefinite matrix has non-negative quadratic forms, so \((T\otimes \mathbb {1})(\rho )\) is not positive semidefinite.

22.14 Positive Schwarz maps outside complete positivity

The following example shows that the Schwarz inequality does not force complete positivity.

22.14.1 A positive Schwarz map that is not completely positive

Example 22.14.1.1 Transpose-trace map on \(M_{2}(\mathbb {C})\)
#

Consider the linear map \(T : M_{2}(\mathbb {C}) \to M_{2}(\mathbb {C})\) defined by

\begin{align} T(A) & =\frac{1}{2} A^T+\frac{1}{4}\operatorname{tr}(A)\mathbb {1}. \notag \end{align}

This is the map from [ Wol12 , Example 5.3 ] .

Theorem 22.14.1.2 The transpose-trace map is positive

The map from Example 22.14.1.1 is positive.

Proof

It is a non-negative linear combination of the transpose map and the map \(A \mapsto \operatorname{tr}(A) \mathbb {1}\), and both of these maps send positive semidefinite matrices to positive semidefinite matrices.

Theorem 22.14.1.3 The transpose-trace map satisfies the Schwarz inequality
#

For every \(A \in M_{2}(\mathbb {C})\), \(T(A^\dagger A)-T(A^\dagger )T(A)\ge 0\), where \(T\) is the map from Example 22.14.1.1.

Proof

Write the Schwarz gap as \(F(A)\). One checks that \(F(A + \lambda \mathbb {1}) = F(A)\) for every scalar \(\lambda \), so it is enough to treat the case \(\operatorname{tr}(A) = 0\). In that case a direct \(2 \times 2\) computation shows that \(F(A)\) dominates \(\frac{1}{2} (A^\dagger A)^T\), hence is positive semidefinite.

Theorem 22.14.1.4 The transpose-trace map is not completely positive

The map from Example 22.14.1.1 is not completely positive.

Proof

Compute the Choi matrix of \(T\) and test it on the antisymmetric vector \(|01\rangle - |10\rangle \). The resulting expectation value is negative, so the Choi matrix is not positive semidefinite.