Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (11) — final scalar error and success bound

Proved
QSPHamSim.Main.error_and_success

by mikedeng1 · Oct 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

hamiltonian-simulationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-signal-processingtrigonometric-polynomials

Suppose A1+iC1A_1+iC_1A1​+iC1​ approximates eihe^{ih}eih to error at most 2ε2\varepsilon2ε and ∣A2−A1∣≤6ε|A_2-A_1|\le6\varepsilon∣A2​−A1​∣≤6ε, pointwise in the angle. Then

∣A2+iC1−eih∣≤8ε,∣A2+iC1∣2≥1−16ε.|A_2+iC_1-e^{ih}|\le8\varepsilon,\qquad |A_2+iC_1|^2\ge1-16\varepsilon.∣A2​+iC1​−eih∣≤8ε,∣A2​+iC1​∣2≥1−16ε.

When 8ε≤18\varepsilon\le18ε≤1, the stronger intermediate bound ∣A2+iC1∣2≥(1−8ε)2|A_2+iC_1|^2\ge(1-8\varepsilon)^2∣A2​+iC1​∣2≥(1−8ε)2 also holds.

This combines the two approximation errors and supplies the paper's success-probability constant.

Formalization Note Squaring the lower modulus bound requires 8ε≤18\varepsilon\le18ε≤1; the stated 1−16ε1-16\varepsilon1−16ε 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
  • Endorsed by Shuze Chen · Oct 16, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 16, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me