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.
After undoing quantum circuit propagation, the Hamiltonian without output penalty is . The common kernel is the valid input space times the uniform clock vector. On its orthogonal complement, the smallest angle between two subspaces obeys . The Kitaev geometrical lemma and path gap give . Degenerate valid quantum witnesses must be removed together when computing this angle.
The input penalty of a history Hamiltonian tests prescribed ancilla qubits at clock time zero while leaving the quantum witness unrestricted. A zero ancilla qubit is tested by the bad-state projector ; a plus ancilla qubit is tested by .
Let , where each tests a different ancilla qubit. These orthogonal projections commute because they act on separate tensor product factors. Thus is a positive operator with integer eigenvalues between zero and . Zero is essential: its kernel contains exactly the valid ancillary input subspace, tensored with arbitrary quantum witness states. Only the nonzero eigenvalues are positive integers.
The clock-conditioned term is . For a normalized computational history state with clock labels forming an orthonormal basis,Together with correct propagation, zero input penalty selects histories with valid initial data. The displayed expectation concerns this fixed history state; a bound on the full Hamiltonian's lowest eigenvalue also has to account for propagation penalties.
A nonlocal quantum clock records quantum circuit time in an abstract dimensional register. A binary encoding uses logarithmically many qubits, but transitions need not have bounded qubit locality. Extra diagonal penalties may exclude unused binary labels. A unary quantum clock provides a different encoding for fixed-locality constructions.
A unary quantum clock represents step of a -gate circuit by . Clock strings are orthogonal, and adjacent legal strings differ at one qubit. Local patterns around that change permit a history-subspace propagation Hamiltonian with bounded locality.
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 in the unary history subspace, the first Gershgorin disc lies in and every other disc has real part at least . For , the first disc is isolated and contains the unique ground state energy. Thus the spectral gap is at least , in particular at least for .
For a path with vertices and edge weight , the eigenvalues are , . The corresponding coefficients are proportional to . The zero mode is uniform, and the spectral gap is at least . The endpoint difference equations use reflecting ghost values, not periodic ones.
Articles by others on the same topic
There are currently no matching articles.