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.
Dyadic cyclotomic ring for Clifford+T synthesis
Definition
Set , , , and . The relation reduces every element of to four integer coefficients in the power basis . The canonical dyadic encoding of a nonzero is
where is least and, if , the four integers are not all even. Zero is encoded with and all four coefficients zero. Arithmetic is exact: multiply polynomials, reduce with , combine denominators, and remove the common power of from the coefficients. The integral-basis supplier Ring of integers of every cyclotomic field and the proof of Canonical dyadic coefficient encoding ↗ justify existence and uniqueness.
Remarks
The ring is a subring of . All coefficients and equality tests in this page use the displayed power basis; no floating-point comparison is implicit.
Depends on
Used by
- Cyclotomic scaled grid and norm-equation solver Algorithm
- Efficient exact-denominator Rz grid iterator Algorithm
- Smallest square root of two denominator exponent Definition
- The nontrivial real-conjugation automorphism of the eighth cyclotomic field Definition
- Canonical dyadic coefficient encoding Lemma
- Clifford+T circuit entries lie in the dyadic cyclotomic ring Lemma
- Conjugate norms from the dyadic eighth-cyclotomic ring are real dyadics Lemma
- Constructive cyclotomic factorization and real unit squares Lemma
- Denominator exponent is a well-defined integer Lemma
- Every Rz epsilon region contains an exact norm-solvable grid point Lemma
- Exponent growth of the Rz scaled grid Lemma
- Finite coefficient bounds for the scaled cyclotomic grid Lemma
- Size and residue of the Rz candidate norm integer Lemma
- Square root of two divisibility criterion in the eighth cyclotomic ring Lemma
- Squared entry denominator bound Lemma
- Unit-modulus elements of the dyadic cyclotomic ring Lemma
- The exact single-qubit compiler returns the input matrix Theorem
Dependency tree · two levels
16 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)