General finite-block sandwiched success bound
OpenQAlgorithms.Papers.Independent.Support50.P19.block_successLet be a finite-dimensional channel, , and let a uniform message unassisted code use independent channel uses with actual rate and average success . Then
The encoder may use arbitrary mixed states on all block inputs and the decoder is a joint output POVM. The alpha-Holevo quantity is evaluated on the full block channel. This is the general finite-block bound preceding additivity arguments.
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.20, (17): arbitrary collective block encodings, average uniform-message success. -/
theorem block_success [Nonempty I] [Nonempty J] (a : ℝ) (ha : 1 < a) (ha2 : a ≤ 2)
(N : Superop I J) (hN : IsChannel 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 : ℝ)))
(((1 / (n : ℝ) : ℝ) : EReal) * channelInformation true a (channelPower N 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 be a map from complex matrices on to complex matrices on admitting a finite Kraus representation with . For every positive integers , and every code consisting of positive semidefinite input matrices of trace on and positive semidefinite measurement matrices on satisfying , put , where acts on each factor and is extended linearly. Then
Here is regarded as a nonnegative extended real, and is for finite extended-real , at , and at . For any channel , is the extended-real supremum, over all finite ensembles with , , and density matrices , of
A density matrix means a positive semidefinite complex matrix of trace ; zero ensemble probabilities are allowed. For the density matrices occurring here, if , and otherwise
where spectral powers send zero eigenvalues to , including for negative , and the extended logarithm takes value at zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.