Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1, p. 4 — Solovay-Kitaev: every gate in SU(d) has an ε-approximating instruction sequence of length O(log^{ln 5/ln(3/2)}(1/ε))

Proved
SKAlgorithm.Qudit.theorem_1

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

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

Theorem (Solovay-Kitaev). Let G\mathcal GG be an instruction set for SU(d)SU(d)SU(d). There is a constant C>0C > 0C>0 such that for every accuracy ϵ>0\epsilon > 0ϵ>0 and every gate U∈SU(d)U \in SU(d)U∈SU(d) there is a finite sequence SSS of gates from G\mathcal GG with

∣S∣≤C ln⁡ ⁣(2+1ϵ)ln⁡5/ln⁡(3/2)andd(U,S)<ϵ.|S| \le C \, \ln\!\left(2 + \frac1\epsilon\right)^{\ln 5/\ln(3/2)} \qquad \text{and} \qquad d(U, S) < \epsilon .∣S∣≤Cln(2+ϵ1​)ln5/ln(3/2)andd(U,S)<ϵ.

Here d(U,S)=∥U−S∥d(U, S) = \|U - S\|d(U,S)=∥U−S∥ is the operator-norm distance between UUU and the product of the gates of SSS, and ln⁡5/ln⁡(3/2)≈3.97\ln 5/\ln(3/2) \approx 3.97ln5/ln(3/2)≈3.97. Theorem 1 asserts length O(log⁡c(1/ϵ))O(\log^c(1/\epsilon))O(logc(1/ϵ)) for some constant ccc; the Solovay-Kitaev algorithm described in the paper gives c=ln⁡5/ln⁡(3/2)c = \ln 5/\ln(3/2)c=ln5/ln(3/2) (Eq. (8), and §5.1 for qudits), and that is the exponent stated here. The theorem says that any universal instruction set simulates any other with only polylogarithmic overhead in the accuracy.

Formalization Note. The constant CCC depends only on ddd and G\mathcal GG and is chosen before ϵ\epsilonϵ and UUU; this order is the content of the O(⋅)O(\cdot)O(⋅). log⁡(1/ϵ)\log(1/\epsilon)log(1/ϵ) is replaced by ln⁡(2+1/ϵ)\ln(2 + 1/\epsilon)ln(2+1/ϵ) so that the bound is positive for every ϵ>0\epsilon > 0ϵ>0; as ϵ→0\epsilon \to 0ϵ→0 the two are asymptotically equivalent, so the class O(log⁡3.97(1/ϵ))O(\log^{3.97}(1/\epsilon))O(log3.97(1/ϵ)) is unchanged. Instruction sets are as in Definition 1: finite, closed under †\dagger†, universal.

Preamble
import Mathlib
import Definitions.Def_SKAlgorithm_Qudit_Model

open scoped Matrix
open QAlgorithms
Formal statement
namespace SKAlgorithm.Qudit

theorem theorem_1 (d : ℕ) (G : Finset (SU d)) (hG : IsInstructionSet G) :
    ∃ C : ℝ, 0 < C ∧ ∀ ε : ℝ, 0 < ε → ∀ U : SU d,
      ∃ S : List (SU d), (∀ g ∈ S, g ∈ G) ∧
        (S.length : ℝ) ≤ C * Real.log (2 + 1 / ε) ^ (Real.log 5 / Real.log (3 / 2)) ∧
        opDist U (seqUnitary S) < ε := by sorry

end SKAlgorithm.Qudit
Source
Dawson and Nielsen, The Solovay-Kitaev algorithm, arXiv:quant-ph/0505030v2, p. 4, Theorem 1; exponent from p. 7, Eq. (8), and p. 11, §5.1
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