Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sections 2.3–2.5 and 4.2–4.4: fidelity capacity equivalences

Open
QAlgorithms.Papers.Independent.Gap20.P07.fidelityCapacities_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 choose one CPTP code on a finite, nonzero logical space of dimension dnd_ndn​, and use lim sup⁡nlog⁡2(dn)/n\limsup_n\log_2(d_n)/nlimsupn​log2​(dn​)/n as its rate. Define capacities by requiring, respectively, minimum normalized pure-state survival fidelity, the infimum of entanglement fidelity over density states, normalized Haar average fidelity, or entanglement fidelity of the maximally mixed state, to tend to one. All overlaps are squared. Then

Qmin⁡(T)=Qe,min⁡(T)=Qav(T)=Qc(T)=Q(T).Q_{\min}(T)=Q_{e,\min}(T)=Q_{\rm av}(T)=Q_c(T)=Q(T).Qmin​(T)=Qe,min​(T)=Qav​(T)=Qc​(T)=Q(T).

Each capacity is the extended nonnegative supremum of positive rates. The mean criteria require selecting suitable logical subspaces; no dimension-independent norm bound for the original channel is asserted.

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.4--5,13--18: all four fidelity capacity definitions coincide.
Average/channel fidelity require expurgation, not an original-channel norm bound. -/
theorem fidelityCapacities_eq {I J : Type} [Nonempty I] [Nonempty J]
    (T : Operation I J) (hT : IsTraceClassChannel T) :
    ∀ c : FidelityCriterion, fidelityCapacity T c = qubitReferenceCapacity T := by sorry

end QAlgorithms.Papers.Independent.Gap20.P07

end
Source
Tema Con Variazioni: Quantum Channel Capacity, arXiv:quant-ph/0311037v1, PDF p. 4, Sections 2.3–2.5 and 4.2–4.4: fidelity capacity equivalences
Read-back

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

Let I,JI,JI,J be arbitrary nonempty types and TTT a channel in the following sense: trace-class coefficient matrices are those admitting Xij=∑rur(i)vr(j)‾X_{ij}=\sum_r u_r(i)\overline{v_r(j)}Xij​=∑r​ur​(i)vr​(j)​ with ur,vr∈ℓ2u_r,v_r\in\ell^2ur​,vr​∈ℓ2 and ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞; TTT preserves this class, is additive and complex homogeneous on it, and preserves density coefficient matrices after every finite ancillary identity extension. Here a density coefficient matrix has real nonnegative finite-coordinate quadratic forms and a summable real diagonal of sum 111, and an ancillary extension applies the map separately to ancillary coefficient blocks. Write ν(X)\nu(X)ν(X) for the infimum of the expansion sums, ∥Φ∥∗=sup⁡q≥0sup⁡X trace class, ν(X)≤1ν((Φ⊗idq)X)\|\Phi\|_*=\sup_{q\ge0}\sup_{X\text{ trace class},\,\nu(X)\le1}\nu((\Phi\otimes\mathrm{id}_q)X)∥Φ∥∗​=supq≥0​supX trace class,ν(X)≤1​ν((Φ⊗idq​)X), and Q(T)Q(T)Q(T) for the supremum of positive real RRR such that, for every positive-integer sequence na,man_a,m_ana​,ma​ with na→∞n_a\to\inftyna​→∞ and lim sup⁡ma/na≤R\limsup m_a/n_a\le Rlimsupma​/na​≤R, the infimum over channel encoders and decoders of ∥DT⊗naE−id2⊗ma∥∗\|DT^{\otimes n_a}E-\mathrm{id}_2^{\otimes m_a}\|_*∥DT⊗na​E−id2⊗ma​​∥∗​ tends to zero. For each of four criteria ccc, define Fc(T)F_c(T)Fc​(T) as the supremum of positive real RRR for which there are positive dimensions dad_ada​ and channel encoders Ea:Fin⁡da→Ia+1E_a:\operatorname{Fin}d_a\to I^{a+1}Ea​:Finda​→Ia+1 and decoders Da:Ja+1→Fin⁡daD_a:J^{a+1}\to\operatorname{Fin}d_aDa​:Ja+1→Finda​, acting on matrices, such that lim sup⁡alog⁡2(da)/(a+1)=R\limsup_a\log_2(d_a)/(a+1)=Rlimsupa​log2​(da​)/(a+1)=R and the chosen fidelity of Aa=DaT⊗(a+1)EaA_a=D_aT^{\otimes(a+1)}E_aAa​=Da​T⊗(a+1)Ea​ tends to 111. With pψ=ψψ†p_\psi=\psi\psi^\daggerpψ​=ψψ†, the criteria are: inf⁡∥ψ∥=1Re⁡tr⁡(pψAa(pψ))\inf_{\|\psi\|=1}\operatorname{Re}\operatorname{tr}(p_\psi A_a(p_\psi))inf∥ψ∥=1​Retr(pψ​Aa​(pψ​)); inf⁡ρ≥0,tr⁡ρ=1fe(ρ,Aa)\inf_{\rho\ge0,\operatorname{tr}\rho=1}f_e(\rho,A_a)infρ≥0,trρ=1​fe​(ρ,Aa​), where fe(ρ,A)=Re⁡∑i,j,k,lρjiρlk‾[A(Ejl)]ikf_e(\rho,A)=\operatorname{Re}\sum_{i,j,k,l}\rho_{ji}\overline{\rho_{lk}}[A(E_{jl})]_{ik}fe​(ρ,A)=Re∑i,j,k,l​ρji​ρlk​​[A(Ejl​)]ik​ and EjlE_{jl}Ejl​ is a matrix unit; the normalized Haar average of Re⁡tr⁡(pψAa(pψ))\operatorname{Re}\operatorname{tr}(p_\psi A_a(p_\psi))Retr(pψ​Aa​(pψ​)) for ψ=Ue0\psi=Ue_0ψ=Ue0​; and Re⁡tr⁡(pΦda(id⊗Aa)(pΦda))\operatorname{Re}\operatorname{tr}(p_{\Phi_{d_a}}(\mathrm{id}\otimes A_a)(p_{\Phi_{d_a}}))Retr(pΦda​​​(id⊗Aa​)(pΦda​​​)), where Φ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​. Tensor powers apply maps independently to coordinate blocks. The assertion is ∀c, Fc(T)=Q(T)\forall c,\ F_c(T)=Q(T)∀c, Fc​(T)=Q(T). All capacity suprema use [0,∞][0,\infty][0,∞], with empty supremum 000; dimensions da=1d_a=1da​=1 and infinite capacities 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