Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Explicit single-copy PPT channel with fidelity above the distillation threshold

Open
QAlgorithms.Papers.Independent.Intakethird100.P43.single_copy_fidelity

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

prove2quantum

All operators act on a finite bipartite space Cd⊗Cd\mathbb C^d\otimes\mathbb C^dCd⊗Cd in a fixed product basis. Write Γ=T2\Gamma=T_2Γ=T2​ for Bob's partial transpose and Pm=∣ψm⟩⟨ψm∣P_m=|\psi_m\rangle\langle\psi_m|Pm​=∣ψm​⟩⟨ψm​∣, where ∣ψm⟩=m−1/2∑i∣ii⟩|\psi_m\rangle=m^{-1/2}\sum_i|ii\rangle∣ψm​⟩=m−1/2∑i​∣ii⟩. A density operator is positive semidefinite with complex trace exactly one. An admissible PPT map is complex-linear, positive and trace preserving, and ΓoutTΓin\Gamma_{\rm out}T\Gamma_{\rm in}Γout​TΓin​ is positive on every positive operator. A PPT channel is additionally completely positive; complete positivity of the transpose-conjugated map is not required. Fidelity means the overlap tr⁡(PmT(ρ))\operatorname{tr}(P_m T(\rho))tr(Pm​T(ρ)).

Let d≥1d\ge1d≥1, m≥2m\ge2m≥2, and let ρ\rhoρ be an NPT density operator. Let PnegP_{\rm neg}Pneg​ be the spectral projector of ρΓ\rho^\GammaρΓ on its strictly negative eigenvalues, and let N(ρ)\mathcal N(\rho)N(ρ) be the sum of their absolute values. The norm ∥⋅∥∞\|\cdot\|_\infty∥⋅∥∞​ is the operator norm. For

0<ϵ≤min⁡{2,∥PnegΓ∥∞−1},A=I−ϵPnegΓm,0<\epsilon\le\min\{2,\|P_{\rm neg}^\Gamma\|_\infty^{-1}\},\qquad A=\frac{I-\epsilon P_{\rm neg}^\Gamma}{m},0<ϵ≤min{2,∥PnegΓ​∥∞−1​},A=mI−ϵPnegΓ​​,

AAA satisfies the isotropic admissibility constraints, and its channel TAT_ATA​, defined by the two-coefficient formula with B=(I−A)/(m2−1)B=(I-A)/(m^2-1)B=(I−A)/(m2−1), satisfies

tr⁡(ρA)=tr⁡(PmTA(ρ))=1+ϵN(ρ)m>1m.\operatorname{tr}(\rho A)=\operatorname{tr}(P_mT_A(\rho))=\frac{1+\epsilon\mathcal N(\rho)}m>\frac1m.tr(ρA)=tr(Pm​TA​(ρ))=m1+ϵN(ρ)​>m1​.

This is the constructive single-copy threshold witness; it does not claim single-copy perfect distillation.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P43
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder

namespace QAlgorithms.Papers.Independent.Intakethird100.P43

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Information100.P04
  (gamma copies bellProjector negativeProjector werner)

open QAlgorithms.Papers.Independent.Information100.P30 (IsPositiveMap)

/-- PDF p.2, (6)–(7): the explicit single-copy witness, its admissibility and its
channel fidelity, strictly above 1/m. Negativity reuses the frozen first-party scalar;
first- and second-party partial transposes are full transposes and have equal trace norms.
NPT makes P_neg nonzero and the operator-norm reciprocal in the interval nondegenerate. -/
theorem single_copy_fidelity (d m : ℕ) (hd : 0 < d) (hm : 2 ≤ m)
    (rho : Matrix (Fin d × Fin d) (Fin d × Fin d) ℂ)
    (hrho : IsDensityMatrix rho) (hnpt : ¬ (gamma rho).PosSemidef)
    (epsilon : ℝ) (hepsilon : 0 < epsilon)
    (hbound : epsilon ≤ min (2 : ℝ) ((specNorm (gamma (negativeProjector rho)))⁻¹)) :
    let A := negativeSpaceWitness rho m epsilon
    RainsFeasibleEffect m A ∧ IsPositiveConjugatePPTChannel (isotropicPreparation m A) ∧
      effectProb A rho = (1 + epsilon * Entanglement.negativity rho) / (m : ℝ) ∧
      effectProb (bellProjector m) (isotropicPreparation m A rho) = (1 + epsilon * Entanglement.negativity rho) / (m : ℝ) ∧
      1 / (m : ℝ) < effectProb (bellProjector m) (isotropicPreparation m A rho) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P43

end
Source
Distillability via protocols respecting the positivity of partial transpose, arXiv:quant-ph/0104095v2, PDF p. 2, Theorem 1 proof, Eqs. (6)–(7)
Read-back

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

For every pair of natural numbers d>0d>0d>0 and m≥2m\ge2m≥2, every complex matrix ρ\rhoρ indexed by {0,…,d−1}2\{0,\ldots,d-1\}^2{0,…,d−1}2 that is positive semidefinite with trace one, and every real ϵ>0\epsilon>0ϵ>0, define (ΓX)(a,b),(a′,b′)=X(a,b′),(a′,b)(\Gamma X)_{(a,b),(a',b')}=X_{(a,b'),(a',b)}(ΓX)(a,b),(a′,b′)​=X(a,b′),(a′,b)​ and suppose that Γρ\Gamma\rhoΓρ is not positive semidefinite and

ϵ≤min⁡ ⁣{2,1∥ΓQ∥op},Q=1(−∞,0)(Γρ),\epsilon\le\min\!\left\{2,\frac1{\|\Gamma Q\|_{\mathrm{op}}}\right\}, \qquad Q=\mathbf1_{(-\infty,0)}(\Gamma\rho),ϵ≤min{2,∥ΓQ∥op​1​},Q=1(−∞,0)​(Γρ),

where QQQ is obtained by applying the function that is one on negative eigenvalues and zero elsewhere through the continuous functional calculus. Set A=(I−ϵΓQ)/mA=(I-\epsilon\Gamma Q)/mA=(I−ϵΓQ)/m, let PmP_mPm​ have entry 1/m1/m1/m when both row and column pairs have equal components and zero otherwise, and define

Pm(A)(X)=tr⁡(X(I−A))m2−1(I−Pm)+tr⁡(XA)Pm.\mathcal P_m(A)(X) =\frac{\operatorname{tr}(X(I-A))}{m^2-1}(I-P_m)+\operatorname{tr}(XA)P_m.Pm​(A)(X)=m2−1tr(X(I−A))​(I−Pm​)+tr(XA)Pm​.

Then AAA is Hermitian and AAA, I−AI-AI−A, I−mΓAI-m\Gamma AI−mΓA, and I+mΓAI+m\Gamma AI+mΓA are positive semidefinite. The map Pm(A)\mathcal P_m(A)Pm​(A) is positive and trace preserving, satisfies ΓPm(A)(ΓX)≥0\Gamma\mathcal P_m(A)(\Gamma X)\ge0ΓPm​(A)(ΓX)≥0 for every X≥0X\ge0X≥0, and is completely positive, meaning that its blockwise extension by an identity map preserves positivity for every finite auxiliary size, including zero. Furthermore,

Re⁡tr⁡(Aρ)=Re⁡tr⁡ ⁣(PmPm(A)(ρ))=1+ϵNm,1m<Re⁡tr⁡ ⁣(PmPm(A)(ρ)),\operatorname{Re}\operatorname{tr}(A\rho) =\operatorname{Re}\operatorname{tr}\!\bigl(P_m\mathcal P_m(A)(\rho)\bigr) =\frac{1+\epsilon N}{m}, \qquad \frac1m<\operatorname{Re}\operatorname{tr}\!\bigl(P_m\mathcal P_m(A)(\rho)\bigr),Retr(Aρ)=Retr(Pm​Pm​(A)(ρ))=m1+ϵN​,m1​<Retr(Pm​Pm​(A)(ρ)),

where N=(∥Γ1ρ∥1−1)/2N=(\|\Gamma_1\rho\|_1-1)/2N=(∥Γ1​ρ∥1​−1)/2, (Γ1X)(a,b),(a′,b′)=X(a′,b),(a,b′)(\Gamma_1X)_{(a,b),(a',b')}=X_{(a',b),(a,b')}(Γ1​X)(a,b),(a′,b′)​=X(a′,b),(a,b′)​, and ∥Y∥1=Re⁡tr⁡Y†Y\|Y\|_1=\operatorname{Re}\operatorname{tr}\sqrt{Y^\dagger Y}∥Y∥1​=RetrY†Y​. The norm ∥⋅∥op\|\cdot\|_{\mathrm{op}}∥⋅∥op​ is the Euclidean operator norm; its reciprocal in the hypothesis is defined to be zero if the norm is zero, in which case no positive ϵ\epsilonϵ satisfies the hypothesis.

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