Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1: uniqueness of the canonical core under two-sided Clifford equivalence (seed result)

Open
QAlgorithms.Papers.Independent.Intakenext100.P82.canonical_core_unique

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 c1,c2c_1,c_2c1​,c2​ be canonical syllable words. If there are g1,g2∈Cg_1,g_2\in Cg1​,g2​∈C with [c2]=g1[c1]g2[c_2]=g_1[c_1]g_2[c2​]=g1​[c1​]g2​ as projective gates, then

c1=c2c_1=c_2c1​=c2​

as words in the two-letter alphabet. This gives a unique canonical core for each Clifford double coset. It makes no uniqueness assertion about the surrounding Clifford gates.

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 ℂ

/-- Theorem 1, PDF p.3, grammar p.2, proof pp.9--10.
Only the canonical syllable cores are syntactically equal. -/
theorem canonical_core_unique (c1 c2 : List Syllable)
    (h1 : BsCanonical c1) (h2 : BsCanonical c2)
    (heq : ∃ g1 g2 : Fin 24,
      SameGate (syllableValue c2) (cliffordMatrix g1 * syllableValue c1 * cliffordMatrix g2)) :
    c1 = c2 := 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, Theorem 1: uniqueness of the canonical core under two-sided Clifford equivalence (seed result)
Read-back

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

Let c1,c2c_1,c_2c1​,c2​ be any finite lists of syllables th,sh\mathrm{th},\mathrm{sh}th,sh, where these syllables represent TH,SHTH,SHTH,SH, respectively, for

H=12(111−1),S=diag⁡(1,i),T=diag⁡(1,eiπ/4).H=\frac1{\sqrt2}\begin{pmatrix}1&1\\1&-1\end{pmatrix}, \qquad S=\operatorname{diag}(1,i), \qquad T=\operatorname{diag}(1,e^{i\pi/4}).H=2​1​(11​1−1​),S=diag(1,i),T=diag(1,eiπ/4).

Let V(c)V(c)V(c) multiply the syllable matrices in list order, with empty product III. Suppose each cjc_jcj​ is empty or ends in th\mathrm{th}th and has no adjacent sh\mathrm{sh}sh syllables, and suppose every one of its first min⁡(4,∣cj∣)\min(4,|c_j|)min(4,∣cj​∣) syllables is th\mathrm{th}th. Define CgC_gCg​, for g=0,…,23g=0,\ldots,23g=0,…,23, by

(C0,…,C23)=(I,H,HS2H,S2,S,S3,HS2,S2H,SH,S3H,S2HS2H,SHS2H,S3HS2H,HS,HS3,S2HS2,SHS2,S3HS2,HSH,HS3H,HSHS2H,HS3HS2H,S3HS,SHS3).(C_0,\ldots,C_{23})= (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).(C0​,…,C23​)=(I,H,HS2H,S2,S,S3,HS2,S2H,SH,S3H,S2HS2H,SHS2H,S3HS2H,HS,HS3,S2HS2,SHS2,S3HS2,HSH,HS3H,HSHS2H,HS3HS2H,S3HS,SHS3).

If there exist indices g1,g2∈{0,…,23}g_1,g_2\in\{0,\ldots,23\}g1​,g2​∈{0,…,23} and a complex number zzz with ∣z∣=1|z|=1∣z∣=1 such that

V(c2)=z Cg1V(c1)Cg2,V(c_2)=z\,C_{g_1}V(c_1)C_{g_2},V(c2​)=zCg1​​V(c1​)Cg2​​,

then c1=c2c_1=c_2c1​=c2​ as lists, including equality of their lengths and every syllable. The hypotheses allow either list to be empty; for a list shorter than four, they require every syllable to be th\mathrm{th}th.

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