Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Every unitary is a product of two-level unitaries

Proved
SuperconductingQC.closure_twoLevelUnitaries_eq_top

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

quantum-computingquantum-gates

Let ι\iotaι be a finite index set and U(Cι)U(\mathbb C^\iota)U(Cι) the group of unitary ι×ι\iota\times\iotaι×ι complex matrices. Then the subgroup generated by the two-level unitaries is the whole group:

⟨ W∈U(Cι) : W is two-level ⟩=U(Cι).\big\langle\, W\in U(\mathbb C^\iota)\ :\ W \text{ is two-level}\,\big\rangle=U(\mathbb C^\iota).⟨W∈U(Cι) : W is two-level⟩=U(Cι).

Here WWW is two-level if there are basis indices a,ba,ba,b (possibly equal) such that Wxy=δxyW_{xy}=\delta_{xy}Wxy​=δxy​ whenever x∉{a,b}x\notin\{a,b\}x∈/{a,b} or y∉{a,b}y\notin\{a,b\}y∈/{a,b}.

This is the first reduction in the standard proof that a gate set is universal: any unitary on nnn qubits decomposes into unitaries that act nontrivially on only two computational basis states.

Preamble
import Mathlib
import Definitions.Def_SuperconductingQC_Gates

open scoped Matrix Kronecker
Formal statement
namespace SuperconductingQC

theorem closure_twoLevelUnitaries_eq_top (ι : Type*) [Fintype ι] [DecidableEq ι] :
    Subgroup.closure (twoLevelUnitaries ι) = ⊤ := by
  sorry

end SuperconductingQC
Source
Nielsen & Chuang, Quantum Computation and Quantum Information (2000), §4.5.1 (decomposition of unitaries into two-level unitaries); Barenco et al., Phys. Rev. A 52, 3457 (1995), https://doi.org/10.1103/PhysRevA.52.3457
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