Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section IV.C: symmetric-assisted depolarizing capacity bound

Open
QAlgorithms.Papers.Independent.Support50.P07.depolarizing_ssPrivateCapacity_bound

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

prove2quantum

For p∈[0,1]p\in[0,1]p∈[0,1], let Np(ρ)=(1−p)ρ+p3(XρX+YρY+ZρZ)\mathcal N_p(\rho)=(1-p)\rho+\frac p3(X\rho X+Y\rho Y+Z\rho Z)Np​(ρ)=(1−p)ρ+3p​(XρX+YρY+ZρZ), let ηp=41−p(1−1−p)\eta_p=4\sqrt{1-p}(1-\sqrt{1-p})ηp​=41−p​(1−1−p​), and set f(γ)=sup⁡0≤t≤1[H(t(1−γ))−H(tγ)]f(\gamma)=\sup_{0\le t\le1}[H(t(1-\gamma))-H(t\gamma)]f(γ)=sup0≤t≤1​[H(t(1−γ))−H(tγ)]. Let g(p)=min⁡{1−H(p),f(ηp),max⁡(1−4p,0)}g(p)=\min\{1-H(p),f(\eta_p),\max(1-4p,0)\}g(p)=min{1−H(p),f(ηp​),max(1−4p,0)}. Write conv⁡g\operatorname{conv}gconvg for the lower convex envelope on [0,1][0,1][0,1], namely the infimum of ∑iwig(pi)\sum_i w_i g(p_i)∑i​wi​g(pi​) over finite nonnegative weights summing to one with pi∈[0,1]p_i\in[0,1]pi​∈[0,1] and ∑iwipi=p\sum_i w_ip_i=p∑i​wi​pi​=p. Then

Cp,ss(Np)≤(conv⁡g)(p).C_{p,ss}(\mathcal N_p)\le (\operatorname{conv}g)(p).Cp,ss​(Np​)≤(convg)(p).

Here ppp is total Pauli error; the QBER is 2p/32p/32p/3.

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 same bound on the unassisted capacity, Cp(Np)≤conv⁡(g)(p)C_p(\mathcal N_p)\le\operatorname{conv}(g)(p)Cp​(Np​)≤conv(g)(p), is included explicitly.

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.C, PDF pp.6–7: convex envelope of the three displayed ss bounds.
Here p is total Pauli error, not QBER. Above p=1/4 the zero bound suffices, including
where the low-noise damping decomposition no longer applies. -/
theorem depolarizing_ssPrivateCapacity_bound [Nonempty E]
    (U : Matrix (Fin 2 × E) (Fin 2) ℂ)
    (hU : IsIsometry U) (p : ℝ) (hp : p ∈ Set.Icc 0 1)
    (hmap : receiverChannel U = depolarizingChannel p) :
    ssPrivateCapacity U ≤ depolarizingEnvelope p ∧
    fullTracePrivateCapacity U ≤ depolarizingEnvelope p := 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.C: symmetric-assisted depolarizing capacity bound
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 U:C2→C2⊗CEU:\mathbb C^2\to\mathbb C^2\otimes\mathbb C^EU:C2→C2⊗CE satisfy U†U=I2U^\dagger U=I_2U†U=I2​, and let p∈[0,1]p\in[0,1]p∈[0,1]. Using

X=(0110),Y=(0−ii0),Z=(100−1),X=\begin{pmatrix}0&1\\1&0\end{pmatrix},\quad Y=\begin{pmatrix}0&-i\\i&0\end{pmatrix},\quad Z=\begin{pmatrix}1&0\\0&-1\end{pmatrix},X=(01​10​),Y=(0i​−i0​),Z=(10​0−1​),

assume that, for every matrix ρ\rhoρ,

Tr⁡E(UρU†)=(1−p)ρ+p3(XρX+YρY+ZρZ).\operatorname{Tr}_E(U\rho U^\dagger)=(1-p)\rho+\frac p3(X\rho X+Y\rho Y+Z\rho Z).TrE​(UρU†)=(1−p)ρ+3p​(XρX+YρY+ZρZ).

For a dilation W:I→O⊗FW:I\to O\otimes FW:I→O⊗F, a code consists of M>0M>0M>0, positive semidefinite input matrices ρm\rho_mρm​ of trace 111, and a measurement Qj≥0Q_j\ge0Qj​≥0, ∑jQj=IO\sum_jQ_j=I_O∑j​Qj​=IO​. Its decoded joint matrix is zero between distinct classical labels and has blocks

Ω(m,j,f),(m,j,f′)=1M∑o,o′(Qj)o′,o(WρmW†)(o,f),(o′,f′).\Omega_{(m,j,f),(m,j,f')}=\frac1M\sum_{o,o'}(Q_j)_{o',o} (W\rho_mW^\dagger)_{(o,f),(o',f')}.Ω(m,j,f),(m,j,f′)​=M1​o,o′∑​(Qj​)o′,o​(Wρm​W†)(o,f),(o′,f′)​.

Its error is

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

Define Ptr(U)P_{\mathrm{tr}}(U)Ptr​(U) as the real supremum of r≥0r\ge0r≥0 such that, for every ε>0\varepsilon>0ε>0 and s>0s>0s>0, some n0>0n_0>0n0​>0 ensures 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, allowing at each block length an arbitrary integer d>0d>0d>0, a code for 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​,

and input density matrices satisfying the separate row and column symmetries

ρ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)).

The integer ddd may depend on the tolerances and block length, and has no growth bound in this definition. Write H2(x)=[−xlog⁡x−(1−x)log⁡(1−x)]/log⁡2H_2(x)=[-x\log x-(1-x)\log(1-x)]/\log2H2​(x)=[−xlogx−(1−x)log(1−x)]/log2, with 0log⁡0=00\log0=00log0=0, and define

D(γ)=sup⁡t∈[0,1][H2(t(1−γ))−H2(tγ)],g(x)=41−x(1−1−x).D(\gamma)=\sup_{t\in[0,1]}\bigl[H_2(t(1-\gamma))-H_2(t\gamma)\bigr], \qquad g(x)=4\sqrt{1-x}\bigl(1-\sqrt{1-x}\bigr).D(γ)=t∈[0,1]sup​[H2​(t(1−γ))−H2​(tγ)],g(x)=41−x​(1−1−x​).

Let E(p)\mathcal E(p)E(p) be the real infimum of

∑i=0k−1wimin⁡ ⁣{1−H2(xi), D(g(xi)), max⁡(1−4xi,0)}\sum_{i=0}^{k-1}w_i \min\!\left\{1-H_2(x_i),\ D(g(x_i)),\ \max(1-4x_i,0)\right\}i=0∑k−1​wi​min{1−H2​(xi​), D(g(xi​)), max(1−4xi​,0)}

over every positive integer kkk and real families wi,xiw_i,x_iwi​,xi​ satisfying wi≥0w_i\ge0wi​≥0, xi∈[0,1]x_i\in[0,1]xi​∈[0,1], ∑iwi=1\sum_iw_i=1∑i​wi​=1, and ∑iwixi=p\sum_iw_ix_i=p∑i​wi​xi​=p; zero weights are allowed. The assertion is

Pss(U)≤E(p),Ptr(U)≤E(p).P_{\mathrm{ss}}(U)\le\mathcal E(p),\qquad P_{\mathrm{tr}}(U)\le\mathcal E(p).Pss​(U)≤E(p),Ptr​(U)≤E(p).

Both endpoints p=0p=0p=0 and p=1p=1p=1 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