---
title: Choi-Rank Separation Criterion
url: https://www.emergentmind.com/topics/choi-rank-separation-criterion
type: topic
---

# Choi-Rank Separation Criterion

The expression “Choi-Rank Separation Criterion” is not used uniformly in the literature cited here. A plausible umbrella usage is to treat it as an *Editor’s term* for a family of criteria in which a Choi matrix, Choi state, Choi polynomial, or Choi rank separates one structural class from another. In the standard matrix-algebra setting, the Choi matrix of a linear map \(\Phi:M_n\to M_m\) is
\[
C_\Phi=\sum_{i,j=1}^n e_{ij}\otimes \Phi(e_{ij}),
\]
and the Choi rank of a quantum channel is the rank of \(C(\Phi)\) [2206.09324], [1710.11416]. Across operator algebras and quantum information, the associated separation mechanisms include complete-positivity tests, rank-one Kraus criteria for separability, product-vector criteria for low-rank PPT states, entropy- and moment-based witnesses for non-Markovianity, and inequalities comparing Choi rank with other operational ranks.

## 1. Terminological scope and basic Choi constructions

The basic Choi correspondence identifies complete positivity with positivity of a Choi object. For a linear map \(\Phi:M_n\to M_m\), Choi’s theorem states
\[
\Phi \text{ is completely positive } \iff C_\Phi\ge 0,
\]
with \(C_\Phi\) defined using the standard matrix units \(\{e_{ij}\}\) [2206.09324]. The same paper studies generalized Choi constructions of the form
\[
C_B=\sum_{i,j=1}^n b_{ij}\otimes \Phi(b_{ij})
\]
for an alternative basis \(B=\{b_{ij}\}\subset M_n\), and also the tensor-level formulation
\[
C_\Phi=(\operatorname{id}_n\otimes \Phi)(E),
\]
where \(E\in M_n\otimes M_n\) is fixed [2206.09324].

In quantum information, the same channel-state duality appears as the Jamiołkowski–Choi construction. For a dynamical map \(\Lambda\), the Choi state is written as
\[
\mathcal{C}_{\Lambda}(t,t_0)=(\mathbb{I}\otimes \Lambda(t,t_0))\ket{\phi}\bra{\phi},
\]
with \(\ket{\phi}\) maximally entangled; complete positivity is equivalent to \(\mathcal{C}_{\Lambda}\ge 0\) [2303.03615]. For bipartite states, the duality is expressed by associating to \(\rho_{AB}\) a completely positive map \(\Lambda_\rho\) satisfying
\[
(I_A\otimes \Lambda_\rho)\,|T\rangle\langle T|=\rho_{AB},
\]
so that separability can be reformulated as a property of the associated map [1909.13309].

A recurrent misconception is that every “Choi-based separation” is literally a rank criterion. The cited works do not support that identification. Some criteria are genuinely rank-theoretic, such as Choi-rank interval theorems for channels or rank-one Kraus conditions for separability [1710.11416], [1909.13309]. Others are positivity, kernel, or product-vector criteria phrased through Choi objects rather than through matrix rank itself [1304.6664], [1911.05303].

## 2. Choi–Effros multiplication and kernel–ideal separation

In operator-algebraic form, the Choi–Effros theorem concerns a completely positive projection rather than a finite-dimensional Choi matrix. If \(A\) is a \(C^*\)-algebra and \(\phi:A\to A\) is completely positive, contractive, and idempotent, then there exist a \(C^*\)-algebra \(B\) and a complete order isomorphism
\[
p:B\to \operatorname{Ran}(\phi)
\]
such that
\[
p(ab)=\phi(p(a)p(b)) \qquad \text{for all } a,b\in B
\]
[1304.6664]. The induced product on the range is the Choi–Effros multiplication
\[
x\circ y:=\phi(xy), \qquad x,y\in \operatorname{Ran}(\phi).
\]

The short proof in “On the Choi-Effros multiplication” identifies the decisive structural separator not as a rank condition but as a kernel–ideal criterion. Let \(J\) be the closed right ideal generated by
\[
xy-\phi(xy), \qquad x,y\in \operatorname{Ran}(\phi).
\]
The key technical statement is
\[
\ker(\phi)=J
\]
[1304.6664]. The inclusion \(J\subseteq \ker(\phi)\) is obtained using the Kadison–Schwarz inequality
\[
\phi(t^*t)\ge \phi(t)^*\phi(t),
\]
while the reverse inclusion is established by induction on products \(u=x_1x_2\cdots x_k\) with \(x_j\in \operatorname{Ran}(\phi)\), showing that
\[
u-\phi(u)\in J.
\]

Once \(\ker(\phi)\) is recognized as a bilateral ideal, the quotient \(A/\ker(\phi)\) is a \(C^*\)-algebra, and \(\operatorname{Ran}(\phi)\) inherits associativity and \(*\)-compatibility from the quotient model [1304.6664]. The paper explicitly states that it does **not** discuss “Choi-rank separation criteria.” The closest relevant criterion is the ideal characterization of \(\ker(\phi)\) by multiplicative defects. This suggests an operator-algebraic notion of separation by failure of multiplicativity on the range rather than by matrix rank.

## 3. Generalized Choi correspondences and the rank-one/full-Schmidt-rank condition

A more literal separation theorem appears in the generalized Choi correspondence studied by Kye. If \(E\in M_n\otimes M_n\) and \(E=C_\varphi\) for a linear map \(\varphi:M_n\to M_n\), then the following are equivalent: \(E\) satisfies the Choi correspondence; \(\varphi\) is a complete order isomorphism; \(\varphi=\operatorname{Ad}_s\) for some nonsingular \(s\in M_n\); and \(E\) is a positive rank-one matrix whose range vector has full Schmidt rank [2206.09324]. In this setting, the generalized criterion
\[
\Phi \text{ is CP } \iff (\operatorname{id}_n\otimes \Phi)(E)\ge 0
\]
holds for every output dimension \(m\) exactly under those equivalent conditions.

This theorem turns the generalized Choi problem into a precise separation between faithful and non-faithful test tensors. The tensor \(E\) must be rank one, positive, and supported on a vector of full Schmidt rank; otherwise positivity of \((\operatorname{id}\otimes \Phi)(E)\) does not characterize complete positivity for all \(\Phi\) [2206.09324]. The equivalence with \(\varphi=\operatorname{Ad}_s\) identifies the relevant geometric symmetry as a complete order isomorphism.

The basis-change version sharpens an earlier sufficient condition of Paulsen and Shultz into a necessary-and-sufficient characterization. For a basis \(B=\{b_{ij}\}\) of \(M_n\), the criterion
\[
\Phi:M_n\to M_m \text{ is CP } \iff C_B\ge 0
\]
for every \(m\) holds if and only if
\[
M_B=\operatorname{Ad}_s
\]
for a nonsingular \(s\in M_n\), equivalently if and only if there exists a basis \(\{s_i\}\) of \(\mathbb{C}^n\) such that
\[
b_{ij}=|s_i\rangle\langle s_j|,\qquad i,j=1,\dots,n
\]
[2206.09324]. Thus only bases arising as matrix units relative to some vector basis preserve the Choi positivity criterion.

The paper also gives a dual-cone interpretation: the bilinear pairing
\[
\langle \Phi,\Psi\rangle=\operatorname{Tr}(C_\Phi\,C_\Psi^t)
\]
makes the cone of completely positive maps self-dual, and the generalized Choi criterion is equivalent to a cone identity
\[
CP[M_m,M_n]=CP[M_m,M_n]\circ \varphi^* .
\]
This is a separation statement at the level of cone automorphisms rather than at the level of spectral rank alone [2206.09324].

## 4. Separability, entanglement breaking, and product-vector criteria

For bipartite states, the strongest rank-based separation mechanism in the cited literature is the channel-state reformulation of separability. Given \(\rho_{AB}\), one defines
\[
\Lambda_\rho[\sigma]=m\,\mathrm{Tr}_A\{\sigma^T\otimes I_B\,\rho_{AB}\},
\]
and obtains an operator-sum representation
\[
\Lambda_\rho[\sigma]=\sum_\alpha M_\alpha \sigma M_\alpha^\dagger
\]
[1909.13309]. The central lemma states that \(\rho\) is separable if and only if the operators \(M_\alpha\) can be transformed by
\[
N_\mu=\sum_\alpha V_{\mu\alpha}M_\alpha
\]
to rank-one operators \(N_\mu\) [1909.13309]. Equivalently, the Choi matrix of the associated map is separable exactly when the map is entanglement-breaking, and this is equivalent to the existence of a rank-one Kraus decomposition.

The same paper derives spectral consequences from this rank-one structure. If
\[
\rho_{AB}=\sum_\alpha p_\alpha |\psi_\alpha\rangle\langle \psi_\alpha|
\]
is a spectral decomposition and \(\chi_i^{(\alpha)}\) are the eigenvalues of the reduced state of \(|\psi_\alpha\rangle\), then
\[
\chi_1^{(\alpha)}\ge p_\alpha
\]
and
\[
\sum_\alpha \chi_1^{(\alpha)}\ge 1
\]
are necessary conditions for separability [1909.13309]. For isotropic states, applying the criterion yields the threshold \(F\le 1/d\), reproducing the known separability boundary for that family [1909.13309].

A distinct low-rank separability criterion appears for multipartite PPT states of rank at most four. Theorem 28 states that a multipartite PPT state of rank \(<4\) is separable, while a rank-four PPT state is entangled if and only if its range \(R(p)\) is a completely entangled subspace, i.e.
\[
p\text{ is entangled } \iff R(p)\text{ contains no product vectors}
\]
[1301.2372]. In the \(3\times 3\) and \(2\times 2\times 2\) cases, the product-vector question is reduced to the vanishing of the Chow form in the Plücker coordinates of the range, giving an explicit polynomial test [1301.2372].

These results show that “rank separation” in separability theory can mean at least three different things: rank-one operator-sum form for the Choi-dual map, low-rank restrictions on the global state, and absence or presence of product vectors in the relevant support subspace. The cited papers do not collapse these into a single theorem, but they place them in a common Choi/Jamiołkowski framework [1909.13309], [1301.2372].

## 5. Choi polynomials, positive maps, and extremality

A polynomial version of Choi-based separation is developed through the Choi polynomial
\[
P_{\phi}(x,y)=y^*\phi(xx^*)y,
\]
for a linear map \(\phi:M_m\to M_n\) [2604.27034]. The paper gives the identity
\[
P_{\phi}(x,y)=\langle C_\phi(\overline{x}\otimes y),\overline{x}\otimes y\rangle,
\]
so the Choi polynomial is the expectation of the Choi matrix on product vectors [2604.27034]. Positivity of the map is equivalent to \(P_\phi(x,y)\ge 0\) for all \(x,y\), or equivalently to block positivity of \(C_\phi\). Complete positivity is equivalent to \(C_\phi\succeq 0\), and complete copositivity to \(C_\phi^\Gamma\succeq 0\) [2604.27034].

The same work introduces the decomposable Gram cone
\[
\mathcal D(m,n)=\{W=Q+R^\Gamma:\ Q\succeq 0,\ R\succeq 0\},
\]
and states that decomposability of the map is equivalent to membership of the associated Gram matrix in \(\mathcal D(m,n)\) [2604.27034]. Its principal separation mechanism is a kernel/product-vector condition: for a decomposable \(W=Q+R^\Gamma\), minimality is equivalent to
\[
\ker Q\cap \ker R \text{ has no nonzero product vectors}.
\]
Under this condition, subtraction of a small multiple of the identity preserves positivity on product vectors while breaking decomposability, yielding indecomposable positive maps and PPT entanglement witnesses [2604.27034].

A related issue is extremality of the Choi map. The note “Notes on extremality of the Choi map” proves that the Choi map generates an extreme ray in the cone \(\mathcal P(M_3)\) of positive linear maps on \(M_3\) [1306.0945]. The paper also corrects two misclaims: extremality of the associated real biquadratic form does not imply extremality in the full complex cone, and the correspondence between positive semidefinite biquadratic forms and positive maps does not extend trivially from real symmetric matrices to all of \(M_n\) [1306.0945]. This controversy matters because separation arguments based only on the real symmetric restriction can fail to establish full complex extremality.

## 6. Choi-state positivity and moment criteria for non-Markovianity

In open-system dynamics, the relevant separation is between CP-divisible Markovian evolution and non-Markovian evolution. One entropy-based witness uses the Choi state of the short-time map
\[
\operatorname{Choi}(\Lambda)=[\mathbb{I}\otimes \Lambda(t,t+\varepsilon)]\bigl(|\psi\rangle\langle\psi|\bigr),
\qquad
|\psi\rangle=\frac{1}{\sqrt d}\sum_{i=1}^d |i\rangle\otimes |i\rangle,
\]
and the normalized linear entropy
\[
S_l(\rho)=\frac{d}{d-1}\bigl(1-\operatorname{Tr}(\rho^2)\bigr)
\]
[1911.05303]. The theorem stated in the paper is that the dynamics is non-Markovian if
\[
S_l(\operatorname{Choi}(\Lambda))<0.
\]
The underlying logic is that CP divisibility implies positivity of the Choi state, whereas violation of positivity allows negative eigenvalues and therefore negative values of the entropy formula [1911.05303].

A moment-based version replaces entropy by spectral moments
\[
r_n=\mathrm{Tr}\!\left[(\mathcal{C}_{\Lambda}(t,s))^n\right], \qquad n=1,2,3,\dots
\]
and proves that Markovian dynamics must satisfy
\[
r_2^2\le r_3,
\]
equivalently
\[
\big(\mathrm{Tr}[(\mathcal{C}_{\Lambda})^2]\big)^2 \le \mathrm{Tr}[(\mathcal{C}_{\Lambda})^3]
\]
[2303.03615]. Violation,
\[
r_2^2-r_3>0,
\]
witnesses CP indivisibility and hence non-Markovianity [2303.03615].

Both papers explicitly support a Choi-based separation viewpoint but do **not** formulate a literal Choi-rank criterion. The separator is failure of positivity or of a moment inequality for the intermediate-map Choi state, not a theorem about the rank of the Choi matrix itself [1911.05303], [2303.03615].

## 7. Choi rank as a quantitative separator for channels

The most direct use of Choi rank as a separating invariant occurs in the study of channels with prescribed marginals. For density matrices \(\sigma_1\in D_m\) and \(\sigma_2\in D_n\), let
\[
S(\sigma_1,\sigma_2)=\{\rho\in D_{mn}:\operatorname{tr}_1(\rho)=\sigma_2,\ \operatorname{tr}_2(\rho)=\sigma_1\}.
\]
If \(r_1=\operatorname{rank}(\sigma_1)\ge r_2=\operatorname{rank}(\sigma_2)\), Theorem 2.1 states that there exists a minimum achievable rank \(r<r_1\), and a rank \(k\) occurs in \(S(\sigma_1,\sigma_2)\) if and only if
\[
r\le k\le r_1r_2
\]
[1710.11416]. The minimum rank is determined by a finite algorithm based on Klyachko/Horn inequalities [1710.11416].

This translates directly to channels because
\[
\operatorname{rank}(C(\Phi))=\text{Choi rank of }\Phi,
\]
and a channel \(\Phi:M_m\to M_n\) with \(\Phi(I_m/m)=\sigma_2\) corresponds exactly to a state in \(S(I_m/m,\sigma_2)\) [1710.11416]. Hence the possible Choi ranks of such channels are precisely the integers
\[
r,\ r+1,\ \dots,\ m\,\operatorname{rank}(\sigma_2).
\]
For unital channels on \(M_n\), every rank
\[
1\le k\le n^2
\]
occurs [1710.11416].

A different separation problem compares Choi rank \(r\) with mixed-unitary rank \(N\). For every mixed-unitary channel,
\[
N\ge r
\]
because every mixed-unitary decomposition is also a Kraus decomposition [2003.14405]. The paper proves the universal upper bound
\[
N\le r^2-r+1,
\]
and the special case \(N=r\) for \(r\le 2\) [2003.14405]. It also gives the first known examples with strict separation \(N>r\): there exist mixed-unitary channels with Choi rank \(d+1\) and mixed-unitary rank \(2d\) for infinitely many positive integers \(d\), including every prime power \(d\) [2003.14405].

The structural mechanism behind that separation is the operator system
\[
\mathcal S_\Phi=\operatorname{span}\{A_j^\ast A_k:1\le j,k\le r\}.
\]
If
\[
\dim(\mathcal S_\Phi)=r^2-r+1,
\]
then \(\Phi\) has mixed-unitary rank \(r\) and a unique mixed-unitary decomposition [2003.14405]. A direct-sum construction then produces channels whose mixed-unitary rank doubles while the Choi rank increases by only one. This is an explicit quantitative realization of Choi-rank separation in channel theory.

Source: https://www.emergentmind.com/topics/choi-rank-separation-criterion