Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sections 2.5 and 4.5: entanglement-generation capacity equals Q

Open
QAlgorithms.Papers.Independent.Gap20.P07.generationCapacity_eq

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

prove2quantum

Let TTT be a memoryless CPTP channel between nonzero complex Hilbert spaces. For each positive block length, permit a finite nonzero logical space and any normalized pure reference/input state Γn\Gamma_nΓn​. Require the squared overlap of (id⊗DnT⊗nEn)(∣Γn⟩⟨Γn∣)(\mathrm{id}\otimes D_nT^{\otimes n}E_n)(|\Gamma_n\rangle\langle\Gamma_n|)(id⊗Dn​T⊗nEn​)(∣Γn​⟩⟨Γn​∣) with the maximally entangled target to tend to one. Let Qgen(T)Q_{\rm gen}(T)Qgen​(T) be the extended supremum of positive limsup logical-dimension rates. Then

Qgen(T)=Q(T).Q_{\rm gen}(T)=Q(T).Qgen​(T)=Q(T).

The input Γn\Gamma_nΓn​ need not be maximally entangled and there is no initially shared entanglement between sender and receiver. This identifies the entanglement-generation variant.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P07
Formal statement
noncomputable section

open Filter MeasureTheory

open scoped Topology ENNReal NNReal Matrix ComplexOrder ComplexConjugate

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus

namespace QAlgorithms.Papers.Independent.Gap20.P07

open QAlgorithms

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State IsTraceClass IsTraceClassChannel traceSize rankOne tensorApply)

open QAlgorithms.Papers.Independent.Frontier30.P14
  (Operation isometryCoeff conjugateKernel)

open QAlgorithms.Papers.Independent.Claimed50.P35
  (stabilizedTraceClassNorm traceClassTensorMap traceClassChannelPower
   transpose transposeBound TraceLinear tracePair MeasurePrepare)

open QAlgorithms.Papers.Independent.Gap48.P29 (fe FiniteCPMap)

/-- PDF pp.5,19--20: arbitrary normalized entanglement-generation inputs are
allowed; teleportation and removal of forward communication yield Q. -/
theorem generationCapacity_eq {I J : Type} [Nonempty I] [Nonempty J]
    (T : Operation I J) (hT : IsTraceClassChannel T) :
    variableSourceGenerationCapacity T = qubitReferenceCapacity T := by sorry

end QAlgorithms.Papers.Independent.Gap20.P07

end
Source
Tema Con Variazioni: Quantum Channel Capacity, arXiv:quant-ph/0311037v1, PDF p. 5, Sections 2.5 and 4.5: entanglement-generation capacity equals Q
Read-back

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

Let I,JI,JI,J be arbitrary nonempty types, with no finiteness or countability assumption. For matrices on a label type HHH, call XXX trace class if there are sequences ur,vr∈ℓ2(H;C)u_r,v_r\in\ell^2(H;\mathbb C)ur​,vr​∈ℓ2(H;C) with ∑r∥ur∥2∥vr∥2\sum_r\|u_r\|_2\|v_r\|_2∑r​∥ur​∥2​∥vr​∥2​ summable and Xij=∑rur(i)vr(j)‾X_{ij}=\sum_r u_r(i)\overline{v_r(j)}Xij​=∑r​ur​(i)vr​(j)​, and let ν(X)\nu(X)ν(X) be the infimum of the corresponding nonnegative extended real costs ofReal⁡(∑r∥ur∥2∥vr∥2)\operatorname{ofReal}(\sum_r\|u_r\|_2\|v_r\|_2)ofReal(∑r​∥ur​∥2​∥vr​∥2​), with empty infimum +∞+\infty+∞. A density matrix here is such a trace class matrix whose finite principal quadratic forms are real and nonnegative, whose real diagonal entries are summable, and whose real diagonal sum is 111. Call a map a trace class channel when it preserves trace class matrices, is additive and complex homogeneous on them, and, for every q∈Nq\in\mathbb Nq∈N, its blockwise amplification to an ancillary label [q]={0,…,q−1}[q]=\{0,\ldots,q-1\}[q]={0,…,q−1} sends density matrices to density matrices. For a map LLL, define

∥L∥st=sup⁡q∈N sup⁡X trace classν(X)≤1ν(L[q]X),(L[q]X)(j,a),(j′,b)=[L((X(i,a),(i′,b))i,i′)]jj′.\|L\|_{\mathrm{st}} =\sup_{q\in\mathbb N}\ \sup_{\substack{X\text{ trace class}\\\nu(X)\le1}}\nu(L^{[q]}X), \qquad (L^{[q]}X)_{(j,a),(j',b)} =\bigl[L((X_{(i,a),(i',b)})_{i,i'})\bigr]_{jj'}.∥L∥st​=q∈Nsup​ X trace classν(X)≤1​sup​ν(L[q]X),(L[q]X)(j,a),(j′,b)​=[L((X(i,a),(i′,b)​)i,i′​)]jj′​.

Let TTT be any trace class channel from matrices on III to matrices on JJJ, and let T⊗nT^{\otimes n}T⊗n mean the recursively defined map applying TTT successively to each coordinate, with the zeroth power acting identically on the singleton empty-coordinate matrix. For positive integers n,mn,mn,m, set

δT(n,m)=inf⁡E,D∥D∘T⊗n∘E−id⁡[2]m∥st,\delta_T(n,m)=\inf_{E,D} \left\|D\circ T^{\otimes n}\circ E-\operatorname{id}_{[2]^m}\right\|_{\mathrm{st}},δT​(n,m)=E,Dinf​​D∘T⊗n∘E−id[2]m​​st​,

where EEE and DDD range over trace class channels from [2]m[2]^m[2]m to InI^nIn and from JnJ^nJn to [2]m[2]^m[2]m, respectively. The declaration equates the following two suprema of strictly positive real rates RRR, regarded as elements of [0,∞][0,\infty][0,∞], with an empty supremum equal to 000: first, the rates for which there exist positive integers dad_ada​, trace class channels Ea:[da]→Ia+1E_a:[d_a]\to I^{a+1}Ea​:[da​]→Ia+1 and Da:Ja+1→[da]D_a:J^{a+1}\to[d_a]Da​:Ja+1→[da​], and unit vectors γa∈C[da]×[da]\gamma_a\in\mathbb C^{[d_a]\times[d_a]}γa​∈C[da​]×[da​], such that

lim sup⁡a→∞ofReal⁡ ⁣(log⁡2daa+1)=R,Re⁡tr⁡ ⁣(PΦda(id⁡⊗(DaT⊗(a+1)Ea))(Pγa))⟶1,\limsup_{a\to\infty} \operatorname{ofReal}\!\left(\frac{\log_2d_a}{a+1}\right)=R, \qquad \operatorname{Re}\operatorname{tr}\!\left( P_{\Phi_{d_a}}(\operatorname{id}\otimes(D_aT^{\otimes(a+1)}E_a))(P_{\gamma_a}) \right)\longrightarrow1,a→∞limsup​ofReal(a+1log2​da​​)=R,Retr(PΦda​​​(id⊗(Da​T⊗(a+1)Ea​))(Pγa​​))⟶1,

where Pv=vv†P_v=vv^\daggerPv​=vv† and Φd=d−1/2∑iei⊗ei\Phi_d=d^{-1/2}\sum_i e_i\otimes e_iΦd​=d−1/2∑i​ei​⊗ei​; second, the rates for which every pair of sequences of positive integers na,man_a,m_ana​,ma​ satisfying na→∞n_a\to\inftyna​→∞ and lim sup⁡a(ma/na)≤R\limsup_a(m_a/n_a)\le Rlimsupa​(ma​/na​)≤R in the nonnegative extended reals satisfies δT(na,ma)→0\delta_T(n_a,m_a)\to0δT​(na​,ma​)→0. The vectors γa\gamma_aγa​ in the first supremum are existentially chosen arbitrary unit vectors.

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