Theorem 2: constrained versus asymptotic extension additivity
OpenQAlgorithms.Papers.Independent.Gap48.P46.constrained_iff_asymptoticAll 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 a nonempty closed constraint on . Additivity for with every nonempty closed constraint and for with constraint is equivalent to the following assertion: for every effect and every , both extension limits exist and
The limits use the admissible tail , . The set need not be convex. This is the paper's fixed-pair constrained/asymptotic equivalence.
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.13–15, Theorem 2: fixed closed B, all closed A, iff every nonnegative
Shor tilt is asymptotically additive. B is not required to be convex. -/
theorem constrained_iff_asymptotic [Nonempty I] [Nonempty O] [Nonempty J] [Nonempty K]
(Phi : Superop I O) (Psi : Superop J K) (hPhi : IsChannel Phi) (hPsi : IsChannel Psi)
(B : Set (Matrix J J ℂ)) (hB : Constraint B) :
(∀ A, Constraint A → ConstrainedAdditive Phi Psi A B) ↔ AsymptoticAdditive Phi Psi B := 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, let and denote channels on matrix spaces, and let be a nonempty closed set of density matrices on , not necessarily convex. A density matrix is positive semidefinite with trace , and a channel has a finite representation with . With , let be the supremum of over finite density-matrix ensembles with nonnegative weights summing to and average , and let . Tensor products of channels act as , extended linearly. The following two properties are equivalent: for every nonempty closed set of density matrices on ,
and, for every matrix with and , and every real , there exists a real such that the following two sequences converge to and , respectively. At a natural index satisfying and , their values are the unrestricted capacity and the capacity of constrained only by the -marginal lying in ; at every other index both values are . Here denotes the set of density matrices, , and is block diagonal with -block , scalar “none” entry , and scalar entries for labels .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.