Finite frozen scalar optimization solution
ProvedQAlgorithms.Papers.Independent.Intakenext100.P88.frozen_optimization_finiteThe 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 .
Absorb the reference angles into the fixed gates and set , where . Write and for derivatives of the actual circuit. The frozen kernel is .
For scalar optimization, let be the known minimum eigenvalue of and let be the initial frozen residual at rescaled angles . Under the frozen recurrence , with , one has
The identity permits , when the residual stays constant. It is the independently displayed finite solution, without the invalid unconditional convergence assertion of the full printed Theorem 1.
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.(10), SM p.21 Eq.(69): finite frozen scalar solution.
This independent displayed identity does not include Theorem 1's invalid unconditional
zero-limit assertion. K=0 and L=0 are allowed and give constant residuals. -/
theorem frozen_optimization_finite {h L : ℕ} (M : OptimizationModel h L)
(delta eta : ℝ) (hdelta : 0 < delta) (heta : 0 < eta)
(v : Fin L → ℝ) (t : ℕ) :
let K := frozenKernel M.model delta ((), ()) ((), ())
let e := linearOutput M.model delta v ((), ()) - M.minimum
frozenResidual (fun _ _ : Unit => K) eta (WithLp.toLp 2 (fun _ : Unit => e)) t () =
(1 - eta * K) ^ t * e := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P88
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be natural numbers and let consist of , unitary matrices , Hermitian matrices , a unit vector , a Hermitian observable , and a real number . Assume that some unit vector satisfies , and that for every unit vector . Define , where in increasing index order. For arbitrary , , and , let , , and , where denotes the -th coordinate vector. On the one-point index set, start with the vector having sole coordinate , and repeatedly multiply by the matrix whose sole entry is . The sole coordinate after steps is exactly . The statement includes , with the zeroth power equal to , and , when and the parameter sums are empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.