Leading capacity additivity in weak and strong depolarization
OpenQAlgorithms.Papers.Independent.Support50.P31.depolarizingCapacityLeadingAdditivityFix and positive dimensions . Let be real parameter functions such that there are constants for which, for all sufficiently small and every ,
Write , and let be the unregularized one-step Holevo maximum in natural units. Both regimes satisfy
The first line is weak depolarization; the second is strong depolarization and keeps the second-order capacity scale. Comparable parameters need not be equal, smooth, or exact scalar multiples of . This precisely expresses the source's leading capacity-additivity proposition in both regimes.
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 pp.10–11, Proposition: leading capacity additivity in BOTH comparable-scale
regimes. Weak error is o(t log t); strong error is o(t squared), retaining the
second-order term. Parameters need not be equal or exact rays. -/
theorem depolarizingCapacityLeadingAdditivity {n : ℕ} (hn : 0 < n) (d : Fin n → ℕ)
(hd : ∀ i, 0 < d i) (q : ℝ → Fin n → ℝ) (hq : ComparableScale q) :
((fun t => holevoQuantity (depolarizingProduct d hd (q t)) -
∑ i, holevoQuantity (QuditFidelity.depolarizingMap (d i) (hd i) (q t i)))
=o[zeroRight] (fun t => t * Real.log t)) ∧
((fun t => holevoQuantity (depolarizingProduct d hd (fun i => 1 - q t i)) -
∑ i, holevoQuantity (QuditFidelity.depolarizingMap (d i) (hd i) (1 - q t i)))
=o[zeroRight] (fun t => t ^ 2)) := 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 positive integer , every family of positive integer dimensions , , and every function for which there exist real constants with such that, for all sufficiently small positive and every , and , the following two limits hold:
Here , and the tensor product map acts on elementary tensors by , extended complex linearly to all matrices on the product of the coordinate registers. For any such map ,
where functional calculus defines , and the supremum ranges over all finite ensembles of positive semidefinite trace-one matrices with nonnegative real weights summing to . All logarithms are natural. Dimensions are allowed; and zero dimensions are excluded. No continuity of , or restrictions on its values away from sufficiently small positive , are assumed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.