Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

A Validated Quantum-Circuit Testbed for the Lattice Schwinger Model

Moein Sahraei

Published Aug 8, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.5281/zenodo.21854390

Related papers

Quantum Algorithms for Simulating the Lattice Schwinger Model

Alexander F. Shaw, Pavel Lougovski, Jesse R. Stryker +1 more

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.

arXiv:2002.11146•Quantum•Aug 10, 2020•159 citations

Towards Precision Quantum Simulation of Lattice Gauge Theories

Siddharth Hariprakash

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.

•May 1, 2026•0 citations

Exact quantum circuits for a lattice Boltzmann realization of the Dirac equation

Nilesh Sawant, Ethan Young, Kevin Patrick Griffin +1 more

The quantum lattice Boltzmann scheme of Succi and Dellar advances a four-component Dirac spinor on a lattice by a fixed sequence of local, exactly norm-preserving operations: a basis rotation, a collision, a streaming shift, and the inverse rotation. While this correspondence has been noted qualitatively, it has remained unclear whether it can be realized exactly and unitarily as a gate-model quantum circuit. This unitarity is a structural property of the scheme, which should, in principle, enable an operator-by-operator port onto quantum hardware. We give a gate-level construction of every operation of the three-dimensional Dirac QLB scheme: the fixed rotation gates, the collision gate, the streaming shift as a controlled increment on a position register, the position-dependent potential as a phase oracle, and periodic and reflecting boundary conditions as unitary circuits. Together, these constructions provide the first complete demonstration that the scheme is exactly representable in the gate model without any approximation beyond the classical method itself. We then compose them into single-axis, two- and three-dimensional time steps. On a state-vector emulator the resulting circuits reproduce the classical QLB solver to machine precision, thus verifying our quantum implementation. Our aim is representability and correctness rather than computational speedup; questions of state preparation, asymptotic cost, and hardware noise are identified as open avenues for future work. Appendices restore physical units, derive the scheme's Zitterbewegung in closed form and compare it with a trapped-ion simulation, and execute a reduced two-site instance on a Rigetti superconducting processor, where choosing the qubits from the live calibration lowers the state-preparation error. All operators, circuits, and figures are reproducible from the open-source quantumKineticMethods library.

quant-pharXiv:2608.06570•Aug 10, 2026•0 citations

Practical Estimation of Trotter Error for Hamiltonian Simulation

William Maxwell, Pablo A. M. Casares, Robert A. Lang +7 more

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 $\mathcal{O}(n^3)$ to $\mathcal{O}(n)$ for second-order, and from $\mathcal{O}(n^5)$ to $\mathcal{O}(n^2)$ 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 (Li$_4$Mn$_2$O) 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.

quant-pharXiv:2606.30738•Jul 1, 2026•0 citations

Trotter error with commutator scaling for the Fermi-Hubbard model

Ansgar Schubert, Christian B. Mendl

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.

arXiv:2306.10603•Physical review. B./Physical review. B•Nov 3, 2023•11 citations

Real-Time Digital Quantum Simulation of the Schwinger Model under High-Field Laser Quenches for ELI-NP Physics Regimes

Alexandru-Florin Boboc

Overview This repository contains the computational code, simulation scripts, and diagnostic notebooks for simulating the 1+1-dimensional Schwinger model (Quantum Electrodynamics) on a quantum processor emulator. The project investigates real-time vacuum decay and electron-positron pair production under extreme laser electric field quenches, utilizing parameters chosen to align with high-field physics regimes studied at facilities like the Extreme Light Infrastructure - Nuclear Physics (ELI-NP) project. Repository Contents The core material is contained within a self-contained Jupyter Notebook designed as a computational essay that links theoretical derivations directly to code execution. The pipeline covers: Lattice Hamiltonian Construction: Setting up the $N=6$ site Kogut-Susskind staggered fermion model via Jordan-Wigner transformation and native SparsePauliOp arithmetic. Laser Quench Evolution: Implementing a time-dependent Gaussian-envelope oscillating electric field coupled via site-dependent driving operators, evolved using first-order Suzuki-Trotter decomposition (PauliEvolutionGate). NISQ Noise Modeling & ZNE Mitigation: Executing noisy density matrix simulations via Qiskit Aer (AerSimulator) under a standard depolarizing noise model ($\epsilon_{1\text{q}} = 0.002$, $\epsilon_{2\text{q}} = 0.015$), followed by Zero-Noise Extrapolation using scale-factor circuit folding ($sf \in \{1, 3\}$) and linear fitting. Advanced Quantum Diagnostics: Tracking the growth of Von Neumann entanglement entropy across a spatial bipartition as a proxy for string breaking, alongside spatiotemporal heatmaps mapping site-resolved chiral condensate melting ($\langle \bar{\psi}\psi \rangle_i$). Software Requirements & Dependencies To run the simulation and generate the diagnostic figures, the code requires Python along with the following libraries: qiskit qiskit-aer numpy matplotlib

•Oct 31, 2026•0 citations
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.
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.
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.
The quantum lattice Boltzmann scheme of Succi and Dellar advances a four-component Dirac spinor on a lattice by a fixed sequence of local, exactly norm-preserving operations: a basis rotation, a collision, a streaming shift, and the inverse rotation. While this correspondence has been noted qualitatively, it has remained unclear whether it can be realized exactly and unitarily as a gate-model quantum circuit. This unitarity is a structural property of the scheme, which should, in principle, enable an operator-by-operator port onto quantum hardware. We give a gate-level construction of every operation of the three-dimensional Dirac QLB scheme: the fixed rotation gates, the collision gate, the streaming shift as a controlled increment on a position register, the position-dependent potential as a phase oracle, and periodic and reflecting boundary conditions as unitary circuits. Together, these constructions provide the first complete demonstration that the scheme is exactly representable in the gate model without any approximation beyond the classical method itself. We then compose them into single-axis, two- and three-dimensional time steps. On a state-vector emulator the resulting circuits reproduce the classical QLB solver to machine precision, thus verifying our quantum implementation. Our aim is representability and correctness rather than computational speedup; questions of state preparation, asymptotic cost, and hardware noise are identified as open avenues for future work. Appendices restore physical units, derive the scheme's Zitterbewegung in closed form and compare it with a trapped-ion simulation, and execute a reduced two-site instance on a Rigetti superconducting processor, where choosing the qubits from the live calibration lowers the state-preparation error. All operators, circuits, and figures are reproducible from the open-source quantumKineticMethods library.
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)\mathcal{O}(n^3)O(n3) to O(n)\mathcal{O}(n)O(n) for second-order, and from O(n5)\mathcal{O}(n^5)O(n5) to O(n2)\mathcal{O}(n^2)O(n2) for fourth-order formulas on nnn 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 (Li4_44​Mn2_22​O) 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.
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.
Overview This repository contains the computational code, simulation scripts, and diagnostic notebooks for simulating the 1+1-dimensional Schwinger model (Quantum Electrodynamics) on a quantum processor emulator. The project investigates real-time vacuum decay and electron-positron pair production under extreme laser electric field quenches, utilizing parameters chosen to align with high-field physics regimes studied at facilities like the Extreme Light Infrastructure - Nuclear Physics (ELI-NP) project. Repository Contents The core material is contained within a self-contained Jupyter Notebook designed as a computational essay that links theoretical derivations directly to code execution. The pipeline covers: Lattice Hamiltonian Construction: Setting up the N=6N=6N=6 site Kogut-Susskind staggered fermion model via Jordan-Wigner transformation and native SparsePauliOp arithmetic. Laser Quench Evolution: Implementing a time-dependent Gaussian-envelope oscillating electric field coupled via site-dependent driving operators, evolved using first-order Suzuki-Trotter decomposition (PauliEvolutionGate). NISQ Noise Modeling & ZNE Mitigation: Executing noisy density matrix simulations via Qiskit Aer (AerSimulator) under a standard depolarizing noise model (ϵ1q=0.002\epsilon_{1\text{q}} = 0.002ϵ1q​=0.002, ϵ2q=0.015\epsilon_{2\text{q}} = 0.015ϵ2q​=0.015), followed by Zero-Noise Extrapolation using scale-factor circuit folding (sf∈{1,3}sf \in \{1, 3\}sf∈{1,3}) and linear fitting. Advanced Quantum Diagnostics: Tracking the growth of Von Neumann entanglement entropy across a spatial bipartition as a proxy for string breaking, alongside spatiotemporal heatmaps mapping site-resolved chiral condensate melting (⟨ψˉψ⟩i\langle \bar{\psi}\psi \rangle_i⟨ψˉ​ψ⟩i​). Software Requirements & Dependencies To run the simulation and generate the diagnostic figures, the code requires Python along with the following libraries: qiskit qiskit-aer numpy matplotlib