Section 4, printed 3.3: Holevo bound (18)
OpenQAlgorithms.Papers.Independent.Intakethird100.P84.transmissionHolevoBoundLet be a finite ensemble of normalized densities, with and . Let be complex linear, trace preserving and 2-positive, and an arbitrary output POVM. Put , and . With natural entropy,
The averages are computed by the accepted Holevo functional. Singular code states and zero weights are allowed; no average invertibility is required.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P84
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P84
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
-- Pinned accepted definitions, inspected at their recorded source locations.
open QAlgorithms.Papers.Independent.Renew46.P35 (traceAdjoint)
open QAlgorithms.Papers.Independent.Dependency50.P21 (imaginaryPower marginalAB)
/-- Petz, arXiv:quant-ph/0209053v1, PDF pp.8--9, (18) [10].
Finite transmission ensembles, arbitrary two-positive trace-preserving transmission,
and the actual output POVM. Zero weights and singular code states are allowed.
The accepted Holevo functional computes both averages and uses natural units. -/
theorem transmissionHolevoBound {X I J O : Type*}
[Fintype X] [Fintype I] [Fintype J] [Fintype O]
[Nonempty X] [Nonempty I] [Nonempty J] [Nonempty O]
(p : X → ℝ) (hp : QAlgorithms.Papers.Independent.Information100.P56.IsLaw p)
(D : X → Matrix I I ℂ) (hD : ∀ i, IsDensityMatrix (D i))
(T : Matrix I I ℂ →ₗ[ℂ] Matrix J J ℂ)
(hT : IsTwoPositive T) (htrace : ∀ B, (T B).trace = B.trace)
(E : O → Matrix J J ℂ) (hE : IsPOVM E) :
QAlgorithms.Papers.Independent.Information100.P56.holevo p
(fun i => measurementDensity E (T (D i))) ≤
QAlgorithms.Papers.Independent.Information100.P56.holevo p D := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P84
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For any finite nonempty sets , let satisfy and , and let each be positive semidefinite with trace . Let be complex-linear and trace-preserving on every matrix, and assume that applying separately to each block of every positive semidefinite block matrix produces a positive semidefinite matrix. Let be positive semidefinite for every , with , and set to be the diagonal matrix indexed by whose -th diagonal entry is . Then
where , , evaluated by functional calculus with . Thus the entropy in this assertion uses natural logarithms. Zero weights are allowed, while the density-matrix condition on is required for every , including those of zero weight.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.