Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Single-qubit gates and CNOT are universal

Proved
SuperconductingQC.closure_singleQubit_CNOT_eq_top

by Lucas · Oct 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

quantum-computingquantum-gates

Let n≥1n\ge1n≥1. The subgroup of U(2n)U(2^n)U(2n) generated by all single-qubit gates U(k)U^{(k)}U(k) (U∈U(2)U\in U(2)U∈U(2), kkk a qubit) together with all CNOT gates CNOT(i,j)\mathrm{CNOT}^{(i,j)}CNOT(i,j) on ordered pairs of distinct qubits is the whole unitary group:

⟨ Sn∪Gn(CNOT) ⟩=U(2n).\big\langle\,\mathcal S_n\cup\mathcal G_n(\mathrm{CNOT})\,\big\rangle=U(2^n).⟨Sn​∪Gn​(CNOT)⟩=U(2n).

Every nnn-qubit unitary is therefore an exact finite product of single-qubit gates and CNOTs; this is the classical universality theorem of the gate model, here used as the stepping stone to the iSWAP version.

Formalization Note For n=1n=1n=1 there are no qubit pairs and the statement reduces to U(2)U(2)U(2) being generated by single-qubit gates; n=0n=0n=0 is excluded because then no generators exist while U(1)U(1)U(1) is nontrivial.

Preamble
import Mathlib
import Definitions.Def_SuperconductingQC_Gates

open scoped Matrix Kronecker
Formal statement
namespace SuperconductingQC

theorem closure_singleQubit_CNOT_eq_top (n : ℕ) (hn : 1 ≤ n) :
    Subgroup.closure (singleQubitGates n ∪ twoQubitGateInstances n CNOT) = ⊤ := by
  sorry

end SuperconductingQC
Source
Barenco et al., Elementary gates for quantum computation, Phys. Rev. A 52, 3457 (1995), https://doi.org/10.1103/PhysRevA.52.3457; Nielsen & Chuang §4.5.2; source claim: Wikipedia, "Superconducting quantum computing" (PDF snapshot supplied by the mission author, retrieved 2026-10-13), section 'Criteria for a viable quantum processor'
Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 13, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me