Unnumbered §II: syllable identities and equivalent generating basis
OpenQAlgorithms.Papers.Independent.Intakenext100.P82.syllable_identities_and_basisAll 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 syllables , satisfy the exact projective identities
Moreover : a projective gate has a word over either alphabet exactly when it has a word over the other. These identities transfer the established universality of the H,T basis to the syllable basis.
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. Exact projective identities transfer the
known universality of H,T; no quantitative universality claim is added. -/
theorem syllable_identities_and_basis :
SameGate QAlgorithms.hadamard
(syllableMatrix .th * syllableMatrix .sh ^ 2 * syllableMatrix .th) ∧
SameGate QAlgorithms.gateT
(syllableMatrix .th ^ 2 * syllableMatrix .sh ^ 2 * syllableMatrix .th) ∧
SameGate (syllableMatrix .sh ^ 3) 1 ∧
(∀ k : ℕ, 0 < k → k < 3 → ¬ SameGate (syllableMatrix .sh ^ k) 1) ∧
(∀ U : Mat,
(∃ w : List BsHTLetter, SameGate U (htValue w)) ↔
(∃ w : List Syllable, SameGate U (syllableValue w))) := 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 , , , , and . For complex matrices write when there exists with and . The assertion is the conjunction
together with the following equivalence for every complex matrix , without any unitarity assumption on : there exists a finite word over the letters whose product satisfies if and only if there exists a finite word over the letters whose product satisfies . Products follow list order, and either word may be empty, giving the identity matrix. The quantified condition on concerns precisely and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.