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-level avoided crossing
Statement
Consider on , where and . Compute its full ground-to-excited gap, derivative bounds, and rank-one JRS error bound.
Facts & Assumptions
Given: The finite path and rank-one JRS estimate from Finite adiabatic path model and Finite JRS adiabatic projector bound.
The eigenvalues of a finite Hermitian matrix determine its ground band and gap (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
For a rank-one band, the JRS bound is (Finite JRS adiabatic projector bound).
Proof
Put . Direct multiplication gives , so its eigenvalues are . The ground-to-excited gap is therefore , whose minimum is at and whose endpoint values are . The ground band is uniformly isolated and has rank one.
Differentiating gives and . Since , for every .
Substituting the endpoint values and derivatives from steps 1.1–1.2 into [F2] gives endpoint contribution . For the integral, with , using the antiderivative . Hence .
The JRS conclusion consequently bounds the projector deviation by and the transition probability out of the ground band by its square. For example, any makes the projector deviation at most .
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)