Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.2, p. 3 — Λ(e^{iφ}) is approximated within √(2/4^k + 2√2/2^k) by O(k) H, T, CNOT gates with two |0⟩ ancillas

Proved
CliffordTApprox.Ancilla.phase_gate_approx

by mikedeng1 · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximationclifford-tgate-synthesisp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-circuits

There is an absolute constant A>0A>0A>0 such that for every k∈Nk\in\mathbb Nk∈N and every real φ\varphiφ there is a circuit CCC of gates from {H,T,CNOT}\{H, T, \mathrm{CNOT}\}{H,T,CNOT} on three wires (the data qubit, then two ancillas initialized to ∣0⟩|0\rangle∣0⟩) with

∥ ψ↦C(ψ⊗∣00⟩) − ψ↦(Λ(eiφ)ψ)⊗∣00⟩ ∥F≤24k+222kand#C≤A (k+1).\big\|\,\psi \mapsto C(\psi\otimes|00\rangle)\ -\ \psi\mapsto(\Lambda(e^{i\varphi})\psi)\otimes|00\rangle\,\big\|_F \le \sqrt{\frac{2}{4^k} + \frac{2\sqrt2}{2^k}} \quad\text{and}\quad \#C \le A\,(k+1).​ψ↦C(ψ⊗∣00⟩) − ψ↦(Λ(eiφ)ψ)⊗∣00⟩​F​≤4k2​+2k22​​​and#C≤A(k+1).

This is the paper's main result for the phase gate: precision O(1/20.5k)O(1/2^{0.5k})O(1/20.5k) with O(k)O(k)O(k) gates, i.e. O(log⁡(1/ε))O(\log(1/\varepsilon))O(log(1/ε)) gates for precision ε\varepsilonε.

Formalization Note. The error is the Frobenius norm of the difference of the two linear maps from one qubit to three qubits; it is sensitive to the global phase and charges any amplitude left on the ancillas. The constants 2/4k+22/2k\sqrt{2/4^k + 2\sqrt2/2^k}2/4k+22​/2k​ and A(k+1)A(k+1)A(k+1) pin the page's O(1/20.5k)O(1/2^{0.5k})O(1/20.5k) and O(k)O(k)O(k); AAA is quantified before kkk and φ\varphiφ. The statement holds for every real φ\varphiφ, not only 0≤φ≤π/40\le\varphi\le\pi/40≤φ≤π/4, through the reduction Λ(eiφ)=TmΛ(eiφ′)\Lambda(e^{i\varphi}) = T^m\Lambda(e^{i\varphi'})Λ(eiφ)=TmΛ(eiφ′).

Preamble
import Mathlib
import Definitions.Def_CliffordTApprox_Ancilla_Setting
Formal statement
namespace CliffordTApprox.Ancilla

open QAlgorithms
open QAlgorithms.Papers.Independent.Renew46.P12

/-- §2.2, p. 3: for every `k` and every `φ` there is an `{H, T, CNOT}` circuit on the data wire and
two `|0⟩` ancillas, of size `O(k)` with an absolute constant, whose initialized map is within
Frobenius distance `√(2/4^k + 2√2/2^k)` of `Λ(e^{iφ}) ⊗ |00⟩`. -/
theorem phase_gate_approx :
    ∃ A : ℝ, 0 < A ∧ ∀ (k : ℕ) (φ : ℝ), ∃ c : Circuit htcxGateSet (1 + 2),
      frobNorm (initializedMap c.unitary - idealMap (phaseGate φ) 2) ≤
        Real.sqrt (2 / 4 ^ k + 2 * Real.sqrt 2 / 2 ^ k) ∧
      (c.size : ℝ) ≤ A * ((k : ℝ) + 1) := by sorry

end CliffordTApprox.Ancilla
Source
Kliuchnikov, Maslov, Mosca, Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits, arXiv:1212.0822v2, pp. 2–3, §2 and §2.2
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 22, 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