§6.2.2 (6.37): smooth min-entropy SDP
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.smooth_min_sdpAll quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Here is squared algebraic fidelity, is squared generalized fidelity, is purified distance, and . The symbols and denote conditional min- and max-entropy, with values and at zero. Smoothing optimizes over all subnormalized states in the purified-distance ball; every entropy radius satisfies .
For normalized center ρ_AB and an actual purification ρ_ABC, exp(−Hmin^ε) is the minimum Trσ_B over σ_B≥0, positive tildeρ_ABC of trace≤1, I_A⊗σ_B≥Tr_C tildeρ, and Tr(tildeρ_ABC ρ_ABC)≥1−ε².
This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
noncomputable section
open Filter
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P07
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J A B C D X Y Z : Type*}
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]
variable [Fintype Z] [DecidableEq Z]
/-- NODE paper:1504.00233#6.smoothsdp
Equation (6.37), PDF pp.98-99. Printed: F_* squared again in the prose.
Changed: F_* >= 1-e^2. Why: F_* already denotes squared fidelity and the SDP uses overlap 1-e^2. -/
theorem smooth_min_sdp [Nonempty A] [Nonempty B] [Nonempty C] (r : paperMat ((A × B) × C))
(hr : IsDensityMatrix r) (hp : paperPure r) (e : ℝ) (he : Radius r e) :
∃ t : paperMat ((A × B) × C), ∃ s : paperMat B, SmoothPrimal r e t s ∧
ENNReal.ofReal s.trace.re = expE (-paperSmoothMin (traceRight r) e) ∧
∀ t' s', SmoothPrimal r e t' s' → s.trace.re ≤ s'.trace.re := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be nonempty finite types with decidable equality. Let be a positive semidefinite complex matrix on , with and rank , and let satisfy . Write , where . For matrices on , put
using real functional calculus for matrix square roots. Define , , and , with these suprema taken in the extended reals and meaning . There exist matrices on and on such that
and , where viewed in , and , , for finite . Moreover, every pair satisfying the same five displayed constraints obeys . No trace upper bound is imposed on or .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.