Optimization QNTK: nonnegativity and commutator identity
OpenQAlgorithms.Papers.Independent.Intakenext100.P88.optimization_kernel_identityThe circuit acts on a nonzero finite-dimensional complex Hilbert space and has the ordered form , with fixed unitary , Hermitian , and real angles. Products are written in increasing index order and the rightmost factor acts first. Feature vectors have norm one. For Hermitian observables , put .
In the scalar optimization problem, the state is a fixed normalized , the observable is , and its known minimum eigenvalue is . Put . Let , , , and . With , one has
This identifies the scalar optimization kernel as a nonnegative Gram quantity.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P88
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P88
open scoped BigOperators ComplexConjugate Topology NNReal ComplexOrder
open MeasureTheory ProbabilityTheory Filter
/-- PDF p.3 Eq.(5), SM pp.19-20 Eqs.(58)-(59): K is nonnegative and is minus the
sum of squared imaginary commutator expectations. The printed main Eq.(5) omits the sum
in its second display; the derivative definition and multioutput Eq.(29) specify it. -/
theorem optimization_kernel_identity {h L : ℕ} (M : OptimizationModel h L)
(theta : Fin L → ℝ) :
0 ≤ expectationKernel M.model theta ((), ()) ((), ()) ∧
(∀ l, (thetaCoefficient M.model theta ((), ()) l).re = 0 ∧
(coordinateDerivative (fun u => expectationOutput M.model u ((), ()) - M.minimum) theta l : ℂ) =
-Complex.I * thetaCoefficient M.model theta ((), ()) l) ∧
(expectationKernel M.model theta ((), ()) ((), ()) : ℂ) =
-∑ l, thetaCoefficient M.model theta ((), ()) l ^ 2 := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P88
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all natural numbers , every optimization model , and every real parameter vector , the following conjunction holds. Such a model supplies , unitary matrices , Hermitian matrices , a unit vector , a Hermitian matrix , and a real number satisfying both the existence of a unit vector with and the inequality for every unit vector . Define
For each , let be the increasing-order product of the with , let be the increasing-order product with , and set
Here is conjugate transpose, matrix action and the inner product are standard, and every empty product is the identity. Write
where the update replaces coordinate and leaves all others unchanged. The conclusions are exactly
and
The derivative on the left of the second equation and in the last equation are included from into ; the last sum uses ordinary complex squares. Derivatives are the total real one-variable derivative operation, returning zero when differentiability fails. No restriction is placed on . When , both sums are zero and the coordinatewise conclusion has no instances; cannot admit the required model.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.