§6: constrained additivity implies weak additivity
OpenQAlgorithms.Papers.Independent.Gap48.P46.strong_implies_weakAll 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 .
Fix channels satisfying additivity for every feasible positive-observable linear constraint pair. Let , and let be feasible for the total observable . Then
The allocation maximum is attained. Here a capacity with an observable and budget uses the inequality . This is the local conditional implication from strong to weak additivity.
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 pp.15–16, §6: strong linear-constraint additivity implies weak allocation
additivity, with a feasible maximizing allocation. -/
theorem strong_implies_weak [Nonempty I] [Nonempty O] [Nonempty J] [Nonempty K]
(Phi : Superop I O) (Psi : Superop J K) (hPhi : IsChannel Phi) (hPsi : IsChannel Psi)
(h : LinearAdditive Phi Psi) (A : Matrix I I ℂ) (B : Matrix J J ℂ)
(hA : A.PosSemidef) (hB : B.PosSemidef) (gamma : ℝ)
(hgamma : gamma ∈ budgetDomain (sumObservable A B)) : WeakAt Phi Psi A B gamma := 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, meaning maps with finite Kraus representations whose Kraus operators satisfy . Write for positive semidefinite matrices of trace , put , let be the supremum of over finite density-matrix ensembles of average with nonnegative weights summing to , and set . Tensor products act on elementary tensors by the tensor product of the channel outputs. For a matrix , define and . Suppose that for every positive semidefinite on , every positive semidefinite on , and every , the capacity of over density matrices with marginals in and equals . Then, for any positive semidefinite on , positive semidefinite on , and real ,
and this supremum is attained by at least one such allocation .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.