Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corrected clipped coherent-information capacity formula

Open
QAlgorithms.Papers.Independent.Support50.P39.clippedCoherentCapacity

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

prove2quantum

Let ρAB\rho_{AB}ρAB​ be a positive semidefinite density operator of trace one on two nonzero finite dimensional complex registers AAA and BBB, whose dimensions may differ. Alice and Bob receive arbitrarily many independent copies of this one fixed state for free. Alice may send quantum systems to Bob through a noiseless channel; there is no free classical communication or feedback. Arbitrary local CPTP encodings, ancillas, disposal, and joint decoding are allowed. Entropies use logarithms to base two.

Write Csd(ρ)C_{\rm sd}(\rho)Csd​(ρ) for the operational supremum of classical bits per transmitted qubit: first choose integers d≥2d\ge2d≥2 and n≥1n\ge1n≥1; a block of kkk channel uses sends a system of dimension dkd^kdk and consumes nknknk copies. For each error tolerance and rate slack, all sufficiently large positive kkk admit encoders for all mmm-bit messages and one common decoder whose success is at least 1−ϵ1-\epsilon1−ϵ for every message. The normalized rate is m/(klog⁡2d)m/(k\log_2d)m/(klog2​d), with vanishing error and arbitrarily small rate slack.

For every positive integer nnn and every CPTP map Λ:A⊗n→A′\Lambda:A^{\otimes n}\to A'Λ:A⊗n→A′ with arbitrary positive finite output dimension, put σ=(Λ⊗idB⊗n)(ρ⊗n)\sigma=(\Lambda\otimes\mathrm{id}_{B^{\otimes n}})(\rho^{\otimes n})σ=(Λ⊗idB⊗n​)(ρ⊗n). Write SA(σ)=S(σA′)S_A(\sigma)=S(\sigma_{A'})SA​(σ)=S(σA′​), IM(σ)=S(σA′)+S(σB⊗n)−S(σ)I_M(\sigma)=S(\sigma_{A'})+S(\sigma_{B^{\otimes n}})-S(\sigma)IM​(σ)=S(σA′​)+S(σB⊗n​)−S(σ), and IB(σ)=max⁡{S(σB⊗n)−S(σ),0}I^B(\sigma)=\max\{S(\sigma_{B^{\otimes n}})-S(\sigma),0\}IB(σ)=max{S(σB⊗n​)−S(σ),0}. Quotients below range only over outputs with SA(σ)>0S_A(\sigma)>0SA​(σ)>0.

Let J(ρ)\mathcal J(\rho)J(ρ) be the set of all corresponding positive-entropy quotients IB(σ)/SA(σ)I^B(\sigma)/S_A(\sigma)IB(σ)/SA​(σ), and let M(ρ)\mathcal M(\rho)M(ρ) be the mutual-information quotient set above. Then

Csd(ρ)=1+sup⁡J(ρ)=max⁡{1,sup⁡M(ρ)},J(ρ)={IB(σ)SA(σ)}.C_{\rm sd}(\rho)=1+\sup\mathcal J(\rho) =\max\{1,\sup\mathcal M(\rho)\},\qquad \mathcal J(\rho)=\left\{\frac{I^B(\sigma)}{S_A(\sigma)}\right\}.Csd​(ρ)=1+supJ(ρ)=max{1,supM(ρ)},J(ρ)={SA​(σ)IB(σ)​}.

The set J(ρ)\mathcal J(\rho)J(ρ) is nonempty and contained in [0,1][0,1][0,1]. This reformulation displays the compression tradeoff between positive coherent information and the sender's entropy.

Formalization Note The denominator printed as S(ρA)S(\rho_A)S(ρA​) in Eq. (5) is corrected to the processed entropy S(Λ(ρA⊗n))S(\Lambda(\rho_A^{\otimes n}))S(Λ(ρA⊗n​)), exactly as in Eq. (15). The equivalence holds after optimization and inclusion of baseline one; it is not a pointwise equality of clipped and signed quotients.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P39
Formal statement
namespace QAlgorithms.Papers.Independent.Support50.P39

noncomputable section

open QAlgorithms

open Filter Topology

open scoped Matrix ComplexConjugate ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

/-- arXiv:quant-ph/0106080v3, PDF p.3 Eq. (5), corrected using PDF p.7 Eq. (15),
and p.8. CORRECTION: S(rho_A) printed in Eq. (5) is replaced with the
entropy of Lambda(rho_A tensor n), as explicitly printed in Eq. (15).
For an entangled pure state, the printed denominator would give 1+n rather
than 2 under identity preprocessing. The mutual-information form agrees only
after optimization AND inclusion of baseline 1; no pointwise clipped identity
with mutual information is asserted for negative signed coherent information. -/
theorem clippedCoherentCapacity {A B : Type*} [Fintype A] [Fintype B]
    [DecidableEq A] [DecidableEq B] [Nonempty A] [Nonempty B]
    (rho : Matrix (A × B) (A × B) ℂ) (hrho : IsDensityMatrix rho) :
    (coherentRatios rho).Nonempty ∧ BddAbove (coherentRatios rho) ∧
    (∀ r ∈ coherentRatios rho, 0 ≤ r ∧ r ≤ 1) ∧
    denseCodingCapacity rho = 1 + sSup (coherentRatios rho) ∧
    max 1 (sSup (mutualRatios rho)) = 1 + sSup (coherentRatios rho) := by sorry

end

end QAlgorithms.Papers.Independent.Support50.P39
Source
Classical capacity of a noiseless quantum channel assisted by noisy entanglement, arXiv:quant-ph/0106080v3, PDF p. 3, Eq. (5), corrected by Eq. (15)
Read-back

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

Let AAA and BBB be finite, nonempty types with decidable equality, and let ρ\rhoρ be a positive semidefinite complex matrix on A×BA\times BA×B with trace 111. Write S(X)=−Re⁡tr⁡(f(X))S(X)=-\operatorname{Re}\operatorname{tr}(f(X))S(X)=−Retr(f(X)), where f(t)=tlog⁡2tf(t)=t\log_2tf(t)=tlog2​t is applied by continuous functional calculus, and write XA,XBX_A,X_BXA​,XB​ for the partial traces over Bob and Alice. A channel means a map Φ(X)=∑j=0q−1EjXEj†\Phi(X)=\sum_{j=0}^{q-1}E_jXE_j^\daggerΦ(X)=∑j=0q−1​Ej​XEj†​ for some finite family with ∑jEj†Ej=I\sum_jE_j^\dagger E_j=I∑j​Ej†​Ej​=I. Let ρ(a,b),(a′,b′)[s]=∏t=0s−1ρ(at,bt),(at′,bt′)\rho^{[s]}_{(a,b),(a',b')}=\prod_{t=0}^{s-1}\rho_{(a_t,b_t),(a'_t,b'_t)}ρ(a,b),(a′,b′)[s]​=∏t=0s−1​ρ(at​,bt​),(at′​,bt′​)​. For every positive integer sss, positive output dimension DDD, and channel Φ:As→{0,…,D−1}\Phi:A^s\to\{0,\ldots,D-1\}Φ:As→{0,…,D−1}, put ω=(Φ⊗id)(ρ[s])\omega=(\Phi\otimes\mathrm{id})(\rho^{[s]})ω=(Φ⊗id)(ρ[s]), where Φ\PhiΦ acts on each Alice matrix block with Bob's indices fixed. Let Cρ\mathcal C_\rhoCρ​ and Mρ\mathcal M_\rhoMρ​ respectively consist of the ratios

max⁡{S(ωB)−S(ω),0}S(ωA)andS(ωA)+S(ωB)−S(ω)S(ωA)\frac{\max\{S(\omega_B)-S(\omega),0\}}{S(\omega_A)} \quad\text{and}\quad \frac{S(\omega_A)+S(\omega_B)-S(\omega)}{S(\omega_A)}S(ωA​)max{S(ωB​)−S(ω),0}​andS(ωA​)S(ωA​)+S(ωB​)−S(ω)​

over precisely these choices with S(ωA)>0S(\omega_A)>0S(ωA​)>0. Define the operational capacity CρC_\rhoCρ​ as the real supremum of the following rates RRR: R≥0R\ge0R≥0, and there exist integers d≥2,n>0d\ge2,n>0d≥2,n>0 such that, for every 0<ϵ<10<\epsilon<10<ϵ<1 and every δ>0\delta>0δ>0, there is K∈NK\in\mathbb NK∈N so that every k≥Kk\ge Kk≥K with k>0k>0k>0 admits an m∈Nm\in\mathbb Nm∈N satisfying m≥(R−δ)klog⁡2dm\ge(R-\delta)k\log_2dm≥(R−δ)klog2​d, channels Ex:Ank→{0,…,dk−1}\mathcal E_x:A^{nk}\to\{0,\ldots,d^k-1\}Ex​:Ank→{0,…,dk−1} for all mmm-bit strings xxx, and positive semidefinite matrices MxM_xMx​ on {0,…,dk−1}×Bnk\{0,\ldots,d^k-1\}\times B^{nk}{0,…,dk−1}×Bnk, satisfying ∑xMx=I\sum_xM_x=I∑x​Mx​=I and Re⁡tr⁡(Mx(Ex⊗id)(ρ[nk]))≥1−ϵ\operatorname{Re}\operatorname{tr}(M_x(\mathcal E_x\otimes\mathrm{id})(\rho^{[nk]}))\ge1-\epsilonRetr(Mx​(Ex​⊗id)(ρ[nk]))≥1−ϵ for every xxx. The declaration asserts that Cρ\mathcal C_\rhoCρ​ is nonempty and bounded above, that every r∈Cρr\in\mathcal C_\rhor∈Cρ​ satisfies 0≤r≤10\le r\le10≤r≤1, and that

Cρ=1+sup⁡Cρ,max⁡{1,sup⁡Mρ}=1+sup⁡Cρ.C_\rho=1+\sup\mathcal C_\rho, \qquad \max\{1,\sup\mathcal M_\rho\}=1+\sup\mathcal C_\rho.Cρ​=1+supCρ​,max{1,supMρ​}=1+supCρ​.

Zero-message codes are allowed, while ratios with zero Alice entropy are excluded.

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