Abstract. We present a validated computational testbed for studying product-formula errorin a lattice gauge theory. For the lattice Schwinger model (1+1D QED, Kogut–Susskindstaggered fermions, gauge field eliminated via Gauss’s law) we construct three references —exact diagonalization, classical second-order Trotter evolution, and a gate-level Qiskit circuit— and cross-check them against each other and against published conventions. The firsttwo are independent; the second and third share the Hamiltonian construction and Paulidecomposition, so their agreement verifies the gate decomposition and circuit implementationrather than the physics, which is validated against the exact solution instead. The gate-levelcircuit reproduces the classical Trotter propagator to 7.6×10−14 after accumulated repetitions,so that the residual difference from exact evolution isolates the physical Trotter error cleanly;the Hamiltonian is verified term-by-term against Nguyen et al., and the Pauli decompositionagainst direct matrix construction, in both cases to machine precision.We then demonstrate the testbed on three questions from the existing literature. First, thecommutator-scaling bound of Childs et al. (2021), evaluated with prefactors derived numerically rather than assumed, overestimates the measured operator-norm error by a factor between1.5 and 6.8 across nine parameter points (median 2.0), rising with system size and coupling;at the reference point the ratio is 1.74, constant to three significant figures over the testedrange ∆t ∈ [1/512, 1/16]. Second, operator-norm, state, and observable errors all give fittedexponents statistically consistent with p = 2 but markedly different prefactors; we introduce anormalisation-independent gap factor G to quantify this, finding G numerically constant overthe tested ∆t range and increasing across the four accessible system sizes. We show that thisgrowth reflects the growth of the state error while the local-observable error stays constantto five significant figures — the local-versus-global robustness established by Heyl, Hauke andZoller (2019), for which we claim no priority. Third, the ordering heuristics of Tranter et al.(2019), established on 44 molecular Hamiltonians, reproduce all four of their reported trendsat the parameter point tested here — the fourth in sharpened form, the norm-based estimatorranking orderings slightly backwards (ρ = −0.292) rather than merely failing to rank them.The contribution is the validated testbed and its convention bookkeeping rather than newtheory: all three demonstrations are measurements of known results, and in the case of theobservable gap, a re-derivation of a known result in a different language. Reference [5] studiesthe same model with the same decomposition and initial state, using a first-order formula inthe long-time limit; the present work uses the second-order symmetric formula at short timeand compares against the 2021 commutator-scaling bound, which postdates that study. Codefor all reported figures and tables is provided.
Abstract. We present a validated computational testbed for studying product-formula errorin a lattice gauge theory. For the lattice Schwinger model (1+1D QED, Kogut–Susskindstaggered fermions, gauge field eliminated via Gauss’s law) we construct three references —exact diagonalization, classical second-order Trotter evolution, and a gate-level Qiskit circuit— and cross-check them against each other and against published conventions. The firsttwo are independent; the second and third share the Hamiltonian construction and Paulidecomposition, so their agreement verifies the gate decomposition and circuit implementationrather than the physics, which is validated against the exact solution instead. The gate-levelcircuit reproduces the classical Trotter propagator to 7.6×10−14 after accumulated repetitions,so that the residual difference from exact evolution isolates the physical Trotter error cleanly;the Hamiltonian is verified term-by-term against Nguyen et al., and the Pauli decompositionagainst direct matrix construction, in both cases to machine precision.We then demonstrate the testbed on three questions from the existing literature. First, thecommutator-scaling bound of Childs et al. (2021), evaluated with prefactors derived numerically rather than assumed, overestimates the measured operator-norm error by a factor between1.5 and 6.8 across nine parameter points (median 2.0), rising with system size and coupling;at the reference point the ratio is 1.74, constant to three significant figures over the testedrange ∆t ∈ [1/512, 1/16]. Second, operator-norm, state, and observable errors all give fittedexponents statistically consistent with p = 2 but markedly different prefactors; we introduce anormalisation-independent gap factor G to quantify this, finding G numerically constant overthe tested ∆t range and increasing across the four accessible system sizes. We show that thisgrowth reflects the growth of the state error while the local-observable error stays constantto five significant figures — the local-versus-global robustness established by Heyl, Hauke andZoller (2019), for which we claim no priority. Third, the ordering heuristics of Tranter et al.(2019), established on 44 molecular Hamiltonians, reproduce all four of their reported trendsat the parameter point tested here — the fourth in sharpened form, the norm-based estimatorranking orderings slightly backwards (ρ = −0.292) rather than merely failing to rank them.The contribution is the validated testbed and its convention bookkeeping rather than newtheory: all three demonstrations are measurements of known results, and in the case of theobservable gap, a re-derivation of a known result in a different language. Reference [5] studiesthe same model with the same decomposition and initial state, using a first-order formula inthe long-time limit; the present work uses the second-order symmetric formula at short timeand compares against the 2021 commutator-scaling bound, which postdates that study. Codefor all reported figures and tables is provided.
Quantum simulation of lattice gauge theories offers a path to first-principles calculations of real-time dynamics and finite-density phenomena that are inaccessible to classical Euclidean Monte Carlo methods. Realizing this potential requires a pipeline of controlled approximations---lattice discretization, truncation, digitization, state preparation, time evolution, measurement, and continuum extrapolation---each contributing errors and computational costs. General algorithmic asymptotic complexity arguments capture only part of the cost picture: the practical resources required for end-to-end simulation depend on numerical pre-factors, the cost of the subroutines that various algorithms call, and structural features of the lattice theory, all of which the asymptotic scaling leaves unspecified. This thesis develops contributions that aim to make such dependencies explicit and quantitative. We begin with a rigorous analysis of the asymptotic gate complexity of product formulas and Quantum Signal Processing (QSP) for the time evolution of general classes of lattice Hamiltonians, identifying the parameter regimes in which each method is favorable and estimating the associated pre-factors numerically. Since the cost of QSP-based simulation is dominated (in regimes of practical interest) by the block-encoding subroutine it calls, we also develop several novel block-encoding constructions tailored to bosonic lattice field theories and show that signal-processing techniques can be repurposed as highly efficient block-encoding subroutines. We then turn to the problem of truncating the Kogut--Susskind electric-field Hilbert space. Existing error bounds rely on energy-conservation arguments and require the truncation to grow with simulation time. By exploiting Hilbert space fragmentation we derive the tightest error bounds known to date: they decay factorially in the truncation parameter and are independent of simulation time. We validate them numerically for U(1) pure gauge theory and the Schwinger model. Finally, we address the continuum limit in the presence of approximate time evolution. For product formulas, we show that Trotter errors correspond to irrelevant operators that vanish in the continuum limit, which yields a renormalization trajectory independent of the Trotter step size. More generally, we introduce the Statistically-Bounded Time Evolution (SBTE) protocol, an algorithm-independent framework that treats approximation errors as a systematic uncertainty to be driven below the working statistical precision. This decouples the continuum-limit prescription from the choice of time-evolution algorithm and provides a basis for end-to-end cost comparisons across simulation methods.
Trotter product formulas are a leading approach for Hamiltonian simulation on quantum computers, yet their practical performance has remained difficult to assess due to the challenge of accurately estimating the Trotter error. In this work, we develop new theoretical results, algorithms, and software tools that advance the state-of-the-art in Trotter error estimation by orders of magnitude in both scale and accuracy. On the theoretical side, we prove that in the asymptotic limit the error of a product formula depends on the diagonal elements of the Baker-Campbell-Hausdorff (BCH) error operator in the eigenbasis of the Hamiltonian, rather than its full spectral norm -- yielding an improved scaling for Hamiltonian simulation using product formulas. On the algorithmic side, we introduce a compact representation of the BCH expansion that reduces the number of commutators from O(n3) to O(n) for second-order, and from O(n5) to O(n2) for fourth-order formulas on n fragments, complemented by an importance sampling scheme to further reduce the computational cost. We provide implementations of these techniques in software and demonstrate their power on two applications: (i) X-ray absorption spectroscopy of an electronic Hamiltonian (Li4Mn2O) at up to 56 qubits using tensor networks; and (ii) vibronic dynamics of naphthalene at over 100 qubits using ML-MCTDH, where we find that naive analytical bounds overestimate the required number of Trotter steps by nearly five orders of magnitude. Our framework enables, for the first time, the accurate estimation of Trotter error at practically relevant system sizes, providing a foundation for fair algorithmic comparisons and rational design of product formulas.
The Schwinger model (quantum electrodynamics in 1+1 dimensions) is a testbed for the study of quantum gauge field theories. We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In particular, we perform a tight analysis of low-order Trotter formula simulations of the Schwinger model, using recently derived commutator bounds, and give upper bounds on the resources needed for simulations in both scenarios. In lattice units, we find a Schwinger model on N / 2 physical sites with coupling constant x − 1 / 2 and electric field cutoff x − 1 / 2 Λ can be simulated on a quantum computer for time 2 x T using a number of T -gates or CNOTs in O ~ ( N 3 / 2 T 3 / 2 x Λ ) for fixed operator error. This scaling with the truncation Λ is better than that expected from algorithms such as qubitization or QDRIFT. Furthermore, we give scalable measurement schemes and algorithms to estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable–the mean pair density. Finally, we bound the root-mean-square error in estimating this observable via simulation as a function of the diamond distance between the ideal and actual CNOT channels. This work provides a rigorous analysis of simulating the Schwinger model, while also providing benchmarks against which subsequent simulation algorithms can be tested.
We derive higher-order error bounds with small prefactors for a general Trotter product formula, generalizing a result given by Childs et al. [Phys. Rev. X 11, 011020 (2021)]. We then apply these bounds to the real-time quantum time evolution operator governed by the Fermi-Hubbard Hamiltonian on one-dimensional and two-dimensional square and triangular lattices. The main technical contribution of our work is a symbolic evaluation of nested commutators between hopping and interaction terms for a given lattice geometry. The calculations result in explicit expressions for the error bounds in terms of the time step and Hamiltonian coefficients. Comparison with the actual Trotter error (evaluated on a small system) indicates that the bounds still overestimate the error.
The product formula, commonly known as Trotter decomposition, is a central tool for digital quantum simulation, whose performance depends critically on how the Hamiltonian is partitioned into tractable blocks. Standard decompositions typically rely on direct commutativity among Hamiltonian terms in a chosen operator representation, which can lead to large residual errors and deep circuits for complex, practically relevant many-body quantum systems. We address this fundamental bottleneck by introducing a new decomposition principle that goes beyond commutativity, grouping Hamiltonian terms into local three-site clusters according to the underlying SU(2) symmetry of the local dynamics. We show that three-site generators fall into at most four SU(2)-symmetry classes, each admitting an effective two-qubit SU(4) representation with exact and efficient implementations. By reducing the number of clusters, this decomposition principle substantially suppresses commutator-induced errors and circuit overhead while preserving underlying physical structures that commutativity-based decompositions may violate. We demonstrate the proposed method on several physically relevant spin-lattice models, where the reduced cluster structure can even realise the second-order product formula without doubling the circuit depth, as would be required by conventional decompositions. Numerical simulations of a Kagome Heisenberg model with triangular spin-chirality interactions show that the proposed method reduces both state infidelity and average spin-chirality bias by more than three orders of magnitude compared with conventional decompositions, while using substantially fewer gates. These results establish local symmetry as a flexible and practical design principle for product-formula simulation, opening a route to more accurate and hardware-efficient simulations of broader classes of many-body systems.
Abstract We develop Ω TRINITAS ENGINE v6, a mathematical and computational framework for constraint-preserving projected unitary dynamics, with particular emphasis on invariant physical subspaces, gauge-constraint leakage, local unitary evolution, and reproducible Hamiltonian lattice gauge theory. The central problem is to distinguish approximation error in discrete or product-formula time evolution from genuine violation of a prescribed physical constraint. For an orthogonal projector P defining the physical subspace and a unitary evolution U, the framework quantifies constraint leakage through ||(I-P)UP|| and establishes the exact identity ||PUx||^2 = ||x||^2 - ||(I-P)Ux||^2 for physical initial states. In finite-dimensional Hilbert spaces, exact preservation of the physical subspace is characterized by invariance under U, equivalently by vanishing leakage. For products of local unitaries, leakage admits an additive bound in terms of the individual factors, while Hamiltonian-generated evolution is controlled through commutators between the projector and the local generators. In particular, when every local Hamiltonian term preserves the Gauss-law physical subspace, finite-depth product-formula dynamics can preserve the gauge constraint exactly even when the approximation to the target continuous-time evolution remains imperfect. We investigate these results computationally using an explicitly constructed gauge-enriched successor model based on the 1+1-dimensional U(1) lattice Schwinger model with staggered fermions, periodic boundary conditions, finite electric-flux truncation, and Gauss-law reduction. Independent constructions of the physical basis and Hamiltonian agree exactly in the audited finite systems, with zero matrix and spectral discrepancies and no detected Gauss-violating hopping transitions. A symmetric local product formula exhibits approximately third-order single-step error and second-order fixed-time convergence while maintaining numerical unitarity near machine precision. Sparse low-energy calculations at fixed physical volume reproduce the massless Schwinger rest-gap benchmark: an even-power continuum extrapolation gives 0.5642377786 in units of the gauge coupling, compared with the exact continuum value 1/sqrt(pi) = 0.5641895835. In the representative electric-flux cutoff test, variations are below the reported numerical resolution. Momentum-resolved T2 sectors further reproduce the expected relativistic dispersion with strong numerical agreement at the lowest momenta and a larger, explicitly retained deviation at higher momentum. The numerical analysis constitutes finite-regulator calibration and continuum extrapolation rather than certification of a controlled continuum limit. Systematic uncertainties associated with fit family, fit range, finite physical volume, regulator ordering, and higher-momentum behavior remain distinct from the proved constraint-preservation results. This separation prevents numerical agreement with a known continuum theory from being promoted to a stronger mathematical or physical claim. The work explicitly distinguishes mathematical proof, finite computational verification, numerical observation, calibration, and physical interpretation. Agreement with the Schwinger model is treated as a nontrivial calibration of the gauge-enriched successor construction, not as a derivation of gauge theory from canonical Ω TRINITAS dynamics. The manuscript does not establish endogenous U(1) gauge emergence from canonical Ω TRINITAS v9 and does not claim correspondence between Ω TRINITAS and the microscopic dynamics of the actual universe. Negative results, failed constructions, limitations, and unresolved questions are retained as part of the epistemic record. Ω TRINITAS ENGINE v6 therefore provides a reproducible reference framework for projected quantum dynamics, invariant subspaces, Gauss-law preservation, constraint leakage, Hamiltonian lattice gauge theory, local unitary circuits, Trotter and product-formula evolution, sparse exact diagonalization, electric-flux truncation, continuum extrapolation, and momentum-sector spectroscopy. The canonical reference implementation and machine-readable numerical results are designed to preserve a strict distinction between proved statements, computationally verified finite cases, numerical evidence, open problems, and unsupported physical correspondence, providing an auditable foundation for subsequent mathematical and computational investigations.