High-order smooth min-entropy uncertainty for a product measurement
OpenQAlgorithms.Papers.Independent.Intakenext100.P63.highOrder_smooth_uncertaintyLet be a POVM on a nonzero finite-dimensional input space, where counts its classical outcomes. Write , optimizing over normalized input densities; this minimum is attained. Smooth min-entropy optimizes over normalized states within half trace-norm distance . For , any , and any normalized, possibly entangled input on systems,
Moreover, for fixed and there is a threshold independent of such that for every subsequent ,
For the smooth output min-entropy is exactly zero for all . The measurement outcome law is represented by its diagonal density. This supplies uncertainty against arbitrary entangled inputs without an independence assumption.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P63
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P63
open QAlgorithms Filter
open QAlgorithms.Papers.Independent.Information100.P63 (Mat)
open QAlgorithms.Papers.Independent.Information100.P04 (Measurement)
open QAlgorithms.Papers.Independent.Information100.P27 (shannon labelInformation)
open QAlgorithms.Papers.Independent.Information100.P71 (channelPower dilationMap SupportIncluded)
open QAlgorithms.Papers.Independent.Bridge50.P47 (SymmetricIndex universalSymmetricDilation)
open QAlgorithms.Learning (IsDistribution)
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF pp.8,16–17, Proposition 6: both smooth min-entropy uncertainty bounds,
for arbitrary entangled inputs. d is the number of OUTPUT outcomes.
The deterministic d=1 case is included explicitly. -/
theorem highOrder_smooth_uncertainty {E : Type} [Fintype E] [DecidableEq E] [Nonempty E]
(d : ℕ) (hd : 0 < d) (M : Fin d → Mat E) (hM : IsPOVM M)
(eps : ℝ) (he0 : 0 < eps) (he1 : eps < 1) :
(∃ psi : Mat E, IsDensityMatrix psi ∧
shannon (fun i => effectProb (M i) psi) = povmMinimumShannon M) ∧
(∀ (delta : ℝ), 0 < delta → delta < 1 → ∀ (n : ℕ) (psi : Mat (Fin n → E)),
IsDensityMatrix psi →
(n : ℝ) * (povmMinimumShannon M - delta) -
16 * (Real.logb 2 d) ^ 2 / delta * Real.logb 2 (1 / eps) ≤
traceSmoothStateMinBits eps (measuredState M n psi)) ∧
(∃ n0 : ℕ, ∀ n ≥ n0, ∀ psi : Mat (Fin n → E), IsDensityMatrix psi →
(n : ℝ) * povmMinimumShannon M -
8 * Real.logb 2 d * Real.sqrt ((n : ℝ) * Real.logb 2 (1 / eps)) ≤
traceSmoothStateMinBits eps (measuredState M n psi)) ∧
(d = 1 → ∀ (n : ℕ) (psi : Mat (Fin n → E)), IsDensityMatrix psi →
traceSmoothStateMinBits eps (measuredState M n psi) = 0) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P63
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite nonempty type with decidable equality, let satisfy , and let be positive semidefinite complex matrices on whose sum is the identity. Fix . For a probability vector , put , and define
For any matrix , write , let be its Euclidean operator norm, and define
For and a density matrix on , let be the diagonal matrix indexed by , with diagonal entry . There exists a density matrix attaining ; for every , every , and every density matrix on ,
there exists such that for every and every such ,
and if , then for every and every such . A density matrix means a positive semidefinite matrix with trace . The universal quantifiers include , where configuration spaces are singletons and empty tensor products have entry ; no positivity condition is imposed on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.