Corollary 3: global unconstrained implies constrained additivity
OpenQAlgorithms.Papers.Independent.Gap48.P46.global_unconstrained_iff_constrainedAll 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.
Let global unconstrained additivity mean capacity additivity for every pair of finite-dimensional channels without constraints. Let global constrained additivity mean the corresponding statement for every such pair with every nonempty closed mean constraint pair. Then
The forward implication is Corollary 3; taking full-state constraints gives the converse. Neither conjecture is assumed to hold unconditionally.
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.15, Corollary 3: implication between global conjectures; full-state
constraints supply the reverse implication. -/
theorem global_unconstrained_iff_constrained :
GlobalUnconstrained ↔ GlobalConstrained := by sorry
end QAlgorithms.Papers.Independent.Gap48.P46
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For a finite index set , let denote the positive semidefinite complex matrices of trace , and put . For a channel , let be the supremum of over all finite ensembles of density matrices with nonnegative weights summing to and average , and define . Channels here are maps with finite Kraus representations , where ; their tensor product is the linear extension of . The following global assertions are equivalent: for every four finite nonempty index types with decidable equality and every pair of channels , , the unrestricted identity
holds; and, for every such choice of types and channels and every pair of nonempty closed sets , , the identity
holds. The constrained sets in the second assertion need not be convex.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.