Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section IV.A: private capacity of the two-Kraus qubit family

Open
QAlgorithms.Papers.Independent.Support50.P07.twoKraus_privateCapacity

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

prove2quantum

For γ,δ∈[0,1]\gamma,\delta\in[0,1]γ,δ∈[0,1], let Nγ,δ\mathcal N_{\gamma,\delta}Nγ,δ​ have Kraus matrices A0=diag⁡(1−γ,1−δ)A_0=\operatorname{diag}(\sqrt{1-\gamma},\sqrt{1-\delta})A0​=diag(1−γ​,1−δ​) and A1=(0δγ0)A_1=\begin{pmatrix}0&\sqrt\delta\\\sqrt\gamma&0\end{pmatrix}A1​=(0γ​​δ​0​). Then

Cp(Nγ,δ)=max⁡0≤t≤1{H(t(1−γ)+(1−t)δ)−H(tγ+(1−t)δ)}.C_p(\mathcal N_{\gamma,\delta})=\max_{0\le t\le1}\{H(t(1-\gamma)+(1-t)\delta)-H(t\gamma+(1-t)\delta)\}.Cp​(Nγ,δ​)=0≤t≤1max​{H(t(1−γ)+(1−t)δ)−H(tγ+(1−t)δ)}.

The maximum is attained, including in the antidegradable regime.

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]

/-- Section IV.A, PDF p.6: optimized formula for all physical two-Kraus parameters,
including the antidegradable regime. The existential t records the printed MAX, not just a supremum. -/
theorem twoKraus_privateCapacity [Nonempty E]
    (U : Matrix (Fin 2 × E) (Fin 2) ℂ)
    (hU : IsIsometry U) (gamma delta : ℝ)
    (hg : gamma ∈ Set.Icc 0 1) (hd : delta ∈ Set.Icc 0 1)
    (hmap : receiverChannel U = twoKrausChannel gamma delta) :
    ∃ t : ℝ, t ∈ Set.Icc 0 1 ∧
      fullTracePrivateCapacity U = twoKrausValue gamma delta t ∧
      ∀ s ∈ Set.Icc (0 : ℝ) 1, twoKrausValue gamma delta s ≤ twoKrausValue gamma delta t := 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.A: private capacity of the two-Kraus qubit family
Read-back

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

For every finite nonempty type EEE with decidable equality, every complex matrix U:C2→C2⊗CEU:\mathbb C^2\to\mathbb C^2\otimes\mathbb C^EU:C2→C2⊗CE satisfying U†U=IU^\dagger U=IU†U=I, and all γ,δ∈[0,1]\gamma,\delta\in[0,1]γ,δ∈[0,1], assume that, for every complex 2×22\times22×2 matrix XXX,

Tr⁡E(UXU†)=K0XK0†+K1XK1†,K0=(1−γ001−δ),K1=(0δγ0).\operatorname{Tr}_E(UXU^\dagger)=K_0XK_0^\dagger+K_1XK_1^\dagger,\qquad K_0=\begin{pmatrix}\sqrt{1-\gamma}&0\\0&\sqrt{1-\delta}\end{pmatrix},\quad K_1=\begin{pmatrix}0&\sqrt\delta\\\sqrt\gamma&0\end{pmatrix}.TrE​(UXU†)=K0​XK0†​+K1​XK1†​,K0​=(1−γ​0​01−δ​​),K1​=(0γ​​δ​0​).

Then there exists t∈[0,1]t\in[0,1]t∈[0,1] such that

C(U)=h2(t(1−γ)+(1−t)δ)−h2(tγ+(1−t)δ),C(U)=h_2\bigl(t(1-\gamma)+(1-t)\delta\bigr) -h_2\bigl(t\gamma+(1-t)\delta\bigr),C(U)=h2​(t(1−γ)+(1−t)δ)−h2​(tγ+(1−t)δ),

and, for every s∈[0,1]s\in[0,1]s∈[0,1], the same expression with sss in place of ttt is at most its value at ttt. Here h2(x)=binEntropy⁡(x)/log⁡2h_2(x)=\operatorname{binEntropy}(x)/\log 2h2​(x)=binEntropy(x)/log2 is binary entropy. The quantity C(U)C(U)C(U) is the supremum over nonnegative real rates rrr with the following property: for every ε>0\varepsilon>0ε>0 and slack η>0\eta>0η>0, there is an integer n0>0n_0>0n0​>0 such that every integer n≥n0n\ge n_0n≥n0​ admits an integer M>0M>0M>0, density matrices ρm\rho_mρm​ on the nnn-fold input, and positive semidefinite measurement matrices DjD_jDj​ on the nnn-fold receiver output with ∑jDj=I\sum_jD_j=I∑j​Dj​=I, for which log⁡2M/n≥r−η\log_2M/n\ge r-\etalog2​M/n≥r−η and ∥Ω−JM(ΩE)∥1<ε\|\Omega-J_M(\Omega_E)\|_1<\varepsilon∥Ω−JM​(ΩE​)∥1​<ε. In this definition,

Ω=1M∑m,j=0M−1∣m,j⟩⟨m,j∣⊗Tr⁡Bn ⁣[(Dj⊗I)U(n)ρmU(n)†],ΩE=Tr⁡m,jΩ,JM(σ)=1M∑m∣m,m⟩⟨m,m∣⊗σ,\Omega=\frac1M\sum_{m,j=0}^{M-1}|m,j\rangle\langle m,j|\otimes \operatorname{Tr}_{B^n}\!\left[(D_j\otimes I)U^{(n)}\rho_mU^{(n)\dagger}\right], \quad \Omega_E=\operatorname{Tr}_{m,j}\Omega,\quad J_M(\sigma)=\frac1M\sum_m|m,m\rangle\langle m,m|\otimes\sigma,Ω=M1​m,j=0∑M−1​∣m,j⟩⟨m,j∣⊗TrBn​[(Dj​⊗I)U(n)ρm​U(n)†],ΩE​=Trm,j​Ω,JM​(σ)=M1​m∑​∣m,m⟩⟨m,m∣⊗σ,

where U(b,e),a(n)=∏i=0n−1U(bi,ei),aiU^{(n)}_{(b,e),a}=\prod_{i=0}^{n-1}U_{(b_i,e_i),a_i}U(b,e),a(n)​=∏i=0n−1​U(bi​,ei​),ai​​, a density matrix is positive semidefinite with trace 111, and ∥X∥1=Re⁡tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{tr}\sqrt{X^\dagger X}∥X∥1​=RetrX†X​. The error uses this full trace norm, without a factor 1/21/21/2. All parameter endpoints are included, and the maximizing ttt is not asserted to be unique.

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