Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4, p. 16 — second term of Eq. (5): ‖|µ⊥_{k+1}⟩ − |µ⊥_k⟩‖ ≤ 2‖ω_{k+1}‖/cos ϕ_{k+1} ≤ 12β_{k+1}3^kϕ₀ for k < t − 1

Proved
QuantumWalkSearch.ApproxRAA.drift_second

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

amplitude-amplificationerror-analysisp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-algorithms

Under the hypotheses of Lemma 1 with 0<γ≤1/400<\gamma\le1/400<γ≤1/40, let ttt be the smallest non-negative integer with 3tϕ0∈[π/4,3π/4]3^t\phi_0\in[\pi/4,3\pi/4]3tϕ0​∈[π/4,3π/4], where ϕ0=sin⁡−1pM\phi_0=\sin^{-1}\sqrt{p_M}ϕ0​=sin−1pM​​. Let ∣ωk+1⟩=Ek+1⋅ref(M~⊥)∣φk⟩|\omega_{k+1}\rangle=E_{k+1}\cdot\mathrm{ref}(\tilde{\mathcal M}^\perp)|\varphi_k\rangle∣ωk+1​⟩=Ek+1​⋅ref(M~⊥)∣φk​⟩ be the error state of level k+1k+1k+1 and sin⁡ϕk+1=∥ΠM~∣φk+1⟩∥\sin\phi_{k+1}=\|\Pi_{\tilde M}|\varphi_{k+1}\rangle\|sinϕk+1​=∥ΠM~​∣φk+1​⟩∥. Then for every k<t−1k<t-1k<t−1

∥∣μk+1⊥⟩−∣μk⊥⟩∥≤2∥ωk+1∥cos⁡ϕk+1≤12 βk+1 3kϕ0.\big\||\mu^\perp_{k+1}\rangle-|\mu^\perp_k\rangle\big\|\le\frac{2\|\omega_{k+1}\|}{\cos\phi_{k+1}}\le12\,\beta_{k+1}\,3^k\phi_0 .​∣μk+1⊥​⟩−∣μk⊥​⟩​≤cosϕk+1​2∥ωk+1​∥​≤12βk+1​3kϕ0​.

This bounds the middle terms of the error recursion (5): the unmarked direction of the ideal states drifts by at most 12βk+1ϕˉk12\beta_{k+1}\bar\phi_k12βk+1​ϕˉ​k​ per level.

Preamble
import Mathlib
import Definitions.Def_QuantumWalkSearch_ApproxRAA_Setting
import Definitions.Def_QuantumWalkSearch_ApproxRAA_Circuit
import Definitions.Def_QuantumWalkSearch_ApproxRAA_Tolerant
Formal statement
namespace QuantumWalkSearch.ApproxRAA

/-- Second term of Eq. (5) (§4, p. 16, proof of Lemma 2). With `t` as in Lemma 1,
`0 < γ ≤ 1/40`, `ϕ₀ = sin⁻¹ √p_M` and the error state
`|ω_{k+1}⟩ = E_{k+1} · ref(M̃⊥) |φ_k⟩` (p. 13), for every `k < t − 1` (here `k : Fin T`):
`‖|µ⊥_{k+1}⟩ − |µ⊥_k⟩‖ ≤ 2‖ω_{k+1}‖ / cos ϕ_{k+1} ≤ 12 β_{k+1} 3^k ϕ₀`. -/
theorem drift_second {X : Type*} [Fintype X] [DecidableEq X] {κ : ℕ → Type*}
    [∀ i, Fintype (κ i)] [∀ i, DecidableEq (κ i)]
    (M : Finset X) (piState : EuclideanSpace ℂ (X × X)) (hπ : ‖piState‖ = 1)
    (z : ∀ i, κ i) (R : ∀ i, Matrix (X × X × κ i) (X × X × κ i) ℂ)
    (γ : ℝ) (hγ : 0 < γ) (hγ' : γ ≤ 1 / 40) (hR : ApproxReflections piState z R γ) (t : ℕ)
    (ht : IsFirstHit (Real.arcsin (Real.sqrt (markedWeight M piState))) t) (T : ℕ)
    (k : Fin T) (hkt : k.val + 1 < t) :
    ‖muPerp M z R piState T (k.val + 1) - muPerp M z R piState T k.val‖ ≤
        2 * ‖act (errOp M z R piState T k) (act (flipMarked M) (phi M z R piState T k.val))‖ /
          Real.cos (markedAngle M (phi M z R piState T (k.val + 1))) ∧
      2 * ‖act (errOp M z R piState T k) (act (flipMarked M) (phi M z R piState T k.val))‖ /
          Real.cos (markedAngle M (phi M z R piState T (k.val + 1))) ≤
        12 * beta γ (k.val + 1) *
          ((3 : ℝ) ^ k.val * Real.arcsin (Real.sqrt (markedWeight M piState))) := by sorry

end QuantumWalkSearch.ApproxRAA
Source
Magniez, Nayak, Roland, Santha, Search via Quantum Walk, arXiv:quant-ph/0608026v4, p. 16, §4, proof of Lemma 2 (second term of Eq. (5)); ω_{k+1} defined p. 13
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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