Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 12: entropy upper bound for a general Pauli channel

Open
QAlgorithms.Papers.Independent.Support50.P07.pauli_privateCapacity_bound

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

prove2quantum

Let p1,p2,p3≥0p_1,p_2,p_3\ge0p1​,p2​,p3​≥0 have sum s=p1+p2+p3≤1s=p_1+p_2+p_3\le1s=p1​+p2​+p3​≤1, and let X,Y,ZX,Y,ZX,Y,Z be the standard qubit Pauli matrices. For the channel Np(ρ)=(1−s)ρ+p1XρX+p2YρY+p3ZρZ\mathcal N_{\mathbf p}(\rho)=(1-s)\rho+p_1X\rho X+p_2Y\rho Y+p_3Z\rho ZNp​(ρ)=(1−s)ρ+p1​XρX+p2​YρY+p3​ZρZ, with any full Stinespring realization, one has

Cp(Np)≤1−H(s).C_p(\mathcal N_{\mathbf p})\le1-H(s).Cp​(Np​)≤1−H(s).

The identity endpoint s=0s=0s=0 is included; HHH is binary entropy in bits.

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 12, PDF p.7: full probability simplex, including the identity endpoint.
The proof's p_i/s at s=0 is not a hypothesis of this statement. -/
theorem pauli_privateCapacity_bound [Nonempty E]
    (U : Matrix (Fin 2 × E) (Fin 2) ℂ)
    (hU : IsIsometry U) (p : Fin 3 → ℝ) (hp : ∀ i, 0 ≤ p i)
    (hs : ∑ i, p i ≤ 1) (hmap : receiverChannel U = qubitPauliProbabilityChannel p) :
    fullTracePrivateCapacity U ≤ 1 - binEntropy2 (∑ i, p i) := 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. 7, Theorem 12: entropy upper bound for a general Pauli channel
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, and let U:C2→C2⊗CEU:\mathbb C^2\to\mathbb C^2\otimes\mathbb C^EU:C2→C2⊗CE satisfy U†U=IU^\dagger U=IU†U=I. Let p0,p1,p2≥0p_0,p_1,p_2\ge0p0​,p1​,p2​≥0 satisfy s=p0+p1+p2≤1s=p_0+p_1+p_2\le1s=p0​+p1​+p2​≤1, and assume equality of maps on all complex 2×22\times22×2 matrices:

Tr⁡E(UρU†)=(1−s)ρ+p0XρX†+p1YρY†+p2ZρZ†,X=(0110), Y=(0−ii0), Z=(100−1).\operatorname{Tr}_E(U\rho U^\dagger) =(1-s)\rho+p_0X\rho X^\dagger+p_1Y\rho Y^\dagger+p_2Z\rho Z^\dagger, \qquad X=\begin{pmatrix}0&1\\1&0\end{pmatrix},\ Y=\begin{pmatrix}0&-i\\i&0\end{pmatrix},\ Z=\begin{pmatrix}1&0\\0&-1\end{pmatrix}.TrE​(UρU†)=(1−s)ρ+p0​XρX†+p1​YρY†+p2​ZρZ†,X=(01​10​), Y=(0i​−i0​), Z=(10​0−1​).

Define Ctr(U)C_{\mathrm{tr}}(U)Ctr​(U) as the real supremum of nonnegative rates RRR such that, for every ε,δ>0\varepsilon,\delta>0ε,δ>0, every sufficiently large positive integer nnn admits M≥1M\ge1M≥1, density input matrices ρm\rho_mρm​ on (C2)⊗n(\mathbb C^2)^{\otimes n}(C2)⊗n, and a receiver POVM (Dj)j<M(D_j)_{j<M}(Dj​)j<M​, with R−δ≤log⁡2M/nR-\delta\le\log_2M/nR−δ≤log2​M/n. Density matrices are positive semidefinite with trace one, and POVM elements are positive semidefinite and sum to III. For the independently applied dilation Un((bi),(ei);(ai))=∏i<nU(bi,ei;ai)U_n((b_i),(e_i);(a_i))=\prod_{i<n}U(b_i,e_i;a_i)Un​((bi​),(ei​);(ai​))=∏i<n​U(bi​,ei​;ai​), let Ω=M−1∑m,j∣m,j⟩⟨m,j∣⊗Tr⁡receiver[(Dj⊗I)UnρmUn†]\Omega=M^{-1}\sum_{m,j}|m,j\rangle\langle m,j|\otimes\operatorname{Tr}_{\mathrm{receiver}}[(D_j\otimes I)U_n\rho_mU_n^\dagger]Ω=M−1∑m,j​∣m,j⟩⟨m,j∣⊗Trreceiver​[(Dj​⊗I)Un​ρm​Un†​] and η=Tr⁡m,jΩ\eta=\operatorname{Tr}_{m,j}\Omegaη=Trm,j​Ω; require ∥Ω−M−1∑m∣m,m⟩⟨m,m∣⊗η∥1<ε\|\Omega-M^{-1}\sum_m|m,m\rangle\langle m,m|\otimes\eta\|_1<\varepsilon∥Ω−M−1∑m​∣m,m⟩⟨m,m∣⊗η∥1​<ε, using the full trace norm ∥T∥1=Re⁡tr⁡T†T\|T\|_1=\operatorname{Re}\operatorname{tr}\sqrt{T^\dagger T}∥T∥1​=RetrT†T​. Then Ctr(U)≤1−h2(s)C_{\mathrm{tr}}(U)\le1-h_2(s)Ctr​(U)≤1−h2​(s), where h2(s)=[−slog⁡s−(1−s)log⁡(1−s)]/log⁡2h_2(s)=[-s\log s-(1-s)\log(1-s)]/\log2h2​(s)=[−slogs−(1−s)log(1−s)]/log2, with zero contributions at s=0s=0s=0 or s=1s=1s=1. No strict positivity of the individual pip_ipi​, nor a restriction s≤1/2s\le1/2s≤1/2, is assumed.

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