Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 1: reduction of optimal approximation to Clifford double cosets

Open
QAlgorithms.Papers.Independent.Intakenext100.P82.approximation_double_cosets

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All circuits are single-qubit circuits without ancillas or measurements. Products act from right to left. Let H=i 2−1/2(111−1)H=i\,2^{-1/2}\begin{pmatrix}1&1\\1&-1\end{pmatrix}H=i2−1/2(11​1−1​), T=diag⁡(e−iπ/8,eiπ/8)T=\operatorname{diag}(e^{-i\pi/8},e^{i\pi/8})T=diag(e−iπ/8,eiπ/8), S=T2S=T^2S=T2, and C=⟨H,S⟩⊂PSU⁡(2)C=\langle H,S\rangle\subset\operatorname{PSU}(2)C=⟨H,S⟩⊂PSU(2). The two distinct syllable letters are a=THa=THa=TH and b=SHb=SHb=SH. A normalized word is empty, or ends in aaa with no adjacent bbb letters. A canonical word is normalized and its first four syllables, when present, are all aaa. Write τ(c)\tau(c)τ(c) for the number of aaa letters in ccc; Clifford gates have zero charged cost.

Let UUU be any single-qubit projective gate, ϵ>0\epsilon>0ϵ>0, and t∈Nt\in\mathbb Nt∈N. Put d(U,V)=2−∣tr⁡(UV†)∣/2d(U,V)=\sqrt{2-|\operatorname{tr}(UV^\dagger)|}/2d(U,V)=2−∣tr(UV†)∣​/2. Then

∃w: cost⁡T(w)<t, d([w],U)<ϵ⟺∃c canonical, g1,g2∈C: τ(c)<t, d([c],g1Ug2)<ϵ.\exists w:\ \operatorname{cost}_T(w)<t,\ d([w],U)<\epsilon \quad\Longleftrightarrow\quad \exists c\text{ canonical},\ g_1,g_2\in C:\ \tau(c)<t,\ d([c],g_1Ug_2)<\epsilon.∃w: costT​(w)<t, d([w],U)<ϵ⟺∃c canonical, g1​,g2​∈C: τ(c)<t, d([c],g1​Ug2​)<ϵ.

The left-hand word is a Clifford/T presentation, so it expresses the minimum charged non-Clifford cost convention of §IV. This reduces bounded-cost approximation to the Clifford double coset; both inequalities are strict.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P82
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P82

open scoped BigOperators

local notation "Mat" => Matrix Bool Bool ℂ

/-- Corollary 1, PDF p.3, §IV metric and charged cost pp.3--4.
Both distance and integer cost cutoffs are strict. -/
theorem approximation_double_cosets (U : Mat) (hU : U ∈ Matrix.unitaryGroup Bool ℂ)
    (epsilon : ℝ) (hepsilon : 0 < epsilon) (t : ℕ) :
    (∃ w : List CTLetter, chargedT w < t ∧ gateDistance (ctValue w) U < epsilon) ↔
    (∃ c : List Syllable, BsCanonical c ∧ bsTCount c < t ∧
      ∃ g1 g2 : Fin 24,
        gateDistance (syllableValue c) (cliffordMatrix g1 * U * cliffordMatrix g2) < epsilon) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P82

end
Source
A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits, arXiv:1206.3223v1, PDF p. 3, Corollary 1: reduction of optimal approximation to Clifford double cosets
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let H=12(111−1)H=\frac1{\sqrt2}\begin{pmatrix}1&1\\1&-1\end{pmatrix}H=2​1​(11​1−1​), S=diag⁡(1,i)S=\operatorname{diag}(1,i)S=diag(1,i), and T=diag⁡(1,eiπ/4)T=\operatorname{diag}(1,e^{i\pi/4})T=diag(1,eiπ/4). For g=0,…,23g=0,\ldots,23g=0,…,23, define CgC_gCg​, in that order, by the list

(I,H,HS2H,S2,S,S3,HS2,S2H,SH,S3H,S2HS2H,SHS2H,S3HS2H,HS,HS3,S2HS2,SHS2,S3HS2,HSH,HS3H,HSHS2H,HS3HS2H,S3HS,SHS3).\bigl( I,H,HS^2H,S^2,S,S^3,HS^2,S^2H,SH,S^3H, S^2HS^2H,SHS^2H,S^3HS^2H,HS,HS^3,S^2HS^2, SHS^2,S^3HS^2,HSH,HS^3H,HSHS^2H,HS^3HS^2H,S^3HS,SHS^3 \bigr).(I,H,HS2H,S2,S,S3,HS2,S2H,SH,S3H,S2HS2H,SHS2H,S3HS2H,HS,HS3,S2HS2,SHS2,S3HS2,HSH,HS3H,HSHS2H,HS3HS2H,S3HS,SHS3).

For complex 2×22\times22×2 matrices define

D(X,Y)=2−∣tr⁡(XY∗)∣2,D(X,Y)=\sqrt{\frac{2-|\operatorname{tr}(XY^*)|}{2}},D(X,Y)=22−∣tr(XY∗)∣​​,

where ∗^*∗ is conjugate transpose and the square root is the real square root, which is zero on negative inputs. For every unitary complex 2×22\times22×2 matrix UUU, every real ϵ>0\epsilon>0ϵ>0, and every natural number ttt, the following are equivalent: there exists a finite word whose letters are TTT or individually indexed matrices CgC_gCg​, containing strictly fewer than ttt letters of type TTT, whose product WWW satisfies D(W,U)<ϵD(W,U)<\epsilonD(W,U)<ϵ; and there exists a finite syllable list ccc with syllables a=THa=THa=TH and b=SHb=SHb=SH, which is empty or ends in aaa and has no consecutive bbb's, whose first min⁡(4,∣c∣)\min(4,|c|)min(4,∣c∣) syllables are all aaa, which contains strictly fewer than ttt occurrences of aaa, together with indices g1,g2∈{0,…,23}g_1,g_2\in\{0,\ldots,23\}g1​,g2​∈{0,…,23}, such that

D(V(c),Cg1UCg2)<ϵ.D\bigl(V(c),C_{g_1}UC_{g_2}\bigr)<\epsilon.D(V(c),Cg1​​UCg2​​)<ϵ.

Here all word products are taken in list order and an empty product is III. Letters CgC_gCg​ contribute zero to the count on the first side. Empty words and empty syllable lists are permitted; when t=0t=0t=0, both existential statements are false because a natural-number count cannot be strictly less than zero.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

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