A Hamiltonian path preserving the history subspace can be analysed using its restricted spectral gap. If this gap is and the derivative has operator norm , a runtime criterion proportional to permits computational history state preparation in time . Other invariant sectors do not cause leakage from a state initialized in the history subspace.
A computational history state coherently records a circuit's intermediate states with orthogonal clock labels: . A propagation term penalizes a mismatch between adjacent time labels and the corresponding gate. With correct propagation, uniform coefficients form a zero-energy ground state within the history subspace.
A Feynman-Kitaev Hamiltonian penalizes incorrect input initialization, disagreement between successive quantum circuit steps and clock labels, and optionally a rejecting output. Its propagation quadratic form is a sum of . Without output penalty, its zero-energy space consists of correctly initialized computational history states. A nonlocal quantum clock makes the propagation formula simple but does not supply fixed qubit locality by itself.
Ground-state subspace 2026-10-06
The ground-state subspace is the eigenspace of a Hamiltonian operator at its lowest eigenvalue . A computational history state construction can have many valid quantum witnesses, hence a degenerate ground space. Perturbation bounds must optimize on this entire subspace, rather than on a chosen basis of ground states.
In the orthonormal history basis , circuit propagation restricts to . This is a Graph Laplacian on a path. Its uniform zero-energy vector is the computational history state, while initialization restricts to .
For an arbitrary vector , the preceding positive quadratic forms show that zero energy requires
Thus all its clock components are generated by one correctly initialized input. If
then consists of , with unrestricted quantum witness . Normalization gives the computational history state
Conversely, every such computational history state annihilates every propagation term and the input term, hence has zero energy. These states are exactly the ground space, not merely examples of its vectors. In particular, histories of computational basis quantum witnesses span the ground space; their coherent superpositions are also zero-energy states.
Another way to see the propagation constraint is to conjugate by . Then , where
The spectrum of a path propagation Hamiltonian has a unique uniform clock zero mode. This is the path with vertices. The upper summation index in the printed auxiliary formula must be , rather than , to agree with its stated dimension and spectrum; using would introduce an extra vertex.
For a normalized computational history state, the output projector sees only its final clock component. With the quantum circuit's acceptance probability,
This proves the hint, including for a computational basis quantum witness. Moreover is a stoquastic Hamiltonian term, so adding it with positive coefficient preserves stoquasticity.
There are two substantive problems with the stated promise. First, for any basis quantum witness the initialized state has nonnegative amplitudes, and every permutation matrix preserves them. Write the output as , with both vectors entrywise nonnegative. Then
The stoquastic acceptance floor rules out the printed one-third soundness condition. There are no NO instances of that literal promise. Second, the ground space includes histories of arbitrary quantum witnesses. It is the maximum over those quantum witnesses, not the maximum over basis quantum witnesses, that determines the lowest output energy. Even the identity quantum circuit accepts each basis input with probability , but accepts a quantum witness with probability one. Thus a basis-witness soundness bound would not control this Hamiltonian, even if its numerical threshold were repaired.
The requested nontrivial hardness statement therefore needs the standard quantum-witness StoqMA promise, with and inverse-polynomial gap . The intended reduction can be completed precisely under that corrected promise. Define the quantum witness embedding and the witness acceptance operator
It is a positive contraction, and . The minimum expectation of on the history ground space is . This is also consistent with a nonnegative optimal StoqMA quantum witness: is entrywise nonnegative, so replacing amplitudes by their absolute values cannot decrease its quadratic form.
A uniform ground-space perturbation bound is needed because the gap shrinks with quantum circuit length. Put , and choose a positive inverse-polynomial coefficient
For the history ground projector and any unit vector with , the operator norm bound gives
The last inequality completes the square in and uses . Testing a ground space minimizing vector gives the upper bound . Since , we obtain
YES instances of the corrected promise have energy at most ; NO instances have energy at least
The separation is at least , an inverse polynomial. The quantum circuit and all these Hamiltonian terms have polynomial-size descriptions. This proves StoqMA hardness for the local Hamiltonian problem variant that permits the nonlocal clock, under the corrected quantum witness and acceptance promise.
The printed perturbation formula also has where a general perturbation belongs. Its unspecified cannot be treated as uniform in a closing gap. Likewise a circuit-length-independent constant cannot in general satisfy the stated small-perturbation requirement for an arbitrary long quantum circuit. The explicit bound above avoids both issues; it does not claim the defective literal promise defines standard StoqMA.
Because each term in the history-subspace propagation Hamiltonian is positive semidefinite, the uniform history vector has zero energy and is a ground state:
Indeed every edge term annihilates the uniform coefficients. Conversely, a zero-energy vector must have equal coefficients across every edge of the connected path, so this computational history state is the unique ground state in . It coherently records every intermediate state of the quantum circuit.