Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Depolarizing finite-block testing converse

Open
QAlgorithms.Papers.Independent.Support50.P04.depolarizing_testing_converse

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

prove2quantum

Let N:A→B\mathcal N:A\to BN:A→B be a CPTP channel on finite positive-dimensional complex Hilbert spaces with fixed orthonormal bases. Write R^(n;ε)\widehat R(n;\varepsilon)R(n;ε) and R^cpp(n;ε)\widehat R^{\mathrm{cpp}}(n;\varepsilon)Rcpp(n;ε) for the maximum unassisted and classical-post-processing assisted entanglement-transmission rates. A code has a positive integer message dimension MMM, rate log⁡2M/n\log_2 M/nlog2​M/n, and squared fidelity to the normalized maximally entangled target at least 1−ε1-\varepsilon1−ε. A cpp encoder may retain sender memory; its decoder is LOCC across that memory and the receiver outputs, with its final quantum output at the receiver and no preshared entanglement. For n≥1n\ge1n≥1 and 0<ε<10<\varepsilon<10<ε<1, let Pγ(x,y)=(1−γ)/2P_\gamma(x,y)=(1-\gamma)/2Pγ​(x,y)=(1−γ)/2 when x=yx=yx=y and γ/2\gamma/2γ/2 otherwise, for binary x,yx,yx,y, and let Q(x,y)=1/4Q(x,y)=1/4Q(x,y)=1/4. Classical testing is identified with diagonal density matrices. For 0≤α≤10\le\alpha\le10≤α≤1, let Dα(X)=(1−α)X+α3(X1XX1+YXY+ZXZ)\mathcal D_\alpha(X)=(1-\alpha)X+\frac\alpha3(X_1XX_1+YXY+ZXZ)Dα​(X)=(1−α)X+3α​(X1​XX1​+YXY+ZXZ), where X1,Y,ZX_1,Y,ZX1​,Y,Z are Pauli matrices. Let ωα\omega_\alphaωα​ have Bell weights (1−α,α/3,α/3,α/3)(1-\alpha,\alpha/3,\alpha/3,\alpha/3)(1−α,α/3,α/3,α/3) and let σ\sigmaσ have weights (1/2,1/6,1/6,1/6)(1/2,1/6,1/6,1/6)(1/2,1/6,1/6,1/6). The latter is a normalized member of PPT′\mathrm{PPT}^{\prime}PPT′. Then

R^Dα(n;ε)≤R^Dαcpp(n;ε)≤1nDHε(ωα⊗n∥σ⊗n),\widehat R_{\mathcal D_\alpha}(n;\varepsilon)\le\widehat R_{\mathcal D_\alpha}^{\mathrm{cpp}}(n;\varepsilon)\le\frac1nD_H^\varepsilon(\omega_\alpha^{\otimes n}\|\sigma^{\otimes n}),RDα​​(n;ε)≤RDα​cpp​(n;ε)≤n1​DHε​(ωα⊗n​∥σ⊗n), DHε(ωα⊗n∥σ⊗n)=DHε(Pα×n∥Q×n).D_H^\varepsilon(\omega_\alpha^{\otimes n}\|\sigma^{\otimes n})=D_H^\varepsilon(P_\alpha^{\times n}\|Q^{\times n}).DHε​(ωα⊗n​∥σ⊗n)=DHε​(Pα×n​∥Q×n).

This is a shared testing upper bound; it does not compare the two exact operational channel boundaries.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P04
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder

open QAlgorithms

namespace QAlgorithms.Papers.Independent.Support50.P04

variable {A B E : Type} [Fintype A] [DecidableEq A]

variable [Fintype B] [DecidableEq B] [Fintype E] [DecidableEq E]

/-- arXiv:1504.04617v2, PDF p.19, Eqs.(71)–(73): fixed normalized PPT Bell
alternative and the finite-block testing converse, with the source alpha/3 convention.
This is not the stronger printed operational comparison deferred under Result 3. -/
theorem depolarizing_testing_converse (alpha epsilon : ℝ)
    (ha0 : 0 ≤ alpha) (ha1 : alpha ≤ 1) (he0 : 0 < epsilon) (he1 : epsilon < 1)
    (n : ℕ) (hn : 0 < n) :
    IsDensityMatrix depolarizingAlternative ∧ QAlgorithms.Papers.Independent.Dependency50.P36.pptPrime depolarizingAlternative ∧
    unassistedBoundary (QuditFidelity.depolarizingMap 2 (by norm_num) (4*alpha/3)) n epsilon ≤ cppBoundary (QuditFidelity.depolarizingMap 2 (by norm_num) (4*alpha/3)) n epsilon ∧
    cppBoundary (QuditFidelity.depolarizingMap 2 (by norm_num) (4*alpha/3)) n epsilon ≤
      QAlgorithms.Papers.Independent.Dependency50.P36.testingEntropy (QAlgorithms.Papers.Independent.Information100.P60.copies n (choiState (QuditFidelity.depolarizingMap 2 (by norm_num) (4*alpha/3))))
        (QAlgorithms.Papers.Independent.Information100.P60.copies n depolarizingAlternative) epsilon / (n : EReal) ∧
    QAlgorithms.Papers.Independent.Dependency50.P36.testingEntropy (QAlgorithms.Papers.Independent.Information100.P60.copies n (choiState (QuditFidelity.depolarizingMap 2 (by norm_num) (4*alpha/3))))
        (QAlgorithms.Papers.Independent.Information100.P60.copies n depolarizingAlternative) epsilon =
      QAlgorithms.Papers.Independent.Dependency50.P36.testingEntropy (QAlgorithms.Papers.Independent.Information100.P60.copies n (bscJoint alpha)) (QAlgorithms.Papers.Independent.Information100.P60.copies n bscAlternative) epsilon := by sorry

end QAlgorithms.Papers.Independent.Support50.P04

end
Source
Quantum Coding with Finite Resources, arXiv:1504.04617v2, PDF p. 19, Eq. (73)
Read-back

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

For every α∈[0,1]\alpha\in[0,1]α∈[0,1], 0<ϵ<10<\epsilon<10<ϵ<1, and integer n>0n>0n>0, define

Pα(X)=(1−4α3)X+2α3Tr⁡(X)I2,ωα=12JPα,σ∗=12JP1/2,\mathcal P_\alpha(X)= \left(1-\frac{4\alpha}{3}\right)X+ \frac{2\alpha}{3}\operatorname{Tr}(X)I_2, \qquad \omega_\alpha=\frac12J_{\mathcal P_\alpha}, \qquad \sigma_*=\frac12J_{\mathcal P_{1/2}},Pα​(X)=(1−34α​)X+32α​Tr(X)I2​,ωα​=21​JPα​​,σ∗​=21​JP1/2​​,

where JM,(a,b),(c,d)=M(∣a⟩⟨c∣)bdJ_{\mathcal M,(a,b),(c,d)}=\mathcal M(|a\rangle\langle c|)_{bd}JM,(a,b),(c,d)​=M(∣a⟩⟨c∣)bd​. Let PαP_\alphaPα​ be diagonal on {0,1}2\{0,1\}^2{0,1}2, with entries (1−α)/2(1-\alpha)/2(1−α)/2 at equal-bit pairs and α/2\alpha/2α/2 at unequal-bit pairs, and let Q0=I4/4Q_0=I_4/4Q0​=I4​/4. The assertion is that σ∗\sigma_*σ∗​ is positive semidefinite with trace one and satisfies ∥σ∗TB∥1≤1\|\sigma_*^{T_B}\|_1\le1∥σ∗TB​​∥1​≤1, and that

Cu(Pα,n,ϵ)≤Ccpp(Pα,n,ϵ)≤1nDHϵ(ωα⊗n∥σ∗⊗n),C_{\mathrm u}(\mathcal P_\alpha,n,\epsilon) \le C_{\mathrm{cpp}}(\mathcal P_\alpha,n,\epsilon) \le\frac1nD_H^\epsilon(\omega_\alpha^{\otimes n}\|\sigma_*^{\otimes n}),Cu​(Pα​,n,ϵ)≤Ccpp​(Pα​,n,ϵ)≤n1​DHϵ​(ωα⊗n​∥σ∗⊗n​), DHϵ(ωα⊗n∥σ∗⊗n)=DHϵ(Pα⊗n∥Q0⊗n).D_H^\epsilon(\omega_\alpha^{\otimes n}\|\sigma_*^{\otimes n}) = D_H^\epsilon(P_\alpha^{\otimes n}\|Q_0^{\otimes n}).DHϵ​(ωα⊗n​∥σ∗⊗n​)=DHϵ​(Pα⊗n​∥Q0⊗n​).

Here X(a,b),(c,d)TB=X(a,d),(c,b)X^{T_B}_{(a,b),(c,d)}=X_{(a,d),(c,b)}X(a,b),(c,d)TB​​=X(a,d),(c,b)​, ∥X∥1=Re⁡Tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{X^\dagger X}∥X∥1​=ReTrX†X​, and tensor powers multiply corresponding coordinate entries. The testing entropy is −log⁡2β-\log_2\beta−log2​β if β>0\beta>0β>0, and +∞+\infty+∞ otherwise, with β=inf⁡{Re⁡Tr⁡(Tτ):0≤T≤I, Re⁡Tr⁡(Tω)≥1−ϵ}\beta=\inf\{\operatorname{Re}\operatorname{Tr}(T\tau):0\le T\le I,\ \operatorname{Re}\operatorname{Tr}(T\omega)\ge1-\epsilon\}β=inf{ReTr(Tτ):0≤T≤I, ReTr(Tω)≥1−ϵ} for the indicated pair (ω,τ)(\omega,\tau)(ω,τ). Both boundaries are extended-real suprema of rates log⁡2M/n\log_2M/nlog2​M/n attained with positive message dimension MMM and entanglement fidelity at least 1−ϵ1-\epsilon1−ϵ; fidelity is overlap with the normalized maximally entangled state after applying the effective channel to its second half. The unassisted boundary uses channel encoders into nnn qubits and channel decoders from nnn qubits. The other boundary additionally permits a positive finite memory at the encoder output, retained until decoding. Its decoder must admit separate isometric embeddings of memory and channel output, a two-factor map L\mathcal LL, discarding the first factor, and a channel on the second. The one-outcome map L\mathcal LL is required to be a stabilized trace-norm limit of total maps of a continuing sequence of finite positive-round protocols, each stage extending each history by one round; a round has a countably indexed completely positive instrument at one party and outcome-dependent channels at the other, with summable branch maps and trace-preserving total. The norm takes the supremum over density inputs with an equally dimensional reference. Channels mean finite complete Kraus sums. The full interval α∈[0,1]\alpha\in[0,1]α∈[0,1] is included, so the parameter 4α/34\alpha/34α/3 appearing in the depolarizing-map definition may exceed 111.

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