AFTD Auto-Formalizing Theoretical Domains

CliffordGate

inductive

An inductive type representing a quantum gate in a k-qubit Clifford circuit: Hadamard h on qubit i : Fin k, phase gate s on qubit i : Fin k, or controlled-NOT gate cnot with distinct control and target qubits c t : Fin k (with a proof c ≠ t).

Statement

inductive CliffordGate (k : ℕ)
Defined in
scout/2610-04621-exact-clifford-optimality-for-two-sided-locally-randomized.md:1610
Verified
30 Oct 2026
Axioms
none listed
Used by 13

Read back from the Lean

An inductive type CliffordGate (k : ℕ) representing elementary Clifford gates on k qubits, with three constructors: 1. h (i : Fin k): a Hadamard gate acting on qubit i. 2. s (i : Fin k): a phase gate (S gate) acting on qubit i. 3. cnot (c t : Fin k) (h : c ≠ t): a controlled-NOT (CNOT) gate with control qubit c and target qubit t, requiring a proof that c ≠ t. The type also derives decidable equality (DecidableEq).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- A quantum gate in a k-qubit Clifford circuit: H on qubit i, S on qubit i, or CNOT with distinct control c and target t. -/
inductive CliffordGate (k : ℕ) where
  | h : Fin k → CliffordGate k
  | s : Fin k → CliffordGate k
  | cnot : (c t : Fin k) → c ≠ t → CliffordGate k
  deriving DecidableEq
See it in the graphDiscuss this resultChallenge it