§5 Eqs. (25)–(26): tilted capacity limits
OpenQAlgorithms.Papers.Independent.Gap48.P46.tilted_capacity_limitsAll quantum systems are nonzero finite-dimensional complex Hilbert spaces. States are positive semidefinite trace-one matrices, and channels are CPTP maps on the full matrix algebra. All entropies and logarithms are in bits. An ensemble is a finite probability distribution of states, with zero weights permitted. For a channel , write for the maximum ensemble Holevo information at mean , for the minimum average output entropy at that mean, and for the maximum of over a nonempty closed mean constraint .
Let and be channels, a nonempty closed second-input constraint, and . Along the admissible cofinal tail , , set . Then
Both maxima are over densities and are attained. Both limits exist without an additivity assumption. Arbitrary zero scalar prefixes encode the same physical-tail limits in the formalization.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P46
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P46
open scoped Matrix ComplexConjugate ENNReal ComplexOrder
open Filter
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)
open QAlgorithms.Papers.Independent.Information100.P54 (relativeEntropyBits)
open QAlgorithms.Papers.Independent.Dependency50.P23 (IsEB)
open QAlgorithms.Papers.Independent.Information100.P08
(Ensemble ensembleAverage outputHolevo mixedRoof)
variable {I O J K : Type} [Fintype I] [Fintype O] [Fintype J] [Fintype K]
variable [DecidableEq I] [DecidableEq O] [DecidableEq J] [DecidableEq K]
/-- PDF p.13, Eqs.(25)–(26): both physical-tail limits and attained maxima, without
assuming additivity. Lambda zero is allowed. -/
theorem tilted_capacity_limits [Nonempty I] [Nonempty O] [Nonempty J] [Nonempty K]
(Phi : Superop I O) (Psi : Superop J K) (hPhi : IsChannel Phi) (hPsi : IsChannel Psi)
(B : Set (Matrix J J ℂ)) (hB : Constraint B) (E : Matrix I I ℂ) (hE : IsEffect E)
(lam : ℝ) (hlam : 0 ≤ lam) :
Tendsto (extensionSequence Phi E lam) atTop (nhds (maxValue (states I) (shorTiltObjective Phi E lam))) ∧
Tendsto (jointExtensionSequence Phi Psi B E lam) atTop
(nhds (maxValue (secondConstraint (I := I) B) (jointTilted Phi Psi E lam))) ∧
MaximizesValue (states I) (shorTiltObjective Phi E lam) (maxValue (states I) (shorTiltObjective Phi E lam)) ∧
MaximizesValue (secondConstraint (I := I) B) (jointTilted Phi Psi E lam)
(maxValue (secondConstraint (I := I) B) (jointTilted Phi Psi E lam)) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P46
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty sets with decidable equality, and let and be channels from matrices on to matrices on , and from matrices on to matrices on , respectively; here a channel means a map expressible as for a finite family satisfying . Write for the positive semidefinite matrices on having trace , and . For any channel , define as the supremum of over all finite ensembles of density matrices with , , and ; define . Let be a nonempty closed subset of , without any convexity assumption, let satisfy and , and let . Put , where partial traces sum over the indicated subsystem, and let denote the map determined on elementary tensors by . Define , acting on matrices on , as the block diagonal output whose -block is , whose scalar output labelled “none” is , and whose scalar output labelled is , with every off-diagonal entry between these output blocks zero. For each natural , set and define and when and , and set both values to otherwise, including . Then, as ,
and each of these two suprema is attained by an element of its displayed domain.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.