Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 2 / Eq.(16): classical capacity of the cloning channels

Open
QAlgorithms.Papers.Independent.Intakenext100.P49.cloning_classicalCapacity

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ℓ≥2\ell\ge2ℓ≥2 be an integer and set Δℓ=ℓ(ℓ−1)/2\Delta_\ell=\ell(\ell-1)/2Δℓ​=ℓ(ℓ−1)/2. Define C(N)C(N)C(N) independently by regularizing the Holevo capacity over all positive tensor powers, allowing arbitrary finite ensembles of entangled inputs. The classical capacity in bits of the full symmetric cloning output is

C(Cl1,ℓ−1)=1−log⁡2(ℓ−1)+1Δℓ∑j=0ℓ−1jlog⁡2j.C(\mathrm{Cl}_{1,\ell-1})=1-\log_2(\ell-1)+\frac{1}{\Delta_\ell}\sum_{j=0}^{\ell-1}j\log_2j.C(Cl1,ℓ−1​)=1−log2​(ℓ−1)+Δℓ​1​j=0∑ℓ−1​jlog2​j.

The convention is 0log⁡20=00\log_2 0=00log2​0=0. The formula yields 111 bit at ℓ=2\ell=2ℓ=2 and 2/32/32/3 bit at ℓ=3\ell=3ℓ=3. It evaluates the regularized capacity rather than defining capacity by the displayed expression.

Formalization Note Regularization is the supremum of positive block rates, equivalent to the source limit by superadditivity and boundedness.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P49
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P49

open scoped BigOperators Matrix ComplexConjugate ComplexOrder

open Filter

open QAlgorithms.Papers.Independent.Support50.P01
  (unruhSectorDilation unruhWeight unruhBlockDilation unruhBlockWeight
   unruhReceiver unruhReceiverEntropy)

open QAlgorithms.Papers.Independent.Information100.P67
  (receiverChannel complementaryChannel IsDegradable)

open QAlgorithms.Papers.Independent.Dependency50.P41 (EntanglementBreaking)

open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)

open QAlgorithms.Papers.Independent.Dependency50.P45 (holevoCapacity)

open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)

open QAlgorithms.QuditFidelity (depolarizingMap)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF p.4, Corollary 2, Eq.(16): regularized classical capacity in bits. -/
theorem cloning_classicalCapacity (k : ℕ) :
    classicalCapacityBits (cloner k) =
      1 - Real.logb 2 (k+1 : ℝ) + clonerLogSum k / clonerDelta k := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P49

end
Source
An Infinite Sequence of Additive Channels: the Classical Capacity of Cloning Channels, arXiv:0903.1638v7, PDF p. 4, Corollary 2 / Eq.(16)
Read-back

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

For every natural number kkk, including k=0k=0k=0, define Uk:C2→Ck+2⊗Ck+1U_k:\mathbb C^2\to\mathbb C^{k+2}\otimes\mathbb C^{k+1}Uk​:C2→Ck+2⊗Ck+1 by

(Uk)(b,j),x=1{b=x+j}2 cx,j(k+1)(k+2),c0,j=k+1−j,c1,j=j+1,(U_k)_{(b,j),x} =\mathbf1_{\{b=x+j\}} \sqrt{\frac{2\,c_{x,j}}{(k+1)(k+2)}}, \qquad c_{0,j}=k+1-j,\quad c_{1,j}=j+1,(Uk​)(b,j),x​=1{b=x+j}​(k+1)(k+2)2cx,j​​​,c0,j​=k+1−j,c1,j​=j+1,

with 0≤b<k+20\le b<k+20≤b<k+2, 0≤j<k+10\le j<k+10≤j<k+1, and x∈{0,1}x\in\{0,1\}x∈{0,1}, and put Ck(X)=Tr⁡Ck+1(UkXUk†)C_k(X)=\operatorname{Tr}_{\mathbb C^{k+1}}(U_kXU_k^\dagger)Ck​(X)=TrCk+1​(Uk​XUk†​). For a map NNN between finite matrix spaces, write

χ(N)=sup⁡{qs,ρs}[S ⁣(N ⁣(∑sqsρs))−∑sqsS(N(ρs))],\chi(N)=\sup_{\{q_s,\rho_s\}} \left[ S\!\left(N\!\left(\sum_s q_s\rho_s\right)\right) -\sum_s q_sS(N(\rho_s)) \right],χ(N)={qs​,ρs​}sup​[S(N(s∑​qs​ρs​))−s∑​qs​S(N(ρs​))],

where the supremum ranges over all finite families with qs≥0q_s\ge0qs​≥0, ∑sqs=1\sum_s q_s=1∑s​qs​=1, and positive semidefinite ρs\rho_sρs​ of trace one, and S(ρ)=−Re⁡Tr⁡[(x↦xlog⁡2x)(ρ)]S(\rho)=-\operatorname{Re}\operatorname{Tr}[(x\mapsto x\log_2x)(\rho)]S(ρ)=−ReTr[(x↦xlog2​x)(ρ)], with the function applied by continuous functional calculus. Then the supremum over all positive integers rrr of χ(Ck⊗r)/r\chi(C_k^{\otimes r})/rχ(Ck⊗r​)/r, where the tensor power acts on matrix units by tensoring their images, is

sup⁡r≥1χ(Ck⊗r)r=1−log⁡2(k+1)+∑j=0k+1jlog⁡2j(k+2)(k+1)/2.\sup_{r\ge1}\frac{\chi(C_k^{\otimes r})}{r} = 1-\log_2(k+1) +\frac{\displaystyle\sum_{j=0}^{k+1}j\log_2j} {\displaystyle (k+2)(k+1)/2}.r≥1sup​rχ(Ck⊗r​)​=1−log2​(k+1)+(k+2)(k+1)/2j=0∑k+1​jlog2​j​.

The sum includes j=0j=0j=0, using the total real logarithm convention log⁡20=0\log_2 0=0log2​0=0; the denominator is positive for every allowed kkk.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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