Single-letter success bound for EB channels
OpenQAlgorithms.Papers.Independent.Support50.P19.eb_successLet be an entanglement-breaking channel on nonzero finite complex spaces, let , and consider any uniform message code using independent uses. With and average correct decoding probability ,
Block codewords may be entangled and the measurement collective. No rate-above-capacity assumption is needed for this finite-block inequality; that assumption is used only to obtain a positive exponent.
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.21, (18): no rate-above-capacity premise is needed for this finite-block bound. -/
theorem eb_success [Nonempty I] [Nonempty J] (a : ℝ) (ha : 1 < a) (ha2 : a ≤ 2)
(N : Superop I J) (hN : IsChannel N) (hEB : IsEB N)
(n M : ℕ) (hn : 0 < n) (hM : 0 < M) (C : UACode (Fin n → I) (Fin n → J) M) :
ENNReal.ofReal (uaCodeSuccess (channelPower N n) C) ≤
codingBound n a ((Real.logb 2 (M : ℝ) / (n : ℝ))) (channelInformation true a N) := 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, let , and let for a finite Kraus family satisfying . Assume that for every positive integer , applying to the second factor of any density matrix on yields a finite nonnegative linear combination of tensor products of density matrices; no separate normalization of the coefficients is required by this assumption. For every positive integers and every code consisting of density matrices on and positive semidefinite matrices on with , its average success satisfies
Here in the nonnegative extended reals, and is on finite extended reals, with values and at and , respectively. The tensor power applies independently to each factor. The quantity is the extended-real supremum over all finite ensembles of , where the weights are nonnegative and sum to , all are density matrices, and zero weights are allowed. A density matrix is positive semidefinite with trace . The divergence is if , and otherwise
with zero eigenvalues sent to under spectral powers and an extended logarithm equal to at zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.