Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered §IV: distance controls absolute trace

Open
QAlgorithms.Papers.Independent.Intakenext100.P82.distance_controls_absolute_trace

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 any single-qubit unitary representatives U,VU,VU,V and any ϵ>0\epsilon>0ϵ>0, with the source distance d(U,V)=2−∣tr⁡(UV†)∣/2d(U,V)=\sqrt{2-|\operatorname{tr}(UV^\dagger)|}/2d(U,V)=2−∣tr(UV†)∣​/2,

d(U,V)<ϵ⟹∣∣tr⁡U∣−∣tr⁡V∣∣<4ϵ.d(U,V)<\epsilon\quad\Longrightarrow\quad\bigl||\operatorname{tr}U|-|\operatorname{tr}V|\bigr|<4\epsilon.d(U,V)<ϵ⟹​∣trU∣−∣trV∣​<4ϵ.

Absolute traces are invariant under the choice of global phase. This implication justifies absolute trace as a primary proximity-search key.

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 §IV, PDF p.4; denominator 2 lies outside the square root. -/
theorem distance_controls_absolute_trace (U V : Mat)
    (hU : U ∈ Matrix.unitaryGroup Bool ℂ) (hV : V ∈ Matrix.unitaryGroup Bool ℂ)
    (epsilon : ℝ) (hepsilon : 0 < epsilon) (hclose : gateDistance U V < epsilon) :
    |‖Matrix.trace U‖ - ‖Matrix.trace V‖| < 4 * 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. 4, Unnumbered §IV: distance controls absolute trace
Read-back

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

For every pair of unitary complex 2×22\times22×2 matrices U,VU,VU,V and every real number ϵ>0\epsilon>0ϵ>0, if

2−∣tr⁡(UV∗)∣2<ϵ,\sqrt{\frac{2-|\operatorname{tr}(UV^*)|}{2}}<\epsilon,22−∣tr(UV∗)∣​​<ϵ,

where ∗^*∗ is conjugate transpose and the square root is the real square root, then

∣ ∣tr⁡(U)∣−∣tr⁡(V)∣ ∣<4ϵ.\left|\,|\operatorname{tr}(U)|-|\operatorname{tr}(V)|\,\right|<4\epsilon.∣∣tr(U)∣−∣tr(V)∣∣<4ϵ.

The inner absolute values are complex moduli and the outer absolute value is the absolute value of a real number.

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