p. 2 — the von Neumann and p-Rényi entropies are additive on tensor products
ProvedWHAdditivity.Renyi.renyi_tensor_additiveadditivityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1renyi-entropytensor-productvon-neumann-entropy
Let , let be dimensions, let be a density matrix on for each , and let . Then
where for and is the von Neumann entropy (natural logarithm). The case is additivity of the von Neumann entropy, the case additivity of the Rényi entropies.
In the paper this is the remark that reduces the additivity conjecture to the inequality (5); in the proof of (7) it gives the easy half: product inputs already achieve .
Formalization Note. is the matrix on with entries , in the product basis.
Differences from the source:
- generalization: "additive on tensor products" (no number of factors, used for two in (5)) → N-fold products with arbitrary dimensions d_j; reason: contains the two-fold case (N = 2), and the N-fold case is what (7) uses.
- encoding: S_p for p > 1, extended to p = 1 by the limit → S_1 := S; reason: the limit's value is S; p = 1 is the von Neumann case of the remark.
- encoding: log unspecified → natural logarithm; reason: additivity holds in every base.
Preamble
import Mathlib import Definitions.Def_WHAdditivity_Renyi_Model
Formal statement
namespace WHAdditivity.Renyi
theorem renyi_tensor_additive (N : ℕ) (d : Fin N → ℕ)
(ρ : (j : Fin N) → Matrix (Fin (d j)) (Fin (d j)) ℂ) (hρ : ∀ j, IsDensity (ρ j))
(p : ℝ) (hp : 1 ≤ p) :
renyiEntropy p (tensorMatrix d ρ) = ∑ j, renyiEntropy p (ρ j) := 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. 2, remark before (5)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.