Proposition 1: optimal ensemble criterion
OpenQAlgorithms.Papers.Independent.Gap48.P46.optimal_ensemble_criterionAll 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. Let have mean . Write , and let be quantum relative entropy, taking value on support violation. Then
Zero-weight distance terms are zero. This criterion tests feasible ensemble averages; individual component states need not lie in the constraint.
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 pp.4–5, Proposition 1: optimality iff the extended distance bound holds for
every ensemble with feasible mean, including components outside the constraint. -/
theorem optimal_ensemble_criterion [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 : (ensembleAverage e) ∈ A) :
IsOptimalConstrainedEnsemble Phi A e ↔ ∀ f : Ensemble I, (ensembleAverage f) ∈ A →
shorEnsembleDistance f Phi (ensembleAverage e) ≤ ENNReal.ofReal (outputHolevo Phi e) := 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, so for all for a finite family satisfying . Let be a nonempty closed convex set of positive semidefinite trace-one matrices on . An ensemble consists of finitely many density matrices with real weights summing to ; put and , where , with zero terms equal to . Define and . For density matrices , define the extended nonnegative quantity
where , and the matrix functions use spectral functional calculus, assigning and . Fix an ensemble with . Then and hold if and only if, for every ensemble with ,
This inequality is in , with .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.