Eq. (11) — final scalar error and success bound
ProvedQSPHamSim.Main.error_and_successhamiltonian-simulationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-signal-processingtrigonometric-polynomials
Suppose approximates to error at most and , pointwise in the angle. Then
When , the stronger intermediate bound also holds.
This combines the two approximation errors and supplies the paper's success-probability constant.
Formalization Note Squaring the lower modulus bound requires ; the stated bound remains valid without that restriction.
Preamble
import Mathlib import Definitions.Def_QSPHamSim_Main_Setting set_option autoImplicit false
Formal statement
namespace QSPHamSim.Main
theorem error_and_success (A₁ A₂ C₁ h : ℝ → ℝ) (ε : ℝ)
(hfirst : ∀ θ : ℝ,
‖((A₁ θ : ℂ) + (C₁ θ : ℂ) * Complex.I) -
Complex.exp ((h θ : ℂ) * Complex.I)‖ ≤ 2 * ε)
(hsecond : ∀ θ : ℝ, |A₂ θ - A₁ θ| ≤ 6 * ε) :
∀ θ : ℝ,
‖((A₂ θ : ℂ) + (C₁ θ : ℂ) * Complex.I) -
Complex.exp ((h θ : ℂ) * Complex.I)‖ ≤ 8 * ε ∧
1 - 16 * ε ≤ ‖((A₂ θ : ℂ) + (C₁ θ : ℂ) * Complex.I)‖ ^ 2 ∧
(8 * ε ≤ 1 →
(1 - 8 * ε) ^ 2 ≤
‖((A₂ θ : ℂ) + (C₁ θ : ℂ) * Complex.I)‖ ^ 2) := by sorry
end QSPHamSim.Main
Source
Low, Chuang, Optimal Hamiltonian Simulation by Quantum Signal Processing, arXiv:1606.02685v2, p. 4, Eq. (11)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.