6.6
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.max_albertiAll 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 .
exp(Hmax(A|B)ρ)=inf{Y_AB>0} Tr(ρ_AB Y_AB^{-1}) ||Tr_A Y_AB||∞. The inverse is the actual inverse on this positive definite domain; an infimum, not necessarily attained.
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.6
6.6, arXiv:1504.00233v5, PDF p.95. -/
theorem max_alberti [Nonempty A] [Nonempty B] (r : paperMat (A × B)) (hr : paperSubnormalized r) :
expE (hmax r) = sInf {v : ENNReal | ∃ Y : paperMat (A × B), Y.PosDef ∧
v = ENNReal.ofReal ((r*Y⁻¹).trace.re*‖traceLeft Y‖)} := 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 index types with decidable equality, and let be a complex matrix on with . Define
where square roots use continuous functional calculus and when , while otherwise , embedded in the extended reals. Let for finite , with and . Then
in the extended nonnegative reals. The infimum ranges over positive definite complex matrices on , , and the matrix norm here is the maximum absolute entry norm. The zero matrix is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.