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.
Fusion-tree task input encoding
Definition
In the unitary braided fusion category fixed by Finite anyon task and promise interface, use its fixed representative set . Fix , ordered inputs , a total charge with nonzero fusion space, and one parenthesized binary tree. Every charge label below belongs to this same representative set. An encoded fusion input consists of the finite tree shape, a simple-charge label on each internal edge, and a multiplicity-basis index at each trivalent vertex. A label is admissible exactly when every chosen vertex index belongs to the specified basis of its multiplicity space ; the allowed local vertex data and resulting orthonormal fusion-tree vectors are those of Multiplicity-aware fusion-tree basis. The input encoding uses fixed self-delimiting binary codes for charge labels and nonnegative multiplicity indices, with out-of-range labels rejected as invalid encodings. It also records the total charge and an identifier for the selected computational subspace isometry required by Finite anyon task and promise interface, as in Fixed-charge encoding and code projector. For a fixed task family, a declared codebook assigns each such finite identifier a computational dimension and a particular isometry into the specified fusion space. The codebook and its isometries are fixed background model data; unknown identifiers are invalid. If isometries instead vary as part of the classical input, the task must declare a finite description language and its exact interpretation as isometries, and charge the full descriptions as input bits. This does not claim that every arbitrary complex isometry has such a finite description; an arbitrary abstract isometry may remain background model data only. The tree labels and isometry identifiers are finite classical data; they do not themselves specify or prepare the initial encoded quantum state, which is the separate state/preparation field in the task record.
Depends on
Used by
- Fusion-channel measurement access Definition
Dependency tree · two levels
13 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)