Lemma 1: supporting linear constraint
OpenQAlgorithms.Papers.Independent.Gap48.P46.supporting_constraintAll 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 a channel and a full-rank state. There is an effect , meaning , such that, on putting ,
for every state . Thus any full-rank state supports a linear constraint under which it maximizes chi. No strict-feasibility conclusion is asserted.
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.3, Lemma 1 (proof pp.16–17): a full-rank density supports an effect
constraint. Strict feasibility and nonscalar effects are not hypotheses. -/
theorem supporting_constraint [Nonempty I] [Nonempty O]
(Phi : Superop I O) (hPhi : IsChannel Phi) (rho : Matrix I I ℂ)
(hrho : IsDensityMatrix rho) (hfull : IsUnit rho.det) :
∃ A : Matrix I I ℂ, IsEffect A ∧ ∀ omega ∈ states I,
effectProb A omega ≤ effectProb A rho → fixedMeanChi Phi omega ≤ fixedMeanChi Phi rho := 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 from matrices on to matrices on : for some finite Kraus family, for every , with . Let be a positive semidefinite trace-one matrix with . For each density matrix , define as the supremum, over all finite ensembles of density matrices with , , and , of
where , with . There exists a matrix on such that both and are positive semidefinite and, for every density matrix ,
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.