Attained quantum variational exponent dominates the Petz bound
OpenQAlgorithms.Papers.Independent.Gap48.P41.quantum_variational_comparisonLet be a nonempty finite orthonormal basis, and let be positive semidefinite complex matrices of trace one with . For a positive integer , an arbitrary effect accepts the null state . Write and . All logarithms are natural, with in rates. Write , using support-restricted spectral logarithms inside the trace.
Put and . Spectral powers vanish on the kernel, including at zero and negative orders.
For a finite real , define and . The variational infimum over all density matrices is attained, and
The constraint makes the subtracted divergence finite, while may be infinite. This is the explicit comparison (22), with no claim of achievability or optimality of the quantum bound.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P41
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P41
open scoped Matrix ComplexOrder BigOperators
open Filter QAlgorithms
open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
open QAlgorithms.Papers.Independent.Information100.P07 (positiveProjection)
open QAlgorithms.Papers.Independent.Dependency50.P28
(tr SupportLE relativeEntropy scalarPower classicalD typeI accept TestSequence
scaled logNonnegativeExtended)
open QAlgorithms.Papers.Independent.Claimed50.P15 (legendre)
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I : Type} [Fintype I] [DecidableEq I]
variable {X : Type} [Fintype X]
/-- PDF p.8, (22): the attained quantum variational minimum dominates the
paper's bound. No log-Euclidean moment or unbounded maximum is assumed, and no
trial density is excluded for having infinite divergence to rho. -/
theorem quantum_variational_comparison [Nonempty I]
(rho sigma : Mat I) (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
(hsupp : SupportLE rho sigma) (r : ℝ) (hr : relativeEntropy rho sigma < (r : EReal)) :
IsLeast (quantumValues rho sigma r) (quantumMinimum rho sigma r) ∧
(petzPhi rho sigma (crossing rho sigma r) : EReal) ≤ quantumMinimum rho sigma r := by sorry
end QAlgorithms.Papers.Independent.Gap48.P41
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite, nonempty index set with decidable equality, and let be complex matrices indexed by , both positive semidefinite with trace . Suppose . For density matrices , define
where matrix logarithms use spectral functional calculus with the real natural logarithm, whose value at zero is . Let satisfy , and define and , using extended-real arithmetic. For positive semidefinite , let apply at nonzero eigenvalues and send zero eigenvalues to , including for zero and negative exponents. Set , , and . Then belongs to and is its least element, and
where the real supremum on the left is embedded in the extended reals. Singular density matrices are included; the kernel conditions specify exactly when the displayed relative entropies take the value .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.