Symmetric Holevo information versus squared fidelity
OpenQAlgorithms.Papers.Independent.Intakethird100.P14.information_fidelity_boundsLet , , be a classical–quantum channel whose outputs are positive trace-one density operators on a common complex Hilbert space. Define and let be the Holevo information of the uniform input distribution, measured in bits. Then
These inequalities connect information and reliability, including identical outputs and orthogonal outputs. For infinite-entropy states, is intrinsically , where and relative entropy uses base-two logarithms. Its extended value is retained until the displayed upper bound ensures finiteness.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P14
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P14
open Filter MeasureTheory
open scoped ENNReal NNReal ComplexOrder BigOperators
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33 (IsDensity)
open QAlgorithms.Papers.Independent.Dependency50.P13 (compression)
open QAlgorithms.Papers.Independent.Renew46.P44 (wordOutput)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Proposition 1, PDF p.3, (1)–(2); proof p.10. The intrinsic information
remains extended until the upper bound establishes finiteness. All outputs
are normalized positive trace-class operators; no finite entropy hypothesis. -/
theorem information_fidelity_bounds {I : Type} (W : Bit → OutputCoefficients I) (hW : IsBinaryCqChannel W) :
ENNReal.ofReal (Real.logb 2 (2 / (1 + Real.sqrt (squaredCqFidelity W)))) ≤
symmetricInformation W ∧
symmetricInformation W ≤ ENNReal.ofReal (Real.sqrt (1 - squaredCqFidelity W)) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P14
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For any type and , suppose each is a density array in the following precise sense: it has an expansion , with and ; every finite quadratic form is real and nonnegative; and its real diagonal is summable with sum one. For an array , let be a chosen bounded operator with coefficients , if one exists, and zero otherwise; let be a chosen positive bounded square root of , if one exists, and zero otherwise; and write . Define
For arrays , define as the supremum over all finite orthonormal families , including the empty family, of
where , , , and matrix functions use continuous functional calculus. With and , the assertion is
where the bounds are embedded into and the real square root is zero on negative arguments. No countability assumption on is present; the density hypothesis cannot hold for empty .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.