Fully quantum asymptotic equipartition property
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.fully_quantum_aepAll 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 every normalized finite-dimensional bipartite state and every fixed 0<ε<1, both (1/n)Hmin^ε(A^n|B^n) and (1/n)Hmax^ε(A^n|B^n) of ρ_AB^⊗n converge to H(A|B)_ρ.
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
seed, arXiv:1504.00233v5, PDF p.1,91,105,109,110,111. -/
theorem fully_quantum_aep [Nonempty A] [Nonempty B] (r : paperMat (A × B)) (hr : IsDensityMatrix r)
(e : ℝ) (he : 0 < e) (he1 : e < 1) :
Tendsto (minRate r e) atTop (nhds (conditionalVN r:EReal)) ∧
Tendsto (maxRate r e) atTop (nhds (conditionalVN r:EReal)) := 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 finite nonempty types with decidable equality, let be a complex matrix on with , and let . Write , define through spectral functional calculus, and let . On a bipartition , define , , , and , with extended-real extrema and with , otherwise. Define on , , and , where is applied through spectral functional calculus and the real logarithm is at . Then both sequences converge in the extended reals to the embedded real number :
At , the defining products are empty products equal to , and the real reciprocal is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.