Explicit block formula for ensemble alpha-Holevo information
OpenQAlgorithms.Papers.Independent.Support50.P19.cq_block_formulaLet and let be a finite ensemble of density operators on a nonzero finite complex space, allowing zero probabilities. Define and . Then
Both minima range over density operators and are attained. The alpha power is inside each trace defining . A zero-weight unsupported block contributes zero. This formula computes the ensemble information from its conditional states.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P19
noncomputable section
open scoped Matrix ComplexOrder ComplexConjugate ENNReal
open Filter Topology
namespace QAlgorithms.Papers.Independent.Support50.P19
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Dependency50.P35
(tr Dominates spectralPower elog elogNN rawTrace cq)
open QAlgorithms.Papers.Independent.Dependency50.P09 (sandwichedD petzD relativeD)
open QAlgorithms.Papers.Independent.Information100.P56 (sandwichedTrace)
open QAlgorithms.Papers.Independent.Information100.P27 (average)
open QAlgorithms.Papers.Independent.Information100.P67
(IsIsometry receiverChannel complementaryChannel)
open QAlgorithms.Papers.Independent.Claimed50.P48 (FiniteKrausCP)
open QAlgorithms.Papers.Independent.Dependency50.P23
(UACode uaCodeSuccess ordinaryClassicalCapacity IsEB IsHadamard)
open QAlgorithms.Papers.Independent.Information100.P08 (Ensemble)
open QAlgorithms.Papers.Independent.Information100.P71 (channelPower)
open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)
open QAlgorithms.Papers.Independent.Information100.P63 (tensorPower)
open QAlgorithms.Papers.Independent.Claimed50.P26
(CovariantIrreducible minOutput UnassistedExponentialConverse)
variable {I J K L : Type} [Fintype I] [Fintype J] [Fintype K] [Fintype L]
variable [DecidableEq I] [DecidableEq J] [DecidableEq K] [DecidableEq L]
/-- PDF p.17, (14): the cq definition equals the explicit support-aware block formula. -/
theorem cq_block_formula [Nonempty I] (a : ℝ) (ha : 1 < a) (e : Ensemble I) :
renyiEnsembleInformation true a e.prob e.state = blockInformation a e.prob e.state ∧
∃ sigma : {X : Matrix I I ℂ // IsDensityMatrix X}, blockInformation a e.prob e.state =
((1 / (a - 1) : ℝ) : EReal) *
elogNN (∑ x, ENNReal.ofReal (e.prob x) * sandwichedTrace a (e.state x) sigma.1) := by sorry
end QAlgorithms.Papers.Independent.Support50.P19
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite nonempty index set with decidable equality, let , and let be a finite ensemble consisting of a natural number , nonnegative real weights summing to one, and positive semidefinite matrices indexed by , each with trace one. Define the block matrix by , and for a density matrix define by replacing every with . For positive semidefinite , let , where spectral powers send zero eigenvalues to zero; set under , and otherwise . Likewise set under support failure and otherwise , with for and otherwise. Writing , , and for finite , the assertion is
and there exists a density matrix attaining the infimum on the right. The sum inside is in , so a zero weight times is zero. Zero weights and singular states are allowed; the condition excludes .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.