We show that qubit Hamiltonians derived from spectral graph theory lattices exhibit structurally favorable Pauli decompositions for quantum simulation. After Jordan–Wigner transformation, the GeoVac lattice Hamiltonian yields
O(Q3.15) Pauli string terms in the number of qubits
Q, compared to
O(Q4+) for conventional Gaussian-basis Hamiltonians (our own log-log fit of the published Pauli counts of Trenev et al. [ref] gives
Q4.25 for LiH and
Q3.92 for H
2O, spanning
Q3.9–
Q4.3). The advantage originates in angular momentum selection rules—enforced by Gaunt integrals at the two-electron integral level—which cause the electron repulsion integral (ERI) tensor density to decay as
∼1/M (empirically
≈M−0.85–
M−1) with the number of spatial orbitals
M, while Gaussian ERI tensors remain near-dense at
O(1). Beyond term counts, we quantify two operationally relevant cost metrics: the number of qubitwise-commuting (QWC) measurement groups scales as
O(Q3.36), and the Pauli 1-norm
λ=∑i∣ci∣—which controls both Trotter step counts and qubitization query complexity—scales as
O(Q1.69) with
R2=0.997. The sub-quadratic 1-norm scaling is the key result for fault-tolerant simulation: it implies that Trotter circuit depth grows far more slowly with system size than term counts alone would suggest. All Gaussian baselines are validated against published integral values (Szabo and Ostlund for H
2; analytical STO for He). For composed multi-center systems, the pseudopotential approximation of the composed natural geometry framework [ref] yields block-diagonal electron repulsion integrals with a universal Pauli scaling of
O(Q2.5), independent of molecular topology (exponent spread
0.02 across three molecules). At equal qubit counts, this represents two or more orders of magnitude fewer Pauli terms than Gaussian baselines (published counts of Trenev et al. [ref],
Q3.9–
Q4.3 span fitted by us)—an advantage that grows with system size due to the
∼1.5 exponent gap. These comparisons are at matched qubit counts, not matched accuracy; the composed basis carries classical equilibrium-geometry errors of 5–26% (LiH/BeH
2/H
2O; Sec. (ref)), making the framework optimal for fixed-geometry quantum simulation rather than geometry optimisation. Across the composed molecular library (35 molecules spanning
Z=1–56, H through Ba, including the first transition series ScH–ZnH), the composed Pauli count is exactly linear in the qubit count:
NPauli=11.10×Q (exact, non-identity terms;
d-orbital blocks give 9.23). These counts are realized under a pair-diagonal angular approximation (
ma=mc,
mb=md) adopted deliberately for sparsity; the exact global-
ML Coulomb rule (used in the framework's precision-physics paths, and considered but left on the table here) gives
≈2.5× more terms with the same scaling, under which the
d-block coefficient is in fact higher, not lower (Sec. (ref)). GeoVac Paper 14. Part of the GeoVac research corpus (quantum computing group). Code, tests, and the full paper series: https://github.com/jloutey-hash/geovac. Corpus archive DOI: 10.5281/zenodo.20482394. Corpus version at deposit: v4.75.0.
We solve cyclic finite-dimensional quantum histories for arbitrary time-dependent unitary steps, without assuming that one step has finite order. The propagation Hamiltonian is a unitary connection Laplacian on a cycle; its complete gauge invariant is the monodromy
M=UL−1⋯U0. Its spectrum is
λa,k=1−cos((2πk−θa)/L), where
eiθa∈spec(M). Thus the exact history sector is isomorphic to
Fix(M), while frustration, the gap above a nonempty zero-energy sector, the determinant, and the finite-temperature trace are obtained in closed form. Ordinary spectral data recover the multiset of monodromy phase cosines but not phase orientation; low energy certifies proximity to an exact relational history. We then define the predictive quotient of a sharp finite clock relative to an accessible operator system as the unique coarsest event alphabet preserving all conditional statistics on a history sector. A finite-error theorem shows that threshold clustering recovers this quotient when the minimum diamond separation of inequivalent event channels exceeds four times the estimation error, and proves an optimal record-count bound. With full matrix access and homogeneous step
U, the minimal number of clock events is the projective order of
U. We distinguish the normalizer of the clock algebra from transformations preserving the coherent history code and classify oriented exact sharp clock changes by
U(r)×ZL on a rank-
r history sector; without orientation the cyclic factor becomes dihedral. Reversible changes of full-information clock fibers are necessarily unitary, so irreversible coarse-graining is not exact clock covariance. Minimal realizations of a complete history Gram kernel are uniquely unitarily equivalent, with a finite-data Procrustes bound. Independent finite-matrix code verifies the main results.
We prove that generic quantum local Hamiltonians are gapless. In fact, we prove that there is a continuous density of states above the ground state. The Hamiltonian can be on a lattice in any spatial dimension or on a graph with a bounded maximum vertex degree. The type of interactions allowed for include translational invariance in a disorder (i.e., probabilistic) sense with some assumptions on the local distributions. Examples include many-body localization and random spin models. We calculate the scaling of the gap with the system's size when the local terms are distributed according to a Gaussian β orthogonal random matrix ensemble. As a corollary, there exist finite size partitions with respect to which the ground state is arbitrarily close to a product state. When the local eigenvalue distribution is discrete, in addition to the lack of an energy gap in the limit, we prove that the ground state has finite size degeneracies. The proofs are simple and constructive. This work excludes the important class of truly translationally invariant Hamiltonians where the local terms are all equal.
This record freezes the analytical and computer-assisted successor protocol to the HLV Golden Gauge Forge finite-family study. Previous work established an exact golden 6→3 cut-and-project carrier fingerprint, a nested bounded-locality exhaustion, maximum vertex degree 12, maximum edge–face incidence 10, volume-independent positive HLV coefficient bounds, and a strictly positive physical-sector gap for every fixed finite connected complex satisfying the declared hypotheses. A preregistered exact Z3 finite-family study successfully constructed the controlled carrier sequence but did not support the frozen positive volume-uniform-gap candidate. This negative result motivates a locality-based analytical programme rather than further unrestricted enlargement of finite matrices. The primary system is a fixed-lattice Z3 gauge Hamiltonian on a declared class of finite oriented two-complexes with uniformly bounded vertex degree, face incidence, interaction range, and positive electric and magnetic coefficients. The protocol freezes a sequential theorem programme consisting of: an explicit volume-uniform gap for the electric product-state backbone; derivation of system-size-independent locality and interaction constants; a strong-coupling perturbative stability theorem with a volume-independent spectral gap; exponential clustering of spatially separated gauge-invariant observables; a van-Hove/Følner theorem for the canonical HLV origin-connected exhaustion; and, only if these gates are closed, construction of a fixed-cutoff thermodynamic-limit state. The computer-assisted component freezes an eight-radius geometry audit, graph-boundary layers of thickness one to three, radius-two rooted patch-frequency diagnostics, exact local norm and interaction-overlap calculations, a global exact-diagonalization cap at cycle rank 10, independent numerical verification, and complete deterministic replay. HLV carrier specificity is tested against matched controls consisting of uniform weights on the same complex, 50 exact histogram-preserving type-stratified weight permutations, 12 deterministic internal-window phason shifts, and three rational Fibonacci-slope periodic approximants. The protocol explicitly forbids replacing a local perturbation estimate by the global magnetic operator norm, which grows with system size and cannot establish a bulk spectral gap. It also keeps the thermodynamic limit, representation-cutoff removal, and continuum lattice-spacing limit strictly separate. A positive result under this protocol would establish, at most, a fixed-Z3, fixed-lattice strong-coupling theorem for a class of aperiodic bounded-locality gauge complexes and a separate finite test of whether the HLV geometric assignment produces effects not reproduced by matched controls. It would not establish full SU(3) dynamics, representation-cutoff removal, a continuum Yang–Mills theory, or the Yang–Mills existence and mass-gap problem.
Feynman's circuit-to-Hamiltonian construction connects quantum computation and ground states of many-body quantum systems. Kitaev applied this construction to demonstrate QMA-completeness of the local Hamiltonian problem, and Aharanov et al. used it to show the equivalence of adiabatic computation and the quantum circuit model. In this work, we analyze the low energy properties of a class of modified circuit Hamiltonians, which include features like complex weights and branching transitions. For history states with linear clocks and complex weights, we develop a method for modifying the circuit propagation Hamiltonian to implement any desired distribution over the time steps of the circuit in a frustration-free ground state, and show that this can be used to obtain a constant output probability for universal adiabatic computation while retaining the Ω(T−2) scaling of the spectral gap, and without any additional overhead in terms of numbers of qubits.Furthermore, we establish limits on the increase in the ground energy due to input and output penalty terms for modified tridiagonal clocks with non-uniform distributions on the time steps by proving a tight O(T−2) upper bound on the product of the spectral gap and ground state overlap with the endpoints of the computation. Using variational techniques which go beyond the Ω(T−3) scaling that follows from the usual geometrical lemma, we prove that the standard Feynman-Kitaev Hamiltonian already saturates this bound. We review the formalism of unitary labeled graphs which replace the usual linear clock by graphs that allow branching and loops, and we extend the O(T−2) bound from linear clocks to this more general setting. In order to achieve this, we apply Chebyshev polynomials to generalize an upper bound on the spectral gap in terms of the graph diameter to the context of arbitrary Hermitian matrices.