Weak converse with binary entropy
OpenQAlgorithms.Papers.Independent.Support50.P19.weakConverseLet be a finite-dimensional channel, and integers, and let a uniform-message unassisted block code have average success and actual rate . If , , and , then
Here is the single-letter Holevo information of the entire block channel, and . The bound applies to arbitrary mixed block codewords and joint POVMs, and gives the usual weak converse.
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.11, Remark 3: weak converse for an allowed error bound, with the p.10 convention. -/
theorem weakConverse [Nonempty I] [Nonempty J] (N : Superop I J) (hN : IsChannel N)
(n M : ℕ) (hn : 0 < n) (hM : 0 < M)
(C : UACode (Fin n → I) (Fin n → J) M)
(e : ℝ) (he : 0 ≤ e) (he1 : e < 1) (heM : e ≤ 1 - 1 / (M : ℝ))
(herr : 1 - uaCodeSuccess (channelPower N n) C ≤ e) :
(Real.logb 2 (M : ℝ) / (n : ℝ)) ≤ ((QAlgorithms.Papers.Independent.Claimed50.P26.channelChi 1 (channelPower N n)) + binEntropy2 e) / ((n : ℝ) * (1 - e)) := 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 types with decidable equality, and let be a channel, so for a finite family satisfying . Let be positive natural numbers, and let consist of density matrices on and positive semidefinite measurement matrices on , indexed by , with . Define
where denotes a matrix unit. For every real satisfying , , and , the theorem asserts
Here is the real supremum, over all finite ensembles of density matrices on the input space with and , of
The scalar is , with the total logarithm convention . The assumptions make ; the case is included and forces .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.