Theorem 1: four equivalent additivity properties
OpenQAlgorithms.Papers.Independent.Gap48.P46.additivity_equivalencesAll 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 . The constraint includes every joint density with first marginal in and second marginal in , including correlated and entangled states.
Fix channels and . The following six universally quantified properties are equivalent:
- For all nonempty closed , .
- The same identity holds for all nonempty positive-observable linear inequality constraints with nonnegative budgets.
- For every joint state , with and ,
- For every joint state, .
- For all states , .
- For all states , .
These are equivalences of properties of a fixed pair, not unconditional additivity claims.
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.6–7, Theorem 1, including the product-state continuation: six equivalent
properties of the fixed pair. No unconditional additivity is asserted. -/
theorem additivity_equivalences [Nonempty I] [Nonempty O] [Nonempty J] [Nonempty K]
(Phi : Superop I O) (Psi : Superop J K) (hPhi : IsChannel Phi) (hPsi : IsChannel Psi) :
(AllConstraints Phi Psi ↔ LinearAdditive Phi Psi) ∧
(AllConstraints Phi Psi ↔ ChiSubadditive Phi Psi) ∧
(AllConstraints Phi Psi ↔ RoofSuperadditive Phi Psi) ∧
(AllConstraints Phi Psi ↔ ProductChiAdditive Phi Psi) ∧
(AllConstraints Phi Psi ↔ ProductRoofAdditive 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 and denote maps between the corresponding complex matrix spaces. Assume each is a channel: it has a finite Kraus representation , valid for every matrix , with . Write for the positive semidefinite trace-one matrices on , and let be the complex-linear map determined by . For any such channel , use all finite ensembles with , , and , and define
where , with zero terms equal to ; ensemble states need not be pure. For sets , , put . Let be the assertion
for every nonempty closed and , without a convexity requirement. The theorem asserts that each of the following five assertions is equivalent to : the same capacity equality holds whenever and , for all positive semidefinite and all nonnegative making these sets nonempty; for every ,
for every such ,
for every ,
and, for every such pair,
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.