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

Quantum computation of scattering amplitudes in scalar quantum electrodynamics

Kübra Yeter Aydeniz, George Siopsis

Published Feb 12, 2018• 17 citations
arXivHTMLPDF

Abstract

We present a quantum algorithm for the calculation of scattering amplitudes of massive charged scalar particles in scalar quantum electrodynamics. Our algorithm is based on continuous-variable quantum computing architecture resulting in exponential speedup over classical methods. We derive a simple form of the Hamiltonian including interactions and a straightforward implementation of the constraint due to gauge invariance.

DOI
10.1103/physrevd.97.036004

Related papers

Quantum computation of scattering in scalar quantum field theories

Stephen P. Jordan, Keith S. M. Lee, John P. Preskill

Quantum field theory provides the framework for the most fundamental physical theories to be confirmed experimentally and has enabled predictions of unprecedented precision. However, calculations of physical observables often require great computational complexity and can generally be performed only when the interaction strength is weak. A full understanding of the foundations and rich consequences of quantum field theory remains an outstanding challenge. We develop a quantum algorithm to compute relativistic scattering amplitudes in massive $\phi^4$ theory in spacetime of four and fewer dimensions. The algorithm runs in a time that is polynomial in the number of particles, their energy, and the desired precision, and applies at both weak and strong coupling. Thus, it offers exponential speedup over existing classical methods at high precision or strong coupling.

arXiv:1112.4833•Quantum Information and Computation•Sep 1, 2014•283 citations

Quantum simulation of quantum field theory using continuous variables

Kevin Marshall, Raphael C. Pooser, George Siopsis +1 more

The year 1982 is often credited as the year that theoretical quantum computing was started with a keynote speech by Richard Feynman, who proposed a universal quantum simulator, the idea being that if you had such a machine you could in principle ``imitate any quantum system, including the physical world.'' With that in mind, we present an algorithm for a continuous-variable quantum computing architecture which gives an exponential speedup over the best-known classical methods. Specifically, this relates to efficiently calculating the scattering amplitudes in scalar bosonic quantum field theory, a problem that is believed to be hard using a classical computer. Building on this, we give an experimental implementation based on continuous-variable states that is feasible with today's technology.

arXiv:1503.08121•Physical Review A•Dec 14, 2015•84 citations

Scalable quantum computation of Quantum Electrodynamics beyond one spatial dimension

Zong-Gang Mou, Bipasha Chakraborty

In the Hamiltonian formulation, Quantum Field Theory calculations scale exponentially with spatial volume, making real-time simulations intractable on classical computers and motivating quantum computation approaches. In Hamiltonian quantisation, bosonic fields introduce the additional challenge of an infinite-dimensional Hilbert space. We present a scalable quantum algorithm for Quantum Electrodynamics (QED), an Abelian gauge field theory in higher than one spatial dimensions, designed to address this limit while preserving gauge invariance. In our formulation, Gauss's law is automatically satisfied when the implementation remains fully gauge invariant. We demonstrate how gauge invariance is maintained throughout the lattice discretisation, digitisation, and qubitisation procedures, and identify the most efficient representation for extending to large Hilbert space dimensions. Within this framework, we benchmark several quantum error mitigation techniques and find the calibration method to perform most effectively. The approach scales naturally to larger lattices, and we implement and test the 2+1 and 3+1 dimensional setups on current quantum hardware. Our results indicate that next-generation quantum platforms could enable reliable, fully quantum simulations of large-scale QED dynamics.

arXiv:2510.27668•Oct 31, 2025•3 citations

BQP-completeness of scattering in scalar quantum field theory

Stephen P. Jordan, Hari Krovi, Keith S. M. Lee +1 more

Recent work has shown that quantum computers can compute scattering probabilities in massive quantum field theories, with a run time that is polynomial in the number of particles, their energy, and the desired precision. Here we study a closely related quantum field-theoretical problem: estimating the vacuum-to-vacuum transition amplitude, in the presence of spacetime-dependent classical sources, for a massive scalar field theory in (1+1) dimensions. We show that this problem is BQP-hard; in other words, its solution enables one to solve any problem that is solvable in polynomial time by a quantum computer. Hence, the vacuum-to-vacuum amplitude cannot be accurately estimated by any efficient classical algorithm, even if the field theory is very weakly coupled, unless BQP=BPP. Furthermore, the corresponding decision problem can be solved by a quantum computer in a time scaling polynomially with the number of bits needed to specify the classical source fields, and this problem is therefore BQP-complete. Our construction can be regarded as an idealized architecture for a universal quantum computer in a laboratory system described by massive phi^4 theory coupled to classical spacetime-dependent sources.

arXiv:1703.00454•Quantum•Jan 8, 2018•129 citations

Quantum Algorithms for Fermionic Quantum Field Theories

Stephen P. Jordan, Keith S. M. Lee, John P. Preskill

Extending previous work on scalar field theories, we develop a quantum algorithm to compute relativistic scattering amplitudes in fermionic field theories, exemplified by the massive Gross-Neveu model, a theory in two spacetime dimensions with quartic interactions. The algorithm introduces new techniques to meet the additional challenges posed by the characteristics of fermionic fields, and its run time is polynomial in the desired precision and the energy. Thus, it constitutes further progress towards an efficient quantum algorithm for simulating the Standard Model of particle physics.

arXiv:1404.7115•Apr 28, 2014•166 citations

Algorithm for quantum computation of particle decays

Anthony N. Ciavarella

A quantum algorithm is developed to calculate decay rates and cross sections using quantum resources that scale polynomially in the system size assuming similar scaling for state preparation and time evolution. This is done by computing finite-volume one- and two-particle Green's functions on the quantum hardware. Particle decay rates and two-particle scattering cross sections are extracted from the imaginary parts of the Green's function. A $0+1$ dimensional implementation of this method is demonstrated on IBM's superconducting quantum hardware for the decay of a heavy scalar particle to a pair of light scalars.

arXiv:2007.04447•Physical review. D/Physical review. D.•Nov 6, 2020•42 citations
We present a quantum algorithm for the calculation of scattering amplitudes of massive charged scalar particles in scalar quantum electrodynamics. Our algorithm is based on continuous-variable quantum computing architecture resulting in exponential speedup over classical methods. We derive a simple form of the Hamiltonian including interactions and a straightforward implementation of the constraint due to gauge invariance.
Quantum field theory provides the framework for the most fundamental physical theories to be confirmed experimentally and has enabled predictions of unprecedented precision. However, calculations of physical observables often require great computational complexity and can generally be performed only when the interaction strength is weak. A full understanding of the foundations and rich consequences of quantum field theory remains an outstanding challenge. We develop a quantum algorithm to compute relativistic scattering amplitudes in massive ϕ4\phi^4ϕ4 theory in spacetime of four and fewer dimensions. The algorithm runs in a time that is polynomial in the number of particles, their energy, and the desired precision, and applies at both weak and strong coupling. Thus, it offers exponential speedup over existing classical methods at high precision or strong coupling.
The year 1982 is often credited as the year that theoretical quantum computing was started with a keynote speech by Richard Feynman, who proposed a universal quantum simulator, the idea being that if you had such a machine you could in principle ``imitate any quantum system, including the physical world.'' With that in mind, we present an algorithm for a continuous-variable quantum computing architecture which gives an exponential speedup over the best-known classical methods. Specifically, this relates to efficiently calculating the scattering amplitudes in scalar bosonic quantum field theory, a problem that is believed to be hard using a classical computer. Building on this, we give an experimental implementation based on continuous-variable states that is feasible with today's technology.
In the Hamiltonian formulation, Quantum Field Theory calculations scale exponentially with spatial volume, making real-time simulations intractable on classical computers and motivating quantum computation approaches. In Hamiltonian quantisation, bosonic fields introduce the additional challenge of an infinite-dimensional Hilbert space. We present a scalable quantum algorithm for Quantum Electrodynamics (QED), an Abelian gauge field theory in higher than one spatial dimensions, designed to address this limit while preserving gauge invariance. In our formulation, Gauss's law is automatically satisfied when the implementation remains fully gauge invariant. We demonstrate how gauge invariance is maintained throughout the lattice discretisation, digitisation, and qubitisation procedures, and identify the most efficient representation for extending to large Hilbert space dimensions. Within this framework, we benchmark several quantum error mitigation techniques and find the calibration method to perform most effectively. The approach scales naturally to larger lattices, and we implement and test the 2+1 and 3+1 dimensional setups on current quantum hardware. Our results indicate that next-generation quantum platforms could enable reliable, fully quantum simulations of large-scale QED dynamics.
Recent work has shown that quantum computers can compute scattering probabilities in massive quantum field theories, with a run time that is polynomial in the number of particles, their energy, and the desired precision. Here we study a closely related quantum field-theoretical problem: estimating the vacuum-to-vacuum transition amplitude, in the presence of spacetime-dependent classical sources, for a massive scalar field theory in (1+1) dimensions. We show that this problem is BQP-hard; in other words, its solution enables one to solve any problem that is solvable in polynomial time by a quantum computer. Hence, the vacuum-to-vacuum amplitude cannot be accurately estimated by any efficient classical algorithm, even if the field theory is very weakly coupled, unless BQP=BPP. Furthermore, the corresponding decision problem can be solved by a quantum computer in a time scaling polynomially with the number of bits needed to specify the classical source fields, and this problem is therefore BQP-complete. Our construction can be regarded as an idealized architecture for a universal quantum computer in a laboratory system described by massive phi^4 theory coupled to classical spacetime-dependent sources.
Extending previous work on scalar field theories, we develop a quantum algorithm to compute relativistic scattering amplitudes in fermionic field theories, exemplified by the massive Gross-Neveu model, a theory in two spacetime dimensions with quartic interactions. The algorithm introduces new techniques to meet the additional challenges posed by the characteristics of fermionic fields, and its run time is polynomial in the desired precision and the energy. Thus, it constitutes further progress towards an efficient quantum algorithm for simulating the Standard Model of particle physics.
A quantum algorithm is developed to calculate decay rates and cross sections using quantum resources that scale polynomially in the system size assuming similar scaling for state preparation and time evolution. This is done by computing finite-volume one- and two-particle Green's functions on the quantum hardware. Particle decay rates and two-particle scattering cross sections are extracted from the imaginary parts of the Green's function. A 0+10+10+1 dimensional implementation of this method is demonstrated on IBM's superconducting quantum hardware for the decay of a heavy scalar particle to a pair of light scalars.