Discrete Clock Hamiltonian Construction

• Discrete clock Hamiltonian construction is a family of techniques that encode discrete evolution into static Hamiltonians by introducing explicit quantum clock degrees of freedom.
• It encompasses paradigms such as Feynman–Kitaev propagation, constraint-based Page–Wootters clocks, and autonomous embeddings, each with unique operator constraints and history state formulations.
• These methods enable efficient quantum simulation by balancing trade-offs in spectral gap, locality, and clock qubit overhead, impacting simulations of time-dependent dynamics.

Discrete clock Hamiltonian construction denotes a family of techniques for encoding discrete evolution into static operators on an enlarged Hilbert space with explicit time degrees of freedom. In the literature, this phrase covers at least three technically distinct architectures: propagation Hamiltonians of Feynman–Kitaev type whose low-energy space is a history state, constraint-based system–clock constructions in the Page–Wootters/Wheeler–DeWitt style, and autonomous time-independent Hamiltonians on system-plus-clock spaces that reproduce time-dependent or discrete dynamics under ordinary Schrödinger evolution (Bausch et al., 2016). A common feature is the replacement of an external time label by a quantum clock basis, but the operator that defines “valid evolution” may be a local frustration-free Hamiltonian, a global translation constraint, or a block-structured generator on a larger space (Boette et al., 2015). For time-dependent simulation, the same idea appears as a finite-dimensional clock embedding in which the original ordered exponential is replaced by evolution under a static Hamiltonian $H_c$ or $H_{\mathrm{tot}}$ on system $\otimes$ clock (Watkins et al., 2022).

1. Formal structure and basic paradigms

The minimal shared object is a history state. In the standard discrete form, one introduces a clock basis $\{|t\rangle\}$ and stores the entire trajectory in a superposition

$$|\Psi\rangle=\frac{1}{\sqrt{N}}\sum_{t=0}^{N-1} |\psi_t\rangle |t\rangle$$

or, in circuit language,

$$|\Psi_{\mathrm{hist}}\rangle=\frac{1}{\sqrt{T+1}}\sum_{t=0}^{T}|t\rangle\otimes (U_t\cdots U_1|\phi_{\mathrm{in}}\rangle).$$

Clock measurement then recovers the conditional system state at the chosen time slice (Boette et al., 2015). In Feynman–Kitaev constructions, this state is singled out as a low-energy or ground state of a propagation Hamiltonian; in Page–Wootters constructions, it is singled out by a translation or Wheeler–DeWitt-type constraint; in autonomous embeddings, it is not a ground state at all, but the clock still supplies the enlarged coordinate along which a static Hamiltonian implements the desired dynamics (Bausch et al., 2016).

Paradigm	Representative operator	Defining feature
Propagation Hamiltonian	$H_{\mathrm{prop}}+H_{\mathrm{in}}+H_{\mathrm{out}}$	Ground state is a history state
Constraint-based clock	$\mathcal U|\Psi\rangle=|\Psi\rangle$ or $\mathcal J|\Psi\rangle=0$	Valid history defined by invariance
Autonomous embedding	$H_c=C(H)-\Delta$ or $H_{\mathrm{tot}}$0	Time-dependent evolution becomes static in larger space

This distinction matters because several common descriptions collapse inequivalent constructions into a single template. A Feynman–Kitaev Hamiltonian is typically an open-chain propagation problem with explicit penalty terms, whereas the finite-dimensional Page–Wootters models emphasized in the discrete-time literature are cyclic and constraint-based. Conversely, time-dependent Hamiltonian simulation via clock embeddings uses the same clock vocabulary while pursuing efficient real-time simulation rather than a history-state ground space (Li et al., 25 Jul 2025).

2. Propagation Hamiltonians and explicit clock encodings

The standard circuit-to-Hamiltonian construction acts on $H_{\mathrm{tot}}$1, with the clock register spanned by $H_{\mathrm{tot}}$2 and propagation enforced by nearest-neighbor terms along the clock line. After conjugating away the circuit unitaries, the propagation part reduces to a purely clock Hamiltonian $H_{\mathrm{tot}}$3, so the spectral problem becomes one of a tridiagonal path operator (Bausch et al., 2016). In more general “standard-form” constructions, this clean line survives only after restricting to valid connected clock sectors and adding legality penalties $H_{\mathrm{tot}}$4 together with possibly extended initialization penalties over an interval of early times; the low-energy reduction is then a penalized quantum walk on a line (Watson, 2019).

The simplest physical clock encodings are unary/domain-wall and pulse clocks. Unary/domain-wall clocks encode time by a domain wall in a chain, while pulse clocks use a single excitation moving along a line. Both reduce to the same path-graph spectral problem inside the legal sector, but locality and spectral properties differ. The unary/domain-wall realization gives 3-local clock terms, whereas the tuned pulse-clock realization achieves 2-local nearest-neighbor clock terms at the cost of a reduced gap, with the unique one-excitation ground state separated by $H_{\mathrm{tot}}$5 (Caha et al., 2017). The same line-clock language extends to endpoint-biased clocks and idling clocks; the latter enlarge the legal clock space so that a large fraction of the ground-state weight lies on “computation completed” states while preserving $H_{\mathrm{tot}}$6 gap scaling for polynomial idling overhead (Caha et al., 2017).

Weighted line clocks generalize the uniform history state by allowing arbitrary target distributions $H_{\mathrm{tot}}$7 on the clock line. A Metropolis-chain construction yields tridiagonal, stoquastic, frustration-free clock Hamiltonians whose ground-state amplitudes are $H_{\mathrm{tot}}$8, making it possible to obtain constant output probability for adiabatic readout without extra clock qubits (Bausch et al., 2016). A different direction compresses the clock register itself: a size-preserving circuit-to-Hamiltonian construction combines a Johnson-graph constant-weight clock with a unary “bouncing” clock and encodes a $H_{\mathrm{tot}}$9-time circuit on $\otimes$0 qubits into a $\otimes$1-local Hamiltonian on $\otimes$2 qubits, recovering a 3-local Hamiltonian with $\otimes$3 clock qubits at $\otimes$4 (Chia et al., 16 Feb 2026).

The global-clock line is not the only propagation geometry. A space-time circuit-to-Hamiltonian construction assigns one local clock to each circuit qubit, so legal time configurations become causally consistent local-time assignments rather than a single scalar $\otimes$5. For 1D nearest-neighbor circuits with circular time, the legal configurations form closed strings on a torus, and the propagation Hamiltonian becomes the Laplacian of that legal-configuration graph; the analysis reduces to Heisenberg-chain and Markov-chain techniques, yielding a polynomial gap lower bound (Breuckmann et al., 2013). A related 2D realization implements the same space-time clock by a connected string of hopping particles on a rotated grid, using only simple $\otimes$6 and $\otimes$7-type interactions after dual-rail encoding; after projection to the legal string sector, the effective Hamiltonian is a quantum walk on legal string configurations and is unitarily related to XY/XXZ chains (Lloyd et al., 2015).

Propagation Hamiltonians also extend beyond closed-system unitary evolution. An open-system version of Feynman’s clock replaces a single Hermitian history Hamiltonian by an ensemble of non-Hermitian clock Hamiltonians whose ground states encode stochastic quantum trajectories of a Lindblad evolution; ensemble averaging over the trajectory-history states reconstructs the density matrix (Tempel et al., 2014).

3. Constraint-based discrete clocks and relational time

A distinct line of work formulates discrete time through a finite clock Hilbert space and a global translation constraint rather than a sum of local propagation penalties. In the finite-dimensional Page–Wootters model, the basic state is again

$\otimes$8

but the defining operator is the joint translation

$\otimes$9

with cyclic identification $\{|t\rangle\}$0. Valid histories satisfy

$\{|t\rangle\}$1

or equivalently, if $\{|t\rangle\}$2,

$\{|t\rangle\}$3

This is explicitly presented as a discrete counterpart of a Wheeler–DeWitt equation (Boette et al., 2015).

For constant step evolution $\{|t\rangle\}$4, the construction becomes especially transparent. The same work shows that when $\{|t\rangle\}$5, evolution across $\{|t\rangle\}$6 time steps can be prepared with $\{|t\rangle\}$7 time qubits, $\{|t\rangle\}$8 Hadamards, and $\{|t\rangle\}$9 controlled powers $$|\Psi\rangle=\frac{1}{\sqrt{N}}\sum_{t=0}^{N-1} |\psi_t\rangle |t\rangle$$0. In the cyclic case $$|\Psi\rangle=\frac{1}{\sqrt{N}}\sum_{t=0}^{N-1} |\psi_t\rangle |t\rangle$$1, the generator factorizes as

$$|\Psi\rangle=\frac{1}{\sqrt{N}}\sum_{t=0}^{N-1} |\psi_t\rangle |t\rangle$$2

which is the exact discrete analogue of the continuum $$|\Psi\rangle=\frac{1}{\sqrt{N}}\sum_{t=0}^{N-1} |\psi_t\rangle |t\rangle$$3 constraint. The same framework introduces system-time entanglement as a quantitative measure of distinguishable evolution, vanishing for stationary states, reaching $$|\Psi\rangle=\frac{1}{\sqrt{N}}\sum_{t=0}^{N-1} |\psi_t\rangle |t\rangle$$4 for a sequence of orthogonal visited states, and obeying an entropic energy-time uncertainty relation in the equally spaced cyclic spectrum case (Boette et al., 2015).

A further structural result is that any finite-dimensional discrete history state can be rewritten, for a fixed initial state, in a special clock basis in which the conditional system states evolve under a constant Hamiltonian $$|\Psi\rangle=\frac{1}{\sqrt{N}}\sum_{t=0}^{N-1} |\psi_t\rangle |t\rangle$$5. The construction proceeds through the Schmidt decomposition and a discrete Fourier transform of the Schmidt clock states, leading to

$$|\Psi\rangle=\frac{1}{\sqrt{N}}\sum_{t=0}^{N-1} |\psi_t\rangle |t\rangle$$6

in the new basis (Boette et al., 2018). This shows that a broad class of discrete system–clock states admits an effective constant-$$|\Psi\rangle=\frac{1}{\sqrt{N}}\sum_{t=0}^{N-1} |\psi_t\rangle |t\rangle$$7 description, but only state-dependently; the result does not identify a universal state-independent Hamiltonian reproducing the original time-dependent propagators on the full system Hilbert space.

The same relational framework also has a sharp nonuniqueness problem. For ideal discrete clocks with $$|\Psi\rangle=\frac{1}{\sqrt{N}}\sum_{t=0}^{N-1} |\psi_t\rangle |t\rangle$$8, clock basis $$|\Psi\rangle=\frac{1}{\sqrt{N}}\sum_{t=0}^{N-1} |\psi_t\rangle |t\rangle$$9, shift $$|\Psi_{\mathrm{hist}}\rangle=\frac{1}{\sqrt{T+1}}\sum_{t=0}^{T}|t\rangle\otimes (U_t\cdots U_1|\phi_{\mathrm{in}}\rangle).$$0, and total step operator $$|\Psi_{\mathrm{hist}}\rangle=\frac{1}{\sqrt{T+1}}\sum_{t=0}^{T}|t\rangle\otimes (U_t\cdots U_1|\phi_{\mathrm{in}}\rangle).$$1, the stronger ambiguity theorem states that any two ideal discrete Page–Wootters systems with equal rest-space dimension are unitarily equivalent, both at the level of histories and at the level of the effective noninteracting laws (Stoica, 23 Apr 2026). The same paper argues that requiring noninteraction between clock and system does not remove this ambiguity, and that physically meaningful observables must supply additional structure beyond the bare tensor-product decomposition.

4. Autonomous enlarged-space clocks and exact generator constructions

A third paradigm uses clock degrees of freedom to convert nonautonomous dynamics into autonomous dynamics on a larger space. For time-dependent Hamiltonian simulation, a finite periodic clock with basis $$|\Psi_{\mathrm{hist}}\rangle=\frac{1}{\sqrt{T+1}}\sum_{t=0}^{T}|t\rangle\otimes (U_t\cdots U_1|\phi_{\mathrm{in}}\rangle).$$2 and discrete times $$|\Psi_{\mathrm{hist}}\rangle=\frac{1}{\sqrt{T+1}}\sum_{t=0}^{T}|t\rangle\otimes (U_t\cdots U_1|\phi_{\mathrm{in}}\rangle).$$3 supports the static Hamiltonian

$$|\Psi_{\mathrm{hist}}\rangle=\frac{1}{\sqrt{T+1}}\sum_{t=0}^{T}|t\rangle\otimes (U_t\cdots U_1|\phi_{\mathrm{in}}\rangle).$$4

where $$|\Psi_{\mathrm{hist}}\rangle=\frac{1}{\sqrt{T+1}}\sum_{t=0}^{T}|t\rangle\otimes (U_t\cdots U_1|\phi_{\mathrm{in}}\rangle).$$5 is a symmetric finite-difference clock-translation generator. A Gaussian clock packet is used instead of a sharp clock basis state, and the paper proves that evolving under $$|\Psi_{\mathrm{hist}}\rangle=\frac{1}{\sqrt{T+1}}\sum_{t=0}^{T}|t\rangle\otimes (U_t\cdots U_1|\phi_{\mathrm{in}}\rangle).$$6 reproduces the desired time-ordered propagator on the system after tracing out the clock, up to explicitly bounded discretization and packet-shape errors (Watkins et al., 2022).

A later discrete-clock algorithm uses the cyclic increment $$|\Psi_{\mathrm{hist}}\rangle=\frac{1}{\sqrt{T+1}}\sum_{t=0}^{T}|t\rangle\otimes (U_t\cdots U_1|\phi_{\mathrm{in}}\rangle).$$7 and defines $$|\Psi_{\mathrm{hist}}\rangle=\frac{1}{\sqrt{T+1}}\sum_{t=0}^{T}|t\rangle\otimes (U_t\cdots U_1|\phi_{\mathrm{in}}\rangle).$$8 by $$|\Psi_{\mathrm{hist}}\rangle=\frac{1}{\sqrt{T+1}}\sum_{t=0}^{T}|t\rangle\otimes (U_t\cdots U_1|\phi_{\mathrm{in}}\rangle).$$9, together with

$H_{\mathrm{prop}}+H_{\mathrm{in}}+H_{\mathrm{out}}$0

The main obstacle is the large norm of the clock Hamiltonian, but the algorithm avoids direct simulation of the full norm by separating the Fourier-diagonal clock part $H_{\mathrm{prop}}+H_{\mathrm{in}}+H_{\mathrm{out}}$1 from the transformed system part $H_{\mathrm{prop}}+H_{\mathrm{in}}+H_{\mathrm{out}}$2, then applying Duhamel’s principle and Gaussian quadrature. The resulting query complexity is

$H_{\mathrm{prop}}+H_{\mathrm{in}}+H_{\mathrm{out}}$3

with corresponding gate and ancilla bounds stated explicitly in the paper (Li et al., 25 Jul 2025). This construction shows that a discrete clock Hamiltonian can match state-of-the-art time-dependent simulation complexity while remaining conceptually close to an autonomous system-plus-clock model.

Not every embedding of discrete evolution into Hamiltonian language uses an explicit clock register. For one-dimensional coined discrete-time quantum walks, there exists a bounded self-adjoint generator $H_{\mathrm{prop}}+H_{\mathrm{in}}+H_{\mathrm{out}}$4 such that

$H_{\mathrm{prop}}+H_{\mathrm{in}}+H_{\mathrm{out}}$5

The construction is exact and uses no enlarged clock space; its square becomes a scalar lattice operator, facilitating comparison with continuous-time quantum walks (Tate, 2013). This is relevant mainly as a contrast: it answers the stroboscopic-embedding question rather than the history-state or propagation-constraint question.

An even more minimal time-lattice viewpoint appears in discrete Hamiltonian cellular automata. There the step label $H_{\mathrm{prop}}+H_{\mathrm{in}}+H_{\mathrm{out}}$6 acts as a discrete clock coordinate, and consistency of the integer-valued action principle forces quadratic Hamiltonians and linear evolution. In complex notation, the discrete equation

$H_{\mathrm{prop}}+H_{\mathrm{in}}+H_{\mathrm{out}}$7

maps invertibly, via Shannon sampling, to a bandlimited modified Schrödinger equation

$H_{\mathrm{prop}}+H_{\mathrm{in}}+H_{\mathrm{out}}$8

with a fundamental scale $H_{\mathrm{prop}}+H_{\mathrm{in}}+H_{\mathrm{out}}$9 and a modified stationary-state dispersion relation (Elze, 2014). This is not a Feynman–Kitaev construction, but it provides a discrete Hamiltonian time-chain formalism in which the clock is a physical lattice in time rather than an auxiliary computational register.

5. Spectral theory, locality, and resource tradeoffs

Spectral analysis of line clocks remains central because many more elaborate constructions reduce to path Hamiltonians after restricting to a legal sector. A particularly useful family is

$\mathcal U|\Psi\rangle=|\Psi\rangle$0

where endpoint terms determine whether low-energy modes are extended trigonometric states or exponentially localized hyperbolic states. Exact quantization conditions show that for $\mathcal U|\Psi\rangle=|\Psi\rangle$1 the gap remains $\mathcal U|\Psi\rangle=|\Psi\rangle$2, while sufficiently strong endpoint attraction produces localized boundary states and can yield constant spectral gaps. In particular, the biased clock

$\mathcal U|\Psi\rangle=|\Psi\rangle$3

has ground state $\mathcal U|\Psi\rangle=|\Psi\rangle$4 and constant gap for fixed $\mathcal U|\Psi\rangle=|\Psi\rangle$5 (Caha et al., 2017). The same paper uses sharper path-spectrum analysis to improve the promise-gap scaling in Kitaev’s Local Hamiltonian reduction to $\mathcal U|\Psi\rangle=|\Psi\rangle$6.

For modified line clocks with arbitrary bounded tridiagonal coefficients, there is also a hard asymptotic limitation. If $\mathcal U|\Psi\rangle=|\Psi\rangle$7 is tridiagonal and $\mathcal U|\Psi\rangle=|\Psi\rangle$8 its ground state, then

$\mathcal U|\Psi\rangle=|\Psi\rangle$9

This shows that endpoint overlap and spectral gap cannot both asymptotically beat the familiar $\mathcal J|\Psi\rangle=0$0 scale. The same analysis proves that weighted-history clocks can realize arbitrary target distributions while staying stoquastic and frustration-free, and that the standard Feynman–Kitaev Hamiltonian already saturates the asymptotically relevant UNSAT penalty scale with $\mathcal J|\Psi\rangle=0$1, despite the weaker $\mathcal J|\Psi\rangle=0$2 bound produced by older geometric-lemma arguments (Bausch et al., 2016).

Standard-form clocks with dynamic initialization lead to the same path-Laplacian picture after decomposing into invariant legal sectors, but now with penalties that may appear at interior as well as endpoint positions. Exact and exponentially tight energy bounds can still be obtained. In the exact rejecting case, the effective line Hamiltonian has ground energy

$\mathcal J|\Psi\rangle=0$3

and for constant rejection probability $\mathcal J|\Psi\rangle=0$4 the improved upper bound on yes-instance energy scales as $\mathcal J|\Psi\rangle=0$5, not merely $\mathcal J|\Psi\rangle=0$6 (Watson, 2019). These results clarify that many nonstandard local clock encodings remain governed by a universal penalized-line spectral theory once the legal clock sector is isolated.

Clock compression, locality reduction, and output-amplification typically compete. The size-preserving Johnson-graph construction achieves the explicit tradeoff “$\mathcal J|\Psi\rangle=0$7-locality versus $\mathcal J|\Psi\rangle=0$8 clock qubits,” interpolating between unary and more compact clocks (Chia et al., 16 Feb 2026). Idling chains boost final-time success probability with only logarithmic clock overhead and no asymptotic loss beyond $\mathcal J|\Psi\rangle=0$9 gap scaling, whereas tuned pulse clocks improve locality to 2-local nearest-neighbor form but reduce the guaranteed gap to $H_c=C(H)-\Delta$0 (Caha et al., 2017). Space-time local clocks preserve circuit geometry but typically worsen locality in qubit implementations; in the explicit 1D local-clock construction, the gap on valid time configurations scales as

$H_c=C(H)-\Delta$1

reflecting diffusion on the legal-configuration manifold rather than on a single clock line (Breuckmann et al., 2013).

6. Scope, limitations, and adjacent notions

One recurrent misconception is that any “clock Hamiltonian” is a local Feynman–Kitaev Hamiltonian. The literature does not support that identification. Page–Wootters constructions may be cyclic, global, and constraint-based rather than open-boundary and frustration-free in the local-projector sense (Stoica, 23 Apr 2026). Exact generators of discrete updates may exist directly on the original Hilbert space without any explicit clock register, as in the one-dimensional quantum-walk logarithm $H_c=C(H)-\Delta$2, but those generators can be nonlocal even when bounded and self-adjoint (Tate, 2013). Time-dependent simulation clocks are again different: they are autonomous enlarged-space Hamiltonians used for real-time evolution, not ground-state encodings (Li et al., 25 Jul 2025).

Open-system and clock-observable approaches introduce further caveats. The open-system Feynman clock for Lindblad dynamics requires an ensemble of non-Hermitian clock Hamiltonians, and in the exact stochastic formulation the Hamiltonian depends on the trajectory and becomes a nonlinear eigenvalue problem (Tempel et al., 2014). Characteristic time operators for semibounded discrete Hamiltonians provide yet another notion of a quantum clock: a bounded self-adjoint $H_c=C(H)-\Delta$3 constructed from spectral data,

$H_c=C(H)-\Delta$4

which satisfies the canonical relation only on a dense canonical domain and only exactly at a time-invariant set $H_c=C(H)-\Delta$5 of measure zero, with operational clock behavior only in neighborhoods of $H_c=C(H)-\Delta$6 (Farrales et al., 2024). This suggests a sharp distinction between “clock as propagation register” and “clock as observable conjugate to a Hamiltonian.”

The broad landscape therefore separates into three questions that are often conflated. One question asks how to encode a discrete computation or trajectory into a static Hamiltonian ground space. A second asks how to formulate relational or constraint-based time using finite clocks. A third asks when discrete or time-dependent updates can be embedded into ordinary autonomous Hamiltonian dynamics. Discrete clock Hamiltonian construction, in its current technical usage, spans all three. The main structural invariants across the literature are the replacement of external time by a quantum degree of freedom, the locality or legality structure imposed on clock states, and the resulting tradeoffs among spectral gap, locality, clock size, endpoint weight, and interpretational uniqueness (Boette et al., 2015).