p. 3 — MEOₚ[Γ_d] = log(d − 1): every pure input gives (1/(d−1))(𝟙 − |φ̄⟩⟨φ̄|)
ProvedWHAdditivity.Renyi.single_channel_valueminimal-output-entropyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1renyi-entropywerner-holevo
Let and , and let be the Werner–Holevo channel on complex matrices. For a unit vector write for its entrywise complex conjugate. Then:
- for every unit vector , ;
- for every unit vector , ;
- the set of values , , is bounded below, and
Here is the -Rényi entropy for and the von Neumann entropy for , with the natural logarithm.
This is the single-channel value: every pure input is mapped to the same flat spectrum, so the right-hand side of the additivity formula (7) is .
Formalization Note. is star φ; is Matrix.vecMulVec φ (star φ); is the linear extension of (6) to all matrices.
Differences from the source:
- encoding: Γ_d defined for d ≥ 1 by (6), with 1/(d − 1) → hypothesis 2 ≤ d; reason: (6) divides by d − 1, so d = 1 is undefined in the paper and junk (0⁻¹ = 0) in Lean.
- encoding: Γ_d(ρ) = (1/(d−1))(𝟙 − ρᵀ) on density matrices → (Tr X · 𝟙 − Xᵀ)/(d − 1) on all matrices; reason: agrees with (6) on every trace-one input, in particular on |φ⟩⟨φ|.
- encoding: MEO_p at p = 1 defined as the limit p ↓ 1 → S_1 := S, the von Neumann entropy; reason: the paper extends the notation to p = 1 by this limit, whose value is S.
- encoding: MEO_p as an infimum → real
sInf, with bounded-belowness of the set concluded; reason: Lean'ssInfof a set unbounded below is 0; concluding the bound adds content and excludes the junk case. - encoding: log unspecified → natural logarithm; reason: the paper's log has no stated base, and log(d − 1) on both sides fixes nothing else.
- generalization: the display states the chain of equal infima → Lean also asserts the two pointwise identities under the infimum, for every unit φ; reason: they imply the display (the infimum of a constant is that constant), and the middle line of the display is the first identity.
Preamble
import Mathlib import Definitions.Def_WHAdditivity_Renyi_Model
Formal statement
namespace WHAdditivity.Renyi
theorem single_channel_value (d : ℕ) (hd : 2 ≤ d) (p : ℝ) (hp : 1 ≤ p) :
(∀ φ : Fin d → ℂ, IsUnitVector φ →
wernerHolevo d (pureState φ) = ((d : ℂ) - 1)⁻¹ • (1 - pureState (star φ))) ∧
(∀ φ : Fin d → ℂ, IsUnitVector φ →
renyiEntropy p (wernerHolevo d (pureState φ)) = Real.log ((d : ℝ) - 1)) ∧
BddBelow (outputEntropies p (wernerHolevo d)) ∧
minOutputEntropy p (wernerHolevo d) = Real.log ((d : ℝ) - 1) := by sorry
end WHAdditivity.Renyi
Source
Alicki, Fannes, Note on multiple additivity of minimal Renyi entropy output of the Werner–Holevo channels, arXiv:quant-ph/0407033v2, p. 3, display after 'A straightforward computation yields'
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.