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.
History state and padded output
Statement
Let the five-local path in Five-local history-state adiabatic path have gates, including its identity gates, and let and . On the legal unary-clock space, the propagation Hamiltonian has kernel After adding , this kernel is one-dimensional and its unit vector is The full also has this unique ground state. Its data-register marginal is at trace distance at most from the specified circuit output state.
Facts & Assumptions
Given: The gate list, local propagation terms, legal unary clock, input penalty, and padding parameters from Five-local history-state adiabatic path.
The partial trace over the clock sums diagonal clock blocks in an orthonormal product basis (Partial trace over a finite tensor factor).
A unit vector represents the density operator (Density operator, Dirac Notation Conversion).
Any two density operators have trace distance at most (Trace Distance Range And Equality).
Proof
Fix an assignment to all clock bits outside the local support of . The subspace with that fixed spectator assignment and local clock state in is invariant; in the order the block is The term is zero on every local pattern outside this pair. These mutually orthogonal blocks, together with the subspaces for those other local patterns, decompose the full register, so it suffices to inspect each displayed block and the zero action on the rest. For any data vectors , its quadratic form is , and its kernel consists exactly of paired amplitudes . Hence is positive semidefinite on the full clock register.
On legal unary clocks, occurs only at and only at . Define the unitary on that space. Since , conjugating the block from step 1.1 by makes every adjacent block . Summing over edges gives .
The quadratic form of is , so its kernel is the constant clock vectors. Step 2.1 therefore gives exactly the displayed propagation kernel, with arbitrary data vector .
On a legal clock, vanishes except at , where it is the data Hamming-weight operator . Since , conjugation by leaves this block unchanged. For a kernel vector with data vector , its input energy is , which is zero exactly when lies in the one-dimensional span of . Thus has the unique normalized kernel vector .
The clock penalty is positive semidefinite and has kernel exactly the legal unary strings: a binary string has no adjacent pattern exactly when all its bits precede all its bits. Each term of is positive semidefinite by step 1.1 and the definitions of . A zero-energy vector must therefore lie in the clock-penalty kernel and in the kernel identified in step 4.1. This proves uniqueness for the full final Hamiltonian.
Tracing the clock out of and using [F1] removes all cross terms between distinct , giving For each , the appended gates are identities, so . There are such indices, and the other terms form a density operator after normalization. Hence .
By homogeneity of the trace norm in the definition of trace distance, the distance from is by [F3]. Since and , we have .
Depends on
Used by
Dependency tree · two levels
33 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 Quantum Computation is Equivalent to Standard Quantum Computation (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (standard reference, not scraped)