Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§III.C: exact capacities for N→N+1 and 1→M

Open
QAlgorithms.Papers.Independent.Support50.P01.cloningFamilies_capacity

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

prove2quantum

Let 1≤N≤M1\le N\le M1≤N≤M be integers. Let ClN,M\mathrm{Cl}_{N,M}ClN,M​ be the specified optimal universal qubit cloner on Sym⁡N(C2)\operatorname{Sym}^N(\mathbb C^2)SymN(C2), with receiver support Sym⁡M(C2)\operatorname{Sym}^M(\mathbb C^2)SymM(C2) and environment dimension M−N+1M-N+1M−N+1. Its common dilation on normalized occupation kets is exactly Eqs.(21),(22). Write πd=Id/d\pi_d=I_d/dπd​=Id​/d, IcI_cIc​ for coherent information in bits, Q(1)Q^{(1)}Q(1) for its supremum over all density inputs, and QQQ for its regularization over all positive block lengths and arbitrary entangled block inputs. The exact regularized capacities of the two established families are

Q(ClN,N+1)=log⁡2N+22(N≥1),Q(Cl1,M)=log⁡2M+1M(M≥1).Q(\mathrm{Cl}_{N,N+1})=\log_2\frac{N+2}{2}\quad(N\ge1),\qquad Q(\mathrm{Cl}_{1,M})=\log_2\frac{M+1}{M}\quad(M\ge1).Q(ClN,N+1​)=log2​2N+2​(N≥1),Q(Cl1,M​)=log2​MM+1​(M≥1).

These identities use conjugate degradability only where the source establishes it.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P01
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P01

open scoped BigOperators Matrix ComplexConjugate ComplexOrder

open Filter

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

open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation quantumCapacity)

open QAlgorithms.Papers.Independent.Information100.P08 (maximallyMixed)

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

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

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

variable {a b e c : ℕ}

/-- PDF p.11: exact capacities only for the two established conjugate degradable families. -/
theorem cloningFamilies_capacity :
    (∀ N : ℕ, 1≤N → quantumCapacity (receiverChannel (clonerDilation N (N+1))) =
      Real.logb 2 ((N+2 : ℝ)/2)) ∧
    (∀ M : ℕ, 1≤M → quantumCapacity (receiverChannel (clonerDilation 1 M)) =
      Real.logb 2 ((M+1 : ℝ)/M)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P01

end
Source
Conjugate Degradability and the Quantum Capacity of Cloning Channels, arXiv:0909.3297v1, PDF p. 11, §III.C: exact capacities for N→N+1 and 1→M
Read-back

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

For 1≤N≤M1\le N\le M1≤N≤M, define UN,M:CN+1→CM+1⊗CM−N+1U_{N,M}:\mathbb C^{N+1}\to\mathbb C^{M+1}\otimes\mathbb C^{M-N+1}UN,M​:CN+1→CM+1⊗CM−N+1 by

(UN,M)(r,j),k=1{r=k+j}(M−N)!(N+1)!(k+j)!(M−k−j)!k!(N−k)!(M+1)!j!(M−N−j)!,(U_{N,M})_{(r,j),k} =\mathbf1_{\{r=k+j\}} \sqrt{\frac{(M-N)!(N+1)!(k+j)!(M-k-j)!} {k!(N-k)!(M+1)!j!(M-N-j)!}},(UN,M​)(r,j),k​=1{r=k+j}​k!(N−k)!(M+1)!j!(M−N−j)!(M−N)!(N+1)!(k+j)!(M−k−j)!​​,

with 0≤r≤M0\le r\le M0≤r≤M, 0≤j≤M−N0\le j\le M-N0≤j≤M−N, 0≤k≤N0\le k\le N0≤k≤N, and truncated natural-number subtraction. Let NN,M(X)=Tr⁡E(UN,MXUN,M†)\mathcal N_{N,M}(X)=\operatorname{Tr}_{E}(U_{N,M}XU_{N,M}^\dagger)NN,M​(X)=TrE​(UN,M​XUN,M†​). For a map Φ\PhiΦ on finite complex matrix spaces, define

Q(Φ)=sup⁡s≥11ssup⁡ρ⪰0, tr⁡ρ=1[S(Φ⊗s(ρ))−S ⁣((id⁡⊗Φ⊗s)(∣Ωρ⟩⟨Ωρ∣))],Q(\Phi)=\sup_{s\ge1}\frac1s \sup_{\rho\succeq0,\ \operatorname{tr}\rho=1} \left[S(\Phi^{\otimes s}(\rho)) -S\!\left((\operatorname{id}\otimes\Phi^{\otimes s})(|\Omega_\rho\rangle\langle\Omega_\rho|)\right)\right],Q(Φ)=s≥1sup​s1​ρ⪰0, trρ=1sup​[S(Φ⊗s(ρ))−S((id⊗Φ⊗s)(∣Ωρ​⟩⟨Ωρ​∣))],

where ρ\rhoρ acts on the sss-fold input space, (Ωρ)i,j=(ρ)j,i(\Omega_\rho)_{\boldsymbol i,\boldsymbol j}=(\sqrt\rho)_{\boldsymbol j,\boldsymbol i}(Ωρ​)i,j​=(ρ​)j,i​, and S(X)=−Re⁡tr⁡(f(X))S(X)=-\operatorname{Re}\operatorname{tr}(f(X))S(X)=−Retr(f(X)), with f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x applied by continuous functional calculus. Here Φ⊗s\Phi^{\otimes s}Φ⊗s is defined on matrix units by Φ⊗s(Ex,y)u,v=∏iΦ(Exi,yi)ui,vi\Phi^{\otimes s}(E_{\boldsymbol x,\boldsymbol y})_{\boldsymbol u,\boldsymbol v}=\prod_i\Phi(E_{x_i,y_i})_{u_i,v_i}Φ⊗s(Ex,y​)u,v​=∏i​Φ(Exi​,yi​​)ui​,vi​​ and extended linearly, while the reference identity acts blockwise. The assertion is

Q(NN,N+1)=log⁡2N+22for every N≥1,Q(N1,M)=log⁡2M+1Mfor every M≥1.Q(\mathcal N_{N,N+1})=\log_2\frac{N+2}{2}\quad\text{for every }N\ge1, \qquad Q(\mathcal N_{1,M})=\log_2\frac{M+1}{M}\quad\text{for every }M\ge1.Q(NN,N+1​)=log2​2N+2​for every N≥1,Q(N1,M​)=log2​MM+1​for every M≥1.

The second assertion includes M=1M=1M=1, for which the stated value is 111; the block lengths in the definition of QQQ are strictly positive.

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

    Confirmed by the moderator at approval.

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