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.
Small-time-aware qubitized simulator
Definition
Input. An exact Hermitian block encoding of , , a rational time , rational , and a terminating certified comparison of with , charged under the access model. For the branch, supply all exact-block-mode inputs of Qubitized Hamiltonian simulator: the certified norm promise , clean embedding, declared forward, inverse and controlled signal access, projector-phase circuits, coefficient preparation, SELECT, OAA reflections, phase synthesis, data access and classical arithmetic with their costs, and terminating certified scalar comparisons and rational-interval evaluations for every arithmetic test in that procedure. These capabilities must be supplied, not inferred from the block matrix or the single comparison of with .
Instructions.
- If , return the identity circuit on the system, with every work register left at zero. The query, gate, and bit costs of this branch are zero.
- If , invoke Qubitized Hamiltonian simulator with , and return its circuit and error certificate. Propagate any INVALID, CERTIFICATE_ERROR, or IMPLEMENTATION_ERROR result without labeling it a successful simulation.
The comparison cost is recorded separately. The second branch is exactly the OP4 procedure; this wrapper does not modify OP4 or infer inverse, controlled, state-preparation, or phase-synthesis access.
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
- András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe, Quantum singular value transformation and beyond, Theorem 58 and Lemma 59 (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, Chapter 29 §29.4 (standard reference, not scraped)