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:1901.05944 · Physical review. D/Physical review. D.

Quantum simulation of scattering in the quantum Ising model

Erik Gustafson, Yannick Meurice, Judah Unmuth-Yockey

Published May 23, 2019• 64 citations
arXivHTMLPDF

Abstract

We discuss real-time evolution for the quantum Ising model in one spatial dimension with ${N}_{s}$ sites. In the limit where the nearest-neighbor interactions $J$ in the spatial directions are small, there is a simple physical picture where qubit states can be interpreted as approximate particle occupations. Using exact diagonalization, for initial states with one or two particles, we show that for small $J$, discrete Bessel functions provide very accurate expressions for the evolution of the occupancies corresponding to initial states with one and two particles. Boundary conditions play an important role when the evolution time is long enough. We discuss a Trotter procedure to implement the evolution on existing quantum computers and discuss the error associated with the Trotter step size. We discuss the effects of gate and measurement errors on the evolution of one- and two-particle states using four and eight-qubits circuits approximately corresponding to existing or near-term quantum computers.

DOI
10.1103/physrevd.99.094503

Related papers

Scattering in the Ising model with the quantum Lanczos algorithm *

Kübra Yeter-Aydeniz, George Siopsis, Raphael C Pooser

Abstract Time evolution and scattering simulation in phenomenological models are of great interest for testing and validating the potential for near-term quantum computers to simulate quantum field theories. Here, we simulate one-particle propagation and two-particle scattering in the one-dimensional transverse Ising model for 3 and 4 spatial sites with periodic boundary conditions on a quantum computer. We use the quantum Lanczos algorithm to obtain all energy levels and corresponding eigenstates of the system. We simplify the quantum computation by taking advantage of the symmetries of the system. These results enable us to compute one- and two-particle transition amplitudes, particle numbers for spatial sites, and the transverse magnetization as functions of time. The quantum circuits were executed on various IBM Q superconducting hardware. The experimental results are in very good agreement with the values obtained using exact diagonalization.

arXiv:2008.08763•New Journal of Physics•Feb 15, 2021•36 citations

Benchmarking quantum computers for real-time evolution of a $(1+1)$ field theory with error mitigation

Erik Gustafson, Patrick Dreher, Zheyue Hang +1 more

Quantum computers open the possibility of performing real-time calculations for quantum field theory scattering processes. We propose to use an index averaging the absolute value of the difference between the accurately calculated Trotter evolution of site occupations and their actual measurements on NISQ machines. The average is over all the qubits for a certain number of Trotter steps. We use this metric to quantify the progress made in successive state-of-the-art machines and error-mitigation techniques. We illustrate the concept with the transverse Ising model in one spatial dimension with four sites using three of IBM's quantum computers (Almaden, Boeblingen, and Melbourne). We discuss the size of the Trotter steps needed to achieve physics goals. Using the proposed metric, we show that readout mitigation methods and Richardson extrapolations of mitigated measurements are very effective for specific numbers of Trotter steps of a chosen size. This specific choice can be applied to other machines and noise mitigation methods. On the other hand, a reliable algorithmic mitigation would require a significantly larger number of smaller Trotter steps.

arXiv:1910.09478•Oct 21, 2019•11 citations

Qualitative quantum simulation of resonant tunneling and localization with the shallow quantum circuits

Jiale Shen, Peng Wang

Abstract In a circuit-based quantum computer, the computing is performed via the discrete-time evolution driven by quantum gates. Accurate simulation of continuous-time evolution requires a large number of quantum gates and therefore suffers from more noise. In this paper, we find that shallow quantum circuits are sufficient to qualitatively observe some typical quantum phenomena in the continuous-time evolution limit, such as resonant tunneling and localization phenomena. We study the propagation of a spin excitation in Trotter circuits with a large step size. The circuits are formed of two types of two-qubit gates, i.e. XY gates and controlled- R x gates, and single-qubit R z gates. The configuration of the R z gates determines the distribution of the spin excitation at the end of evolution. We demonstrate the resonant tunneling with up to four steps and the localization phenomenon with dozens of steps in Trotter circuits. Our results show that the circuit depth required for qualitative observation of some typical quantum phenomena is much smaller than that required for quantitative computation, suggesting that it is feasible to apply qualitative observations to near-term quantum computers. We also provide a way to use the physics laws to understand the error propagation in quantum circuits.

arXiv:2302.03249•Journal of Physics Communications•Apr 29, 2026•0 citations

Towards simulating time evolution of specific quantum many-body system by lower counts of quantum gates

Guanlin Jian, Yuan Yang, Ze Liu +2 more

Abstract In the noisy intermediate-scale quantum (NISQ) era, quantum computers have become important tools to simulate the real-time evolution of strong correlated many-body systems. The general scheme of designing quantum circuits to simulate the quantum dynamics is based on the Trotter-Suzuki decomposition technique, which has its limitation because the accuracy of evolution process depends on the size of trotter steps when the evolution operator is decomposed as quantum gates. Going beyond the limitation of the Trotter-Suzuki scheme, we design a parameterized quantum circuit named α -circuit with simple determined size and the only one control parameter θ to simulate the real-time evolution of the specific XXX Heisenberg model with the specific initial state . The α -circuit can accurately generate the time-evolution results by tuning parameter θ , which means the circuit can also be regarded as a good state preparation machine (SPM).

Europhysics Letters (EPL)•Dec 20, 2022•0 citations

Quantum Simulation of the Real-time Dynamics in the multi-flavor Gross-Neveu Model at the utility scale using Superconducting Quantum Computers

Talal Ahmed Chowdhury, Seokwon Choi, Kyoungchul Kong +1 more

We present a scalable quantum simulation framework for real-time dynamics of the multi-flavor Gross-Neveu model in 1+1 dimensions. Using superconducting quantum processors at utility scale, we develop a hardware-efficient Trotterization whose per-step circuit depth scales with fermion flavor number rather than total system size, enabling simulations beyond 100 qubits. A central contribution of this work is the Localized Diagonal Operator Approximation (LDOA), which systematically reduces the overhead associated with quartic interactions. We formulate diagonal unitary synthesis as a structured least-squares problem in phase space and obtain analytic solutions via the Moore-Penrose pseudoinverse. This formulation provides a principled and quantitatively controlled approximation: in the small Trotter-step regime, the unitary error is directly linked to the phase reconstruction error and vanishes asymptotically as the Trotter step size decreases. This establishes a clear mathematical foundation for the LDOA while significantly reducing two-qubit gate counts and circuit depth, and is broadly applicable to diagonal quantum operators with long-range structure, making it particularly well suited for quantum hardware with limited qubit connectivity. Using these techniques, we run large-scale simulations on IBM superconducting processors and study real-time observables, including density-density correlators. We benchmark against exact diagonalization and tensor network-based methods, finding strong agreement across system sizes. These results show that combining hardware-aware circuit design with rigorous approximations enables practical near-term simulation of interacting fermionic field theories and provides a scalable pathway toward more complex quantum field theory simulations.

quant-pharXiv:2605.05479•May 8, 2026•0 citations

Simulating Field Theories with Quantum Computers

Muhammad Asaduzzaman, Simon M. Catterall, Yannick Meurice +1 more

In this study, we investigate Trotter evolution in the Gross-Neveu and hyperbolic Ising models in two spacetime dimensions, using quantum computers. We identify different sources of errors prevalent in various quantum processing units and discuss challenges to scale up the size of the computation. We present benchmark results obtained on a variety of platforms and employ a range of error mitigation techniques to address coherent and incoherent noise. By comparing these mitigated outcomes with exact diagonalization results and density matrix renormalization group calculations, we assess the effectiveness of our approaches. Moreover, we demonstrate the implementation of an out-of-time-ordered correlator (OTOC) protocol using IBM's quantum computers.

arXiv:2401.01962•International Symposium on Lattice Field Theory (LATTICE)•May 4, 2024•0 citations
We discuss real-time evolution for the quantum Ising model in one spatial dimension with Ns{N}_{s}Ns​ sites. In the limit where the nearest-neighbor interactions JJJ in the spatial directions are small, there is a simple physical picture where qubit states can be interpreted as approximate particle occupations. Using exact diagonalization, for initial states with one or two particles, we show that for small JJJ, discrete Bessel functions provide very accurate expressions for the evolution of the occupancies corresponding to initial states with one and two particles. Boundary conditions play an important role when the evolution time is long enough. We discuss a Trotter procedure to implement the evolution on existing quantum computers and discuss the error associated with the Trotter step size. We discuss the effects of gate and measurement errors on the evolution of one- and two-particle states using four and eight-qubits circuits approximately corresponding to existing or near-term quantum computers.
Abstract Time evolution and scattering simulation in phenomenological models are of great interest for testing and validating the potential for near-term quantum computers to simulate quantum field theories. Here, we simulate one-particle propagation and two-particle scattering in the one-dimensional transverse Ising model for 3 and 4 spatial sites with periodic boundary conditions on a quantum computer. We use the quantum Lanczos algorithm to obtain all energy levels and corresponding eigenstates of the system. We simplify the quantum computation by taking advantage of the symmetries of the system. These results enable us to compute one- and two-particle transition amplitudes, particle numbers for spatial sites, and the transverse magnetization as functions of time. The quantum circuits were executed on various IBM Q superconducting hardware. The experimental results are in very good agreement with the values obtained using exact diagonalization.
Benchmarking quantum computers for real-time evolution of a (1+1)(1+1)(1+1) field theory with error mitigation
Quantum computers open the possibility of performing real-time calculations for quantum field theory scattering processes. We propose to use an index averaging the absolute value of the difference between the accurately calculated Trotter evolution of site occupations and their actual measurements on NISQ machines. The average is over all the qubits for a certain number of Trotter steps. We use this metric to quantify the progress made in successive state-of-the-art machines and error-mitigation techniques. We illustrate the concept with the transverse Ising model in one spatial dimension with four sites using three of IBM's quantum computers (Almaden, Boeblingen, and Melbourne). We discuss the size of the Trotter steps needed to achieve physics goals. Using the proposed metric, we show that readout mitigation methods and Richardson extrapolations of mitigated measurements are very effective for specific numbers of Trotter steps of a chosen size. This specific choice can be applied to other machines and noise mitigation methods. On the other hand, a reliable algorithmic mitigation would require a significantly larger number of smaller Trotter steps.
Abstract In a circuit-based quantum computer, the computing is performed via the discrete-time evolution driven by quantum gates. Accurate simulation of continuous-time evolution requires a large number of quantum gates and therefore suffers from more noise. In this paper, we find that shallow quantum circuits are sufficient to qualitatively observe some typical quantum phenomena in the continuous-time evolution limit, such as resonant tunneling and localization phenomena. We study the propagation of a spin excitation in Trotter circuits with a large step size. The circuits are formed of two types of two-qubit gates, i.e. XY gates and controlled- R x gates, and single-qubit R z gates. The configuration of the R z gates determines the distribution of the spin excitation at the end of evolution. We demonstrate the resonant tunneling with up to four steps and the localization phenomenon with dozens of steps in Trotter circuits. Our results show that the circuit depth required for qualitative observation of some typical quantum phenomena is much smaller than that required for quantitative computation, suggesting that it is feasible to apply qualitative observations to near-term quantum computers. We also provide a way to use the physics laws to understand the error propagation in quantum circuits.
Abstract In the noisy intermediate-scale quantum (NISQ) era, quantum computers have become important tools to simulate the real-time evolution of strong correlated many-body systems. The general scheme of designing quantum circuits to simulate the quantum dynamics is based on the Trotter-Suzuki decomposition technique, which has its limitation because the accuracy of evolution process depends on the size of trotter steps when the evolution operator is decomposed as quantum gates. Going beyond the limitation of the Trotter-Suzuki scheme, we design a parameterized quantum circuit named α -circuit with simple determined size and the only one control parameter θ to simulate the real-time evolution of the specific XXX Heisenberg model with the specific initial state . The α -circuit can accurately generate the time-evolution results by tuning parameter θ , which means the circuit can also be regarded as a good state preparation machine (SPM).
We present a scalable quantum simulation framework for real-time dynamics of the multi-flavor Gross-Neveu model in 1+1 dimensions. Using superconducting quantum processors at utility scale, we develop a hardware-efficient Trotterization whose per-step circuit depth scales with fermion flavor number rather than total system size, enabling simulations beyond 100 qubits. A central contribution of this work is the Localized Diagonal Operator Approximation (LDOA), which systematically reduces the overhead associated with quartic interactions. We formulate diagonal unitary synthesis as a structured least-squares problem in phase space and obtain analytic solutions via the Moore-Penrose pseudoinverse. This formulation provides a principled and quantitatively controlled approximation: in the small Trotter-step regime, the unitary error is directly linked to the phase reconstruction error and vanishes asymptotically as the Trotter step size decreases. This establishes a clear mathematical foundation for the LDOA while significantly reducing two-qubit gate counts and circuit depth, and is broadly applicable to diagonal quantum operators with long-range structure, making it particularly well suited for quantum hardware with limited qubit connectivity. Using these techniques, we run large-scale simulations on IBM superconducting processors and study real-time observables, including density-density correlators. We benchmark against exact diagonalization and tensor network-based methods, finding strong agreement across system sizes. These results show that combining hardware-aware circuit design with rigorous approximations enables practical near-term simulation of interacting fermionic field theories and provides a scalable pathway toward more complex quantum field theory simulations.
In this study, we investigate Trotter evolution in the Gross-Neveu and hyperbolic Ising models in two spacetime dimensions, using quantum computers. We identify different sources of errors prevalent in various quantum processing units and discuss challenges to scale up the size of the computation. We present benchmark results obtained on a variety of platforms and employ a range of error mitigation techniques to address coherent and incoherent noise. By comparing these mitigated outcomes with exact diagonalization results and density matrix renormalization group calculations, we assess the effectiveness of our approaches. Moreover, we demonstrate the implementation of an out-of-time-ordered correlator (OTOC) protocol using IBM's quantum computers.