Unnumbered §II: projective Clifford subgroup structure
OpenQAlgorithms.Papers.Independent.Intakenext100.P82.projective_clifford_structureAll circuits are single-qubit circuits without ancillas or measurements. Products act from right to left. Let , , , and . The two distinct syllable letters are and . A normalized word is empty, or ends in with no adjacent letters. A canonical word is normalized and its first four syllables, when present, are all . Write for the number of letters in ; Clifford gates have zero charged cost.
The projective Clifford subgroup generated by and satisfies
Here is the symmetric group on four letters, equivalently the classical Coxeter group of type . This identifies the finite Clifford subgroup used for every terminal and lookup.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P82
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P82
open scoped BigOperators
local notation "Mat" => Matrix Bool Bool ℂ
/-- Unnumbered §II, PDF p.2. S4 means permutations of four letters
(order 24), equivalently the classical Coxeter group of type A3. -/
theorem projective_clifford_structure :
Nat.card cliffordSubgroup = 24 ∧
Nonempty (cliffordSubgroup ≃* Equiv.Perm (Fin 4)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P82
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be the group of invertible complex matrices modulo its center. Let and , regarded as invertible matrices with respective inverses and , and let be the smallest subgroup of containing their quotient classes. Then the cardinality of the underlying type of is , and there exists a group isomorphism from to the group of all permutations of the four-element set .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.