Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Single-qubit gates and iSWAP form a universal gate set

Proved
SuperconductingQC.closure_singleQubit_iSWAP_eq_top

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

quantum-computingquantum-gates

Let n≥1n\ge1n≥1 and let U(2n)U(2^n)U(2n) be the group of unitary operators on nnn qubits. The subgroup generated by all single-qubit gates U(k)U^{(k)}U(k) (U∈U(2)U\in U(2)U∈U(2), kkk any qubit) together with the iSWAP gate placed on any ordered pair of distinct qubits is all of U(2n)U(2^n)U(2n):

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

Equivalently, every nnn-qubit unitary is an exact finite product of single-qubit gates and iSWAP gates. This is the precise content of the statement that single-qubit gates combined with the two-qubit gates available on superconducting hardware form a universal gate set.

Formalization Note Universality is exact (the generated group, not its closure in the topological sense). n=0n=0n=0 is excluded for the same reason as in the CNOT version.

Preamble
import Mathlib
import Definitions.Def_SuperconductingQC_Gates

open scoped Matrix Kronecker
Formal statement
namespace SuperconductingQC

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

end SuperconductingQC
Source
Wikipedia, "Superconducting quantum computing" (PDF snapshot supplied by the mission author, retrieved 2026-10-13), https://en.wikipedia.org/wiki/Superconducting_quantum_computing; section 'Criteria for a viable quantum processor': 'single-qubit gates combined with two-qubit gates form a universal gate set', with the two-qubit gate iSWAP of section 'Quantum gates'
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