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.
Full-space history-path gap
Statement
For the path in Five-local history-state adiabatic path, put , , and For every , the full Hamiltonian has a unique ground state and its gap is greater than . Consequently the minimum gap is .
Facts & Assumptions
Given: The five-local path, its input/propagation/clock terms, and the chosen from Five-local history-state adiabatic path.
The zero-input legal clock block has gap at least (Restricted history-path gap).
Its normalized ground vector is nonnegative and nonincreasing, and its ground state is unique (Nonnegative monotone ground vector of the history path).
The ideal final history state is the unique kernel vector of (History state and padded output).
The large clock-penalty lemma bounds the first two full eigenvalues by those of the legal compression with additive error (Large clock-penalty perturbation).
Finite self-adjoint matrices have an orthonormal eigenbasis (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
Proof
Let be the subspace of legal unary clocks. The prefix conjugation from History state and padded output preserves each clock basis state and makes equal to on the clock. Since the input penalty acts only at and the prefix at is the identity, the compression of to decomposes, in the computational basis , as where is the zero-input clock block and is Hamming weight.
The block has simple ground energy and gap by [F1]–[F2]. Write . Since and , . Also : the compression of to is positive and has trace at most (for its trace is , and for it is ). If is a normalized ground vector, the two-dimensional space contains a nonzero vector . Its Rayleigh quotient is at least by expansion in an orthonormal eigenbasis, while the quotient is at most the largest eigenvalue of the compression to , hence at most its trace . Thus and, since , .
For any , put and . The spectral gap of the zero-input block gives , and . Thus If , set . On the two-dimensional span of and , the matrix of in the orthonormal basis has trace and determinant . Its smaller eigenvalue is at least its determinant divided by its trace, hence at least . On the orthogonal complement, , so this bound applies to the whole space. If , then and has eigenvalues on and on , so . Thus in either case . By , every nonzero-input block has ground energy at least .
The legal compression therefore has unique ground in the block and gap at least The last inequality is equivalent to , which holds for every .
On the full register, is positive, vanishes exactly on , and is at least on : every illegal binary clock string contains at least one adjacent pair. To bound , fix an assignment of all clock bits outside the local support of a term . On the two local pattern states , the block is ; it has eigenvalues and because is unitary, and is zero on the other local patterns. Thus , , and . Also and , by their sums of and projections. Hence is self-adjoint and . The legal dimension is , so [F4] applies to its first two eigenvalues with .
For this , and The perturbation bounds in [F4] give and , where by step 4.1. Thus the full gap is at least for every . Its positivity makes the ground state unique, and gives the stated asymptotic gap.
Depends on
- Restricted history-path gap
- Large clock-penalty perturbation
- Five-local history-state adiabatic path
- History state and padded output
- Nonnegative monotone ground vector of the history path
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
Used by
- Circuit-to-adiabatic simulation Theorem
Dependency tree · two levels
27 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)