Exponential strong converse for entanglement-breaking and Hadamard channels
OpenQAlgorithms.Papers.Independent.Support50.P19.strongConverseLet be a channel between positive-dimensional finite complex Hilbert spaces. Suppose that is entanglement breaking or is complementary to an entanglement-breaking channel. Let be its operational unassisted classical capacity. For every real rate there exist and an integer such that every , every positive integer satisfying , and every unassisted -message block code obey
The messages are uniform, the encoder may use arbitrary mixed states entangled across all channel inputs, and the decoder is a joint output POVM. The constants precede all block lengths, message numbers, and codes. This makes the operational capacity a sharp communication threshold, including Hadamard channels whose complements lie on the EB boundary.
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 pp.1,21,25–26: exponential strong converse for every EB and every Hadamard channel,
including complements on the EB boundary. Capacity is operational, not defined as Holevo. -/
theorem strongConverse [Nonempty I] [Nonempty J] (N : Superop I J) (hN : IsChannel N)
(hclass : IsEB N ∨ IsHadamard N) : UnassistedExponentialConverse 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 types with decidable equality, and let be a channel from matrices on to matrices on , meaning that for a finite family with . Suppose either that, for every natural and every positive semidefinite trace-one on the reference space times , is a finite sum of tensor products of density matrices with nonnegative coefficients, or that there exist a natural and an isometry with
such that has that same finite-decomposition property. The coefficients in these decompositions are not explicitly required to sum to . Define as the real supremum of
over all collections of density matrices on and positive semidefinite measurement matrices on summing to the identity. Here
and is a matrix unit. Let be the real supremum of all for which there exists a sequence of positive natural message counts , defined for every , such that and, for every , eventually . The theorem asserts that for every real , there exist and a natural such that for every , every with , and every such collection ,
The same work for all those message counts and codes; the bound only concerns positive block lengths.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.