Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§VII.B, Fig.6: two-use finite-block fidelity comparisons

Open
QAlgorithms.Papers.Independent.Support50.P11.two_use_fidelity_comparisons

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

prove2quantum

Fix exactly two parallel uses N=(W(3,1))⊗2\mathcal N=(\mathcal W^{(3,1)})^{\otimes2}N=(W(3,1))⊗2 of the qutrit Werner–Holevo channel. The finite-block optimal fidelities obey

FNS(N,3)=1,FNS(N,K)<FPPTp(N,K)(K≥4).F^{\mathrm{NS}}(\mathcal N,3)=1,\qquad F^{\mathrm{NS}}(\mathcal N,K)<F^{\mathrm{PPTp}}(\mathcal N,K)\quad(K\ge4).FNS(N,3)=1,FNS(N,K)<FPPTp(N,K)(K≥4).

There is a positive integer KKK for which

FNS∩PPTp(N,K)<min⁡{FNS(N,K),FPPTp(N,K)},F^{\mathrm{NS}\cap\mathrm{PPTp}}(\mathcal N,K)<\min\{F^{\mathrm{NS}}(\mathcal N,K),F^{\mathrm{PPTp}}(\mathcal N,K)\},FNS∩PPTp(N,K)<min{FNS(N,K),FPPTp(N,K)},

and for every integer K≥9K\ge9K≥9,

FNS∩PPTp(N,K)=FNS(N,K).F^{\mathrm{NS}\cap\mathrm{PPTp}}(\mathcal N,K)=F^{\mathrm{NS}}(\mathcal N,K).FNS∩PPTp(N,K)=FNS(N,K).

These are the stated two-use comparisons; the strict intersection improvement is retained existentially rather than assigning uncertified rational values from the graph.

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

/-- PDF p.11, section VII.B, Fig.6: the two-use finite-block comparisons.
The strict intersection improvement is existential, with no invented graph values. -/
theorem two_use_fidelity_comparisons :
    let N := piSuperop (fun _ : Fin 2 => wernerHolevoChannel 3 1)
    optimalCodeFidelity .NS N 3 = 1 ∧
    (∀ K : ℕ, 4 ≤ K → optimalCodeFidelity .NS N K < optimalCodeFidelity .PPTp N K) ∧
    (∃ K : ℕ, 0 < K ∧ optimalCodeFidelity .both N K < min (optimalCodeFidelity .NS N K) (optimalCodeFidelity .PPTp N K)) ∧
    (∀ K : ℕ, 9 ≤ K → optimalCodeFidelity .both N K = optimalCodeFidelity .NS N K) := by sorry

end QAlgorithms.Papers.Independent.Support50.P11

end
Source
On the power of PPT-preserving and non-signalling codes, arXiv:1406.7142v2, PDF p. 11, §VII.B, Fig.6: two-use finite-block fidelity comparisons
Read-back

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

Let T(H)=(Tr⁡(H)13−HT)/2T(H)=(\operatorname{Tr}(H)1_3-H^{\mathsf T})/2T(H)=(Tr(H)13​−HT)/2, and let N=T⊗TN=T\otimes TN=T⊗T, acting on product matrix units by N(Eij⊗Ekl)=T(Eij)⊗T(Ekl)N(E_{ij}\otimes E_{kl})=T(E_{ij})\otimes T(E_{kl})N(Eij​⊗Ekl​)=T(Eij​)⊗T(Ekl​). For a positive integer KKK, define Fc(K)F_c(K)Fc​(K) as the real supremum of

Re⁡Tr⁡ ⁣[ΦK(id⁡K⊗LN,Z)(ΦK)],[LN,Z(H)]bc=∑a,a′,i,j,o,o′Haa′[N(Eij)]oo′[Z(E(a,o),(a′,o′))](i,b),(j,c),\operatorname{Re}\operatorname{Tr}\!\left[ \Phi_K(\operatorname{id}_K\otimes\mathcal L_{N,Z})(\Phi_K) \right], \qquad [\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)},ReTr[ΦK​(idK​⊗LN,Z​)(ΦK​)],[LN,Z​(H)]bc​=a,a′,i,j,o,o′∑​Haa′​[N(Eij​)]oo′​[Z(E(a,o),(a′,o′)​)](i,b),(j,c)​,

where Φ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 Z:Mat⁡K×9→Mat⁡9×KZ:\operatorname{Mat}_{K\times9}\to\operatorname{Mat}_{9\times K}Z:MatK×9​→Mat9×K​ ranges over channels with Tr⁡KZ(H)=E(Tr⁡9H)\operatorname{Tr}_K Z(H)=E(\operatorname{Tr}_9 H)TrK​Z(H)=E(Tr9​H) for every HHH, for some channel EEE. For class NS\mathrm{NS}NS, additionally require a channel DDD with Tr⁡9Z(H)=D(Tr⁡KH)\operatorname{Tr}_9 Z(H)=D(\operatorname{Tr}_K H)Tr9​Z(H)=D(TrK​H); for class PPT\mathrm{PPT}PPT, additionally require ΓZΓ\Gamma Z\GammaΓZΓ to be a channel, where Γ\GammaΓ transposes the second factor; class both\mathrm{both}both imposes both additional requirements. Channels are finite Kraus maps satisfying ∑jAj†Aj=1\sum_jA_j^\dagger A_j=1∑j​Aj†​Aj​=1. The assertion consists of all four statements

FNS(3)=1,∀K≥4,FNS(K)<FPPT(K),F_{\mathrm{NS}}(3)=1,\qquad \forall K\ge4,\quad F_{\mathrm{NS}}(K)<F_{\mathrm{PPT}}(K),FNS​(3)=1,∀K≥4,FNS​(K)<FPPT​(K), ∃K>0,Fboth(K)<min⁡{FNS(K),FPPT(K)},∀K≥9,Fboth(K)=FNS(K).\exists K>0,\quad F_{\mathrm{both}}(K)< \min\{F_{\mathrm{NS}}(K),F_{\mathrm{PPT}}(K)\}, \qquad \forall K\ge9,\quad F_{\mathrm{both}}(K)=F_{\mathrm{NS}}(K).∃K>0,Fboth​(K)<min{FNS​(K),FPPT​(K)},∀K≥9,Fboth​(K)=FNS​(K).

The existential statement specifies a positive integer KKK without identifying it, and every comparison concerns the optimized real suprema.

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