Corollary 2: two unconstrained extension families suffice
OpenQAlgorithms.Papers.Independent.Gap48.P46.extension_pairs_sufficeAll 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 . Suppose unconstrained capacity additivity holds for and for every pair of effects , every and every pair of positive integers . Then, for every nonempty closed ,
The extension parameters are universally quantified before the conclusion over original constraints. The result reduces constrained additivity of the pair to all its unconstrained extension pairs.
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 2: the premise covers every pair of extension parameters,
and the conclusion covers every closed mean constraint pair. -/
theorem extension_pairs_suffice [Nonempty I] [Nonempty O] [Nonempty J] [Nonempty K]
(Phi : Superop I O) (Psi : Superop J K) (hPhi : IsChannel Phi) (hPsi : IsChannel Psi)
(h : ∀ E : Matrix I I ℂ, IsEffect E → ∀ F : Matrix J J ℂ, IsEffect F →
∀ q ∈ Set.Icc (0 : ℝ) 1, ∀ r ∈ Set.Icc (0 : ℝ) 1,
∀ d : ℕ, 1 ≤ d → ∀ e : ℕ, 1 ≤ e →
ConstrainedAdditive (shor Phi E q d) (shor Psi F r e) (states (I × Fin d)) (states (J × Fin e))) :
AllConstraints 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 sets with decidable equality, and let and be channels on the corresponding matrix spaces. A channel means a finite Kraus map with . Write for positive semidefinite matrices of trace , define , define as the supremum of over finite density-matrix ensembles of average with nonnegative weights summing to , and put . Tensor products of channels are the linear extensions of . For an effect , meaning and , a real , and a natural , define to have block diagonal output consisting of , the scalar , and the scalars for . Suppose that for every effect on , every effect on , every , and all natural , the unrestricted capacity of equals the sum of the unrestricted capacities of these two maps. Then, for every nonempty closed and nonempty closed , with neither set required to be convex,
The hypothesis includes and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.