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.
Propagation kernel and path-Laplacian gap
Statement
On the legal clock space spanned by , the propagation Hamiltonian of Feynman–Kitaev history Hamiltonian is unitarily conjugate to tensor the identity on computation space. Its kernel is the uniform clock vector, equivalently the valid computation histories, and its first positive eigenvalue is
Facts & Assumptions
Given: The ordered computation unitaries and legal clock basis.
Feynman–Kitaev history Hamiltonian: each propagation edge couples adjacent legal times with weight and transports computation by .
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: a finite Hermitian matrix has an orthonormal eigenbasis.
Dirac Notation Conversion: ket-bra products and inner products use the stated root convention and matrix-adjoint correspondence.
Proof
Set and . The block diagonal map is unitary because every is unitary and clock sectors are orthogonal. Conjugating an edge term by replaces in its off-diagonal block by ; its diagonal clock blocks remain unchanged. The ket-bra multiplications use the convention [F3]. Summing gives . Thus the kernel consists of vectors constant across clock time, and undoing gives exactly the history vectors , normalized when .
Put . For , the vector with coordinates , , is nonzero. The cosine addition identity verifies the interior eigenvalue equation for with eigenvalue ; the same identity with the endpoint degree-one rows verifies both endpoint equations. These eigenvalues are distinct, so symmetry of makes the corresponding vectors orthogonal; by [F2] they form a full eigenbasis. The vector is constant and the smallest positive eigenvalue is the value.
For , concavity of sine gives . Hence This proves the stated gap and includes ().
Depends on
Used by
Dependency tree · two levels
17 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 and Tomer Naveh, Quantum NP: A Survey (standard reference, not scraped)
- Julia Kempe, Alexei Kitaev, and Oded Regev, The Complexity of the Local Hamiltonian Problem (standard reference, not scraped)