Single-qubit gates and CNOT are universal
ProvedSuperconductingQC.closure_singleQubit_CNOT_eq_topquantum-computingquantum-gates
Let . The subgroup of generated by all single-qubit gates (, a qubit) together with all CNOT gates on ordered pairs of distinct qubits is the whole unitary group:
Every -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 there are no qubit pairs and the statement reduces to being generated by single-qubit gates; is excluded because then no generators exist while 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 SuperconductingQCSource
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.