Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4: generalized-dephasing classical–quantum capacity

Open
QAlgorithms.Papers.Independent.Gap48.P39.generalized_dephasing_cq

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

prove2quantum

Let X,C,EX,C,EX,C,E be nonempty finite basis sets and let each ∣ψx⟩CE|\psi_x\rangle^{CE}∣ψx​⟩CE be a unit vector, without any orthogonality assumption. Define U∣x⟩=∣x⟩B∣ψx⟩CEU|x\rangle=|x\rangle^B|\psi_x\rangle^{CE}U∣x⟩=∣x⟩B∣ψx​⟩CE, with BBB indexed by XXX, and N=Tr⁡E∘Ad⁡U\mathcal N=\operatorname{Tr}_E\circ\operatorname{Ad}_UN=TrE​∘AdU​. Its closed unassisted common-classical/Alice–Bob-EPR capacity region is

CQ(N)={(R,Q)≥0:Q≤H(X∣T)ω−H(CE∣T)ω, R≤I(T;C)ω},CQ(\mathcal N)=\{(R,Q)\ge0:Q\le H(X\mid T)_\omega-H(CE\mid T)_\omega,\ R\le I(T;C)_\omega\},CQ(N)={(R,Q)≥0:Q≤H(X∣T)ω​−H(CE∣T)ω​, R≤I(T;C)ω​},

where the union ranges over distributions p(t,x)p(t,x)p(t,x) with ∣T∣≤∣X∣|T|\le|X|∣T∣≤∣X∣ and ωTXCE=⨁t,xp(t,x)ψxCE\omega^{TXCE}=\bigoplus_{t,x}p(t,x)\psi_x^{CE}ωTXCE=⨁t,x​p(t,x)ψxCE​. Entropies are in bits; ψx\psi_xψx​ denotes the normalized rank-one density matrix. The operational criterion is vanishing maximum joint squared-fidelity error to both common labels and an independent EPR target, with no side communication or preshared resources. Only the dilation UUU is isometric; EEE is discarded from N\mathcal NN. This provides an exact single-letter formula while retaining CECECE jointly in the quantum-rate bound.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P39
Formal statement
noncomputable section

open scoped BigOperators Matrix ComplexConjugate

namespace QAlgorithms.Papers.Independent.Gap48.P39

open QAlgorithms.Papers.Independent.Information100.P21 (Op)

open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)

open QAlgorithms.Papers.Independent.Claimed50.P08 (cqBlocks holevoInfo)

open QAlgorithms.Papers.Independent.Dependency50.P19 (both epr mutualInformation marginalRA marginalRB)

open QAlgorithms.Papers.Independent.Information100.P58 (Distribution)

open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity conditionalEntropy groupedChannelPower)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {A B C X T E : Type}

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype C] [DecidableEq C] [Fintype X] [DecidableEq X]

variable [Fintype T] [DecidableEq T] [Fintype E] [DecidableEq E]

/-- Theorem 4, PDF pp.8,10,14: generalized-dephasing CQ capacity, |T|≤|X|.
CE remains joint in the quantum bound; only E is traced for Charlie's information. -/
theorem generalized_dephasing_cq [Nonempty X] [Nonempty C] [Nonempty E]
    (D : DephasingData X (C × E)) :
    cqGenerationCapacity (generalizedDephasingBroadcast D) = dephasingRegion D (traceRight : Superop (C × E) C) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P39

end
Source
Quantum broadcast channels, arXiv:quant-ph/0603098v2, PDF p. 8, Theorem 4: generalized-dephasing classical–quantum capacity
Read-back

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

Let X,C,EX,C,EX,C,E be nonempty finite register index types with decidable equality, and let ψx∈CC×E\psi_x\in\mathbb C^{C\times E}ψx​∈CC×E have norm 111 for every x∈Xx\in Xx∈X. Define N\mathcal NN on arbitrary matrices by

N(ρ)(x,c),(y,c′)=ρx,y∑eψx(c,e)ψy(c′,e)‾.\mathcal N(\rho)_{(x,c),(y,c')}=\rho_{x,y}\sum_e\psi_x(c,e)\overline{\psi_y(c',e)}.N(ρ)(x,c),(y,c′)​=ρx,y​e∑​ψx​(c,e)ψy​(c′,e)​.

Its classical–quantum generation capacity, as defined here, is the closure of the nonnegative pairs (r1,r2)(r_1,r_2)(r1​,r2​) satisfying this condition: for every ϵ>0\epsilon>0ϵ>0, for every sufficiently large integer nnn, with m=⌊2nr1⌋m=\lfloor2^{nr_1}\rfloorm=⌊2nr1​⌋ and k=⌊2nr2⌋k=\lfloor2^{nr_2}\rfloork=⌊2nr2​⌋, one can choose a unit vector vs∈CFin(k)×Xnv_s\in\mathbb C^{\mathrm{Fin}(k)\times X^n}vs​∈CFin(k)×Xn for every s<ms<ms<m, a Bob instrument from the first output XnX^nXn to Fin(k)\mathrm{Fin}(k)Fin(k) with classical outcome h<mh<mh<m, and a Charlie POVM on CnC^nCn with outcome j<mj<mj<m, such that for every s<ms<ms<m the decoded joint state has squared fidelity at least 1−ϵ1-\epsilon1−ϵ with the state having h=j=sh=j=sh=j=s and an EPR state k−1/2∑i<k∣i,i⟩k^{-1/2}\sum_{i<k}|i,i\ranglek−1/2∑i<k​∣i,i⟩ between the untouched reference and Bob’s quantum output. The instrument consists of finitely many Kraus matrices Kh,aK_{h,a}Kh,a​ with ∑h,aKh,a†Kh,a=I\sum_{h,a}K_{h,a}^\dagger K_{h,a}=I∑h,a​Kh,a†​Kh,a​=I; a POVM consists of positive semidefinite matrices summing to III. Squared fidelity is (Re⁡tr⁡Z WZ)2\bigl(\operatorname{Re}\operatorname{tr}\sqrt{\sqrt Z\,W\sqrt Z}\bigr)^2(RetrZ​WZ​​)2. The asserted capacity equals exactly the set of nonnegative pairs for which there exist 0<t≤∣X∣0<t\le|X|0<t≤∣X∣ and probabilities ps,x≥0p_{s,x}\ge0ps,x​≥0 summing to 111, such that, writing Πx=∣ψx⟩⟨ψx∣\Pi_x=|\psi_x\rangle\langle\psi_x|Πx​=∣ψx​⟩⟨ψx​∣,

Ω=⨁s<t∑xps,xΠx,Λ=⨁s<t∑xps,xtr⁡EΠx,\Omega=\bigoplus_{s<t}\sum_xp_{s,x}\Pi_x,\qquad \Lambda=\bigoplus_{s<t}\sum_xp_{s,x}\operatorname{tr}_E\Pi_x,Ω=s<t⨁​x∑​ps,x​Πx​,Λ=s<t⨁​x∑​ps,x​trE​Πx​,

the inequalities

r2≤S ⁣(diag⁡(ps,x))−S(Ω),r1≤S(tr⁡CΛ)+S(tr⁡Fin(t)Λ)−S(Λ)r_2\le S\!\left(\operatorname{diag}(p_{s,x})\right)-S(\Omega),\qquad r_1\le S(\operatorname{tr}_C\Lambda)+S(\operatorname{tr}_{\mathrm{Fin}(t)}\Lambda)-S(\Lambda)r2​≤S(diag(ps,x​))−S(Ω),r1​≤S(trC​Λ)+S(trFin(t)​Λ)−S(Λ)

hold, where S(Z)=−Re⁡tr⁡f(Z)S(Z)=-\operatorname{Re}\operatorname{tr}f(Z)S(Z)=−Retrf(Z) with f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x applied by continuous functional calculus. Channel uses are the tensor power N⊗n\mathcal N^{\otimes n}N⊗n, with the outputs grouped by receiver. Zero rates and zero probabilities are included.

Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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