How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Exact single-qubit Clifford+T ring characterization
Statement
A matrix is exactly the matrix of a finite one-qubit Clifford+T word if and only if all four entries of lie in . This is a single-qubit statement; no multi-qubit exact ring characterization is asserted.
Facts & Assumptions
Given: The exact circuit matrices and matrix-product convention of the gate-library and circuit-semantics definitions.
Clifford+T circuit entries lie in the dyadic cyclotomic ring: every finite Clifford+T circuit matrix has entries in .
Normal form of a single-qubit ring unitary: a ring-entry unitary has first column and determinant phase , with second column .
Clifford+T denominator descent and finite base table: every normalized ring column reduces by an step from squared-entry exponent to , and every column with has an exact H/T preparation word.
Unit-modulus elements of the dyadic cyclotomic ring: the elements satisfying are exactly .
Proof
If is a finite Clifford+T circuit matrix, [F1] puts all its entries in .
Conversely, let have entries in . By [F2] its first column is a normalized column. Apply the descent in [F3] repeatedly while . Each step replaces the current matrix by and decreases the nonnegative integer by exactly one; hence after finitely many steps the first column lies in the base regime.
By [F3], the base column has a word with . Reversing each descent step by prepending its recorded gives a word with first column equal to the original . The unitary has first column , so orthogonality of its columns makes it for a unit scalar . Its entries lie in , since have entries in that ring. Therefore [F4] gives , and is a finite Clifford+T word.
Both implications are proved. The proof constructs the converse word with only exact coefficient operations and the finite base lookup; no approximation, ancilla, or multi-qubit inference is used.
Unresolved supplier checks
The actual QC07 gate matrices and QC09 circuit-semantics body were inspected; their exact matrix and chronological word interfaces agree with the local proof. The theorem remains limited to one qubit; no multi-qubit ring characterization is inferred.
Depends on
- Clifford+T circuit entries lie in the dyadic cyclotomic ring
- Normal form of a single-qubit ring unitary
- Unit-modulus elements of the dyadic cyclotomic ring
- Smallest square root of two denominator exponent
- Clifford+T denominator descent and finite base table
- Denotational semantics of a finite layered circuit
Used by
Dependency tree · two levels
20 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Kliuchnikov, Maslov, and Mosca, Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates (standard reference, not scraped)