Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section IV.A and reference note [28]: dephasing private capacity

Open
QAlgorithms.Papers.Independent.Support50.P07.dephasing_privateCapacity

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

prove2quantum

Choose any Pauli axis P∈{X,Y,Z}P\in\{X,Y,Z\}P∈{X,Y,Z} and p∈[0,1]p\in[0,1]p∈[0,1]. For the receiver map N(ρ)=(1−p)ρ+pPρP†\mathcal N(\rho)=(1-p)\rho+pP\rho P^\daggerN(ρ)=(1−p)ρ+pPρP†, with any full isometric dilation,

Cp(N)=1−H(p).C_p(\mathcal N)=1-H(p).Cp​(N)=1−H(p).

The private capacity uses the full trace-norm operational criterion above, arbitrary mixed block inputs, uniform messages and normalized POVMs; HHH is binary entropy in bits. All parameter endpoints and all three Pauli axes are included.

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.6–7 and note [28], p.8: general channel private capacity, allowing
arbitrary mixed and entangled signal states, equals the dephasing formula.
All three Pauli axes are included, as in IV.A and the proof of Theorem 12. -/
theorem dephasing_privateCapacity [Nonempty E]
    (U : Matrix (Fin 2 × E) (Fin 2) ℂ)
    (hU : IsIsometry U) (axis : Fin 3) (p : ℝ) (hp : p ∈ Set.Icc 0 1)
    (hmap : receiverChannel U =
      qubitPauliProbabilityChannel (fun i => if i = axis then p else 0)) :
    fullTracePrivateCapacity U = 1 - binEntropy2 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. 7, Section IV.A and reference note [28]: dephasing private capacity
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​, choose an index a∈{0,1,2}a\in\{0,1,2\}a∈{0,1,2}, and let p∈[0,1]p\in[0,1]p∈[0,1]. Put

P0=(0110),P1=(0−ii0),P2=(100−1),P_0=\begin{pmatrix}0&1\\1&0\end{pmatrix},\qquad P_1=\begin{pmatrix}0&-i\\i&0\end{pmatrix},\qquad P_2=\begin{pmatrix}1&0\\0&-1\end{pmatrix},P0​=(01​10​),P1​=(0i​−i0​),P2​=(10​0−1​),

and assume, as equality on every matrix ρ\rhoρ, that

Tr⁡E(UρU†)=(1−p)ρ+pPaρPa†.\operatorname{Tr}_E(U\rho U^\dagger)=(1-p)\rho+pP_a\rho P_a^\dagger.TrE​(UρU†)=(1−p)ρ+pPa​ρPa†​.

Define Ptr(U)P_{\mathrm{tr}}(U)Ptr​(U) to be the real supremum of all r≥0r\ge0r≥0 with the following property: for every error tolerance ε>0\varepsilon>0ε>0 and slack s>0s>0s>0, there is an integer n0>0n_0>0n0​>0 such that every n≥n0n\ge n_0n≥n0​ admits an integer M>0M>0M>0, density matrices ρm\rho_mρm​ on (C2)⊗n(\mathbb C^2)^{\otimes n}(C2)⊗n, and matrices Qj≥0Q_j\ge0Qj​≥0 on the receiver output with ∑j=0M−1Qj=I\sum_{j=0}^{M-1}Q_j=I∑j=0M−1​Qj​=I, such that r−s≤log⁡2M/nr-s\le\log_2M/nr−s≤log2​M/n and the following trace norm error is strictly less than ε\varepsilonε. Here density means positive semidefinite with trace 111; form the matrix Ω\OmegaΩ, indexed by message mmm, decoded label jjj, and environment index e∈Ene\in E^ne∈En, with 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′)​.

The error is

∥Ω−1M∑m∣m,m⟩⟨m,m∣⊗Tr⁡m,jΩ∥1,∥X∥1=Tr⁡X†X.\left\|\Omega-\frac1M\sum_m|m,m\rangle\langle m,m|\otimes\operatorname{Tr}_{m,j}\Omega\right\|_1, \qquad \|X\|_1=\operatorname{Tr}\sqrt{X^\dagger X}.​Ω−M1​m∑​∣m,m⟩⟨m,m∣⊗Trm,j​Ω​1​,∥X∥1​=TrX†X​.

The tensor dilation has entries given by products of the corresponding entries of UUU. Writing H2(p)=[−plog⁡p−(1−p)log⁡(1−p)]/log⁡2H_2(p)=[-p\log p-(1-p)\log(1-p)]/\log2H2​(p)=[−plogp−(1−p)log(1−p)]/log2, with 0log⁡0=00\log0=00log0=0, the assertion is

Ptr(U)=1−H2(p).P_{\mathrm{tr}}(U)=1-H_2(p).Ptr​(U)=1−H2​(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