Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem-5

Open
QAlgorithms.Papers.Independent.Gap20.P04.theorem5

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

prove2quantum

Let N≥1N\ge1N≥1 be an integer and NN\mathcal N_NNN​ the universal 1→N1\to N1→N qubit cloner specified by isometry (12), with the entire (N+1)(N+1)(N+1)-dimensional symmetric receiver output and NNN-dimensional environment. Put ΔN=N(N+1)/2\Delta_N=N(N+1)/2ΔN​=N(N+1)/2, and for 0≤μ≤1/20\le\mu\le1/20≤μ≤1/2 set λi=(N−2i)μ+i\lambda_i=(N-2i)\mu+iλi​=(N−2i)μ+i for i=0,…,Ni=0,\ldots,Ni=0,…,N, and ηi=(N−1−2i)μ+i+1\eta_i=(N-1-2i)\mu+i+1ηi​=(N−1−2i)μ+i+1 for i=0,…,N−1i=0,\ldots,N-1i=0,…,N−1. Write H(v)=−∑ivilog⁡2viH(v)=-\sum_i v_i\log_2 v_iH(v)=−∑i​vi​log2​vi​, with 0log⁡20=00\log_2 0=00log2​0=0.

The generating coordinate families are

FCQ(μ)=(log⁡2(N+1)−H(λ/ΔN), H(λ/ΔN)−H(η/ΔN)),F_{CQ}(\mu)=\left(\log_2(N+1)-H(\lambda/\Delta_N),\ H(\lambda/\Delta_N)-H(\eta/\Delta_N)\right),FCQ​(μ)=(log2​(N+1)−H(λ/ΔN​), H(λ/ΔN​)−H(η/ΔN​)), FCE(μ)=(log⁡2(N+1)+H2(μ)−H(η/ΔN), H2(μ)).F_{CE}(\mu)=\left(\log_2(N+1)+H_2(\mu)-H(\eta/\Delta_N),\ H_2(\mu)\right).FCE​(μ)=(log2​(N+1)+H2​(μ)−H(η/ΔN​), H2​(μ)).

For a family F(μ)F(\mu)F(μ), 0≤μ≤1/20\le\mu\le1/20≤μ≤1/2, let HCQ(F)\mathsf H_{CQ}(F)HCQ​(F) be its closed convex resource-monotone hull: classical and quantum rates can be lowered. Let HCE(F)\mathsf H_{CE}(F)HCE​(F) instead allow lowering the classical rate and increasing entanglement consumption, with nonnegative rates in both cases. These hulls include time sharing and endpoint limits.

They determine exactly

CCQ(NN)=HCQ(FCQ),CCE(NN)=HCE(FCE).\mathcal C_{CQ}(\mathcal N_N)=\mathsf H_{CQ}(F_{CQ}),\qquad \mathcal C_{CE}(\mathcal N_N)=\mathsf H_{CE}(F_{CE}).CCQ​(NN​)=HCQ​(FCQ​),CCE​(NN​)=HCE​(FCE​).

This concerns the whole symmetric output, rather than an individual clone.

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.6,12--15, Theorem 5: the whole symmetric-output cloner, N>=1.
The parent isometry (12) supplies the normalization omitted in the printed complementaryChannel Kraus list. -/
theorem theorem5 (N : ℕ) (hN : 0 < N) :
    capacityCQ (cloningDilation N) = cqHull (cloningCQ N) ∧
      capacityCE (cloningDilation N) = ceHull (cloningCE N) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P04

end
Source
Trade-off capacities of the quantum Hadamard channels, arXiv:1001.1732v2, PDF p. 12, Theorem-5
Read-back

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

For every positive integer NNN, including 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),a=Δ−1/2(1{a=0, b=e}N−e+1{a=1, b=e+1}e+1).(U_N)_{(b,e),a}= \Delta^{-1/2} \left(\mathbf1_{\{a=0,\ b=e\}}\sqrt{N-e} +\mathbf1_{\{a=1,\ b=e+1\}}\sqrt{e+1}\right).(UN​)(b,e),a​=Δ−1/2(1{a=0, b=e}​N−e​+1{a=1, b=e+1}​e+1​).

For a matrix WWW, let BW(ρ)\mathcal B_W(\rho)BW​(ρ) and EW(ρ)\mathcal E_W(\rho)EW​(ρ) be the receiver and environment partial traces of WρW†W\rho W^\daggerWρW†. A valid purified input family comprises positive integers ℓ,r\ell,rℓ,r, probabilities px≥0p_x\ge0px​≥0 summing to 111, and unit vectors ψx∈Cr⊗Cinput(W)\psi_x\in\mathbb C^r\otimes\mathbb C^{\mathrm{input}(W)}ψx​∈Cr⊗Cinput(W), allowing zero probabilities; put ρx=Tr⁡Cr∣ψx⟩⟨ψx∣\rho_x=\operatorname{Tr}_{\mathbb C^r}|\psi_x\rangle\langle\psi_x|ρx​=TrCr​∣ψx​⟩⟨ψx​∣ and ρˉ=∑xpxρx\bar\rho=\sum_xp_x\rho_xρˉ​=∑x​px​ρx​. With S(ρ)=−∑jλjlog⁡2λjS(\rho)=-\sum_j\lambda_j\log_2\lambda_jS(ρ)=−∑j​λj​log2​λj​, using 0log⁡20=00\log_2 0=00log2​0=0, define

a=∑xpxS(ρx),χ=S(BW(ρˉ))−∑xpxS(BW(ρx)),Q=∑xpx(S(BW(ρx))−S(EW(ρx))),J=a+S(BW(ρˉ))−∑xpxS(EW(ρx)).a=\sum_xp_xS(\rho_x),\quad \chi=S(\mathcal B_W(\bar\rho))-\sum_xp_xS(\mathcal B_W(\rho_x)),\quad Q=\sum_xp_x\bigl(S(\mathcal B_W(\rho_x))-S(\mathcal E_W(\rho_x))\bigr),\quad J=a+S(\mathcal B_W(\bar\rho))-\sum_xp_xS(\mathcal E_W(\rho_x)).a=x∑​px​S(ρx​),χ=S(BW​(ρˉ​))−x∑​px​S(BW​(ρx​)),Q=x∑​px​(S(BW​(ρx​))−S(EW​(ρx​))),J=a+S(BW​(ρˉ​))−x∑​px​S(EW​(ρx​)).

Let RCQ(W)R_{\mathrm{CQ}}(W)RCQ​(W) contain exactly the nonnegative pairs bounded coordinatewise by (χ,Q)(\chi,Q)(χ,Q) for some valid family, and let RCE(W)R_{\mathrm{CE}}(W)RCE​(W) contain exactly the nonnegative pairs (c,e)(c,e)(c,e) satisfying c≤Jc\le Jc≤J and a≤ea\le ea≤e for some valid family. Put C∙(W)=⋃n≥1{z:nz∈R∙(W(n))}‾C_\bullet(W)=\overline{\bigcup_{n\ge1}\{z:nz\in R_\bullet(W^{(n)})\}}C∙​(W)=⋃n≥1​{z:nz∈R∙​(W(n))}​, where W(n)W^{(n)}W(n) has entries ∏j<nW(bj,ej),ij\prod_{j<n}W_{(b_j,e_j),i_j}∏j<n​W(bj​,ej​),ij​​. For μ∈[0,12]\mu\in[0,\tfrac12]μ∈[0,21​], define

Li=(N−2i)μ+iΔ(0≤i≤N),Ei=(N−1−2i)μ+i+1Δ(0≤i<N),L_i=\frac{(N-2i)\mu+i}{\Delta}\quad(0\le i\le N),\qquad E_i=\frac{(N-1-2i)\mu+i+1}{\Delta}\quad(0\le i<N),Li​=Δ(N−2i)μ+i​(0≤i≤N),Ei​=Δ(N−1−2i)μ+i+1​(0≤i<N), HB=−∑i=0NLilog⁡2Li,HE=−∑i=0N−1Eilog⁡2Ei,h(μ)=−μlog⁡2μ−(1−μ)log⁡2(1−μ).H_B=-\sum_{i=0}^NL_i\log_2L_i,\qquad H_E=-\sum_{i=0}^{N-1}E_i\log_2E_i,\qquad h(\mu)=-\mu\log_2\mu-(1-\mu)\log_2(1-\mu).HB​=−i=0∑N​Li​log2​Li​,HE​=−i=0∑N−1​Ei​log2​Ei​,h(μ)=−μlog2​μ−(1−μ)log2​(1−μ).

Then CCQ(UN)C_{\mathrm{CQ}}(U_N)CCQ​(UN​) is the closure of the convex hull of all nonnegative (c,q)(c,q)(c,q) satisfying c≤log⁡2(N+1)−HBc\le\log_2(N+1)-H_Bc≤log2​(N+1)−HB​ and q≤HB−HEq\le H_B-H_Eq≤HB​−HE​ for some such μ\muμ; and CCE(UN)C_{\mathrm{CE}}(U_N)CCE​(UN​) is the closure of the convex hull of all nonnegative (c,e)(c,e)(c,e) satisfying c≤log⁡2(N+1)+h(μ)−HEc\le\log_2(N+1)+h(\mu)-H_Ec≤log2​(N+1)+h(μ)−HE​ and h(μ)≤eh(\mu)\le eh(μ)≤e for some such μ\muμ.

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