Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

cloning-time-sharing-gain

Open
QAlgorithms.Papers.Independent.Gap20.P04.cloningTimeSharingGain

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

prove2quantum

For every universal symmetric-output cloning channel with parameter N>1N>1N>1 (integer NNN in the cloning case), let FCQ(μ)F_{CQ}(\mu)FCQ​(μ) and FCE(μ)F_{CE}(\mu)FCE​(μ) be the coordinate families in the corresponding explicit capacity formula, with 0≤μ≤1/20\le\mu\le1/20≤μ≤1/2. Define TCQT_{CQ}TCQ​ by time sharing between FCQ(0)F_{CQ}(0)FCQ​(0) and FCQ(1/2)F_{CQ}(1/2)FCQ​(1/2) and lowering both rates; define TCET_{CE}TCE​ by time sharing between FCE(0)F_{CE}(0)FCE​(0) and FCE(1/2)F_{CE}(1/2)FCE​(1/2), lowering CCC and permitting extra consumption EEE. Then

TCQ⊊CCQ,TCE⊊CCE.T_{CQ}\subsetneq\mathcal C_{CQ},\qquad T_{CE}\subsetneq\mathcal C_{CE}.TCQ​⊊CCQ​,TCE​⊊CCE​.

Both resource regions strictly improve on their own endpoint time-sharing strategy. Properness requires an interior improvement; no strict improvement is asserted at the endpoints. The noiseless case is excluded.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P04
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap20.P04

open QAlgorithms

open QAlgorithms.Papers.Independent.Claimed50.P24
  (Dilation PhysicalDilation ChannelEB Hadamard EqualMax AdditiveMax
   dephasingDilation dephasingGamma cloningDilation)

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

open QAlgorithms.Papers.Independent.Information100.P32 (diagonal)

open QAlgorithms.Papers.Independent.Dependency50.P24 (ensembleHolevoBits)

open QAlgorithms.Papers.Independent.Gap48.P44 (cqTimeSharing ceTimeSharing)

open scoped BigOperators Matrix ComplexConjugate

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I B E J D F : Type}

variable [Fintype I] [Fintype B] [Fintype E]

variable [Fintype J] [Fintype D] [Fintype F]

variable [DecidableEq I] [DecidableEq B] [DecidableEq E]

variable [DecidableEq J] [DecidableEq D] [DecidableEq F]

variable [Nonempty I] [Nonempty B] [Nonempty E]

variable [Nonempty J] [Nonempty D] [Nonempty F]

/-- PDF pp.14--15: BOTH cloning resource regions strictly beat their endpoint time sharing. -/
theorem cloningTimeSharingGain (N : ℕ) (hN : 1 < N) :
    cqTimeSharing (cloningCQ N 0).1 (cloningCQ N (1/2)).2 ⊂
      capacityCQ (cloningDilation N) ∧
    ceTimeSharing (cloningCE N 0).1 (cloningCE N (1/2)).1
      (cloningCE N (1/2)).2 ⊂
      capacityCE (cloningDilation N) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P04

end
Source
Trade-off capacities of the quantum Hadamard channels, arXiv:1001.1732v2, PDF p. 15, cloning-time-sharing-gain
Read-back

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

For every integer N>1N>1N>1, put Δ=N(N+1)/2\Delta=N(N+1)/2Δ=N(N+1)/2 and define UN:C2→CN+1⊗CNU_N:\mathbb C^2\to\mathbb C^{N+1}\otimes\mathbb C^NUN​:C2→CN+1⊗CN by

(UN)(b,e),i=Δ−1/2(1i=0, b=eN−e+1i=1, b=e+1e+1),0≤b≤N,0≤e<N.(U_N)_{(b,e),i} =\Delta^{-1/2}\left(\mathbf1_{i=0,\ b=e}\sqrt{N-e} +\mathbf1_{i=1,\ b=e+1}\sqrt{e+1}\right), \quad 0\le b\le N,\quad0\le e<N.(UN​)(b,e),i​=Δ−1/2(1i=0, b=e​N−e​+1i=1, b=e+1​e+1​),0≤b≤N,0≤e<N.

Write H(X)=−Re⁡Tr⁡[x↦xlog⁡2x](X)H(X)=-\operatorname{Re}\operatorname{Tr}[x\mapsto x\log_2x](X)H(X)=−ReTr[x↦xlog2​x](X), using continuous functional calculus, and define

cN=log⁡2(N+1)+∑i=0NiΔlog⁡2iΔ,qN=log⁡2(N+1)−log⁡2N,c_N=\log_2(N+1)+\sum_{i=0}^{N}\frac{i}{\Delta}\log_2\frac{i}{\Delta}, \qquad q_N=\log_2(N+1)-\log_2N,cN​=log2​(N+1)+i=0∑N​Δi​log2​Δi​,qN​=log2​(N+1)−log2​N,

with the zero summand interpreted as 000. For a dilation TTT, take all families with positive finite label and reference dimensions, probabilities px≥0p_x\ge0px​≥0 summing to 111, and unit purifications with reduced input matrices ρx\rho_xρx​. With receiver and environment maps BT,ET\mathcal B_T,\mathcal E_TBT​,ET​, set h=∑xpxH(ρx)h=\sum_xp_xH(\rho_x)h=∑x​px​H(ρx​), χ=H(BT(∑xpxρx))−∑xpxH(BT(ρx))\chi=H(\mathcal B_T(\sum_xp_x\rho_x))-\sum_xp_xH(\mathcal B_T(\rho_x))χ=H(BT​(∑x​px​ρx​))−∑x​px​H(BT​(ρx​)), q=∑xpx[H(BT(ρx))−H(ET(ρx))]q=\sum_xp_x[H(\mathcal B_T(\rho_x))-H(\mathcal E_T(\rho_x))]q=∑x​px​[H(BT​(ρx​))−H(ET​(ρx​))], and J=h+H(BT(∑xpxρx))−∑xpxH(ET(ρx))J=h+H(\mathcal B_T(\sum_xp_x\rho_x))-\sum_xp_xH(\mathcal E_T(\rho_x))J=h+H(BT​(∑x​px​ρx​))−∑x​px​H(ET​(ρx​)). Let QT\mathcal Q_TQT​ consist of nonnegative pairs (c,a)(c,a)(c,a) with c≤χ, a≤qc\le\chi,\ a\le qc≤χ, a≤q for some such family, and let CT\mathcal C_TCT​ consist of nonnegative pairs with c≤J, h≤ac\le J,\ h\le ac≤J, h≤a. Define CapQ(T)={r:∃m≥1, mr∈QT(m)}‾\mathrm{Cap}_Q(T)=\overline{\{r:\exists m\ge1,\ mr\in\mathcal Q_{T^{(m)}}\}}CapQ​(T)={r:∃m≥1, mr∈QT(m)​}​ and CapC(T)={r:∃m≥1, mr∈CT(m)}‾\mathrm{Cap}_C(T)=\overline{\{r:\exists m\ge1,\ mr\in\mathcal C_{T^{(m)}}\}}CapC​(T)={r:∃m≥1, mr∈CT(m)​}​, where T(m)T^{(m)}T(m) has entries given by products of mmm entries of TTT. Then

{(c,q)≥0:∃t∈[0,1], c≤(1−t)cN, q≤tqN}⊊CapQ(UN),\{(c,q)\ge0:\exists t\in[0,1],\ c\le(1-t)c_N,\ q\le tq_N\} \subsetneq\mathrm{Cap}_Q(U_N),{(c,q)≥0:∃t∈[0,1], c≤(1−t)cN​, q≤tqN​}⊊CapQ​(UN​), {(c,a)≥0:∃t∈[0,1], c≤(1−t)cN+t(1+qN), t≤a}⊊CapC(UN).\{(c,a)\ge0:\exists t\in[0,1],\ c\le(1-t)c_N+t(1+q_N),\ t\le a\} \subsetneq\mathrm{Cap}_C(U_N).{(c,a)≥0:∃t∈[0,1], c≤(1−t)cN​+t(1+qN​), t≤a}⊊CapC​(UN​).

Each inclusion asserts containment and inequality of the two sets; N=0,1N=0,1N=0,1 are excluded, and t=0,1t=0,1t=0,1 and zero probabilities in the input families are included.

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

    Confirmed by the moderator at approval.

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