Unnumbered §IV: spherical trace levels and Clifford fundamental tiles
OpenQAlgorithms.Papers.Independent.Intakenext100.P82.trace_level_sphere_and_tilesAll 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.
Fix . Every projective gate of absolute trace has a unique positive-trace special-unitary representative, parametrized uniquely by as
Every unit vector gives a special-unitary matrix of trace , and all such matrices arise uniquely. Clifford conjugation becomes the faithful group of 24 orientation-preserving octahedral rotations. The closed spherical triangle with vertices has 24 translates covering with pairwise disjoint relative interiors, and the union of their vertex sets has cardinality 14. These coordinates support the source's secondary geometric search indices.
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 §IV, PDF pp.4--5: the nonextreme trace level is a sphere,
Clifford conjugation is the faithful rotational octahedral action, and the stated
triangle has 24 translates with disjoint relative interiors and 14 total vertices. -/
theorem trace_level_sphere_and_tiles (t : ℝ) (ht : 0 < t) (ht2 : t < 2) :
(∀ U : Mat, U ∈ Matrix.unitaryGroup Bool ℂ → ‖Matrix.trace U‖ = t →
∃! V : Mat, V ∈ Matrix.unitaryGroup Bool ℂ ∧ V.det = 1 ∧
Matrix.trace V = (t : ℂ) ∧ SameGate U V) ∧
(∀ v ∈ unitSphere,
sphereGate t v ∈ Matrix.unitaryGroup Bool ℂ ∧
(sphereGate t v).det = 1 ∧ Matrix.trace (sphereGate t v) = (t : ℂ)) ∧
(∀ U : Mat, U ∈ Matrix.unitaryGroup Bool ℂ → U.det = 1 →
Matrix.trace U = (t : ℂ) → ∃! v : BsSphereVector, v ∈ unitSphere ∧ sphereGate t v = U) ∧
(∀ g : Fin 24, ∀ v ∈ unitSphere,
(bsCliffordRotation g).mulVec v ∈ unitSphere ∧
sphereGate t ((bsCliffordRotation g).mulVec v) =
cliffordMatrix g * sphereGate t v * star (cliffordMatrix g)) ∧
Function.Injective (fun g : Fin 24 => fun v : {v : BsSphereVector // v ∈ unitSphere} =>
(bsCliffordRotation g).mulVec v.val) ∧
Set.range bsCliffordRotation = octahedronRotations ∧ Nat.card octahedronRotations = 24 ∧
(⋃ g : Fin 24, tile g) = unitSphere ∧
(∀ g h : Fin 24, g ≠ h → Disjoint (tileInterior g) (tileInterior h)) ∧
Nat.card (Set.range tile) = 24 ∧ Nat.card tileVertices = 14 := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P82
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real number satisfying , the following assertions all hold, with the notation specified here. Matrices acting on two coordinates are complex matrices, with coordinates ordered as false, true; denotes conjugate transpose. Put
define the indexed matrices by
and write
where is the th coordinate vector and , with the same image notation for . The assertions are: (1) for every unitary complex matrix with , there exists exactly one complex matrix that is unitary, has and , and satisfies for some complex number with ; (2) for every , the matrix is unitary, has determinant , and has trace ; (3) for every unitary complex matrix with determinant and trace , there exists exactly one vector satisfying both and ; (4) for every and , one has and ; (5) for any , if for every , then ; (6) ; (7) has exactly elements; (8) ; (9) for all distinct , the sets and are disjoint; (10) the set of distinct sets has exactly elements; and (11) the set has exactly elements.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.