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.
Two-gate padded history state
Example
Take the algebraic one-qubit macro-gate circuit , and tolerance . Applying the propagation formula at this macro-step level gives , , and . Write its legal clocks as . This is an algebraic illustration of the propagation formula, rather than a literal fixed-alphabet input to the uniform-circuit construction: expanding and changes the gate count and padding. The normalized history state is
Facts & Assumptions
Given: The unary-clock propagation formula and padded circuit conventions from Five-local history-state adiabatic path and History state and padded output.
Each propagation term couples only its two adjacent legal clocks and its kernel condition on their data amplitudes is (History state and padded output).
Dirac kets denote the corresponding computational basis vectors (Dirac Notation Conversion).
Verification
At the algebraic macro-step level, the padding count is , so . The prefix states are , , and . Since are identities, all later prefix states remain . Substitution in the history-state formula of [F1] gives the displayed normalized vector.
For , the endpoint patterns are on clock bits ; for , the internal patterns are on bits ; for , the endpoint patterns are on bits . On every adjacent pair , the data amplitudes in step 1.1 satisfy : the first two transitions apply and , and the last four apply .
By [F1], each restricted to its pattern pair has quadratic form . Step 2.1 makes this zero for each ; all other legal clock amplitudes are outside that term's two-pattern support. Thus every propagation term annihilates , and the sum does as well.
Depends on
Used by
Nothing in the library uses this result yet.
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
- Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, and Oded Regev, Adiabatic Computation is Equivalent to Standard Quantum Computation (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (standard reference, not scraped)