Eventual square-root-block success bound
OpenQAlgorithms.Papers.Independent.Support50.P19.sqrt_successFor every entanglement-breaking channel on nonzero finite complex spaces, there exist an attained ordinary-radius center , a uniform , and , chosen before blocklength, rate, and code, such that and for every . For every , any such -use code of actual rate at least satisfies
Success is the uniform average, with arbitrary mixed joint codewords. This eventual alternative uses ; its decay is exponential in .
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: the alternative sqrt(n) exponent is eventual, so alpha=1+1/sqrt(n)
lies in (20). This is not the exponential-in-n strong converse itself. -/
theorem sqrt_success [Nonempty I] [Nonempty J] (N : Superop I J) (hN : IsChannel N) (hEB : IsEB N) :
∃ sigma : Matrix J J ℂ, ∃ c : ℝ, CenterControl N sigma c ∧
∃ n0 : ℕ, 0 < n0 ∧ ∀ n : ℕ, n0 ≤ n →
1 / Real.sqrt (n : ℝ) < Real.logb 2 3 / (4 * Real.logb 2 c) ∧
1 / Real.sqrt (n : ℝ) ≤ 1 ∧
∀ R : ℝ, (QAlgorithms.Papers.Independent.Claimed50.P26.channelChi 1 N) < R → ∀ M : ℕ, 0 < M → R ≤ (Real.logb 2 (M : ℝ) / (n : ℝ)) →
∀ C : UACode (Fin n → I) (Fin n → J) M,
uaCodeSuccess (channelPower N n) C ≤
(2 : ℝ) ^ (-(Real.sqrt (n : ℝ) / (1 + 1 / Real.sqrt (n : ℝ))) *
(R - ((QAlgorithms.Papers.Independent.Claimed50.P26.channelChi 1 N) + 4 / Real.sqrt (n : ℝ) * (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 for a finite family satisfying . Assume that for every positive integer , applying to the second factor of an arbitrary joint density matrix with an -dimensional first factor yields a finite sum of products of density matrices with nonnegative coefficients, without a separate coefficient-sum condition. Let be the real supremum over finite input ensembles of , where , , and . There exist an output density matrix , a real , and a positive integer , such that , for every input density matrix , and , and such that every satisfies
For every such , every real , every positive integer with , and every code consisting of density matrices on and positive semidefinite measurement matrices on summing to ,
Density matrices are positive semidefinite with trace , and applies independently to the factors. The center conditions use under , and otherwise, and , with zero eigenvalues assigned in matrix logarithms and spectral powers. No hypothesis requires the final parenthesized exponent factor to be positive.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.