Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sections 2.7 and 7.3: positive exponential reliability below capacity

Open
QAlgorithms.Papers.Independent.Gap20.P07.exponentialReliability_belowCapacity

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

prove2quantum

Let TTT be a memoryless CPTP channel between nonzero complex Hilbert spaces, and let 0<R<Q(T)0<R<Q(T)0<R<Q(T). There are constants a,C>0a,C>0a,C>0 and CPTP codes for every positive block length nnn, transmitting exactly ⌊nR⌋\lfloor nR\rfloor⌊nR⌋ logical qubits, such that

∥DnT⊗nEn−id2⌊nR⌋∥cb≤Ce−aneventually.\|D_nT^{\otimes n}E_n-\mathrm{id}_{2^{\lfloor nR\rfloor}}\|_{\rm cb}\le Ce^{-an}\quad\text{eventually}.∥Dn​T⊗nEn​−id2⌊nR⌋​∥cb​≤Ce−aneventually.

The exponent may depend on TTT and RRR. For every channel, including those of zero capacity, the extended supremum of positive rates with such reliability equals Q(T)Q(T)Q(T). No prescribed exponent or reliability at the capacity endpoint 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.6,29: the positive exponent may depend on both channel and rate. -/
theorem exponentialReliability_belowCapacity {I J : Type} [Nonempty I] [Nonempty J]
    (T : Operation I J) (hT : IsTraceClassChannel T) :
    exponentialCapacity T = qubitReferenceCapacity T ∧
    ∀ R : ℝ, 0 < R → ENNReal.ofReal R < qubitReferenceCapacity T → ExponentialReliable T R := by sorry

end QAlgorithms.Papers.Independent.Gap20.P07

end
Source
Tema Con Variazioni: Quantum Channel Capacity, arXiv:quant-ph/0311037v1, PDF p. 6, Sections 2.7 and 7.3: positive exponential reliability below capacity
Read-back

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

For arbitrary nonempty types I,JI,JI,J, let TTT preserve trace-class coefficient matrices, be additive and complex homogeneous on them, and preserve density coefficient matrices after every finite ancillary identity extension, applied blockwise. Here trace class means 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​∥<∞; density coefficient matrices additionally have real nonnegative quadratic forms on every finite coordinate set and a summable real diagonal of sum 111. Call maps with these properties channels. Write ν(X)\nu(X)ν(X) for 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). Let Q(T)Q(T)Q(T) be 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 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​​∥∗​, using channel encoders and decoders. A real rate RRR is exponentially reliable when there exist real constants a,C>0a,C>0a,C>0 and, for every integer b≥1b\ge1b≥1, a channel encoder from dimension 2⌊bR⌋2^{\lfloor bR\rfloor}2⌊bR⌋ into IbI^bIb and a channel decoder from JbJ^bJb back to that dimension, such that eventually in bbb,

∥DT⊗bE−id 2⌊bR⌋∥∗≤Ce−ab.\|DT^{\otimes b}E-\mathrm{id}_{\,2^{\lfloor bR\rfloor}}\|_* \le Ce^{-ab}.∥DT⊗bE−id2⌊bR⌋​∥∗​≤Ce−ab.

The exponential capacity is the supremum in [0,∞][0,\infty][0,∞] of positive exponentially reliable rates, with empty supremum 000. The theorem asserts that this capacity equals Q(T)Q(T)Q(T), and that every real R>0R>0R>0 satisfying R<Q(T)R<Q(T)R<Q(T) is exponentially reliable. The inequality is strict; the assertion includes infinite Q(T)Q(T)Q(T) and permits code dimension 111 at initial block lengths.

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