Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 8: operational PPT distillation and channel codes

Open
QAlgorithms.Papers.Independent.Support50.P11.ppt_distillation_and_channel_codes

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For a finite CPTP channel N:A′→B\mathcal N:A'\to BN:A′→B, let ν=N/dim⁡A′\nu=N/\dim A'ν=N/dimA′ be its normalized Choi state, reordered as reference–output. Write FΓ(ν,K)F_\Gamma(\nu,K)FΓ​(ν,K) for the supremum of Bell overlaps obtainable by PPT-preserving CPTP distillation maps, and DΓ(ν)D_\Gamma(\nu)DΓ​(ν) for the corresponding memoryless vanishing-error rate. Every such map producing Bell overlap fff at size K≥1K\ge1K≥1 yields an actual forward-assisted PPTp code with exactly channel fidelity fff. Thus

FPPTp(N,K)≥FΓ(ν,K),QPPTp(N)≥DΓ(ν).F^{\mathrm{PPTp}}(\mathcal N,K)\ge F_\Gamma(\nu,K),\qquad Q^{\mathrm{PPTp}}(\mathcal N)\ge D_\Gamma(\nu).FPPTp(N,K)≥FΓ​(ν,K),QPPTp(N)≥DΓ​(ν).

If N\mathcal NN has an exact single-copy simulation from ν\nuν by local operations and forward classical communication, every PPTp code conversely yields a PPT-preserving distillation map with exactly the same fidelity, and

FPPTp(N,K)=FΓ(ν,K),QPPTp(N)=DΓ(ν).F^{\mathrm{PPTp}}(\mathcal N,K)=F_\Gamma(\nu,K),\qquad Q^{\mathrm{PPTp}}(\mathcal N)=D_\Gamma(\nu).FPPTp(N,K)=FΓ​(ν,K),QPPTp(N)=DΓ​(ν).

The transformations use a single channel or a parallel block, retaining the operational meaning of both optima.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P11
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder ENNReal

namespace QAlgorithms.Papers.Independent.Support50.P11

open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing permutationMatrix)

open QAlgorithms.Papers.Independent.Information100.P21 (pt)

open QAlgorithms.Papers.Independent.Dependency50.P09 (tensorAction)

open QAlgorithms.Papers.Independent.Information100.P76 (swapMatrix)

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

open QAlgorithms.Papers.Independent.Gap20.P19 (wernerIsometry)

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

section Statements

variable {I O : Type} [Fintype I] [Nonempty I] [Fintype O] [Nonempty O]

/-- PDF pp.9--10, Proposition 8: fixed-fidelity transformations in both directions
when exact single-copy Choi simulation is available, and both one-shot/quantumCodeCapacity comparisons.
The channel label in printed part (ii) is corrected to the same N as part (i). -/
theorem ppt_distillation_and_channel_codes
    (N : Superop I O) (hN : IsChannel N) :
    (∀ K : ℕ, ∀ hK : 0 < K,
      letI : Nonempty (Fin K) := ⟨⟨0,hK⟩⟩
      (∀ Y : Superop (I × O) (Fin K × Fin K), PPTMap Y →
        ∃ Z : Superop (Fin K × O) (I × Fin K), IsForwardCode K .PPTp Z ∧
          channelFidelity K (link K N Z) =
            effectProb (pureDensity (finiteMaxEntangled (Fin K))) (Y (choiState N))) ∧
      distillFidelity (choiState N) K ≤ optimalCodeFidelity .PPTp N K) ∧
    distillCapacity (choiState N) ≤ quantumCodeCapacity .PPTp N ∧
    (HasChoiSimulation N →
      (∀ K : ℕ, ∀ hK : 0 < K,
        letI : Nonempty (Fin K) := ⟨⟨0,hK⟩⟩
        (∀ Z : Superop (Fin K × O) (I × Fin K), IsForwardCode K .PPTp Z →
          ∃ Y : Superop (I × O) (Fin K × Fin K), PPTMap Y ∧
            effectProb (pureDensity (finiteMaxEntangled (Fin K))) (Y (choiState N)) =
              channelFidelity K (link K N Z)) ∧
        optimalCodeFidelity .PPTp N K = distillFidelity (choiState N) K) ∧
      quantumCodeCapacity .PPTp N = distillCapacity (choiState N)) := by sorry

end Statements

end QAlgorithms.Papers.Independent.Support50.P11

end
Source
On the power of PPT-preserving and non-signalling codes, arXiv:1406.7142v2, PDF p. 9, Proposition 8: operational PPT distillation and channel codes
Read-back

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

Let I,OI,OI,O be finite index types and N:Mat⁡I(C)→Mat⁡O(C)N:\operatorname{Mat}_I(\mathbb C)\to\operatorname{Mat}_O(\mathbb C)N:MatI​(C)→MatO​(C) a channel, where channels have finite Kraus representations H↦∑jAjHAj†H\mapsto\sum_jA_jHA_j^\daggerH↦∑j​Aj​HAj†​ with ∑jAj†Aj=1\sum_jA_j^\dagger A_j=1∑j​Aj†​Aj​=1. Put ωN=∣I∣−1JN\omega_N=|I|^{-1}J_NωN​=∣I∣−1JN​, where (JN)(i,o),(j,o′)=[N(Eij)]o,o′(J_N)_{(i,o),(j,o')}=[N(E_{ij})]_{o,o'}(JN​)(i,o),(j,o′)​=[N(Eij​)]o,o′​. Partial transposition is (ΓH)(a,b),(a′,b′)=H(a,b′),(a′,b)(\Gamma H)_{(a,b),(a',b')}=H_{(a,b'),(a',b)}(ΓH)(a,b),(a′,b′)​=H(a,b′),(a′,b)​; a map TTT between bipartite matrix spaces is called PPT here when both TTT and Γ∘T∘Γ\Gamma\circ T\circ\GammaΓ∘T∘Γ are channels. For every positive integer KKK and every such PPT map Y:Mat⁡I×O→Mat⁡K×KY:\operatorname{Mat}_{I\times O}\to\operatorname{Mat}_{K\times K}Y:MatI×O​→MatK×K​, there exists a channel Z:Mat⁡K×O→Mat⁡I×KZ:\operatorname{Mat}_{K\times O}\to\operatorname{Mat}_{I\times K}Z:MatK×O​→MatI×K​ that is PPT and satisfies Tr⁡KZ(H)=E(Tr⁡OH)\operatorname{Tr}_{K}Z(H)=E(\operatorname{Tr}_O H)TrK​Z(H)=E(TrO​H) for all HHH, for some channel EEE, such that

Re⁡Tr⁡ ⁣[ΦK(id⁡K⊗LN,Z)(ΦK)]=Re⁡Tr⁡ ⁣[ΦKY(ωN)].\operatorname{Re}\operatorname{Tr}\!\left[\Phi_K(\operatorname{id}_K\otimes\mathcal L_{N,Z})(\Phi_K)\right] =\operatorname{Re}\operatorname{Tr}\!\left[\Phi_KY(\omega_N)\right].ReTr[ΦK​(idK​⊗LN,Z​)(ΦK​)]=ReTr[ΦK​Y(ωN​)].

Here ΦK\Phi_KΦK​ projects onto K−1/2∑a∣a,a⟩K^{-1/2}\sum_a|a,a\rangleK−1/2∑a​∣a,a⟩, and

[LN,Z(H)]bc=∑a,a′,i,j,o,o′Haa′[N(Eij)]oo′[Z(E(a,o),(a′,o′))](i,b),(j,c).[\mathcal L_{N,Z}(H)]_{bc} =\sum_{a,a',i,j,o,o'}H_{aa'}[N(E_{ij})]_{oo'} [Z(E_{(a,o),(a',o')})]_{(i,b),(j,c)}.[LN,Z​(H)]bc​=a,a′,i,j,o,o′∑​Haa′​[N(Eij​)]oo′​[Z(E(a,o),(a′,o′)​)](i,b),(j,c)​.

Consequently D(ωN,K)≤F(N,K)D(\omega_N,K)\le F(N,K)D(ωN​,K)≤F(N,K), where D(ω,K)D(\omega,K)D(ω,K) is the real supremum of Re⁡Tr⁡[ΦKY(ω)]\operatorname{Re}\operatorname{Tr}[\Phi_KY(\omega)]ReTr[ΦK​Y(ω)] over PPT YYY, and F(N,K)F(N,K)F(N,K) is the real supremum of the linked fidelities over the stated ZZZ. Also,

sup⁡r≥0D(ωN⊗n,⌊2nr⌋)→1r ≤ sup⁡r≥0F(N⊗n,⌊2nr⌋)→1r,\sup_{\substack{r\ge0\\D(\omega_N^{\otimes n},\,\lfloor2^{nr}\rfloor)\to1}}r \ \le\ \sup_{\substack{r\ge0\\F(N^{\otimes n},\,\lfloor2^{nr}\rfloor)\to1}}r,r≥0D(ωN⊗n​,⌊2nr⌋)→1​sup​r ≤ r≥0F(N⊗n,⌊2nr⌋)→1​sup​r,

with suprema in [0,∞][0,\infty][0,∞]; the tensor products use products of matrix entries, and the limits are as natural n→∞n\to\inftyn→∞. Finally, suppose there exist a positive integer mmm, channels M:Mat⁡I×I→Mat⁡mM:\operatorname{Mat}_{I\times I}\to\operatorname{Mat}_mM:MatI×I​→Matm​ and D0:Mat⁡m×O→Mat⁡OD_0:\operatorname{Mat}_{m\times O}\to\operatorname{Mat}_OD0​:Matm×O​→MatO​, with every M(H)M(H)M(H) diagonal, such that using ωN\omega_NωN​ as an auxiliary state reproduces NNN: explicitly, for every HHH,

N(H)=D0 ⁣([ M ⁣((Huv ωN(a,o),(a′,o′))(u,a),(v,a′))c,c′ ](c,o),(c′,o′)).N(H)=D_0\!\left( \left[\, M\!\left((H_{uv}\,\omega_N{}_{(a,o),(a',o')})_{(u,a),(v,a')}\right)_{c,c'} \,\right]_{(c,o),(c',o')} \right).N(H)=D0​([M((Huv​ωN​(a,o),(a′,o′)​)(u,a),(v,a′)​)c,c′​](c,o),(c′,o′)​).

Then, for every positive KKK and every allowed ZZZ, there exists a PPT YYY giving the reverse fidelity equality, F(N,K)=D(ωN,K)F(N,K)=D(\omega_N,K)F(N,K)=D(ωN​,K), and the two displayed asymptotic suprema are equal. The one-shot quantifiers include K=1K=1K=1; the capacity definitions also include rate r=0r=0r=0 and the n=0n=0n=0 term, which does not affect their limits.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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