Optimized quantum algorithms for simulating the Schwinger effect

• URL: http://arxiv.org/abs/2508.16831v1
• Date: Fri, 22 Aug 2025 23:09:02 GMT
• Title: Optimized quantum algorithms for simulating the Schwinger effect
• Authors: Angus Kan, Jessica Lemieux, Olga Okrut, Burak Şahinoğlu,
• Abstract summary: The Schwinger model describes lattice quantum electrodynamics in $1+1$ space-time dimensions.<n>We study different physical regimes in which the Schwinger effect is expected to be observable.<n>We find that a reliable simulation of the Schwinger effect is provably possible at high cutoff scales.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The Schwinger model, which describes lattice quantum electrodynamics in $1+1$ space-time dimensions, provides a valuable framework to investigate fundamental aspects of quantum field theory, and a stepping stone towards non-Abelian gauge theories. Specifically, it enables the study of physically relevant dynamical processes, such as the nonperturbative particle-antiparticle pairs production, known as the Schwinger effect. In this work, we analyze the quantum computational resource requirements associated with simulating the Schwinger effect under two distinct scenarios: (1) a quench process, where the initial state is a simple product state of a non-interacting theory, and interactions are turned on at time $t=0$; (2) a splitting (or scattering) process where two Gaussian states, peaked at given initial momenta, are shot away from (or towards) each other. We explore different physical regimes in which the Schwinger effect is expected to be observable. These regimes are characterized by initial momenta and coupling strengths, as well as simulation parameters such as lattice size and electric-field cutoffs. Leveraging known rigorous bounds for electric-field cutoffs, we find that a reliable simulation of the Schwinger effect is provably possible at high cutoff scales. Furthermore, we provide optimized circuit implementations of both the second-order Trotter formula and an interaction-picture algorithm based on the Dyson series to implement the time evolution. Our detailed resource estimates show the regimes in which the interaction-picture approach outperforms the Trotter approach, and vice versa. The improved theoretical error bounds, optimized quantum circuit designs, and explicitly compiled subroutines developed in this study are broadly applicable to simulations of other lattice models in high-energy physics and beyond.

Related papers

• Probing Hadron Scattering in Lattice Gauge Theories on Qudit Quantum Computers [0.5420492913071214]
  We propose experimentally feasible digital qudit quantum circuits for far-from-equilibrium quench dynamics of a $mathrmU(1)$ quantum link lattice gauge theory.<n>We probe scattering processes in this model on these proposed circuits, focusing on meson-meson and meson-antimeson collisions.<n>Our simulations, which include realistic noise models of dephasing and depolarization, show very good agreement with the exact noiseless dynamics.
  arXiv  Detail & Related papers  (2025-07-16T20:15:36Z)
• Scalable Quantum Algorithm for Meson Scattering in a Lattice Gauge Theory [0.0]
  We study meson scattering in a (1+1)-dimensional Z2 lattice gauge theory with staggered fermions.<n>We develop a quantum subspace expansion technique to construct high-fidelity meson creation operators.<n>We design an efficient quantum circuit for meson wave packet preparation using Givens rotations, significantly reducing the circuit depth compared to existing methods.
  arXiv  Detail & Related papers  (2025-05-27T14:19:53Z)
• Quantum error mitigation in optimized circuits for particle-density correlations in real-time dynamics of the Schwinger model [0.0]
  In principle, it is possible to calculate non-equal-time correlation functions, from which one can detect interesting phenomena.<n>In practice, these calculations are strongly affected by noise, due to the complexity of the required quantum circuits.<n>We derive a digital circuit implementation of the time-evolution of particle-density correlation operators and their correlation, comparing results from exact evolution, bare noisy simulations and simulations with different error mitigation techniques.
  arXiv  Detail & Related papers  (2025-01-18T17:32:59Z)
• Thermalization and Criticality on an Analog-Digital Quantum Simulator [133.58336306417294]
  We present a quantum simulator comprising 69 superconducting qubits which supports both universal quantum gates and high-fidelity analog evolution. We observe signatures of the classical Kosterlitz-Thouless phase transition, as well as strong deviations from Kibble-Zurek scaling predictions. We digitally prepare the system in pairwise-entangled dimer states and image the transport of energy and vorticity during thermalization.
  arXiv  Detail & Related papers  (2024-05-27T17:40:39Z)
• Simulating Scattering of Composite Particles [0.09208007322096534]
  We develop a non-perturbative approach to simulating scattering on classical and quantum computers. The construction is designed to mimic a particle collision, wherein two composite particles are brought in contact. The approach is well-suited for studying strongly coupled systems in both relativistic and non-relativistic settings.
  arXiv  Detail & Related papers  (2023-10-20T18:00:50Z)
• Trapped-Ion Quantum Simulation of Collective Neutrino Oscillations [55.41644538483948]
  We study strategies to simulate the coherent collective oscillations of a system of N neutrinos in the two-flavor approximation using quantum computation. We find that the gate complexity using second order Trotter- Suzuki formulae scales better with system size than with other decomposition methods such as Quantum Signal Processing.
  arXiv  Detail & Related papers  (2022-07-07T09:39:40Z)
• Hybridized Methods for Quantum Simulation in the Interaction Picture [69.02115180674885]
  We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations. Physical applications of these hybridized methods yield a gate complexity scaling as $log2 Lambda$ in the electric cutoff. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter $lambda$ used to impose an energy cost.
  arXiv  Detail & Related papers  (2021-09-07T20:01:22Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• State preparation and measurement in a quantum simulation of the O(3) sigma model [65.01359242860215]
  We show that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. We apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes. We present and analyze a quantum algorithm based on non-unitary randomized simulation methods.
  arXiv  Detail & Related papers  (2020-06-28T23:44:12Z)
• Accelerated variational algorithms for digital quantum simulation of many-body ground states [0.0]
  One of the key applications for the quantum simulators is to emulate the ground state of many-body systems. variational methods have also been proposed and realized in quantum simulators for emulating the ground state of many-body systems.
  arXiv  Detail & Related papers  (2020-06-16T18:01:35Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.