Dimension-independent finite-block quantum AEP
ProvedQAlgorithms.Papers.Independent.Support50.P23.finiteBlockAepLet be a normalized finite-dimensional state, let be an integer, and put , where . For and , set . Then
For , the smooth min entropy is . The printed unrestricted real square-root formula requires this domain repair; no explicit small- error is supplied. The quantitative bound contains no dimension factor for .
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P23
noncomputable section
open Filter
open scoped ENNReal ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Support50.P23
attribute [local instance] Classical.propDecidable
-- Exact accepted bodies. Other similarly named catalogue entries use different
-- smoothing, conditioning order, logarithm base, or channel-level objects.
open QAlgorithms.Papers.Independent.Gap20.P03 (fixedMin)
open QAlgorithms.Papers.Independent.Dependency50.P36 (relativeEntropy)
open QAlgorithms.Papers.Independent.Information100.P67 (IsSubnormalized)
open QAlgorithms.Papers.Independent.Information100.P69 (matrixPower)
variable {A B C D I : Type*}
variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype I]
variable [DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq D] [DecidableEq I]
/-- Theorem 9, PDF p.6, (30). Domain correction: the displayed real square root is
used for 0<epsilon<1 above the 8/5 threshold; epsilon>=1 is the trivial +infinity
branch. The printed formula is not real for epsilon>sqrt(2). No small-n error is invented. -/
theorem finiteBlockAep [Nonempty A] [Nonempty B]
(rho : Matrix (A × B) (A × B) ℂ) (hrho : IsDensityMatrix rho)
(epsilon : ℝ) (hepsilon : 0 < epsilon) (n : ℕ) (hn : 0 < n) :
((epsilon < 1 ∧ (8 / 5 : ℝ) * Real.logb 2 (2 / epsilon ^ 2) ≤ (n : ℝ)) →
((conditionalEntropyBitsAB rho -
aepBlockError epsilon (entropyConvergenceParameter rho (traceLeft rho)) / Real.sqrt (n : ℝ) : ℝ) : EReal) ≤
(((n : ℝ)⁻¹ : ℝ) : EReal) * sineSmoothMin (jointPower rho n) epsilon) ∧
(1 ≤ epsilon → sineSmoothMin (jointPower rho n) epsilon = ⊤) := by sorry
end QAlgorithms.Papers.Independent.Support50.P23
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite, nonempty index types with decidable equality, let on be positive semidefinite with trace one, let be real, and let be a positive natural number. Put , , , and . For , define if and , and otherwise define , where , otherwise, , and otherwise; matrix functions use continuous functional calculus. Set , where , , and for finite , and put , where if and otherwise is its real value. Let . For any bipartite , define as the extended-real supremum over density matrices on its second factor of , and define as the supremum of over with and , where . The assertion is the conjunction
Real quantities in these inequalities are embedded in the extended reals. No finiteness hypothesis on is stated; the error formula uses the total conventions , , and for .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.