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.
Three-Fibonacci-anyon qubit matrices
Example
For three anyons of total charge , the fusion space is two-dimensional. Fix the chiral convention After removing the common scalar , the adjacent generators are
The verification checks these matrices directly as a unitary representation. It uses the listed sector data as input and does not infer global category coherence from this calculation.
Facts & Assumptions
Given: and the displayed fixed-convention Fibonacci and data.
The Fibonacci supplier states the fusion rule, the displayed block, and the pullback phases and , so . Fibonacci fusion data and chiral convention
Verification
Put and . Since , and . Matrix multiplication then gives . Both diagonal entries of have modulus one, so is unitary; is unitary because it is real and . The data in [F1] give . Also and , so division of by gives . With , division by gives ; since , it follows that and . Hence is unitary.
Write , where , , and . Then The relations and give ; expanding the remaining diagonal entries and using , , and gives and . Thus both matrices reduce to The Artin relation follows entry by entry.
The off-diagonal entry of is , because and . Thus the generators do not commute. They are not two copies of a single diagonal phase gate in the same fusion basis.
Depends on
Used by
Dependency tree · two levels
11 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
- Chetan Nayak, Steven H. Simon, Ady Stern, Michael Freedman, and Sankar Das Sarma, Non-Abelian Anyons and Topological Quantum Computation (standard reference, not scraped)
- John Preskill, Lecture Notes for Physics 219: Quantum Computation, Chapter 9: Topological Quantum Computation (standard reference, not scraped)