§6: block additivity and operational single-letterization
OpenQAlgorithms.Papers.Independent.Gap48.P46.operational_single_letterizationAll 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 a channel , a positive observable , and a feasible nonnegative budget . For let . Assume the -use weak allocation identity for every : the block capacity is the attained maximum of over feasible allocations with . Then
Operational is the supremum of nonnegative rates achievable by collective block encoders and decoding POVMs with vanishing maximum message error, each codeword satisfying its additive budget. Integer message counts and asymptotic rates in bits are used. It is not defined by the regularization identity cited from [2].
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.15–16, §6: the conditional n-use weak identity implies block additivity
and single-letter operational capacity. The operational capacity is defined by codes. -/
theorem operational_single_letterization [Nonempty I] [Nonempty O]
(Phi : Superop I O) (hPhi : IsChannel Phi) (A : Matrix I I ℂ) (hA : A.PosSemidef)
(alpha : ℝ) (halpha : alpha ∈ budgetDomain A) (hweak : BlockWeak Phi A alpha) :
(∀ n : ℕ, 1 ≤ n → constrainedChiCapacity (piSuperop (fun _ : Fin n => Phi))
(linearConstraint (blockObservable A n) ((n : ℝ) * alpha)) =
(n : ℝ) * constrainedChiCapacity Phi (linearConstraint A alpha)) ∧
constrainedOperationalCapacity Phi A alpha = constrainedChiCapacity Phi (linearConstraint A alpha) := 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 be a channel with a finite Kraus representation satisfying , and let be a matrix on . A density matrix is positive semidefinite with trace . Define , define as the supremum of over finite density-matrix ensembles with nonnegative weights summing to and average , and put . Set , , and fix . For , let , and let act on each factor by , extended linearly from elementary tensors. Assume that, for every , equals the supremum of over allocations with , and that this supremum is attained. Then
Here is the supremum of all such that, for every real , there exists a natural such that every admits a positive number of messages, density matrices on , and positive semidefinite measurement matrices on with , satisfying, for every message , and , together with .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.