Section 4.1, unnumbered: generators of C_T(C_1)
ProvedQAlgorithms.Papers.Independent.Gap48.P12.ct_generatorsFor the exact Clifford group and the image-defined subgroup on page 7,
These are exact matrix groups. The symbolic third generator evaluates to ; the following printed display is erroneous. Keeping the symbolic word preserves the asserted group and its global phases. The result identifies the generators used by the local rewrite construction.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P12
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P12
local notation "Mat" => Matrix Bool Bool ℂ
local notation "Vec" => EuclideanSpace ℂ Bool
local notation "wordMatrix" => fun (B : CircuitBasis) (w : CircuitWord) =>
QAlgorithms.Papers.Independent.Next46.P21.wordMatrix (chronologicalInstructions B w)
/-- PDF p.7, §4.1: the printed symbolic generator assertion.
Source discrepancy: the following “namely” display prints exp(i*pi/8) I;
the word (H P^3)^3 actually equals exp(-i*pi/4) I. We retain the symbolic
word and exact phases; independent moderation of the correction is required. -/
theorem ct_generators :
(generatedCT : Set (Matrix.unitaryGroup Bool ℂ)) = {u : Matrix.unitaryGroup Bool ℂ | (u : Mat) ∈ ctSet} := by sorry
end QAlgorithms.Papers.Independent.Gap48.P12
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let , , and . Let consist of the matrix values of all finite words over , including , and set
The subgroup of the unitary group generated by the three matrices , , and has, as its underlying set, exactly the unitary matrices whose underlying complex matrices belong to . Here “generated” means the smallest subgroup containing those three matrices, so its elements are finite products of those generators and their inverses, including the empty product.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.