Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 5 (and p. 11) — basic ε₀-approximations of bounded length l₀

Proved
SKAlgorithm.Qudit.base_case

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-compilingsolovay-kitaevuniversality

Let G\mathcal GG be an instruction set for SU(d)SU(d)SU(d) and let ϵ0>0\epsilon_0 > 0ϵ0​>0. Then there is a length l0∈Nl_0 \in \mathbb Nl0​∈N such that every gate U∈SU(d)U \in SU(d)U∈SU(d) has an ϵ0\epsilon_0ϵ0​-approximation by a sequence of gates from G\mathcal GG of length at most l0l_0l0​:

∀U∈SU(d) ∃S⊆G∗,∣S∣≤l0  and  d(U,S)<ϵ0.\forall U \in SU(d)\ \exists S \subseteq \mathcal G^{*},\quad |S| \le l_0 \ \text{ and } \ d(U, S) < \epsilon_0 .∀U∈SU(d) ∃S⊆G∗,∣S∣≤l0​  and  d(U,S)<ϵ0​.

This is the preprocessing stage of the Solovay-Kitaev algorithm ("Return Basic Approximation to UUU"): the paper obtains it by enumerating all instruction sequences up to a sufficiently large but fixed length l0l_0l0​. It supplies the depth-zero case of the recursion with a length independent of UUU.

Formalization Note. The bound l0l_0l0​ is chosen before UUU; it depends only on G\mathcal GG and ϵ0\epsilon_0ϵ0​. No compactness hypothesis is added; compactness of SU(d)SU(d)SU(d) is a fact to be proved, not assumed.

Preamble
import Mathlib
import Definitions.Def_SKAlgorithm_Qudit_Model

open scoped Matrix
open QAlgorithms
Formal statement
namespace SKAlgorithm.Qudit

theorem base_case {d : ℕ} (G : Finset (SU d)) (hG : IsInstructionSet G)
    (ε₀ : ℝ) (hε₀ : 0 < ε₀) :
    ∃ l₀ : ℕ, ∀ U : SU d, ∃ S : List (SU d), (∀ g ∈ S, g ∈ G) ∧ S.length ≤ l₀ ∧
      opDist U (seqUnitary S) < ε₀ := by sorry

end SKAlgorithm.Qudit
Source
Dawson and Nielsen, The Solovay-Kitaev algorithm, arXiv:quant-ph/0505030v2, p. 5, §3, base case 'In order to implement this step …'; p. 11, §5.1, 'This is done by enumerating all possible gate sequences up to some sufficient length'
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

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