Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section III-A, unnumbered: weak additivity of the depolarized cloning channel

Open
QAlgorithms.Papers.Independent.Intakenext100.P49.depolarizedCloning_weakAdditivity

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

prove2quantum

Let ℓ≥3\ell\ge3ℓ≥3 be an integer, λ=(ℓ−1)/(ℓ+1)\lambda=(\ell-1)/(\ell+1)λ=(ℓ−1)/(ℓ+1), and define the depolarizing map on all d×dd\times dd×d operators by Pdλ(X)=λX+(1−λ)Tr⁡(X)Id/dP_d^\lambda(X)=\lambda X+(1-\lambda)\operatorname{Tr}(X)I_d/dPdλ​(X)=λX+(1−λ)Tr(X)Id​/d. For the complete symmetric cloning output,

Pℓλ∘Cl1,ℓ−1=Cl1,ℓ−1∘P2λ,χ((Pℓλ∘Cl1,ℓ−1)⊗n)=nχ(Pℓλ∘Cl1,ℓ−1)(n≥1).P_\ell^\lambda\circ\mathrm{Cl}_{1,\ell-1}=\mathrm{Cl}_{1,\ell-1}\circ P_2^\lambda, \qquad \chi\bigl((P_\ell^\lambda\circ\mathrm{Cl}_{1,\ell-1})^{\otimes n}\bigr) =n\chi(P_\ell^\lambda\circ\mathrm{Cl}_{1,\ell-1})\quad(n\ge1).Pℓλ​∘Cl1,ℓ−1​=Cl1,ℓ−1​∘P2λ​,χ((Pℓλ​∘Cl1,ℓ−1​)⊗n)=nχ(Pℓλ​∘Cl1,ℓ−1​)(n≥1).

The composition is CPTP, and the intertwining identity holds on every operator. This is the source's weak-additivity aside at its specified parameter and local dimension range.

Formalization Note The accepted depolarizing map takes the noise probability p=1−λ=2/(ℓ+1)p=1-\lambda=2/(\ell+1)p=1−λ=2/(ℓ+1), not λ\lambdaλ.

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 pp.4--5, Section III-A: ell>=3, the specified depolarizing parameter,
the intertwining identity on all operators, and weak Holevo additivity. -/
theorem depolarizedCloning_weakAdditivity (k : ℕ) (_hk : 1 ≤ k) :
    depolarizedCloner k =
      cloner k ∘ depolarizingMap 2 (by omega) (2 / (k+3 : ℝ)) ∧
    WeakHolevoAdditive (depolarizedCloner 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, Section III-A, unnumbered (continued p.5)
Read-back

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

For every natural number k≥1k\ge1k≥1, set p=2/(k+3)p=2/(k+3)p=2/(k+3), define

Dd,p(X)=pdTr⁡(X)Id+(1−p)X,\mathcal D_{d,p}(X)=\frac{p}{d}\operatorname{Tr}(X)I_d+(1-p)X,Dd,p​(X)=dp​Tr(X)Id​+(1−p)X,

and let 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†​), where 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 has entries

(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

for zero-based indices b<k+2b<k+2b<k+2, j<k+1j<k+1j<k+1, and x<2x<2x<2. Then

Dk+2,p∘Ck=Ck∘D2,p.\mathcal D_{k+2,p}\circ C_k=C_k\circ\mathcal D_{2,p}.Dk+2,p​∘Ck​=Ck​∘D2,p​.

Moreover, N=Dk+2,p∘CkN=\mathcal D_{k+2,p}\circ C_kN=Dk+2,p​∘Ck​ is a channel and satisfies χ(N⊗n)=nχ(N)\chi(N^{\otimes n})=n\chi(N)χ(N⊗n)=nχ(N) for every natural number n≥1n\ge1n≥1. Here a channel admits a finite representation N(X)=∑sEsXEs†N(X)=\sum_sE_sXE_s^\daggerN(X)=∑s​Es​XEs†​ with ∑sEs†Es=I2\sum_sE_s^\dagger E_s=I_2∑s​Es†​Es​=I2​, tensor powers act on matrix units by tensoring their images, and χ(N)\chi(N)χ(N) is the supremum over finite ensembles qs≥0q_s\ge0qs​≥0, ∑sqs=1\sum_s q_s=1∑s​qs​=1, and positive semidefinite trace-one ρs\rho_sρs​, of S(N(∑sqsρs))−∑sqsS(N(ρs))S(N(\sum_s q_s\rho_s))-\sum_s q_sS(N(\rho_s))S(N(∑s​qs​ρs​))−∑s​qs​S(N(ρs​)), with S(ρ)=−Re⁡Tr⁡[(x↦xlog⁡2x)(ρ)]S(\rho)=-\operatorname{Re}\operatorname{Tr}[(x\mapsto x\log_2x)(\rho)]S(ρ)=−ReTr[(x↦xlog2​x)(ρ)] defined by continuous functional calculus.

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