Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sections 2.6 and 4.4: entropy capacity for QAEP sources

Open
QAlgorithms.Papers.Independent.Gap20.P07.qaepEntropyCapacity_eq

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

prove2quantum

Let TTT be a memoryless CPTP channel on nonzero physical Hilbert spaces. A source consists of finite nonzero block spaces and density states ρn\rho_nρn​; its entropy rate is lim sup⁡nS(ρn)/n\limsup_n S(\rho_n)/nlimsupn​S(ρn​)/n, with entropy in bits. It satisfies QAEP at finite rate R≥0R\ge0R≥0 if this entropy rate is RRR and, for every η>0\eta>0η>0, the total spectral mass in

2−n(R+η)≤λ≤2−n(R−η)2^{-n(R+\eta)}\le\lambda\le2^{-n(R-\eta)}2−n(R+η)≤λ≤2−n(R−η)

tends to one. Let QQAEP(T)Q_{\rm QAEP}(T)QQAEP​(T) be the extended supremum of entropy rates of QAEP sources transmitted by CPTP codes with squared entanglement fidelity tending to one. Then

QQAEP(T)=Q(T).Q_{\rm QAEP}(T)=Q(T).QQAEP​(T)=Q(T).

Typical restrictions are normalized only at positive retained mass. QAEP does not impose a bound on every eigenvalue of the original source state. This version covers the source class specified by the paper without restricting it to product sources.

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--6,18--19: QAEP source capacity equals Q. The definition uses
concentrated typical mass; it does not impose the erroneous global eigenvalue bound. -/
theorem qaepEntropyCapacity_eq {I J : Type} [Nonempty I] [Nonempty J]
    (T : Operation I J) (hT : IsTraceClassChannel T) :
    sourceEntropyCapacity T QuantumSource.QAEP = 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.6 and 4.4: entropy capacity for QAEP sources
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 trace-class channel: a coefficient matrix is trace class if it admits 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 there, and preserves density coefficient matrices under every finite ancillary identity extension, applied blockwise. Density coefficient matrices have real nonnegative quadratic forms on every finite coordinate set and a summable real diagonal of sum 111. Let ν(X)\nu(X)ν(X) be the infimum of the expansion sums and ∥Φ∥∗=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). Define Q(T)Q(T)Q(T) as the supremum of positive real RRR such that 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 has vanishing infimal simulation error inf⁡E,D∥DT⊗naE−id2⊗ma∥∗\inf_{E,D}\|DT^{\otimes n_a}E-\mathrm{id}_2^{\otimes m_a}\|_*infE,D​∥DT⊗na​E−id2⊗ma​​∥∗​, with channel encoders and decoders. A source consists of positive dimensions dad_ada​ and positive semidefinite trace-one matrices ρa\rho_aρa​; put h=lim sup⁡aS(ρa)/(a+1)h=\limsup_a S(\rho_a)/(a+1)h=limsupa​S(ρa​)/(a+1) in [0,∞][0,\infty][0,∞], where S(ρ)=−Re⁡tr⁡(ρlog⁡2ρ)S(\rho)=-\operatorname{Re}\operatorname{tr}(\rho\log_2\rho)S(ρ)=−Retr(ρlog2​ρ) uses spectral functional calculus and 0log⁡20=00\log_2 0=00log2​0=0. Its QAEP property means that some finite r≥0r\ge0r≥0 satisfies h=rh=rh=r and, for every η>0\eta>0η>0, Re⁡tr⁡(PaρaPa)→1\operatorname{Re}\operatorname{tr}(P_a\rho_aP_a)\to1Retr(Pa​ρa​Pa​)→1, where PaP_aPa​ is the spectral indicator of [2−(a+1)(r+η),2−(a+1)(r−η)][2^{-(a+1)(r+\eta)},2^{-(a+1)(r-\eta)}][2−(a+1)(r+η),2−(a+1)(r−η)]. The source is reliable if there are channel encoders and decoders of length a+1a+1a+1 and dimension dad_ada​, with effective maps AaA_aAa​, for which fe(ρa,Aa)→1f_e(\rho_a,A_a)\to1fe​(ρa​,Aa​)→1, where

fe(ρ,A)=Re⁡∑i,j,k,lρjiρlk‾ [A(Ejl)]ik.f_e(\rho,A)=\operatorname{Re}\sum_{i,j,k,l} \rho_{ji}\overline{\rho_{lk}}\,[A(E_{jl})]_{ik}.fe​(ρ,A)=Rei,j,k,l∑​ρji​ρlk​​[A(Ejl​)]ik​.

The theorem says that the supremum of positive RRR for which a reliable QAEP source has R≤hR\le hR≤h equals Q(T)Q(T)Q(T). Tensor powers apply maps independently to coordinates; capacity suprema are extended nonnegative suprema with empty value 000, and source dimensions may equal 111.

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