Universal one-step capacity upper bound
ProvedQAlgorithms.Papers.Independent.Support50.P31.capacityEntropyUpperBoundLet be a completely positive trace-preserving endomorphism on operators on a complex Hilbert space with finite dimension . Let be the maximum of the Holevo information over all finite probability ensembles of density inputs, and let , where uses natural logarithms and . Then
The bound applies to every such channel, without a unitality or qubit assumption. It supplies the entropy-based upper bound used in the source's binary and depolarizing capacity arguments.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P31
noncomputable section
open Filter Asymptotics
open scoped ComplexConjugate ENNReal
namespace QAlgorithms.Papers.Independent.Support50.P31
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P56 (entropy)
open QAlgorithms.Papers.Independent.Information100.P63 (schatten)
open QAlgorithms.Papers.Independent.Gap48.P03 (holevoQuantity)
open QAlgorithms.Papers.Independent.Claimed50.P38 (tensorSuperop)
open QAlgorithms.Papers.Independent.Dependency50.P44 (tensorChannels)
/-- PDF p.9, (19): universal one-step capacity bound, with no unitality assumption. -/
theorem capacityEntropyUpperBound {I : Type} [Fintype I] [DecidableEq I] [Nonempty I]
(Phi : Superop I I) (hPhi : IsChannel Phi) :
holevoQuantity Phi ≤ Real.log (Fintype.card I : ℝ) - nuH Phi := by sorry
end QAlgorithms.Papers.Independent.Support50.P31
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every finite nonempty type with decidable equality, and every map from complex matrices to themselves that admits a finite Kraus representation for all , with , one has
Here is the natural logarithm, , where is applied by continuous functional calculus, and
with the supremum over all finite ensembles of positive semidefinite trace-one matrices and real weights summing to . Zero weights are allowed; an empty ensemble cannot satisfy the weight normalization. The infimum in the bound is exactly the quantity denoted by in the statement. The case is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.