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.
Fibonacci fusion measurement branches and zero outcomes
Example
In the two-dimensional Fibonacci fusion space for three anyons of total charge , use the basis labelled by the charge after fusing the first two anyons. This is the fixed convention of Fibonacci fusion data and chiral convention. For measurement of that pair's total charge yields probabilities and and conditional states and . If either coefficient is zero, its outcome has probability zero and there is no normalized conditional state for that outcome.
The circuit below is schematic: the pair enters the declared fusion-channel projective measurement, the classical outcome is the charge label, and the post-measurement quantum branch is . It records no physical measurement hardware or any unproved braid diagram rule.
Facts & Assumptions
Given: The two orthogonal Fibonacci channel basis vectors and the finite projective measurement of their pair charge.
The two basis states are the total-charge channels of the first pair in the stated Fibonacci convention. Fibonacci fusion data and chiral convention
Channel outcome probability and conditional state are given by the fusion-branch theorem. Fusion measurement branches are normalized exactly when nonzero
Verification
The coefficients have squared moduli and , whose sum is one. The channel projectors are and , so they send to the corresponding coefficient times its basis vector. Thus the probabilities are and , and after division by the coefficient magnitudes the conditional states are and by [F1]–[F2].
If the coefficient of one channel is zero, its projected vector is zero and the corresponding probability is zero. The branch-validity theorem says that this case has no normalized conditional state. If the surviving channel is with coefficient , normalization gives , so its conditional vector is , representing the same pure state as . This checks both zero-coefficient boundary cases without fixing a global phase.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
23 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
- John Preskill, Lecture Notes for Physics 219: Quantum Computation, Chapter 9: Topological Quantum Computation (standard reference, not scraped)
- Chetan Nayak, Steven H. Simon, Ady Stern, Michael Freedman, and Sankar Das Sarma, Non-Abelian Anyons and Topological Quantum Computation (standard reference, not scraped)