Binary bistochastic capacity and the conditional additivity implication
ProvedQAlgorithms.Papers.Independent.Support50.P31.binaryBistochasticCapacityLet be a binary bistochastic channel: a completely positive trace-preserving endomorphism of complex matrices satisfying . Let denote the one-step finite-ensemble Holevo maximum and minimum output entropy, both in natural units. Then
Moreover, for every and every tuple of binary bistochastic channels ,
Each output optimization ranges over all density inputs, and is not a regularized capacity. The second clause transfers an entropy-additivity hypothesis to one-step capacity additivity; it is not an unconditional proof of either conjecture.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P31
noncomputable section
open Filter Asymptotics
open scoped ComplexConjugate ENNReal
namespace QAlgorithms.Papers.Independent.Support50.P31
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P56 (entropy)
open QAlgorithms.Papers.Independent.Information100.P63 (schatten)
open QAlgorithms.Papers.Independent.Gap48.P03 (holevoQuantity)
open QAlgorithms.Papers.Independent.Claimed50.P38 (tensorSuperop)
open QAlgorithms.Papers.Independent.Dependency50.P44 (tensorChannels)
/-- PDF p.9, Lemma (18), BOTH clauses: binary bistochastic formula, and the
conditional implication from entropy additivity to one-step capacity additivity. -/
theorem binaryBistochasticCapacity (Phi : Superop (Fin 2) (Fin 2))
(hPhi : IsChannel Phi) (hunital : Phi 1 = 1) :
holevoQuantity Phi = Real.log 2 - nuH Phi ∧
∀ (n : ℕ) (_hn : 0 < n) (Psi : Fin n → Superop (Fin 2) (Fin 2)),
(∀ i, IsChannel (Psi i) ∧ Psi i 1 = 1) →
nuH (piSuperop Psi) = ∑ i, nuH (Psi i) →
holevoQuantity (piSuperop Psi) = ∑ i, holevoQuantity (Psi i) := by sorry
end QAlgorithms.Papers.Independent.Support50.P31
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a map on complex matrices admitting a finite Kraus representation with , and assume . For any map on a finite matrix space, define on density matrices, using natural logarithms and , define , and define
Then . Furthermore, for every positive natural number and every family of maps on complex matrices, if each has a finite Kraus representation satisfying the same completeness identity and satisfies , then
where on the index set . The family is quantified independently of the initial map ; the empty family is excluded, and zero-size ensembles cannot satisfy the required sum of weights equal to one.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.