Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§1, p.4: every one- or two-qubit gate is a product of a constant number of CNOT, HHH and R(θ)R(\theta)R(θ) gates

Proved
ConstOverheadCompile.Main.decomposition_cnot_h_rotation

by mikedeng1 · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

gate-synthesisp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-computing

There is a constant NNN with the following property. Let k∈{1,2}k\in\{1,2\}k∈{1,2} and let UUU be any unitary on kkk qubits. Then there is a circuit ccc on the same kkk wires, each of whose gates is a CNOT, a Hadamard HHH, or a Z-rotation R(θ)R(\theta)R(θ) with θ∈(0,2π)\theta\in(0,2\pi)θ∈(0,2π), such that

∣c∣≤NandU=Uc,|c|\le N\qquad\text{and}\qquad U=U_{c},∣c∣≤NandU=Uc​,

where UcU_cUc​ is the unitary implemented by ccc. The equality is exact, with no global phase.

This is the reduction with which the proofs of Theorem 7 and Theorem 1 begin: the input circuit may be assumed to consist of CNOT, HHH and Z-rotations at a constant-factor cost.

Differences from the source:

  • encoding: "a constant number of such gates" → one natural number NNN quantified before kkk and UUU; reason: this is the meaning of "constant".
  • encoding: "any one- or two-qubit gate" → any unitary matrix on one or on two qubits, decomposed on the same wires; reason: no ancillas are mentioned, and on one wire CNOT cannot be placed.
Preamble
import Mathlib
import Definitions.Def_ConstOverheadCompile_Main_GateSets
Formal statement
namespace ConstOverheadCompile.Main

open QAlgorithms

/-- §1, p.4: there is one constant `N` such that every unitary on one or on two qubits equals,
exactly (no global phase), the unitary of a circuit on the same wires with at most `N` gates,
each a CNOT, an `H` or a rotation `R(θ)` with `θ ∈ (0, 2π)`. -/
theorem decomposition_cnot_h_rotation :
    ∃ N : ℕ, ∀ k : ℕ, (k = 1 ∨ k = 2) →
      ∀ U : Matrix (Qubits k) (Qubits k) ℂ, U ∈ Matrix.unitaryGroup (Qubits k) ℂ →
        ∃ c : Circuit HCnotRotGates k, c.size ≤ N ∧ c.unitary = U := by sorry

end ConstOverheadCompile.Main
Source
Chenyi Zhang, Xinyu Tan, Robin Kothari, David Gosset, Craig Gidney, Quantum circuit compilation with constant overhead, STOC 2027 submission #397 (October 2026), source.pdf SHA-256 b848604016de1821f5f693c59f328e0b2a9e535bca0b37bb664e6f40dbe3681f, p.4, §1 "Proof overview of Theorem 1" (decomposition claim); also p.10, §4
Human review
  • Endorsed by Shuze Chen · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 11, 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