Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2: private capacity of a degradable channel

Open
QAlgorithms.Papers.Independent.Support50.P07.degradable_privateCapacity

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

prove2quantum

Suppose N\mathcal NN is degradable: there exists a CPTP map from its receiver output to the full complementary output of the same dilation. Let Q(1)(N)=sup⁡ρ[S(N(ρ))−S(N^(ρ))]Q^{(1)}(\mathcal N)=\sup_\rho[S(\mathcal N(\rho))-S(\widehat{\mathcal N}(\rho))]Q(1)(N)=supρ​[S(N(ρ))−S(N(ρ))], optimizing over all density operators on the input. Then

Cp(N)=Q(N)=Q(1)(N)=sup⁡∣ϕ⟩RAI(R⟩B)(idR⊗N)(∣ϕ⟩⟨ϕ∣).C_p(\mathcal N)=Q(\mathcal N)=Q^{(1)}(\mathcal N)=\sup_{|\phi\rangle_{RA}} I(R\rangle B)_{(\mathrm{id}_R\otimes\mathcal N)(|\phi\rangle\langle\phi|)}.Cp​(N)=Q(N)=Q(1)(N)=∣ϕ⟩RA​sup​I(R⟩B)(idR​⊗N)(∣ϕ⟩⟨ϕ∣)​.

Here I(R⟩B)=S(B)−S(RB)I(R\rangle B)=S(B)-S(RB)I(R⟩B)=S(B)−S(RB), the vectors ϕ\phiϕ are normalized purifications, and a reference copy R≃AR\simeq AR≃A suffices.

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]

/-- Theorem 2, PDF pp.2–3: the unrestricted mixed-input coherent-information optimum,
equivalently the pure-reference/input purification optimum, equals private capacity.
The operational equality Cp=Q announced immediately before the theorem is retained. -/
theorem degradable_privateCapacity [Nonempty A] [Nonempty B] [Nonempty E]
    (U : Matrix (B × E) A ℂ)
    (hU : IsIsometry U) (hd : IsDegradable U) :
    fullTracePrivateCapacity U = maximumCoherentInformation U ∧
    maximumCoherentInformation U = purificationCoherentInformation U ∧
    fullTracePrivateCapacity U =
      QAlgorithms.Papers.Independent.Information100.P80.quantumCapacity (receiverChannel U) := 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. 2, Theorem 2: private capacity of a degradable channel
Read-back

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

Let A,B,EA,B,EA,B,E be finite, nonempty types with decidable equality, and let U:CA→CB⊗CEU:\mathbb C^A\to\mathbb C^B\otimes\mathbb C^EU:CA→CB⊗CE satisfy U†U=IAU^\dagger U=I_AU†U=IA​. Define N(ρ)=Tr⁡E(UρU†)N(\rho)=\operatorname{Tr}_E(U\rho U^\dagger)N(ρ)=TrE​(UρU†) and Nc(ρ)=Tr⁡B(UρU†)N^c(\rho)=\operatorname{Tr}_B(U\rho U^\dagger)Nc(ρ)=TrB​(UρU†). Assume that there is a channel D:B→ED:B\to ED:B→E such that Nc(ρ)=D(N(ρ))N^c(\rho)=D(N(\rho))Nc(ρ)=D(N(ρ)) for every matrix ρ\rhoρ, where a channel means a map admitting a finite Kraus representation Φ(X)=∑jKjXKj†\Phi(X)=\sum_j K_jXK_j^\daggerΦ(X)=∑j​Kj​XKj†​ with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. A density matrix is positive semidefinite with trace 111, and write S(ρ)=−Tr⁡(ρlog⁡2ρ)S(\rho)=-\operatorname{Tr}(\rho\log_2\rho)S(ρ)=−Tr(ρlog2​ρ), with zero eigenvalues contributing zero. Define

Imax⁡(U)=sup⁡ρ a density matrix on A[S(N(ρ))−S(Nc(ρ))],Ipur(U)=sup⁡∥ψ∥=1, ψ∈CA⊗CA[S(Tr⁡Aωψ)−S(ωψ)],ωψ=(id⁡A⊗N)(∣ψ⟩⟨ψ∣).I_{\max}(U)=\sup_{\rho\text{ a density matrix on }A}\bigl[S(N(\rho))-S(N^c(\rho))\bigr], \qquad I_{\mathrm{pur}}(U)=\sup_{\|\psi\|=1,\ \psi\in\mathbb C^A\otimes\mathbb C^A} \bigl[S(\operatorname{Tr}_A\omega_\psi)-S(\omega_\psi)\bigr], \quad \omega_\psi=(\operatorname{id}_A\otimes N)(|\psi\rangle\langle\psi|).Imax​(U)=ρ a density matrix on Asup​[S(N(ρ))−S(Nc(ρ))],Ipur​(U)=∥ψ∥=1, ψ∈CA⊗CAsup​[S(TrA​ωψ​)−S(ωψ​)],ωψ​=(idA​⊗N)(∣ψ⟩⟨ψ∣).

For clarity, define Ptr(U)P_{\mathrm{tr}}(U)Ptr​(U) as follows. For nnn uses, put Un=U⊗nU_n=U^{\otimes n}Un​=U⊗n, whose entries are (Un)(b,e),a=∏i=0n−1U(bi,ei),ai(U_n)_{(b,e),a}=\prod_{i=0}^{n-1}U_{(b_i,e_i),a_i}(Un​)(b,e),a​=∏i=0n−1​U(bi​,ei​),ai​​. A code consists of a positive integer MMM, density matrices ρm\rho_mρm​ on AnA^nAn, and positive semidefinite matrices QjQ_jQj​ on BnB^nBn with ∑jQj=I\sum_jQ_j=I∑j​Qj​=I, for m,j=0,…,M−1m,j=0,\ldots,M-1m,j=0,…,M−1. Its decoded joint matrix Ω\OmegaΩ, indexed by (m,j,e)(m,j,e)(m,j,e), has zero entries unless both classical labels agree between row and column, and its remaining entries are

Ω(m,j,e),(m,j,e′)=1M∑b,c∈Bn(Qj)c,b(UnρmUn†)(b,e),(c,e′).\Omega_{(m,j,e),(m,j,e')}=\frac1M\sum_{b,c\in B^n}(Q_j)_{c,b}(U_n\rho_mU_n^\dagger)_{(b,e),(c,e')}.Ω(m,j,e),(m,j,e′)​=M1​b,c∈Bn∑​(Qj​)c,b​(Un​ρm​Un†​)(b,e),(c,e′)​.

Set τ=Tr⁡m,jΩ\tau=\operatorname{Tr}_{m,j}\Omegaτ=Trm,j​Ω and Ωideal=M−1∑m∣m,m⟩⟨m,m∣⊗τ\Omega_{\mathrm{ideal}}=M^{-1}\sum_m|m,m\rangle\langle m,m|\otimes\tauΩideal​=M−1∑m​∣m,m⟩⟨m,m∣⊗τ. Then Ptr(U)P_{\mathrm{tr}}(U)Ptr​(U) is the real supremum of all r≥0r\ge0r≥0 such that, for every ε>0\varepsilon>0ε>0 and every s>0s>0s>0, there is n0>0n_0>0n0​>0 for which every n≥n0n\ge n_0n≥n0​ admits such a code with ∥Ω−Ωideal∥1<ε\|\Omega-\Omega_{\mathrm{ideal}}\|_1<\varepsilon∥Ω−Ωideal​∥1​<ε and r−s≤log⁡2M/nr-s\le\log_2M/nr−s≤log2​M/n; here ∥X∥1=Tr⁡X†X\|X\|_1=\operatorname{Tr}\sqrt{X^\dagger X}∥X∥1​=TrX†X​, with no factor 1/21/21/2 in this error. Define Q(N)Q(N)Q(N) as the real supremum of nonnegative rates rrr for which there is a sequence, indexed by every natural number nnn, of positive integers MnM_nMn​, encoding channels En:Mn→An\mathcal E_n:M_n\to A^nEn​:Mn​→An, and decoding channels Dn:Bn→Mn\mathcal D_n:B^n\to M_nDn​:Bn→Mn​, such that

Tr⁡ ⁣[ΦMn(id⁡Mn⊗(Dn∘N⊗n∘En))(ΦMn)]⟶1,∀s>0,r−s≤log⁡2Mnn eventually,\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]\longrightarrow1, \qquad \forall s>0,\quad r-s\le\frac{\log_2M_n}{n}\ \text{eventually},Tr[ΦMn​​(idMn​​⊗(Dn​∘N⊗n∘En​))(ΦMn​​)]⟶1,∀s>0,r−s≤nlog2​Mn​​ eventually,

where ΦM=∣ϕM⟩⟨ϕM∣\Phi_M=|\phi_M\rangle\langle\phi_M|ΦM​=∣ϕM​⟩⟨ϕM​∣ and ϕM=M−1/2∑j=0M−1∣j,j⟩\phi_M=M^{-1/2}\sum_{j=0}^{M-1}|j,j\rangleϕM​=M−1/2∑j=0M−1​∣j,j⟩. Tensor powers act independently on their factors; at n=0n=0n=0 they use the empty product, and the displayed rate quotient uses the total convention x/0=0x/0=0x/0=0. The assertion is the conjunction

Ptr(U)=Imax⁡(U),Imax⁡(U)=Ipur(U),Ptr(U)=Q(N).P_{\mathrm{tr}}(U)=I_{\max}(U),\qquad I_{\max}(U)=I_{\mathrm{pur}}(U),\qquad P_{\mathrm{tr}}(U)=Q(N).Ptr​(U)=Imax​(U),Imax​(U)=Ipur​(U),Ptr​(U)=Q(N).
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