Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered §II: projective Clifford subgroup structure

Open
QAlgorithms.Papers.Independent.Intakenext100.P82.projective_clifford_structure

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.

The projective Clifford subgroup generated by HHH and SSS satisfies

∣C∣=24,C≅S4.|C|=24,\qquad C\cong\mathfrak S_4.∣C∣=24,C≅S4​.

Here S4\mathfrak S_4S4​ is the symmetric group on four letters, equivalently the classical Coxeter group of type A3A_3A3​. This identifies the finite Clifford subgroup used for every terminal and lookup.

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 ℂ

/-- Unnumbered §II, PDF p.2. S4 means permutations of four letters
(order 24), equivalently the classical Coxeter group of type A3. -/
theorem projective_clifford_structure :
    Nat.card cliffordSubgroup = 24 ∧
      Nonempty (cliffordSubgroup ≃* Equiv.Perm (Fin 4)) := 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. 2, Unnumbered §II: projective Clifford subgroup structure
Read-back

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

Let GGG be the group of invertible complex 2×22\times22×2 matrices modulo its center. Let H=12(111−1)H=\frac1{\sqrt2}\begin{pmatrix}1&1\\1&-1\end{pmatrix}H=2​1​(11​1−1​) and S=diag⁡(1,i)S=\operatorname{diag}(1,i)S=diag(1,i), regarded as invertible matrices with respective inverses HHH and S3S^3S3, and let CCC be the smallest subgroup of GGG containing their quotient classes. Then the cardinality of the underlying type of CCC is 242424, and there exists a group isomorphism from CCC to the group of all permutations of the four-element set {0,1,2,3}\{0,1,2,3\}{0,1,2,3}.

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