Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact single-copy distillation criterion

Open
QAlgorithms.Papers.Independent.Intakenext100.P18.exact_distillation_criterion

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let N,M≥1N,M\ge1N,M≥1 and 1≤m≤min⁡(N,M)1\le m\le\min(N,M)1≤m≤min(N,M), and let ρ\rhoρ be a positive trace-one operator on CN⊗CM\mathbb C^N\otimes\mathbb C^MCN⊗CM. Exact noncollective distillation means there are local contractions A:CN→CmA:\mathbb C^N\to\mathbb C^mA:CN→Cm and B:CM→CmB:\mathbb C^M\to\mathbb C^mB:CM→Cm such that the output has strictly positive trace and, after division by that trace, equals the normalized mmm-dimensional plus Bell projector P+(m)P_+^{(m)}P+(m)​. Then

ρ is exactly noncollectively distillable to P+(m)  ⟺  ∃P,Q,ψ≠0: (P⊗Q)ρ(P⊗Q)=∣ψ⟩⟨ψ∣,\rho\text{ is exactly noncollectively distillable to }P_+^{(m)}\iff\exists P,Q,\psi\ne0:\ (P\otimes Q)\rho(P\otimes Q)=|\psi\rangle\langle\psi|,ρ is exactly noncollectively distillable to P+(m)​⟺∃P,Q,ψ=0: (P⊗Q)ρ(P⊗Q)=∣ψ⟩⟨ψ∣,

where P,QP,QP,Q are orthogonal projections of ranks m,mm,mm,m on the original local spaces and the coefficient matrix of ψ\psiψ has complex rank mmm. The vector ψ\psiψ need not be normalized.

This characterizes successful one-copy extraction. Rescaling a product operator to contractions does not affect its normalized output or whether its success is positive; the case m=1m=1m=1 is retained.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P18
Formal statement
noncomputable section

open QAlgorithms MeasureTheory

open scoped Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator

namespace QAlgorithms.Papers.Independent.Intakenext100.P18

open QAlgorithms.Papers.Independent.Claimed50.P28 (maximallyEntangledDensity)

open QAlgorithms.Papers.Independent.Support50.P11 (choiState teleportWeyl bellKet)

open QAlgorithms.Papers.Independent.Renew46.P40 (initialJoint)

/-- PDF pp.9--10, Proposition 2: exact one-copy extraction iff a rank-m
product projection leaves a nonzero pure positive operator of Schmidt rank m.
The vector on the right is deliberately not required to have norm one. -/
theorem exact_distillation_criterion (N M m : ℕ) (hN : 0 < N) (hM : 0 < M)
    (hm : 0 < m) (hmN : m ≤ N) (hmM : m ≤ M)
    (rho : Matrix (Fin N × Fin M) (Fin N × Fin M) ℂ) (hrho : IsDensityMatrix rho) :
    ExactlyDistillable rho m hm ↔
      ∃ P : Matrix (Fin N) (Fin N) ℂ, ∃ Q : Matrix (Fin M) (Fin M) ℂ,
      ∃ psi : EuclideanSpace ℂ (Fin N × Fin M),
        IsRankProjection m P ∧ IsRankProjection m Q ∧ psi ≠ 0 ∧
        Matrix.rank (fun i j => psi (i, j)) = m ∧
        conjSuperop (Matrix.kronecker P Q) rho = pureDensity psi := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P18

end
Source
General teleportation channel, singlet fraction and quasi-distillation, arXiv:quant-ph/9807091v2, PDF p. 10, §VI, Proposition 2: exact single-copy distillation criterion
Read-back

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

For all positive integers N,M,mN,M,mN,M,m with m≤Nm\le Nm≤N and m≤Mm\le Mm≤M, and every positive semidefinite trace-one matrix ρ\rhoρ on CN⊗CM\mathbb C^N\otimes\mathbb C^MCN⊗CM, the following are equivalent: there exist matrices A:CN→CmA:\mathbb C^N\to\mathbb C^mA:CN→Cm and B:CM→CmB:\mathbb C^M\to\mathbb C^mB:CM→Cm with IN−A†AI_N-A^\dagger AIN​−A†A and IM−B†BI_M-B^\dagger BIM​−B†B positive semidefinite, such that, writing ω=(A⊗B)ρ(A⊗B)†\omega=(A\otimes B)\rho(A\otimes B)^\daggerω=(A⊗B)ρ(A⊗B)†, one has Re⁡tr⁡ω>0\operatorname{Re}\operatorname{tr}\omega>0Retrω>0 and ω/Re⁡tr⁡ω=Φm\omega/\operatorname{Re}\operatorname{tr}\omega=\Phi_mω/Retrω=Φm​, where Φm=∣Ωm⟩⟨Ωm∣\Phi_m=|\Omega_m\rangle\langle\Omega_m|Φm​=∣Ωm​⟩⟨Ωm​∣ and ∣Ωm⟩=m−1/2∑j=0m−1∣j,j⟩|\Omega_m\rangle=m^{-1/2}\sum_{j=0}^{m-1}|j,j\rangle∣Ωm​⟩=m−1/2∑j=0m−1​∣j,j⟩; and there exist matrices PPP on CN\mathbb C^NCN, QQQ on CM\mathbb C^MCM, and a nonzero vector ψ∈CN×M\psi\in\mathbb C^{N\times M}ψ∈CN×M such that

P†=P,P2=P,rank⁡P=m,Q†=Q,Q2=Q,rank⁡Q=m,rank⁡(ψij)=m,(P⊗Q)ρ(P⊗Q)†=∣ψ⟩⟨ψ∣.P^\dagger=P,\quad P^2=P,\quad \operatorname{rank}P=m,\qquad Q^\dagger=Q,\quad Q^2=Q,\quad \operatorname{rank}Q=m,\qquad \operatorname{rank}(\psi_{ij})=m,\qquad (P\otimes Q)\rho(P\otimes Q)^\dagger=|\psi\rangle\langle\psi|.P†=P,P2=P,rankP=m,Q†=Q,Q2=Q,rankQ=m,rank(ψij​)=m,(P⊗Q)ρ(P⊗Q)†=∣ψ⟩⟨ψ∣.

No unit-norm requirement is imposed on ψ\psiψ. The statement permits m=1m=1m=1 and equality in either dimension bound.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me