Corollary 1: chi-deficit maximal-distance bound
OpenQAlgorithms.Papers.Independent.Gap48.P46.chi_deficit_boundAll quantum systems are nonzero finite-dimensional complex Hilbert spaces. States are positive semidefinite trace-one matrices, and channels are CPTP maps on the full matrix algebra. All entropies and logarithms are in bits. An ensemble is a finite probability distribution of states, with zero weights permitted. For a channel , write for the maximum ensemble Holevo information at mean , for the minimum average output entropy at that mean, and for the maximum of over a nonempty closed mean constraint .
Let be nonempty, closed and convex, and let be the average of an optimal ensemble for with this constraint. For every ,
Here is extended nonnegative relative entropy, infinite on support failure. The inequality bounds the loss in chi by the distance to the optimal output mean.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P46
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P46
open scoped Matrix ComplexConjugate ENNReal ComplexOrder
open Filter
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)
open QAlgorithms.Papers.Independent.Information100.P54 (relativeEntropyBits)
open QAlgorithms.Papers.Independent.Dependency50.P23 (IsEB)
open QAlgorithms.Papers.Independent.Information100.P08
(Ensemble ensembleAverage outputHolevo mixedRoof)
variable {I O J K : Type} [Fintype I] [Fintype O] [Fintype J] [Fintype K]
variable [DecidableEq I] [DecidableEq O] [DecidableEq J] [DecidableEq K]
/-- PDF p.6, Corollary 1: optimal mean capacity and the chi-deficit distance bound.
Convexity is inherited from Proposition 1, which the proof invokes. -/
theorem chi_deficit_bound [Nonempty I] [Nonempty O]
(Phi : Superop I O) (hPhi : IsChannel Phi) (A : Set (Matrix I I ℂ))
(hA : Constraint A) (hconvex : Convex ℝ A) (e : Ensemble I) (he : IsOptimalConstrainedEnsemble Phi A e) :
constrainedChiCapacity Phi A = fixedMeanChi Phi (ensembleAverage e) ∧ ∀ rho ∈ A,
ENNReal.ofReal (fixedMeanChi Phi rho) + relativeEntropyBits (Phi rho) (Phi (ensembleAverage e)) ≤
ENNReal.ofReal (constrainedChiCapacity Phi A) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P46
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types with decidable equality, and let be a channel, with a finite Kraus family satisfying . Let be a nonempty closed convex subset of the density matrices on . For a finite ensemble , require , , and each to be positive semidefinite with trace , and put . Define
where , with zero terms equal to . Suppose and . Then
Here the latter inequality is in the extended nonnegative reals, , and, for density matrices , is unless ; when this inclusion holds, it equals . Matrix functions use spectral functional calculus with and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.