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.
One-gate history Hamiltonian energy check
Example
Take one work qubit in , one gate , and declare outcome accepting. Then the history is Verify that propagation energy is zero and that the scaled output penalty has energy , equal to the verifier's rejection probability.
Facts & Assumptions
Given: The history Hamiltonian and the stated one-qubit circuit.
Feynman–Kitaev history Hamiltonian: at , propagation is the half-weight edge penalty and output penalty coefficient is .
Propagation kernel and path-Laplacian gap: the edge penalty vanishes exactly when the second computation component is applied to the first.
Input and output penalties on history states: the scaled output penalty equals the terminal rejection probability.
Proof
The propagation quadratic form on an arbitrary vector is . Here , so the norm is zero and propagation energy vanishes.
The terminal state is , whose probability of rejecting the accept-on- predicate is . Directly, the clock- history component has squared norm , its reject projection has probability within that component, and the coefficient 2 cancels the clock factor ; the total output energy is . This matches [F3].
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
8 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
- Dorit Aharonov and Tomer Naveh, Quantum NP: A Survey (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes (standard reference, not scraped)