Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section IV.A: private capacity of a degradable erasure channel (domain correction)

Open
QAlgorithms.Papers.Independent.Support50.P07.erasure_privateCapacity

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

prove2quantum

Let d≥1d\ge1d≥1 and 0≤p≤1/20\le p\le1/20≤p≤1/2. The erasure channel sends an input density operator on Cd\mathbb C^dCd to (1−p)ρ+p∣e⟩⟨e∣(1-p)\rho+p|e\rangle\langle e|(1−p)ρ+p∣e⟩⟨e∣, where the erasure flag is orthogonal to the input subspace. Then

Cp(Ep,d)=Q(Ep,d)=(1−2p)log⁡2d.C_p(\mathcal E_{p,d})=Q(\mathcal E_{p,d})=(1-2p)\log_2 d.Cp​(Ep,d​)=Q(Ep,d​)=(1−2p)log2​d.

This is the degradable parameter range used by the source's argument.

All quantum registers are finite and nonzero, states have trace one, pure vectors have norm one, and entropy and logarithms are in bits. Operational private capacities use memoryless powers, positive blocklengths and message counts, uniform messages, arbitrary mixed block inputs, and normalized decoding POVMs. A code is good when its joint decoded message/environment state has full trace norm less than the error from a perfectly correlated uniform pair tensor its actual common environment marginal. Rates use every positive error and rate slack at all sufficiently large blocklengths. Symmetric assistance allows one arbitrary finite symmetric channel per block without charging its dimension.

This result supplies a capacity identity or bound for the channel family and resource model stated above.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P07
Formal statement
noncomputable section

open scoped BigOperators Matrix ComplexConjugate ComplexOrder

open Filter

namespace QAlgorithms.Papers.Independent.Support50.P07

open QAlgorithms.Papers.Independent.Information100.P67
  (IsIsometry receiverChannel complementaryChannel IsDegradable IsAntidegradable
    dilationPower idealJoint maximumCoherentInformation)

open QAlgorithms.Papers.Independent.Claimed50.P24 (productDilation)

open QAlgorithms.Papers.Independent.Dependency50.P19 (mutualInformation)

variable {A B E C D F : Type}

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype E] [DecidableEq E] [Fintype C] [DecidableEq C]

variable [Fintype D] [DecidableEq D] [Fintype F] [DecidableEq F]

/-- Section IV.A, PDF p.6, SOURCE DOMAIN CORRECTION: the printed sentence calls
all erasure channels degradable. The argument requires p<=1/2; at d=2,p=1 the printed
RHS is -1. Restrict to the degradable range and retain the positive input dimension. -/
theorem erasure_privateCapacity [Nonempty E]
    (d : ℕ) (hd : 0 < d)
    (U : Matrix (Option (Fin d) × E) (Fin d) ℂ) (hU : IsIsometry U)
    (p : ℝ) (hp : p ∈ Set.Icc 0 (1 / 2)) (hmap : receiverChannel U = erasureMap d p) :
    fullTracePrivateCapacity U = (1 - 2 * p) * Real.logb 2 d ∧
    QAlgorithms.Papers.Independent.Information100.P80.quantumCapacity (receiverChannel U) =
      (1 - 2 * p) * Real.logb 2 d := by sorry

end QAlgorithms.Papers.Independent.Support50.P07

end
Source
The private classical capacity with a symmetric side channel and its application to quantum cryptography, arXiv:0705.3838v1, PDF p. 6, Section IV.A: private capacity of a degradable erasure channel (domain correction)
Read-back

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

Let EEE be a finite, nonempty type with decidable equality, let ddd be a positive natural number, and let U:Cd→C{0,…,d−1}∪{⊥}⊗CEU:\mathbb C^d\to\mathbb C^{\{0,\ldots,d-1\}\cup\{\bot\}}\otimes\mathbb C^EU:Cd→C{0,…,d−1}∪{⊥}⊗CE satisfy U†U=IdU^\dagger U=I_dU†U=Id​. Let p∈[0,12]p\in[0,\tfrac12]p∈[0,21​], and assume that its receiver map N(ρ)=Tr⁡E(UρU†)N(\rho)=\operatorname{Tr}_E(U\rho U^\dagger)N(ρ)=TrE​(UρU†) has entries

N(ρ)a,b=(1−p)ρa,b,N(ρ)⊥,⊥=p Tr⁡ρ,N(ρ)a,⊥=N(ρ)⊥,a=0N(\rho)_{a,b}=(1-p)\rho_{a,b},\qquad N(\rho)_{\bot,\bot}=p\,\operatorname{Tr}\rho,\qquad N(\rho)_{a,\bot}=N(\rho)_{\bot,a}=0N(ρ)a,b​=(1−p)ρa,b​,N(ρ)⊥,⊥​=pTrρ,N(ρ)a,⊥​=N(ρ)⊥,a​=0

for a,b∈{0,…,d−1}a,b\in\{0,\ldots,d-1\}a,b∈{0,…,d−1}. Define Ptr(U)P_{\mathrm{tr}}(U)Ptr​(U) as the real supremum of rates r≥0r\ge0r≥0 such that, for every ε>0\varepsilon>0ε>0 and s>0s>0s>0, some integer n0>0n_0>0n0​>0 has the property that every n≥n0n\ge n_0n≥n0​ admits a positive message count MMM, input density matrices ρm\rho_mρm​ on (Cd)⊗n(\mathbb C^d)^{\otimes n}(Cd)⊗n, and a receiver measurement Qj≥0Q_j\ge0Qj​≥0, ∑jQj=I\sum_jQ_j=I∑j​Qj​=I, satisfying r−s≤log⁡2M/nr-s\le\log_2M/nr−s≤log2​M/n and

∥Ω−1M∑m∣m,m⟩⟨m,m∣⊗Tr⁡m,jΩ∥1<ε.\left\|\Omega-\frac1M\sum_m|m,m\rangle\langle m,m|\otimes\operatorname{Tr}_{m,j}\Omega\right\|_1<\varepsilon.​Ω−M1​m∑​∣m,m⟩⟨m,m∣⊗Trm,j​Ω​1​<ε.

A density matrix is positive semidefinite with trace 111, ∥X∥1=Tr⁡X†X\|X\|_1=\operatorname{Tr}\sqrt{X^\dagger X}∥X∥1​=TrX†X​, and Ω\OmegaΩ has zero entries between different classical labels and blocks

Ω(m,j,e),(m,j,e′)=1M∑b,c(Qj)c,b(U⊗nρm(U⊗n)†)(b,e),(c,e′).\Omega_{(m,j,e),(m,j,e')}=\frac1M\sum_{b,c}(Q_j)_{c,b} (U^{\otimes n}\rho_m(U^{\otimes n})^\dagger)_{(b,e),(c,e')}.Ω(m,j,e),(m,j,e′)​=M1​b,c∑​(Qj​)c,b​(U⊗nρm​(U⊗n)†)(b,e),(c,e′)​.

Define Q(N)Q(N)Q(N) as the real supremum of nonnegative rates admitting a sequence, for every natural number nnn, of positive message dimensions MnM_nMn​, encoding channels En:Mn→dn\mathcal E_n:M_n\to d^nEn​:Mn​→dn, and decoding channels Dn:(d+1)n→Mn\mathcal D_n:(d+1)^n\to M_nDn​:(d+1)n→Mn​, such that their entanglement fidelities

Tr⁡ ⁣[ΦMn(id⁡Mn⊗(Dn∘N⊗n∘En))(ΦMn)]⟶1\operatorname{Tr}\!\left[\Phi_{M_n} (\operatorname{id}_{M_n}\otimes(\mathcal D_n\circ N^{\otimes n}\circ\mathcal E_n))(\Phi_{M_n})\right] \longrightarrow1Tr[ΦMn​​(idMn​​⊗(Dn​∘N⊗n∘En​))(ΦMn​​)]⟶1

and, for every s>0s>0s>0, r−s≤log⁡2Mn/nr-s\le\log_2M_n/nr−s≤log2​Mn​/n eventually. Here ΦM\Phi_MΦM​ is the projector onto M−1/2∑j∣j,j⟩M^{-1/2}\sum_j|j,j\rangleM−1/2∑j​∣j,j⟩, and a channel admits a finite Kraus representation Φ(X)=∑jKjXKj†\Phi(X)=\sum_jK_jXK_j^\daggerΦ(X)=∑j​Kj​XKj†​ with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. Tensor powers act independently on the factors; the sequence includes n=0n=0n=0, using empty tensor products and total division by zero. The assertion is

Ptr(U)=(1−2p)log⁡2d,Q(N)=(1−2p)log⁡2d.P_{\mathrm{tr}}(U)=(1-2p)\log_2d,\qquad Q(N)=(1-2p)\log_2d.Ptr​(U)=(1−2p)log2​d,Q(N)=(1−2p)log2​d.

The cases d=1d=1d=1, p=0p=0p=0, and p=12p=\tfrac12p=21​ are included.

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