Theorem I.17: JHHH scheme Fe≥1−2(n+1)^d 2^(−n inf_(H(nu)≥R) D(nu||averageState)).
ProvedQAlgorithms.Papers.Independent.Renew46.P43.universalCompressionLet a finite pure-state source have average on a -dimensional system. For and , take the JHHH projection onto the least common support of all exact spectral types of all states of entropy at most , over all fine bases. Compress onto its nonzero range and decode by inclusion. Divergences are in bits; an empty constraint infimum is and .
This is the source result with its stated operational or information-theoretic domain.
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
noncomputable section
namespace QAlgorithms.Papers.Independent.Renew46.P43
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator
open Filter MeasureTheory
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Information100.P06 (Below)
open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)
open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Claimed50.P40 (InBlocks)
attribute [local instance] QAlgorithms.Papers.Independent.Renew46.P43.matrixMeasurableSpace
/-- Theorem I.17, PDF p.17: entanglement fidelity of the actual universal JHHH
range compression followed by inclusion. The proof's later Fbar notation is a slip;
the printed theorem states Fe, which is retained here. -/
theorem universalCompression {a d : ℕ} (S : PureSource a d)
(R : ℝ) (hR : 0 ≤ R) (n : ℕ) (hn : 0 < n) (k : ℕ) (hk : 0 < k)
(V : Matrix (Fin n → Fin d) (Fin k) ℂ)
(hisometry : Vᴴ * V = 1) (hrange : V * Vᴴ = universalProjector d n R) :
sourceFe (copies n S.average) (conjSuperop V ∘ projectionEncoder V) ≥
1 - 2 * (n+1 : ℝ)^d * divergenceTail n (highEntropyDivergence S.average R) := by sorry
end QAlgorithms.Papers.Independent.Renew46.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be natural numbers, and let consist of positive integers , a probability mass function on , and distinct matrices on , where every has norm . Put , with the real probability of . Let , let be positive integers, and let satisfy and , where is the orthogonal projector onto the following subspace: for every probability vector and unitary matrix such that has entropy , include the range of , where is column of , and take the complex linear span of all these ranges. Here and throughout this paragraph for the continuous functional calculus with . Define and . For , let and , where is defined by continuous functional calculus. Then
The infimum is taken in , so an empty feasible set gives ; , and for finite . For density matrices , is unless ; otherwise it equals , where and both matrix functions use continuous functional calculus. The map applies to each matrix block indexed by the first register. No positivity of individual is required, and the assertion is conditional on the specified existing.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.