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.
Every Rz epsilon region contains an exact norm-solvable grid point
Statement
For and , there are such that Thus the scaled grid has at least one candidate whose norm equation is solvable.
Facts & Assumptions
Given: The exact Clifford+T one-qubit matrices, , the automorphism , , and . For scalar , .
Determinant-one Clifford+T words are dense in SU(2): every target has an exact determinant-one Clifford+T word within any positive operator-norm error.
Dyadic cyclotomic ring for Clifford+T synthesis: is a subring of .
Clifford+T gate library and exact matrices: the exact displayed matrices are the one-qubit generators.
The nontrivial real-conjugation automorphism of the eighth cyclotomic field: is a field automorphism of that preserves and commutes with complex conjugation.
The exact operator-norm epsilon region for determinant-one Rz candidates: for , the operator-norm error bound is equivalent to the displayed real-part condition.
Proof
By [F2,F3], the entries of lie in . Also and , so every entry of lies in . The ring is closed under complex conjugation because . Apply [F1] to and choose an exact word with and . Every entry of lies in because each generator has entries in and products of matrices over a subring remain over that subring. Let the first column be . It is a unit vector; its orthogonal unit vector is therefore the second column up to a unit scalar . The determinant of the resulting matrix is , so forces . Hence and .
Applying to preserves products and fixes ; [F4] also makes it commute with the adjoint. Thus is unitary, and its first-column norm gives . The original first column similarly gives , so .
The strict approximation in step 1.1 and [F5] imply , hence the required weak inequality. Together with step 1.1 this gives a grid candidate and an exact solution of its norm equation.
Unresolved supplier checks
The actual QC12 projective-density proof and its Pauli-axis suppliers were inspected. Its normalized lifts are used only for projective density; the exact scalar phases are retained in the local matrix argument. This records interface reconciliation, not approval of those supplier drafts.
Depends on
Used by
Dependency tree · two levels
22 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
- Ross and Selinger, Optimal ancilla-free Clifford+T approximation of z-rotations (standard reference, not scraped)
- Childs, Lecture Notes on Quantum Algorithms (standard reference, not scraped)