clifford_t_circuit_matrix_nil
Sanity check: the empty circuit has the identity matrix.
Statement
theorem clifford_t_circuit_matrix_nil (N : ℕ) : clifford_t_circuit_matrix ([] : List (CliffordTGate N)) = 1- Source
- Stated here; not taken from a source
- Verified
- 06 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- clifford_t_circuit_matrixThe unitary of a Clifford+T circuit given as a list of gates, the first gate of the list acting first: g_k ... g_2 g_1.
- CliffordTGateA gate of a Clifford+T circuit on N qubits: a Hadamard H on qubit i, a phase gate S on qubit i, a CNOT with control c and target t (c…
The proof, explained
The unitary matrix of a Clifford+$T$ circuit is defined as the left fold of gate multiplications starting from the identity matrix $1$. For the empty circuit, the fold over an empty list of gates evaluates definitionally to the identity matrix. The theorem is thus established immediately by reflexivity (`rfl`).
The matrix representing the empty circuit is the identity matrix.
By definition, `clifford_t_circuit_matrix` computes the matrix product via `List.foldl` over the list of gates, with the initial accumulator set to the identity matrix $1$. For an empty list `[]`, `List.foldl` immediately evaluates to the base value $1$. The equality therefore holds definitionally and is proved by reflexivity (`rfl`).
theorem clifford_t_circuit_matrix_nil (N : ℕ) : clifford_t_circuit_matrix ([] : List (CliffordTGate N)) = 1 := rfl
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
theorem clifford_t_circuit_matrix_nil (N : ℕ) : clifford_t_circuit_matrix ([] : List (CliffordTGate N)) = 1 := rfl