Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proposition 21: rank-three detector channels are not 3-non-entangling

Open
QAlgorithms.Papers.Independent.Intakethird100.P19.rankThreeMap_notThreeNonEntangling

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All registers are finite-dimensional complex spaces with positive local dimensions and fixed product bases. Let d≥3d\ge3d≥3 and (d−3)/3<β≤(d−2)/2(d-3)/3<\beta\le(d-2)/2(d−3)/3<β≤(d−2)/2, and let ρd(β)=[I−(β+1)Fd/d]/[d2−(β+1)]\rho_d(\beta)=[I-(\beta+1)F_d/d]/[d^2-(\beta+1)]ρd​(β)=[I−(β+1)Fd​/d]/[d2−(β+1)] be the Werner state. For every unit ket η\etaη of Schmidt rank three such that Tr⁡(ρd(β)Wη)<0\operatorname{Tr}(\rho_d(\beta)W_\eta)<0Tr(ρd​(β)Wη​)<0, construct

Wη=(∣η⟩⟨η∣)Γ,Aη=(Wη+2I)/3,Λη(X)=Tr⁡(AηX)I4/4+Tr⁡((I−Aη)X)ϕ2+.W_\eta=(|\eta\rangle\langle\eta|)^\Gamma,\qquad A_\eta=(W_\eta+2I)/3,\qquad \Lambda_\eta(X)=\operatorname{Tr}(A_\eta X)I_4/4+\operatorname{Tr}((I-A_\eta)X)\phi_2^+.Wη​=(∣η⟩⟨η∣)Γ,Aη​=(Wη​+2I)/3,Λη​(X)=Tr(Aη​X)I4​/4+Tr((I−Aη​)X)ϕ2+​.

Then Λη\Lambda_\etaΛη​ is a channel, is dually non-entangling, has PPT grouped Choi operator, sends ρd(β)\rho_d(\beta)ρd​(β) to an LOCC-distillable two-qubit state, and is not 333-non-entangling. Dually non-entangling means that the channel and its trace dual preserve the separable positive cone; 333-non-entangling tests preservation after adjoining a three-dimensional identity ancilla at each party. LOCC-distillability is trace-norm convergence of deterministic LOCC outputs on tensor powers to ϕ2+\phi_2^+ϕ2+​.

The same conclusions are also explicitly recorded for the canonical detector η=(∣00⟩+∣11⟩+∣22⟩)/3\eta=(|00\rangle+|11\rangle+|22\rangle)/\sqrt3η=(∣00⟩+∣11⟩+∣22⟩)/3​ in the first three local coordinates.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P19
Formal statement
noncomputable section

open QAlgorithms QAlgorithms.Entanglement Filter

open scoped Matrix ComplexOrder ComplexConjugate ENNReal

attribute [local instance] Classical.propDecidable Classical.decEq

namespace QAlgorithms.Papers.Independent.Intakethird100.P19

open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)

open QAlgorithms.Papers.Independent.Information100.P19 (Bip)

open QAlgorithms.Papers.Independent.Information100.P69 (CP)

open QAlgorithms.Papers.Independent.Information100.P71 (supportPower SupportIncluded)

open QAlgorithms.Papers.Independent.Dependency50.P19 (epr)

/-- Proposition 21, PDF p.23: the Eq.(21) channels for every unit
Schmidt-rank-three detector of the Werner state are not 3-NE. The rank
and negative pairing specify the detector used in the source proof; all
channel, preservation and distillability properties remain conclusions.
The canonical equal-amplitude detector is also recorded explicitly. -/
theorem rankThreeMap_notThreeNonEntangling (d : ℕ) (hd : 3 ≤ d)
    (beta : ℝ) (hlo : ((d : ℝ) - 3) / 3 < beta)
    (hhi : beta ≤ ((d : ℝ) - 2) / 2) :
    (IsChannel (rankThreeMap d) ∧ DNE (rankThreeMap d) ∧ ChoiPPT (rankThreeMap d) ∧
      LOCCDistillable (rankThreeMap d (betaWernerState d beta)) ∧ ¬ KNE 3 (rankThreeMap d)) ∧
    ∀ eta : UnitBipartiteKet d d, finiteSchmidtRank eta.ket = 3 →
      (betaWernerState d beta * partialTransposeFirst eta.rho).trace.re < 0 →
      let L := witnessMap (partialTransposeFirst eta.rho)
      IsChannel L ∧ DNE L ∧ ChoiPPT L ∧
        LOCCDistillable (L (betaWernerState d beta)) ∧ ¬ KNE 3 L := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P19

end
Source
Entanglement manipulation and distillability beyond LOCC, arXiv:1711.03835v2, PDF p. 23, Proposition 21
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every natural number d≥3d\ge3d≥3 and every real number β\betaβ satisfying d−33<β≤d−22\frac{d-3}{3}<\beta\le\frac{d-2}{2}3d−3​<β≤2d−2​, the following assertions hold. Use basis indices 0,…,s−10,\ldots,s-10,…,s−1 for Cs\mathbb C^sCs, write EijE_{ij}Eij​ for a matrix unit, and write ∣v⟩⟨v∣|v\rangle\langle v|∣v⟩⟨v∣ for the matrix with entries vivj‾v_i\overline{v_j}vi​vj​​. For a bipartite matrix, define its partial transpose on the first factor by T1(X)(i,j),(i′,j′)=X(i′,j),(i,j′)T_1(X)_{(i,j),(i',j')}=X_{(i',j),(i,j')}T1​(X)(i,j),(i′,j′)​=X(i′,j),(i,j′)​. Let FdF_dFd​ exchange the two factors, so its ((i,j),(i′,j′))((i,j),(i',j'))((i,j),(i′,j′))-entry is 111 when i=j′i=j'i=j′ and j=i′j=i'j=i′, and 000 otherwise, and put

ρd,β=I−β+1dFdd2−(β+1),rd=13∑i=02∣i,i⟩,Ωs=1s∑i,j=0s−1∣i,i⟩⟨j,j∣.\rho_{d,\beta}=\frac{I-\frac{\beta+1}{d}F_d}{d^2-(\beta+1)},\qquad r_d=\frac1{\sqrt3}\sum_{i=0}^{2}|i,i\rangle,\qquad \Omega_s=\frac1s\sum_{i,j=0}^{s-1}|i,i\rangle\langle j,j|.ρd,β​=d2−(β+1)I−dβ+1​Fd​​,rd​=3​1​i=0∑2​∣i,i⟩,Ωs​=s1​i,j=0∑s−1​∣i,i⟩⟨j,j∣.

For any matrix WWW on Cd⊗Cd\mathbb C^d\otimes\mathbb C^dCd⊗Cd, define the map to matrices on C2⊗C2\mathbb C^2\otimes\mathbb C^2C2⊗C2 by

AW=W+2I3,LW(X)=tr⁡(AWX)I44+tr⁡((I−AW)X)Ω2.A_W=\frac{W+2I}{3},\qquad L_W(X)=\operatorname{tr}(A_WX)\frac{I_4}{4} +\operatorname{tr}((I-A_W)X)\Omega_2.AW​=3W+2I​,LW​(X)=tr(AW​X)4I4​​+tr((I−AW​)X)Ω2​.

Here a density matrix means a positive semidefinite matrix of trace 111; a separable positive matrix means any finite sum ∑j=0q−1wjAj⊗Bj\sum_{j=0}^{q-1}w_j A_j\otimes B_j∑j=0q−1​wj​Aj​⊗Bj​, where qqq is a natural number, every wj≥0w_j\ge0wj​≥0, and every Aj,BjA_j,B_jAj​,Bj​ is a density matrix, with no requirement that the weights sum to 111; the empty sum is allowed and equals zero. A map is a channel when it has a finite Kraus representation L(X)=∑jKjXKj†L(X)=\sum_jK_jXK_j^\daggerL(X)=∑j​Kj​XKj†​ with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. Say that a map has the separability-preserving property when it has a finite Kraus representation, without a completeness requirement, and sends every separable positive matrix to a separable positive matrix. Its trace-bilinear dual is the map defined by (L∨(Y))ij=tr⁡(L(Eji)Y)(L^\vee(Y))_{ij}=\operatorname{tr}(L(E_{ji})Y)(L∨(Y))ij​=tr(L(Eji​)Y), with no complex conjugation in this pairing. For a map from the bipartite system A⊗BA\otimes BA⊗B to C⊗DC\otimes DC⊗D, define its party-grouped Choi matrix by

CL((c,a),(e,b)),((c′,a′),(e′,b′))=L(E(a,b),(a′,b′))(c,e),(c′,e′).C_L{}_{((c,a),(e,b)),((c',a'),(e',b'))} =L(E_{(a,b),(a',b')})_{(c,e),(c',e')}.CL​((c,a),(e,b)),((c′,a′),(e′,b′))​=L(E(a,b),(a′,b′)​)(c,e),(c′,e′)​.

The Choi condition used here means that LLL has a finite Kraus representation and that both CLC_LCL​ and its partial transpose on the grouped factor C⊗AC\otimes AC⊗A are positive semidefinite. The property with index 333 that is excluded below means that LLL has a finite Kraus representation and that its extension by a three-dimensional identity system on each party has the separability-preserving property across (A⊗C3)∣(B⊗C3)(A\otimes\mathbb C^3)\mid(B\otimes\mathbb C^3)(A⊗C3)∣(B⊗C3); explicitly, this extension satisfies

L~(X)((c,u),(e,v)),((c′,u′),(e′,v′))=L ⁣([X((a,u),(b,v)),((a′,u′),(b′,v′))](a,b),(a′,b′))(c,e),(c′,e′),\widetilde L(X)_{((c,u),(e,v)),((c',u'),(e',v'))} =L\!\left( [X_{((a,u),(b,v)),((a',u'),(b',v'))}]_{(a,b),(a',b')} \right)_{(c,e),(c',e')},L(X)((c,u),(e,v)),((c′,u′),(e′,v′))​=L([X((a,u),(b,v)),((a′,u′),(b′,v′))​](a,b),(a′,b′)​)(c,e),(c′,e′)​,

where u,u′,v,v′∈{0,1,2}u,u',v,v'\in\{0,1,2\}u,u′,v,v′∈{0,1,2}. Finally, call a bipartite matrix σ\sigmaσ distillable here when it is a density matrix and there exists a sequence of channels DnD_nDn​, each realizable by the following finite recursive local construction, such that ∥Dn(σ⊗(n+1))−Ω2∥1→0\|D_n(\sigma^{\otimes(n+1)})-\Omega_2\|_1\to0∥Dn​(σ⊗(n+1))−Ω2​∥1​→0 as n→∞n\to\inftyn→∞: the construction starts with identity maps and permits either party to apply a finite complete local Kraus family and then, for each Kraus outcome, continue with another map in the construction, summing the resulting branches. More explicitly, an Alice step has the form X↦∑iDi((Ki⊗I)X(Ki⊗I)†)X\mapsto\sum_iD_i((K_i\otimes I)X(K_i\otimes I)^\dagger)X↦∑i​Di​((Ki​⊗I)X(Ki​⊗I)†), with ∑iKi†Ki=I\sum_iK_i^\dagger K_i=I∑i​Ki†​Ki​=I, and a Bob step uses I⊗KiI\otimes K_iI⊗Ki​ instead; local dimensions and the finite number of outcomes are natural numbers, including zero where the required equations permit it. The copies are grouped by party and indexed using the fixed bijections between strings of basis indices and their finite index sets, and ∥X∥1=Re⁡tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{tr}\sqrt{X^\dagger X}∥X∥1​=RetrX†X​. With these meanings, LT1(∣rd⟩⟨rd∣)L_{T_1(|r_d\rangle\langle r_d|)}LT1​(∣rd​⟩⟨rd​∣)​ is a channel, both it and its trace-bilinear dual have the separability-preserving property, it satisfies the Choi condition, its output on ρd,β\rho_{d,\beta}ρd,β​ is distillable, and it does not have the property with index 333. Moreover, for every unit vector η∈Cd⊗Cd\eta\in\mathbb C^d\otimes\mathbb C^dη∈Cd⊗Cd, let ρη=∣η⟩⟨η∣\rho_\eta=|\eta\rangle\langle\eta|ρη​=∣η⟩⟨η∣. If exactly three eigenvalues of the reduced matrix (∑bηi,bηj,b‾)ij(\sum_b\eta_{i,b}\overline{\eta_{j,b}})_{ij}(∑b​ηi,b​ηj,b​​)ij​, counted with multiplicity, are strictly positive, and

Re⁡tr⁡ ⁣(ρd,β T1(ρη))<0,\operatorname{Re}\operatorname{tr}\!\left(\rho_{d,\beta}\,T_1(\rho_\eta)\right)<0,Retr(ρd,β​T1​(ρη​))<0,

then LT1(ρη)L_{T_1(\rho_\eta)}LT1​(ρη​)​ is a channel, both it and its trace-bilinear dual have the separability-preserving property, it satisfies the Choi condition, its output on ρd,β\rho_{d,\beta}ρd,β​ is distillable, and it does not have the property with index 333.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me