Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Quadratic near-capacity success exponent

Open
QAlgorithms.Papers.Independent.Support50.P19.quadratic_success

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

prove2quantum

For each entanglement-breaking channel N\mathcal NN on nonzero finite complex spaces, choose an attained ordinary-radius center σ∗\sigma_*σ∗​ and a uniform finite c>1c>1c>1 as in the near-one estimate, before all rates and codes. Put L=log⁡2cL=\log_2cL=log2​c and Δ=R−χ(N)\Delta=R-\chi(\mathcal N)Δ=R−χ(N). For every RRR with Δ>0\Delta>0Δ>0, Δ/(8L2)≤1\Delta/(8L^2)\le1Δ/(8L2)≤1, and Δ/(8L2)<log⁡23/(4L)\Delta/(8L^2)<\log_2 3/(4L)Δ/(8L2)<log2​3/(4L), any n≥1n\ge1n≥1 use code with actual rate at least RRR satisfies

psucc≤2−nΔ2/(32L2).p_{\rm succ}\le2^{-n\Delta^2/(32L^2)}.psucc​≤2−nΔ2/(32L2).

Message numbers are positive integers and success is the uniform average with unrestricted mixed block encodings. These small-gap conditions ensure the chosen α=1+Δ/(8L2)\alpha=1+\Delta/(8L^2)α=1+Δ/(8L2) lies in the valid range. This gives an explicit exponential rate of decay near capacity.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P19
Formal statement
noncomputable section

open scoped Matrix ComplexOrder ComplexConjugate ENNReal

open Filter Topology

namespace QAlgorithms.Papers.Independent.Support50.P19

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Dependency50.P35
  (tr Dominates spectralPower elog elogNN rawTrace cq)

open QAlgorithms.Papers.Independent.Dependency50.P09 (sandwichedD petzD relativeD)

open QAlgorithms.Papers.Independent.Information100.P56 (sandwichedTrace)

open QAlgorithms.Papers.Independent.Information100.P27 (average)

open QAlgorithms.Papers.Independent.Information100.P67
  (IsIsometry receiverChannel complementaryChannel)

open QAlgorithms.Papers.Independent.Claimed50.P48 (FiniteKrausCP)

open QAlgorithms.Papers.Independent.Dependency50.P23
  (UACode uaCodeSuccess ordinaryClassicalCapacity IsEB IsHadamard)

open QAlgorithms.Papers.Independent.Information100.P08 (Ensemble)

open QAlgorithms.Papers.Independent.Information100.P71 (channelPower)

open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)

open QAlgorithms.Papers.Independent.Information100.P63 (tensorPower)

open QAlgorithms.Papers.Independent.Claimed50.P26
  (CovariantIrreducible minOutput UnassistedExponentialConverse)

variable {I J K L : Type} [Fintype I] [Fintype J] [Fintype K] [Fintype L]

variable [DecidableEq I] [DecidableEq J] [DecidableEq K] [DecidableEq L]

/-- PDF p.23, (24): the near-capacity quadratic exponent, with a strict cap from (20).
The intermediate printed display omits factor 4; its subsequent chain and chosen alpha
use chi + 4(alpha-1)L^2 ≤ (R+chi)/2. We retain that corrected reading. -/
theorem quadratic_success [Nonempty I] [Nonempty J] (N : Superop I J) (hN : IsChannel N) (hEB : IsEB N) :
    ∃ sigma : Matrix J J ℂ, ∃ c : ℝ, CenterControl N sigma c ∧
      ∀ R : ℝ, (QAlgorithms.Papers.Independent.Claimed50.P26.channelChi 1 N) < R →
        (R - (QAlgorithms.Papers.Independent.Claimed50.P26.channelChi 1 N)) / (8 * (Real.logb 2 c) ^ 2) ≤ 1 →
        (R - (QAlgorithms.Papers.Independent.Claimed50.P26.channelChi 1 N)) / (8 * (Real.logb 2 c) ^ 2) < Real.logb 2 3 / (4 * Real.logb 2 c) →
        ∀ n : ℕ, 0 < n → ∀ M : ℕ, 0 < M → R ≤ (Real.logb 2 (M : ℝ) / (n : ℝ)) →
          ∀ C : UACode (Fin n → I) (Fin n → J) M,
            uaCodeSuccess (channelPower N n) C ≤
              (2 : ℝ) ^ (-((n : ℝ) * (R - (QAlgorithms.Papers.Independent.Claimed50.P26.channelChi 1 N)) ^ 2 / (32 * (Real.logb 2 c) ^ 2))) := by sorry

end QAlgorithms.Papers.Independent.Support50.P19

end
Source
Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy, arXiv:1306.1586v4, PDF p. 23, eq24
Read-back

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

Let I,JI,JI,J be finite nonempty index types with decidable equality, and let NNN have a finite Kraus representation N(X)=∑ℓKℓXKℓ†N(X)=\sum_\ell K_\ell XK_\ell^\daggerN(X)=∑ℓ​Kℓ​XKℓ†​, ∑ℓKℓ†Kℓ=1\sum_\ell K_\ell^\dagger K_\ell=1∑ℓ​Kℓ†​Kℓ​=1. Suppose that for every positive integer rrr, applying NNN to the second factor of any joint density matrix with an rrr-dimensional first factor yields a finite nonnegative linear combination of products of density matrices; the definition has no separate coefficient-normalization requirement. Write χ\chiχ for the real supremum of H(∑xpxN(ρx))−∑xpxH(N(ρx))H(\sum_xp_xN(\rho_x))-\sum_xp_xH(N(\rho_x))H(∑x​px​N(ρx​))−∑x​px​H(N(ρx​)) over all finite ensembles of input density matrices with nonnegative probabilities summing to 111, where H(X)=−Re⁡tr⁡(Xlog⁡2X)H(X)=-\operatorname{Re}\operatorname{tr}(X\log_2X)H(X)=−Retr(Xlog2​X). There exist an output density matrix σ\sigmaσ and a real c>1c>1c>1 such that every input density matrix ρ\rhoρ satisfies ker⁡σ⊆ker⁡N(ρ)\ker\sigma\subseteq\ker N(\rho)kerσ⊆kerN(ρ) and ν(N(ρ),σ)≤c\nu(N(\rho),\sigma)\le cν(N(ρ),σ)≤c, and sup⁡ρD(N(ρ)∥σ)=χ\sup_\rho D(N(\rho)\|\sigma)=\chisupρ​D(N(ρ)∥σ)=χ. For these same choices, every real R>χR>\chiR>χ satisfying

R−χ8(log⁡2c)2≤1,R−χ8(log⁡2c)2<log⁡234log⁡2c,\frac{R-\chi}{8(\log_2c)^2}\le1, \qquad \frac{R-\chi}{8(\log_2c)^2} <\frac{\log_2 3}{4\log_2c},8(log2​c)2R−χ​≤1,8(log2​c)2R−χ​<4log2​clog2​3​,

every positive integers n,Mn,Mn,M with R≤log⁡2M/nR\le\log_2M/nR≤log2​M/n, and every code with density matrices ρm\rho_mρm​ on InI^nIn and positive semidefinite measurement matrices DmD_mDm​ on JnJ^nJn summing to 111, satisfy

1M∑mRe⁡tr⁡[DmN⊗n(ρm)]≤2− n(R−χ)2/[32(log⁡2c)2].\frac1M\sum_m\operatorname{Re}\operatorname{tr} [D_mN^{\otimes n}(\rho_m)] \le 2^{-\,n(R-\chi)^2/[32(\log_2c)^2]}.M1​m∑​Retr[Dm​N⊗n(ρm​)]≤2−n(R−χ)2/[32(log2​c)2].

Here density matrices are positive semidefinite with trace 111, and N⊗nN^{\otimes n}N⊗n applies NNN to each factor. The center conditions use D(X∥Y)=Re⁡tr⁡(Xlog⁡2X−Xlog⁡2Y)D(X\|Y)=\operatorname{Re}\operatorname{tr}(X\log_2X-X\log_2Y)D(X∥Y)=Retr(Xlog2​X−Xlog2​Y) when ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, and +∞+\infty+∞ otherwise, and ν(X,Y)=Re⁡tr⁡(X[3/2]Y[−1/2])+Re⁡tr⁡(X[1/2]Y[1/2])+1\nu(X,Y)=\operatorname{Re}\operatorname{tr}(X^{[3/2]}Y^{[-1/2]})+\operatorname{Re}\operatorname{tr}(X^{[1/2]}Y^{[1/2]})+1ν(X,Y)=Retr(X[3/2]Y[−1/2])+Retr(X[1/2]Y[1/2])+1; matrix logarithms assign 000 at zero eigenvalues, and displayed spectral powers send zero eigenvalues to 000.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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