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.
Gap closing invalidates a uniform adiabatic bound
Statement
The path has a closing gap and its exact evolution from the initial ground state ends orthogonal to the final ground state. Thus regularity alone does not imply ground-state following or satisfy the uniform-gap hypothesis of the finite JRS theorem.
Facts & Assumptions
Given: The finite path and the uniform positive-gap hypothesis of Finite adiabatic path model and Finite JRS adiabatic projector bound.
The eigenvalues of a finite Hermitian matrix determine its ground state and gap (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
Proof
The path is linear in , hence twice continuously differentiable. Since , its eigenvalues are and ; the gap is , which vanishes at . Therefore no positive uniform full gap exists.
At , has unique ground vector ; at , has unique ground vector . The Hamiltonians commute for all times and are diagonal, so the solution of maps to a scalar phase times . Its final overlap with the final ground vector is zero, and its transition probability out of the final ground space is exactly for every .
The path satisfies the smoothness assumption but violates the strictly positive uniform-gap hypothesis in Finite JRS adiabatic projector bound. Step 1.2 shows directly that the desired ground-state-following conclusion can fail completely when that hypothesis is removed.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
29 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
- 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)