Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1: strong Holevo additivity of every 1-to-(ell-1) qubit cloning channel

Open
QAlgorithms.Papers.Independent.Intakenext100.P49.cloning_strongAdditivity

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

prove2quantum

Let ℓ≥2\ell\ge2ℓ≥2 be an integer and let Cl1,ℓ−1\mathrm{Cl}_{1,\ell-1}Cl1,ℓ−1​ be the universal symmetric qubit cloning channel whose receiver holds all ℓ−1\ell-1ℓ−1 clones in their ℓ\ellℓ-dimensional symmetric subspace. The channel is the receiver reduction of the occupation-basis isometry in Eqs. (9)–(11). For every CPTP auxiliary channel TTT between arbitrary positive finite dimensions,

χ(Cl1,ℓ−1⊗T)=χ(Cl1,ℓ−1)+χ(T).\chi(\mathrm{Cl}_{1,\ell-1}\otimes T)=\chi(\mathrm{Cl}_{1,\ell-1})+\chi(T).χ(Cl1,ℓ−1​⊗T)=χ(Cl1,ℓ−1​)+χ(T).

Here χ(N)\chi(N)χ(N) is the supremum of the Holevo information over all finite ensembles of positive trace-one input operators, with entropy in bits. Joint inputs to the tensor product may be mixed and entangled. This is strong additivity and gives the classical single-letter property of the complete cloning output.

Formalization Note The natural parameter is k=ℓ−2k=\ell-2k=ℓ−2. CPTP is included in the additivity predicate. The PDF's Eq. (9) agrees with the accepted dilation; the plan's claim of overlapping images at k=0k=0k=0 is contradicted by the original page.

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.3, Theorem 1 (proof p.4): strong Holevo additivity for every ell>=2.
The occupation-basis dilation agrees with Eqs.(9)--(11); Eq.(15) is not used. -/
theorem cloning_strongAdditivity (k : ℕ) : StrongHolevoAdditive (cloner 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. 3, Theorem 1
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 Ck(X)=Tr⁡E(VkXVk†)\mathcal C_k(X)=\operatorname{Tr}_E(V_kXV_k^\dagger)Ck​(X)=TrE​(Vk​XVk†​), where XXX is a complex 2×22\times22×2 matrix, the receiver index is r<k+2r<k+2r<k+2, the environment index is s<k+1s<k+1s<k+1, and

Vk((r,s),x)={2(k+1−s)/((k+1)(k+2)),r=x+s, x=0,2(s+1)/((k+1)(k+2)),r=x+s, x=1,0,r≠x+s.V_k((r,s),x)= \begin{cases} \sqrt{2(k+1-s)/((k+1)(k+2))},&r=x+s,\ x=0,\\ \sqrt{2(s+1)/((k+1)(k+2))},&r=x+s,\ x=1,\\ 0,&r\ne x+s. \end{cases}Vk​((r,s),x)=⎩⎨⎧​2(k+1−s)/((k+1)(k+2))​,2(s+1)/((k+1)(k+2))​,0,​r=x+s, x=0,r=x+s, x=1,r=x+s.​

The theorem asserts that Ck\mathcal C_kCk​ admits a finite Kraus representation Ck(X)=∑jKjXKj†\mathcal C_k(X)=\sum_jK_jXK_j^\daggerCk​(X)=∑j​Kj​XKj†​ valid for every XXX, with ∑jKj†Kj=I2\sum_jK_j^\dagger K_j=I_2∑j​Kj†​Kj​=I2​, and that for every pair of positive natural numbers a,ba,ba,b and every function TTT from complex a×aa\times aa×a matrices to complex b×bb\times bb×b matrices admitting such a finite Kraus representation with normalization IaI_aIa​,

χ(Ck⊗T)=χ(Ck)+χ(T).\chi(\mathcal C_k\otimes T)=\chi(\mathcal C_k)+\chi(T).χ(Ck​⊗T)=χ(Ck​)+χ(T).

Here, for a map NNN on matrices over a finite input register,

χ(N)=sup⁡m∈N, qx≥0, ∑xqx=1ρx⪰0, tr⁡ρx=1[S ⁣(N ⁣(∑x<mqxρx))−∑x<mqxS(N(ρx))],S(M)=−Re⁡tr⁡[t↦tlog⁡2t](M),\chi(N)= \sup_{\substack{m\in\mathbb N,\ q_x\ge0,\ \sum_xq_x=1\\ \rho_x\succeq0,\ \operatorname{tr}\rho_x=1}} \left[ S\!\left(N\!\left(\sum_{x<m}q_x\rho_x\right)\right) -\sum_{x<m}q_xS(N(\rho_x)) \right], \quad S(M)=-\operatorname{Re}\operatorname{tr}[t\mapsto t\log_2t](M),χ(N)=m∈N, qx​≥0, ∑x​qx​=1ρx​⪰0, trρx​=1​sup​[S(N(x<m∑​qx​ρx​))−x<m∑​qx​S(N(ρx​))],S(M)=−Retr[t↦tlog2​t](M),

with continuous functional calculus used in SSS. The tensor map is defined on every matrix XXX by

(Ck⊗T)(X)(r,c),(r′,d)=∑x,y<2∑u,v<aX(x,u),(y,v) Ck(Exy)r,r′T(Euv)c,d,(\mathcal C_k\otimes T)(X)_{(r,c),(r',d)} =\sum_{x,y<2}\sum_{u,v<a} X_{(x,u),(y,v)}\,\mathcal C_k(E_{xy})_{r,r'}T(E_{uv})_{c,d},(Ck​⊗T)(X)(r,c),(r′,d)​=x,y<2∑​u,v<a∑​X(x,u),(y,v)​Ck​(Exy​)r,r′​T(Euv​)c,d​,

where EuvE_{uv}Euv​ are matrix units. Ensemble size zero cannot satisfy the weight normalization. All suprema are real suprema, with total-operation value 000 for empty or unbounded-above sets.

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