Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3: linear symbolic normalization cost

Open
QAlgorithms.Papers.Independent.Intakenext100.P82.linear_symbolic_normalization

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.

For the effective normalization problem there are one fixed symbolic program AAA and a constant K>0K>0K>0, chosen before every input gate list www, that return h,c,gh,c,gh,c,g with ccc normalized, g∈Cg\in Cg∈C, and

[w]=Hh[c]g,cost⁡A(w)≤K(∣w∣+1).[w]=H^h[c]g,\qquad \operatorname{cost}_A(w)\le K(|w|+1).[w]=Hh[c]g,costA​(w)≤K(∣w∣+1).

The execution consists only of constant-size finite table tests and stack operations; setup and the complete retained output are charged. This expresses the linear symbolic cost of Appendix C, including the empty input.

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 ℂ

/-- Proposition 3, PDF p.3 and Appendix C, p.8.
Runtime includes actual execution, input scan and the retained output. -/
theorem linear_symbolic_normalization :
    ∃ p : Program, ∃ K : ℕ, 0 < K ∧ LinearNormalizes p K := 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, Proposition 3: linear symbolic normalization cost
Read-back

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

There exist a finite program ppp and a positive natural number KKK such that the following holds for every finite word www in h,th,th,t, including the empty word. Set 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), and let W(w)W(w)W(w) multiply H,TH,TH,T in the order prescribed by www, using III for the empty word. A syllable th\mathrm{th}th represents THTHTH, a syllable sh\mathrm{sh}sh represents SHSHSH, and V(b)V(b)V(b) is their list-order product, with V([])=IV([])=IV([])=I. Define

(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).

There exist ϵ∈{0,1}\epsilon\in\{0,1\}ϵ∈{0,1}, a syllable list bbb that is empty or ends in th\mathrm{th}th and has no two consecutive sh\mathrm{sh}sh syllables, an index g∈{0,…,23}g\in\{0,\ldots,23\}g∈{0,…,23}, a natural cost ccc, and a complex scalar zzz with ∣z∣=1|z|=1∣z∣=1, such that

HϵV(b)Cg=z W(w),c≤K(∣w∣+1).H^\epsilon V(b)C_g=z\,W(w),\qquad c\le K(|w|+1).HϵV(b)Cg​=zW(w),c≤K(∣w∣+1).

The program executes from xxx, obtained from www by encoding h,th,th,t as 0,10,10,1, to y=[29+ϵ]∥s(b)∥[5+g]y=[29+\epsilon]\mathbin{\Vert}s(b)\mathbin{\Vert}[5+g]y=[29+ϵ]∥s(b)∥[5+g], where sss encodes th,sh\mathrm{th},\mathrm{sh}th,sh as 3,43,43,4. The program is an ordered finite list of instructions for four stacks over {0,…,31}\{0,\ldots,31\}{0,…,31}, each specifying a natural state, the exact four heads, four keep, pop, or single-symbol push actions, and a next natural state or halt. Popping an empty stack leaves it empty. Starting in state 000 with xxx on stack 000 and all other stacks empty, execution applies the first matching instruction and updates the stacks simultaneously; if none matches, it halts with unchanged stacks, and halted configurations remain fixed. There must be a natural number rrr of steps after which the machine is halted with stack 000 exactly yyy, without constraints on the other stacks, and the cost is

c=∣x∣+∣y∣+1+20(∣p∣+1)r.c=|x|+|y|+1+20(|p|+1)r.c=∣x∣+∣y∣+1+20(∣p∣+1)r.
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