Proposition 2: three subadditivity cases
OpenQAlgorithms.Papers.Independent.Gap48.P46.subadditivity_casesAll 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 any channel . Pointwise chi subadditivity means
It holds in each of these cases: is the identity channel; is entanglement breaking, meaning that every finite reference extension maps densities to separable states; or for , where and already satisfy the displayed property. This gives all three channel classes stated by the proposition.
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.8–10, Proposition 2: noiseless, entanglement-breaking, and noiseless
mixture cases. IsEB is the accepted dimension-general predicate. -/
theorem subadditivity_cases [Nonempty I] [Nonempty O] [Nonempty J] [Nonempty K]
(Psi : Superop J K) (hPsi : IsChannel Psi) :
ChiSubadditive (id : Superop I I) Psi ∧
(∀ Phi : Superop I O, IsChannel Phi → IsEB Phi → ChiSubadditive Phi Psi) ∧
(∀ Phi : Superop I O, IsChannel Phi → ChiSubadditive Phi Psi →
∀ q ∈ Set.Icc (0 : ℝ) 1, ChiSubadditive (twoBranchFlaggedChannel q (id : Superop I I) Phi) Psi) := 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 types with decidable equality, and let be a channel from matrices on to matrices on . A channel here is a map for a finite family with . For any channel , define as the supremum of over all finite ensembles of positive semidefinite trace-one matrices having nonnegative weights summing to and average , where , with zero terms equal to . For channels and , the subadditivity assertion means that every density matrix on satisfies
where the tensor map is the linear extension of . The theorem asserts this subadditivity for the identity channel on paired with ; for every channel satisfying the following condition paired with ; and, for every channel already satisfying this subadditivity with , for every , for the map paired with . The condition in the second assertion is that, for every integer and every density matrix on , can be written as a finite sum , where and every is a density matrix; the definition imposes no separate requirement that . The third assertion includes and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.