Unnumbered result: finite-Holevo equality iff recovery of the ensemble family
OpenQAlgorithms.Papers.Independent.Gap48.P45.discreteHolevoEquality_recoveryAll physical Hilbert spaces are nonzero complex separable Hilbert spaces, with finite dimensions included. States are positive trace-class operators of trace one, channels are completely positive and trace preserving on the entire trace class, and logarithms are natural. Inner products are conjugate-linear in the first argument. Let be a finite or countable ensemble, with computed average and finite Holevo quantity . Then
This result characterizes when a channel preserves the distinguishability of a discrete ensemble.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P45
noncomputable section
open Filter MeasureTheory
open scoped BigOperators ENNReal Topology
attribute [local instance] Classical.propDecidable Classical.decEq
attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus
namespace QAlgorithms.Papers.Independent.Gap48.P45
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsTraceClass IsTraceClassChannel traceSize traceClosure rankOne productCoeff tensorApply)
open QAlgorithms.Papers.Independent.Frontier18.P01 (Channel Complementary traceFirst traceSecond)
open QAlgorithms.Papers.Independent.Frontier18.P07
(GeneralizedEnsemble averageCoefficients extendedEntropyNats extendedRelativeEntropyNats ensembleHolevo pureStates finiteEnsembleCapacity)
open QAlgorithms.Papers.Independent.Frontier18.P18
(operatorCoeff boundedOperator conjugateCoeff ReversibleOn IsometricallyEquivalent
IsParsevalFrame IsKrausRepresentation)
open QAlgorithms.Papers.Independent.Claimed50.P16 (tensorRankLE)
open QAlgorithms.Papers.Independent.Next46.P31 (positiveSquareRoot)
open QAlgorithms.Papers.Independent.Next46.P42 (minimumOutputEntropy)
/-- PDF p.19, after Remark 3: finite-Holevo equality iff one common channel
recovers every positive-weight state. Zero-weight entries are removed. -/
theorem discreteHolevoEquality_recovery
{I J : Type} [Countable I] [Countable J] [Nonempty I] [Nonempty J]
(Phi : Channel I J) (e : DiscreteEnsemble I)
(hFinite : discreteHolevo (id : Matrix I I ℂ → Matrix I I ℂ) e < ⊤) :
discreteHolevo Phi.val e = discreteHolevo (id : Matrix I I ℂ → Matrix I I ℂ) e ↔
ReversibleOn Phi.val (activeStates e) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P45
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be countable, nonempty types and . A trace-class coefficient matrix means a matrix admitting with ; a state additionally has real, nonnegative quadratic forms on every finite coordinate set and a summable real diagonal of sum . Let preserve trace class, be additive and complex homogeneous on trace-class inputs, and preserve states under blockwise amplification by the identity on every finite auxiliary coordinate space. Let be a convergent sequence of weights summing to , and let be a state for every . For any matrix , let be a chosen bounded operator with that coordinate matrix, or if no such operator exists, and let . Define the average specified by the code by
For arbitrary matrices , define , where are their compressions to , and
Here and the logarithms use continuous functional calculus with . Set
as extended nonnegative sums, with . Assuming , one has if and only if there exists a single channel , satisfying the same trace-class linearity and finite-amplification state conditions, such that
Recovery is required only for the states occurring with positive weight.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.