Quadratic near-capacity success exponent
OpenQAlgorithms.Papers.Independent.Support50.P19.quadratic_successFor each entanglement-breaking channel on nonzero finite complex spaces, choose an attained ordinary-radius center and a uniform finite as in the near-one estimate, before all rates and codes. Put and . For every with , , and , any use code with actual rate at least satisfies
Message numbers are positive integers and success is the uniform average with unrestricted mixed block encodings. These small-gap conditions ensure the chosen lies in the valid range. This gives an explicit exponential rate of decay near capacity.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P19
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty index types with decidable equality, and let have a finite Kraus representation , . Suppose that for every positive integer , applying to the second factor of any joint density matrix with an -dimensional first factor yields a finite nonnegative linear combination of products of density matrices; the definition has no separate coefficient-normalization requirement. Write for the real supremum of over all finite ensembles of input density matrices with nonnegative probabilities summing to , where . There exist an output density matrix and a real such that every input density matrix satisfies and , and . For these same choices, every real satisfying
every positive integers with , and every code with density matrices on and positive semidefinite measurement matrices on summing to , satisfy
Here density matrices are positive semidefinite with trace , and applies to each factor. The center conditions use when , and otherwise, and ; matrix logarithms assign at zero eigenvalues, and displayed spectral powers send zero eigenvalues to .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.