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.
Finite adiabatic braid compilation input
Definition
A finite adiabatic braid input consists of a finite-dimensional complex Hilbert space , a Hermitian path on , a norm-continuous rank- orthogonal spectral projection , with , onto a coherently followed band with uniform positive full gap, a slow-time schedule , and an explicit initial isometry . These are the path and propagator hypotheses of Finite adiabatic path model; the output propagator solves . Also supply an endpoint isometry and a specified Fibonacci braid word with categorical action on a specified -dimensional fusion space , in the fixed convention of Fibonacci fusion data and chiral convention, and a unitary target in the declared logical input/output frames. Supply unitary coordinate maps for and set . The band identifications are then , as in Physical braid implementation interface. The target is the selected categorical action written in those frames, including the phase convention recorded by Braid phase reference and correction ledger; specifying it does not assert that the physical path realizes it. The in-band transport condition is the separate hypothesis This condition is not a consequence of a projector-leakage estimate. The model also specifies a finite output measurement and, if needed, its own implementation-variation bound. The JRS expression and leakage consequence are handled as a separate result.
Depends on
Used by
Dependency tree · two levels
39 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)
- Sabine Jansen, Mary-Beth Ruskai, and Ruedi Seiler, Bounds for the adiabatic approximation with applications to quantum computation (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (standard reference, not scraped)