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:2008.08763 · New Journal of Physics

Scattering in the Ising model with the quantum Lanczos algorithm *

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

Published Feb 15, 2021• 36 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1088/1367-2630/abe63d

Related papers

Quantum simulation of scattering in the quantum Ising model

Erik Gustafson, Yannick Meurice, Judah Unmuth-Yockey

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.

arXiv:1901.05944•Physical review. D/Physical review. D.•May 23, 2019•64 citations

Exact Ising model simulation on a quantum computer

Alba Cervera-Lierta

We present an exact simulation of a one-dimensional transverse Ising spin chain with a quantum computer. We construct an efficient quantum circuit that diagonalizes the Ising Hamiltonian and allows to obtain all eigenstates of the model by just preparing the computational basis states. With an explicit example of that circuit for n = 4 spins, we compute the expected value of the ground state transverse magnetization, the time evolution simulation and provide a method to also simulate thermal evolution. All circuits are run in IBM and Rigetti quantum devices to test and compare them qualitatively.

arXiv:1807.07112•Quantum•Dec 21, 2018•155 citations

The boundary effects of transverse field Ising model

Yan He, Hao Guo

Abstract Advance in quantum simulations using trapped ions or superconducting elements allows detailed analysis of the transverse field Ising model (TFIM), which can exhibit a quantum phase transition and has been a paradigm in exactly solvable quantum systems. The Jordan–Wigner transformation maps the one-dimensional TFIM to a fermion model, but additional complications arise in finite systems and introduce a fermion-number parity constraint when periodic boundary condition is imposed. By constructing the free energy and spin correlations with the fermion-number parity constraint and comparing the results to the TFIM with open boundary condition, we show that the boundary effects can become significant for the anti-ferromagnetic TFIM with odd number of sites at low temperature.

arXiv:1707.02400•Journal of Statistical Mechanics Theory and Experiment•Sep 1, 2017•18 citations

Quantum computing for field and gauge theories in the NISQ era

Erik Gustafson, Stephen P. Jordan, Yannick Meurice +3 more

This thesis looks at how we can leverage current and near future quantum computers to effectively simulate quantum field theories. The scope of this thesis covers how to simulate the (1+1)-D Transverse Ising model on digital quantum computers and the methods to handle multiple types of machine errors to effectively extract real-time dynamic information. We leverage modifications to the transverse Ising model to study the calculation of phase shifts from scattering a particle off of simple potentials and demonstrate that these calculations are feasible on current quantum hardware. In looking toward the future we demonstrate two different state preparation algorithms. One algorithm projected cooling we show can extract information about the second order phase transition in the Transverse Ising Model and has excellent scaling properties. The second algorithm involves leveraging classical field theory simulations to circumvent quantum state preparation methods on that should prove tractable on near term quantum computing hardware. These tools together highlight the promise of quantum computing to tackle interesting problems in high energy physics.

•May 1, 2021•0 citations

Quantum Phase Transitions in the Transverse-Field Ising Model: A Comparative Study of Exact, Variational, and Hardware-Based Approaches

Rudraksh Sharma

The quantum phase transitions provide a paradigm for studying collective quantum phenomena that are a result of competing non-commuting interactions. This paper will study the ground state properties and quantum critical dynamics of the one-dimensional transverse field Ising model through a combined perspective that includes exact diagonalisation, variational quantum eigensolver (VQE) simulations, and simulations on realistic physical quantum devices. We focus on a lattice of four spins, where we calculate the ground-state energies, magnetic order parameters and correlation functions at uniformly applied conditions, which is repeated by all systems. Precise diagonalisation provides both a benchmark, which is symmetry-conserving, and a depth-two, physics inspired variational approximation, which provides simulations accessible to hardware. The circuits that have been optimised identically are then placed on the IQM Garnet quantum processor, using a resource-efficient batched protocol. We find that the ground-state energies of shallow variational circuits are reliably captured by the circuit over the entire parameter space; the magnetic arrangement parameters and observables sensitive to correlation signal significantly more noise. The error analysis of quantitative analysis reveals a strong broadening of critical crossover on hardware, which is consistent with the noise attenuation of long-range correlations. These findings highlight the current capabilities as well as the fundamental limitations of noisy intermediate-scale quantum systems in modelling quantum critical phenomena as a benchmark to future enhancements in obtaining quantum hardware and quantum algorithms development.

quant-pharXiv:2601.17515•Jan 27, 2026•0 citations

Simulation of the 1d XY model on a quantum computer

Marc Farreras, Alba Cervera-Lierta

The field of quantum computing has grown fast in recent years, both in theoretical advancements and the practical construction of quantum computers. These computers were initially proposed, among other reasons, to efficiently simulate and comprehend the complexities of quantum physics. In this paper, we present a comprehensive scheme for the exact simulation of the 1-D XY model on a quantum computer. We successfully diagonalize the proposed Hamiltonian, enabling access to the complete energy spectrum. Furthermore, we propose a novel approach to design a quantum circuit to perform exact time evolution. Among all the possibilities this opens, we compute the ground and excited state energies for the symmetric XY model with spin chains of n=4 n = 4 and n=8 n = 8 spins. Further, we calculate the expected value of transverse magnetization for the ground state in the transverse Ising model. Both studies allow the observation of a quantum phase transition from an antiferromagnetic to a paramagnetic state. Additionally, we have simulated the time evolution of the state all spins up in the transverse Ising model. The scalability and high performance of our algorithm make it an ideal candidate for benchmarking purposes, while also laying the foundation for simulating other integrable models on quantum computers.

arXiv:2410.21143•SciPost Physics Lecture Notes•Jun 11, 2025•3 citations
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.
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.
We present an exact simulation of a one-dimensional transverse Ising spin chain with a quantum computer. We construct an efficient quantum circuit that diagonalizes the Ising Hamiltonian and allows to obtain all eigenstates of the model by just preparing the computational basis states. With an explicit example of that circuit for n = 4 spins, we compute the expected value of the ground state transverse magnetization, the time evolution simulation and provide a method to also simulate thermal evolution. All circuits are run in IBM and Rigetti quantum devices to test and compare them qualitatively.
Abstract Advance in quantum simulations using trapped ions or superconducting elements allows detailed analysis of the transverse field Ising model (TFIM), which can exhibit a quantum phase transition and has been a paradigm in exactly solvable quantum systems. The Jordan–Wigner transformation maps the one-dimensional TFIM to a fermion model, but additional complications arise in finite systems and introduce a fermion-number parity constraint when periodic boundary condition is imposed. By constructing the free energy and spin correlations with the fermion-number parity constraint and comparing the results to the TFIM with open boundary condition, we show that the boundary effects can become significant for the anti-ferromagnetic TFIM with odd number of sites at low temperature.
This thesis looks at how we can leverage current and near future quantum computers to effectively simulate quantum field theories. The scope of this thesis covers how to simulate the (1+1)-D Transverse Ising model on digital quantum computers and the methods to handle multiple types of machine errors to effectively extract real-time dynamic information. We leverage modifications to the transverse Ising model to study the calculation of phase shifts from scattering a particle off of simple potentials and demonstrate that these calculations are feasible on current quantum hardware. In looking toward the future we demonstrate two different state preparation algorithms. One algorithm projected cooling we show can extract information about the second order phase transition in the Transverse Ising Model and has excellent scaling properties. The second algorithm involves leveraging classical field theory simulations to circumvent quantum state preparation methods on that should prove tractable on near term quantum computing hardware. These tools together highlight the promise of quantum computing to tackle interesting problems in high energy physics.
The quantum phase transitions provide a paradigm for studying collective quantum phenomena that are a result of competing non-commuting interactions. This paper will study the ground state properties and quantum critical dynamics of the one-dimensional transverse field Ising model through a combined perspective that includes exact diagonalisation, variational quantum eigensolver (VQE) simulations, and simulations on realistic physical quantum devices. We focus on a lattice of four spins, where we calculate the ground-state energies, magnetic order parameters and correlation functions at uniformly applied conditions, which is repeated by all systems. Precise diagonalisation provides both a benchmark, which is symmetry-conserving, and a depth-two, physics inspired variational approximation, which provides simulations accessible to hardware. The circuits that have been optimised identically are then placed on the IQM Garnet quantum processor, using a resource-efficient batched protocol. We find that the ground-state energies of shallow variational circuits are reliably captured by the circuit over the entire parameter space; the magnetic arrangement parameters and observables sensitive to correlation signal significantly more noise. The error analysis of quantitative analysis reveals a strong broadening of critical crossover on hardware, which is consistent with the noise attenuation of long-range correlations. These findings highlight the current capabilities as well as the fundamental limitations of noisy intermediate-scale quantum systems in modelling quantum critical phenomena as a benchmark to future enhancements in obtaining quantum hardware and quantum algorithms development.
The field of quantum computing has grown fast in recent years, both in theoretical advancements and the practical construction of quantum computers. These computers were initially proposed, among other reasons, to efficiently simulate and comprehend the complexities of quantum physics. In this paper, we present a comprehensive scheme for the exact simulation of the 1-D XY model on a quantum computer. We successfully diagonalize the proposed Hamiltonian, enabling access to the complete energy spectrum. Furthermore, we propose a novel approach to design a quantum circuit to perform exact time evolution. Among all the possibilities this opens, we compute the ground and excited state energies for the symmetric XY model with spin chains of n=4 n = 4 and n=8 n = 8 spins. Further, we calculate the expected value of transverse magnetization for the ground state in the transverse Ising model. Both studies allow the observation of a quantum phase transition from an antiferromagnetic to a paramagnetic state. Additionally, we have simulated the time evolution of the state all spins up in the transverse Ising model. The scalability and high performance of our algorithm make it an ideal candidate for benchmarking purposes, while also laying the foundation for simulating other integrable models on quantum computers.