Tensor-power subadditivity for EB channels
OpenQAlgorithms.Papers.Independent.Support50.P19.eb_power_subadditivityFor an entanglement-breaking channel on nonzero finite complex spaces, every and every positive integer satisfy
The left side optimizes over all mixed joint input ensembles. The statement gives the tensor-power estimate needed to obtain a single-letter success bound.
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, Corollary 19: full tensor-input quantity for every positive integer n. -/
theorem eb_power_subadditivity [Nonempty I] [Nonempty J] (a : ℝ) (ha : 1 < a) (ha2 : a ≤ 2)
(N : Superop I J) (hN : IsChannel N) (hEB : IsEB N) (n : ℕ) (hn : 0 < n) :
channelInformation true a (channelPower N n) ≤
((n : ℝ) : EReal) * 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 admit a finite Kraus representation with . Suppose that for every positive integer and every density matrix on , applying to each matrix block produces a finite sum of tensor products of density matrices with nonnegative coefficients, without a separate coefficient-sum requirement. Then, for every positive integer ,
in the extended real numbers, where applies independently to all factors and is extended linearly. For any channel , is the supremum over finite ensembles , with , , and positive semidefinite matrices of trace , of
Zero ensemble probabilities are allowed. For these density matrices, if ; otherwise
where zero eigenvalues remain under every displayed spectral power and the extended logarithm is at zero. The quantification includes and excludes .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.