Strong-converse threshold from minimum-output entropy additivity
OpenQAlgorithms.Papers.Independent.Support50.P19.minimumOutput_converseLet be any channel on nonzero finite complex spaces, and put . For , let , with the von Neumann entropy in bits. Suppose that for every and every integer ,
Then is an exponential strong-converse threshold: for every there exist such that all use unassisted codes of actual rate at least obey . The constants precede all codes. This is a threshold statement for arbitrary channels; it does not identify with operational 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.24, final paragraph of 8.1: general entropy-additivity strong-converse threshold.
No covariance or claim of equality with capacity is imposed. -/
theorem minimumOutput_converse [Nonempty I] [Nonempty J] (N : Superop I J) (hN : IsChannel N)
(hadd : ∀ a : ℝ, 1 ≤ a → ∀ n : ℕ, 0 < n →
minOutput a (channelPower N n) = (n : ℝ) * minOutput a N) :
ExponentialAt N (Real.logb 2 (Fintype.card J) - minOutput 1 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, and let for a finite family satisfying . For real , define to be the real infimum of over all positive semidefinite input matrices of trace , where, for density matrices ,
The matrix logarithm assigns at zero eigenvalues, and applies the real power to nonzero eigenvalues and sends zero eigenvalues to . Assume that for every real and every positive integer ,
where the tensor power applies to each factor and is extended linearly. Put . Then for every real , there exist a real and a positive integer such that, for every , every positive integer with , and every code consisting of density matrices on and positive semidefinite measurement matrices on with ,
The additivity hypothesis includes and all positive block lengths.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.