Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered result in Theorem 11: antidegradable channels have zero ss-private capacity

Open
QAlgorithms.Papers.Independent.Support50.P07.antidegradable_ssPrivateCapacity

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

prove2quantum

If N\mathcal NN is antidegradable, meaning that a CPTP map simulates its receiver from the full complementary output of the same dilation, then

Cp,ss(N)=Q(1)(N)=0.C_{p,ss}(\mathcal N)=Q^{(1)}(\mathcal N)=0.Cp,ss​(N)=Q(1)(N)=0.

The one-letter coherent information optimizes over arbitrary normalized input density operators.

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.

The conclusion also explicitly includes the unassisted private capacity Cp(N)=0C_p(\mathcal N)=0Cp​(N)=0.

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]

/-- PDF pp.5–6: environment-to-receiverChannel simulation forces zero ss-private capacity;
the equality with Q^(1) mentioned in Theorem 11 is retained. -/
theorem antidegradable_ssPrivateCapacity [Nonempty A] [Nonempty B] [Nonempty E]
    (U : Matrix (B × E) A ℂ)
    (hU : IsIsometry U) (ha : IsAntidegradable U) :
    ssPrivateCapacity U = 0 ∧ maximumCoherentInformation U = 0 ∧
    fullTracePrivateCapacity U = 0 := 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. 5, Unnumbered result in Theorem 11: antidegradable channels have zero ss-private capacity
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​. Write 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†), and assume that there exists a channel D:E→BD:E\to BD:E→B satisfying N(ρ)=D(Nc(ρ))N(\rho)=D(N^c(\rho))N(ρ)=D(Nc(ρ)) for every matrix ρ\rhoρ. Here a channel has 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; a density matrix is positive semidefinite with trace 111. For any isometric dilation W:I→O⊗FW:I\to O\otimes FW:I→O⊗F, a finite code consists of M>0M>0M>0, input density matrices ρm\rho_mρm​, and a measurement Qj≥0Q_j\ge0Qj​≥0, ∑jQj=IO\sum_jQ_j=I_O∑j​Qj​=IO​. Its joint matrix has entries

Ω(m,j,f),(m′,j′,f′)={M−1∑o,o′(Qj)o′,o(WρmW†)(o,f),(o′,f′),m=m′, j=j′,0,otherwise.\Omega_{(m,j,f),(m',j',f')}= \begin{cases} M^{-1}\displaystyle\sum_{o,o'}(Q_j)_{o',o}(W\rho_mW^\dagger)_{(o,f),(o',f')},&m=m',\ j=j',\\ 0,&\text{otherwise}. \end{cases}Ω(m,j,f),(m′,j′,f′)​=⎩⎨⎧​M−1o,o′∑​(Qj​)o′,o​(Wρm​W†)(o,f),(o′,f′)​,0,​m=m′, j=j′,otherwise.​

With τ=Tr⁡m,jΩ\tau=\operatorname{Tr}_{m,j}\Omegaτ=Trm,j​Ω, its error is

e(W,ρ,Q)=∥Ω−1M∑m∣m,m⟩⟨m,m∣⊗τ∥1,∥X∥1=Tr⁡X†X.e(W,\rho,Q)=\left\|\Omega-\frac1M\sum_m|m,m\rangle\langle m,m|\otimes\tau\right\|_1, \qquad \|X\|_1=\operatorname{Tr}\sqrt{X^\dagger X}.e(W,ρ,Q)=​Ω−M1​m∑​∣m,m⟩⟨m,m∣⊗τ​1​,∥X∥1​=TrX†X​.

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 slack s>0s>0s>0, there is n0>0n_0>0n0​>0 such that every n≥n0n\ge n_0n≥n0​ admits a code for U⊗nU^{\otimes n}U⊗n with e<εe<\varepsilone<ε and r−s≤log⁡2M/nr-s\le\log_2M/nr−s≤log2​M/n. Define Pss(U)P_{\mathrm{ss}}(U)Pss​(U) by the same quantifiers, except that for each such nnn one may also choose any integer d>0d>0d>0 and use the dilation

U^n,d ; ((b,f),(e,g)),(a,(h,k))=(U⊗n)(b,e),a 1f=h1g=k,\widehat U_{n,d\,;\,((b,f),(e,g)),(a,(h,k))} =(U^{\otimes n})_{(b,e),a}\,\mathbf1_{f=h}\mathbf1_{g=k},Un,d;((b,f),(e,g)),(a,(h,k))​=(U⊗n)(b,e),a​1f=h​1g=k​,

from An⊗Cd⊗CdA^n\otimes\mathbb C^d\otimes\mathbb C^dAn⊗Cd⊗Cd to (Bn⊗Cd)⊗(En⊗Cd)(B^n\otimes\mathbb C^d)\otimes(E^n\otimes\mathbb C^d)(Bn⊗Cd)⊗(En⊗Cd). Every input density matrix must satisfy, separately in its row and column indices,

ρm((a,f,g),z)=ρm((a,g,f),z),ρm(z,(a,f,g))=ρm(z,(a,g,f)).\rho_m((a,f,g),z)=\rho_m((a,g,f),z),\qquad \rho_m(z,(a,f,g))=\rho_m(z,(a,g,f)).ρm​((a,f,g),z)=ρm​((a,g,f),z),ρm​(z,(a,f,g))=ρm​(z,(a,g,f)).

There is no bound on the growth of ddd in this definition. Finally put

Imax⁡(U)=sup⁡ρ a density matrix on A[S(N(ρ))−S(Nc(ρ))],S(σ)=−Tr⁡(σlog⁡2σ),I_{\max}(U)=\sup_{\rho\text{ a density matrix on }A} \bigl[S(N(\rho))-S(N^c(\rho))\bigr], \qquad S(\sigma)=-\operatorname{Tr}(\sigma\log_2\sigma),Imax​(U)=ρ a density matrix on Asup​[S(N(ρ))−S(Nc(ρ))],S(σ)=−Tr(σlog2​σ),

with zero eigenvalues contributing zero. The assertion is

Pss(U)=0,Imax⁡(U)=0,Ptr(U)=0.P_{\mathrm{ss}}(U)=0,\qquad I_{\max}(U)=0,\qquad P_{\mathrm{tr}}(U)=0.Pss​(U)=0,Imax​(U)=0,Ptr​(U)=0.
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