(8), pp. 3–4 — Tr X_N(Ω)² = ∏ⱼ 1/(dⱼ−1)² Σ_Λ Tr ρ²_Λ ∏_{j∈Λᶜ}(dⱼ−2) ≤ ∏ⱼ 1/(dⱼ−1)
ProvedWHAdditivity.Renyi.eq_8p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1partial-tracepuritywerner-holevo
Let , , and let be a unit vector. Put , the output of the product of Werner–Holevo channels, and let be the reduced matrix of on the sites in , with the complement in . Then every line of the computation (8) holds:
where all sums run over subsets of ; in particular is real.
The bound says that the purity of the output of on any pure input, entangled or not, is at most the purity of a product output; it is the inequality from which the paper derives the lower bound in (7).
Formalization Note. is (X * X).trace, a complex number; the statement asserts its imaginary part is and bounds its real part. is star Ω. The subsets range over Finset.powerset.
Differences from the source:
- encoding: Γ_{d_j} with 1/(d_j − 1) → hypotheses 2 ≤ d_j; reason: (6) is undefined at d_j = 1.
- encoding: ⊗j Γ{d_j} → the linear extension of (6), tensored through matrix units; reason: needed for entangled inputs; agrees with (6) on density matrices.
- encoding: a real trace compared with ≤ → the complex trace has imaginary part 0, and its real part is bounded; reason: the inequality in the paper presupposes that Tr X² is real; Lean states it.
- encoding: sites 1, …, N → sites
Fin Nfrom 0; reason: relabelling only. - generalization: N ≥ 1 implicitly → every N ∈ ℕ; reason: N = 0 is the trivial case (Tr X² = 1 = empty product); specializes to the paper's N ≥ 1.
Preamble
import Mathlib import Definitions.Def_WHAdditivity_Renyi_Model
Formal statement
namespace WHAdditivity.Renyi
theorem eq_8 (N : ℕ) (d : Fin N → ℕ) (hd : ∀ j, 2 ≤ d j) (Ω : Config d → ℂ)
(hΩ : IsUnitVector Ω) :
let X := tensorChannel d (fun j => wernerHolevo (d j)) (pureState Ω)
let ρ := pureState (star Ω)
(X * X).trace =
(∏ j, (((d j : ℂ) - 1) ^ 2)⁻¹) * ∑ Λ : Finset (Fin N), ∑ Λ' : Finset (Fin N),
(-1 : ℂ) ^ (Λ.card + Λ'.card) *
(tensorIdentity d Λ (reducedMatrix d Λ ρ) *
tensorIdentity d Λ' (reducedMatrix d Λ' ρ)).trace ∧
(X * X).trace =
(∏ j, (((d j : ℂ) - 1) ^ 2)⁻¹) * ∑ Λ : Finset (Fin N), ∑ Λ' : Finset (Fin N),
(-1 : ℂ) ^ (Λ.card + Λ'.card) *
((∏ j ∈ (Λ ∪ Λ')ᶜ, (d j : ℂ)) * (reducedMatrix d (Λ ∩ Λ') ρ ^ 2).trace) ∧
(X * X).trace =
(∏ j, (((d j : ℂ) - 1) ^ 2)⁻¹) * ∑ Λ : Finset (Fin N),
(reducedMatrix d Λ ρ ^ 2).trace *
∑ Δ ∈ Λᶜ.powerset, (-1 : ℂ) ^ Δ.card *
∑ Δ' ∈ (Λᶜ \ Δ).powerset, (-1 : ℂ) ^ Δ'.card *
∏ j ∈ (Λᶜ \ Δ) \ Δ', (d j : ℂ) ∧
(X * X).trace =
(∏ j, (((d j : ℂ) - 1) ^ 2)⁻¹) * ∑ Λ : Finset (Fin N),
(reducedMatrix d Λ ρ ^ 2).trace * ∏ j ∈ Λᶜ, ((d j : ℂ) - 2) ∧
(X * X).trace.im = 0 ∧
(X * X).trace.re ≤ ∏ j, ((d j : ℝ) - 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, pp. 3–4, (8)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.