Supplementary Note 2, Lemma 1: high fidelity implies low entropy
OpenQAlgorithms.Papers.Independent.Intakenext100.P87.lemma_1Let and let be a positive semidefinite trace-one operator on the pairs. Entropy is measured in bits. Suppose and the squared singlet overlap satisfies . Then
The explicit interval for is the increasing branch used in the source's maximum-entropy comparison, and the strict inequality matches the strict overlap assumption.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P87
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P87
open scoped Matrix ComplexConjugate
open QAlgorithms.Measurements
/-- PDF p.19, Lemma 1: the proof uses the increasing entropy branch, here stated explicitly. -/
theorem lemma_1 (R : ℕ) (hR : 0 < R)
(rho : Matrix (PairRegister R) (PairRegister R) ℂ) (hrho : IsDensityMatrix rho)
(delta : ℝ) (hd : 0 < delta) (hsmall : delta < 1 - 1 / (2 : ℝ) ^ (2 * R))
(hF : 1 - delta < singletOverlap rho) :
vnEntropy rho < -(1 - delta) * Real.logb 2 (1 - delta) -
delta * Real.logb 2 (delta / ((2 : ℝ) ^ (2 * R) - 1)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P87
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive integer , let be a positive semidefinite complex matrix of trace , indexed by pairs of Boolean strings of length . Define if for every , and zero otherwise. For every real satisfying , if
then
where is applied to by continuous functional calculus, with . Both the overlap hypothesis and the entropy conclusion are strict inequalities; is excluded.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.