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

arXiv:2002.11146 · Quantum

Quantum Algorithms for Simulating the Lattice Schwinger Model

Alexander F. Shaw, Pavel Lougovski, Jesse R. Stryker, Nathan Wiebe

Published Aug 10, 2020• 180 citations
arXivHTMLPDF

Abstract

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.

DOI
10.22331/q-2020-08-10-306

Related papers

Simulating lattice quantum electrodynamics on a quantum computer

Angus Kan, Yunseong Nam

Abstract U(1) lattice gauge theories (LGTs) offer a way to simulate quantum electrodynamics, one of the three forces unified by the Standard Model of particles physics. Here we provide complete, quantum-gate-by-quantum-gate algorithms to simulate U(1) LGTs on a fault-tolerant quantum computer. We further perform rigorous error analysis in order to derive concrete estimates of the quantum computational resources required for an accurate simulation of U(1) LGTs using a second-order product formula. We show that U(1) LGTs in any spatial dimension can be simulated using O ˜ ( T 3 2 N 3 2 Λ ϵ − 1 2 ) non-Clifford T gates, where T is the simulation time, N is the number of lattice sites, Λ is the truncation parameter for the bosonic gauge fields, and ε is the simulation error. This work paves the way towards fault-tolerant quantum simulations of physical models closely related to the Standard Model of particle physics.

Quantum Science and Technology•Nov 7, 2022•13 citations

Solving lattice gauge theories using the quantum Krylov algorithm and qubitization

Lewis W. Anderson, Martin Kiffner, Tom O’Leary +2 more

Computing vacuum states of lattice gauge theories (LGTs) containing fermionic degrees of freedom can present significant challenges for classical computation using Monte-Carlo methods. Quantum algorithms may offer a pathway towards more scalable computation of groundstate properties of LGTs. However, a comprehensive understanding of the quantum computational resources required for such a problem is thus far lacking. In this work, we investigate using the quantum subspace expansion (QSE) algorithm to compute the groundstate of the Schwinger model, an archetypal LGT describing quantum electrodynamics in one spatial dimension. We perform numerical simulations, including the effect of measurement noise, to extrapolate the resources required for the QSE algorithm to achieve a desired accuracy for a range of system sizes. Using this, we present a full analysis of the resources required to compute LGT vacuum states using a quantum algorithm using qubitization within a fault tolerant framework. We develop of a novel method for performing qubitization of a LGT Hamiltonian based on a 'linear combination of unitaries' (LCU) approach. The cost of the corresponding block encoding operation scales as O ~ ( N ) with system size N . Including the corresponding prefactors, our method reduces the gate cost by multiple orders of magnitude when compared to previous LCU methods for the QSE algorithm, which scales as O ~ ( N 2 ) when applied to the Schwinger model. While the qubit and single circuit T-gate cost resulting from our resource analysis is appealing to early fault-tolerant implementation, we find that the number of shots required to avoid numerical instability within the QSE procedure must be significantly reduced in order to improve the feasibility of the methodology we consider and discuss how this might be achieved.

arXiv:2403.08859•Quantum•Mar 25, 2025•16 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

A Validated Quantum-Circuit Testbed for the Lattice Schwinger Model

Moein Sahraei

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.

•Aug 8, 2026•0 citations

Digital Quantum Simulation for Energy Spectroscopy of Schwinger Model

Masazumi Honda, Dongwook Ghim

We discuss a method to efficiently compute energy spectra in quantum field theories by digital quantum simulation. We utilize a quantum algorithm called coherent imaging spectroscopy which quenches the ground state with a perturbation oscillating periodically in time for various frequencies and then reads off excited energy levels from values of frequencies having loss of the vacuum-to-vacuum probability by the quench. We demonstrate this method in the Schwinger model which is the (1+1)-dimensional quantum electrodynamics with a topological term. In particular, the ground state of the Schwinger model on lattice is prepared by adiabatic state preparation and then we apply various types of quenches to the approximate ground state via Suzuki-Trotter time evolution. We benchmark the types of quenches and argue their (dis)advantages especially in the context of studying quantum field theories. We also estimate the computational complexity to obtain physically reasonable results which likely implies efficiency of the method in the early fault-tolerant quantum computer era

Conference on Quark Confinement and the Hadron Spectrum (Confinement)•Oct 24, 2025•0 citations

Quantum Simulation of QCD in Axial Gauge

Xiaojun Yao

We study quantum simulation of SU(3) non-Abelian gauge theory dynamically coupled with fundamental fermions in $3+1$ dimensions by employing the lattice Hamiltonian in axial gauge that avoids Gauss's law constraints. The temporal component of the gauge field is analytically solved in terms of independent field degrees of freedom and a lattice regulated Green's function. The axial gauge condition is trivially maintained in time evolution, even under Trotterization. The gauge field degrees of freedom are expressed in the local field basis and can be efficiently transformed into the canonical conjugate momentum basis by local quantum Fourier transforms. We prove the number of qubits needed for describing all states up to an energy $E$ with an accuracy $ε$ on a lattice of volume $V$ at bare coupling $g$ is bounded as $16n_A V + 12n_f V$, where $n_A \approx \log_2 (\frac{64 E' V^{4/3}}{π^2ε} + \frac{32\sqrt{2}g n_f E'^{1/2} V^{7/6}}{\sqrt{3}π^3ε^{1/2}} ) $ is the number of qubits needed for each independent gauge field per site with a shifted energy $E'$, and $n_f$ denotes the number of fermion flavors. We then analyze a quantum algorithm for time evolution that is based on Trotterization, quantum Fourier transform, and Jordan-Wigner transformation, for which quantum circuits can be explicitly constructed under arbitrary gauge field truncation and digitization. We find the numbers of CNOT and single-qubit rotation gates both scale as $O(n_A^4 V^{4/3}) + O(V^{5/3})$ per Trotter step for fixed $n_f\leq 6$. We conclude that quantum resources needed for simulating real-time dynamics of lattice QCD scale polynomially with volume, energy, time, accuracy, and bare Hamiltonian parameters.

hep-latCross-listedarXiv:2608.16783•Physical review. D/Physical review. D.•Aug 18, 2026•7 citations
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.
Abstract U(1) lattice gauge theories (LGTs) offer a way to simulate quantum electrodynamics, one of the three forces unified by the Standard Model of particles physics. Here we provide complete, quantum-gate-by-quantum-gate algorithms to simulate U(1) LGTs on a fault-tolerant quantum computer. We further perform rigorous error analysis in order to derive concrete estimates of the quantum computational resources required for an accurate simulation of U(1) LGTs using a second-order product formula. We show that U(1) LGTs in any spatial dimension can be simulated using O ˜ ( T 3 2 N 3 2 Λ ϵ − 1 2 ) non-Clifford T gates, where T is the simulation time, N is the number of lattice sites, Λ is the truncation parameter for the bosonic gauge fields, and ε is the simulation error. This work paves the way towards fault-tolerant quantum simulations of physical models closely related to the Standard Model of particle physics.
Computing vacuum states of lattice gauge theories (LGTs) containing fermionic degrees of freedom can present significant challenges for classical computation using Monte-Carlo methods. Quantum algorithms may offer a pathway towards more scalable computation of groundstate properties of LGTs. However, a comprehensive understanding of the quantum computational resources required for such a problem is thus far lacking. In this work, we investigate using the quantum subspace expansion (QSE) algorithm to compute the groundstate of the Schwinger model, an archetypal LGT describing quantum electrodynamics in one spatial dimension. We perform numerical simulations, including the effect of measurement noise, to extrapolate the resources required for the QSE algorithm to achieve a desired accuracy for a range of system sizes. Using this, we present a full analysis of the resources required to compute LGT vacuum states using a quantum algorithm using qubitization within a fault tolerant framework. We develop of a novel method for performing qubitization of a LGT Hamiltonian based on a 'linear combination of unitaries' (LCU) approach. The cost of the corresponding block encoding operation scales as O ~ ( N ) with system size N . Including the corresponding prefactors, our method reduces the gate cost by multiple orders of magnitude when compared to previous LCU methods for the QSE algorithm, which scales as O ~ ( N 2 ) when applied to the Schwinger model. While the qubit and single circuit T-gate cost resulting from our resource analysis is appealing to early fault-tolerant implementation, we find that the number of shots required to avoid numerical instability within the QSE procedure must be significantly reduced in order to improve the feasibility of the methodology we consider and discuss how this might be achieved.
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.
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.
We discuss a method to efficiently compute energy spectra in quantum field theories by digital quantum simulation. We utilize a quantum algorithm called coherent imaging spectroscopy which quenches the ground state with a perturbation oscillating periodically in time for various frequencies and then reads off excited energy levels from values of frequencies having loss of the vacuum-to-vacuum probability by the quench. We demonstrate this method in the Schwinger model which is the (1+1)-dimensional quantum electrodynamics with a topological term. In particular, the ground state of the Schwinger model on lattice is prepared by adiabatic state preparation and then we apply various types of quenches to the approximate ground state via Suzuki-Trotter time evolution. We benchmark the types of quenches and argue their (dis)advantages especially in the context of studying quantum field theories. We also estimate the computational complexity to obtain physically reasonable results which likely implies efficiency of the method in the early fault-tolerant quantum computer era
We study quantum simulation of SU(3) non-Abelian gauge theory dynamically coupled with fundamental fermions in 3+13+13+1 dimensions by employing the lattice Hamiltonian in axial gauge that avoids Gauss's law constraints. The temporal component of the gauge field is analytically solved in terms of independent field degrees of freedom and a lattice regulated Green's function. The axial gauge condition is trivially maintained in time evolution, even under Trotterization. The gauge field degrees of freedom are expressed in the local field basis and can be efficiently transformed into the canonical conjugate momentum basis by local quantum Fourier transforms. We prove the number of qubits needed for describing all states up to an energy EEE with an accuracy εεε on a lattice of volume VVV at bare coupling ggg is bounded as 16nAV+12nfV16n_A V + 12n_f V16nA​V+12nf​V, where $n_A \approx \log_2 (\frac{64 E' V^{4/3}}{π^2ε} + \frac{32\sqrt{2}g n_f E'^{1/2} V^{7/6}}{\sqrt{3}π^3ε^{1/2}} ) $ is the number of qubits needed for each independent gauge field per site with a shifted energy E′E'E′, and nfn_fnf​ denotes the number of fermion flavors. We then analyze a quantum algorithm for time evolution that is based on Trotterization, quantum Fourier transform, and Jordan-Wigner transformation, for which quantum circuits can be explicitly constructed under arbitrary gauge field truncation and digitization. We find the numbers of CNOT and single-qubit rotation gates both scale as O(nA4V4/3)+O(V5/3)O(n_A^4 V^{4/3}) + O(V^{5/3})O(nA4​V4/3)+O(V5/3) per Trotter step for fixed nf≤6n_f\leq 6nf​≤6. We conclude that quantum resources needed for simulating real-time dynamics of lattice QCD scale polynomially with volume, energy, time, accuracy, and bare Hamiltonian parameters.