§2 Eq. (2): chi-function and entropy roof
OpenQAlgorithms.Papers.Independent.Gap48.P46.chi_decompositionAll 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 state. With denoting von Neumann entropy, the independently defined ensemble maximum and entropy minimum satisfy
There exist finite ensembles of mean attaining each of these two extrema. This identifies the entropy-roof decomposition without defining the chi-function through that identity.
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.2–3, Eq.(2): decomposition and attainment of both finite-ensemble extrema. -/
theorem chi_decomposition [Nonempty I] [Nonempty O]
(Phi : Superop I O) (hPhi : IsChannel Phi) (rho : Matrix I I ℂ)
(hrho : IsDensityMatrix rho) :
fixedMeanChi Phi rho = vnEntropy (Phi rho) - (mixedRoof (fun X => vnEntropy (Phi X))) rho ∧
(∃ e : Ensemble I, (ensembleAverage e) = rho ∧ outputHolevo Phi e = fixedMeanChi Phi rho) ∧
(∃ e : Ensemble I, (ensembleAverage e) = rho ∧ shorEnsembleEntropy e Phi = (mixedRoof (fun X => vnEntropy (Phi X))) 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 map complex matrices on to complex matrices on . Assume that is a channel, meaning that there is a finite family of matrices with and for every matrix . Let be positive semidefinite with trace . An ensemble here consists of finitely many density matrices, nonnegative real probabilities, and ; zero probabilities and repeated states are permitted, while cannot satisfy the probability condition. Write , let for the eigenvalues of a density matrix , with zero terms interpreted as , and define
The supremum and infimum range over these mixed-state ensembles, without requiring their states to be pure. The assertion is
and there exists an ensemble of average attaining the supremum defining , and there exists an ensemble of average attaining the infimum defining . The two existence assertions do not require the chosen ensembles to be identical.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.