Traditional Renyi Holevo information equals its radius
OpenQAlgorithms.Papers.Independent.Support50.P19.petz_holevo_eq_radiusLet be a finite-dimensional channel with nonzero registers and . Define and by the same ensemble and center optimizations as the sandwiched quantities, but use the unnormalized Petz divergence . Then
The input ensembles contain arbitrary mixed states; extrema are attained. This is a separate identity for traditional relative Renyi entropy, in the range inherited from the preceding proof.
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.19, Remark 15: the same equality for the distinct traditional Petz divergence. -/
theorem petz_holevo_eq_radius [Nonempty I] [Nonempty J] (a : ℝ) (ha : 1 < a) (ha2 : a ≤ 2)
(N : Superop I J) (hN : IsChannel N) :
channelInformation false a N = informationRadius false a N ∧ InformationExtrema false a N := 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 finite nonempty index sets with decidable equality, let , and let admit a finite Kraus representation for every , with . Let denote the positive semidefinite complex matrices indexed by with trace one. For density matrices , define when , and otherwise
where spectral powers send zero eigenvalues to zero. For every finite ensemble of input density matrices with nonnegative weights summing to one, put , , and ; put . Then
A finite input ensemble attains the left supremum, an output density matrix attains the right infimum, and for every output density matrix , some input density matrix satisfies . Zero ensemble weights and singular density matrices are allowed, and the extrema are interpreted in the extended real numbers.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.