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

Quantum Simulation of Drell-Yan Scattering at the Partonic Level

Erik Bashore

Published Jan 1, 2026• 0 citations
OpenAlex

Abstract

In this project we probe the possibilities of efficiently simulating simple Feynman diagrams usingquantum devices. More precisely, we study Drell-Yan lepton pair creation at the partonic level of theform qq¯ → γ/Z → ℓ−ℓ+. We develop quantum gates that build up the relevant diagrams based onFeynman rules, such as vertex and propagator gates V and P. We show how the quantum circuit maybe used to compute simultaneous amplitudes in the phase space and how to reach the full integratedcross-section from the outputs. Finally we also provide a method to isolate the interference effectsof the contributing diagrams by making a basis rotation inside the circuit. The circuit design ismade to be universal, and thus this work constitutes a step towards the implementation of arbitraryscattering process computations and efficient interference analyses.

Related papers

Quantum computation of partonic Drell-Yan scattering cross sections and interference effects

Erik Bashore, Stefano Moretti, Timea Vitos

We probe the possibilities of efficiently constructing simple Feynman diagrams into quantum devices. More precisely, we study Drell-Yan lepton pair creation at the partonic level of the form q qbar -> gamma/Z -> l- l+. We develop quantum gates that build up the relevant diagrams using simple Feynman rules, such as vertex and propagator gates V and P. We show how the quantum circuit may compute simultaneous amplitudes in the phase space and how to reach the full integrated cross section from the outputs. In addition to this, we also show how the circuit is able to simultaneously isolate the interference effects of the contributing diagrams by a simple basis rotation. The circuit design is made to be general, and thus this work constitutes a step towards the implementation of arbitrary scattering process computations and efficient interference analyses.

hep-phCross-listedarXiv:2608.28057•Aug 31, 2026•0 citations

Quantum simulation of scattering amplitudes and interferences in perturbative QCD

Herschel A. Chawdhry, Mathieu Pellen, Simon Williams

A flagship application of quantum computers is the simulation of other quantum systems, including quantum field theories. In this article, we show how quantum computers can be employed to naturally calculate Feynman diagrams and their interferences in Quantum Chromodynamics (QCD). We simulate the colour parts of the interactions directly on the quantum computer, while the kinematic parts are for now pre-computed classically. For processes where some of the external particles are identical, we find the first hints of a potential quantum advantage. We validate our techniques using simulated quantum computers. Furthermore, for toy examples we also demonstrate our algorithms on a 56-qubit trapped-ion quantum computer. The work constitutes a further key step towards a full quantum simulation of generic perturbative QCD processes.

arXiv:2507.07194•Jul 9, 2025•0 citations

Quantum simulation of colour in perturbative quantum chromodynamics

Herschel A. Chawdhry, Mathieu Pellen

Quantum computers are expected to give major speed-ups for the simulation of quantum systems. In this work, we present quantum gates that simulate the colour part of the interactions of quarks and gluons in perturbative quantum chromodynamics (QCD). As a first application, we implement these circuits on a simulated noiseless quantum computer and use them to calculate colour factors for various examples of Feynman diagrams. This work constitutes a first key step towards a quantum simulation of generic scattering processes in perturbative QCD.

arXiv:2303.04818•SciPost Physics•Nov 24, 2023•12 citations

Qubits and Vacuum Amplitudes

Germán Rodrigo

High-energy colliders, such as the Large Hadron Collider (LHC) at CERN, are genuine quantum machines, so, in line with Richard Feynman's original motivation for Quantum Computing, the scattering processes that take place there are natural candidates to be simulated on a quantum system. Potential applications range from quantum machine learning methods for collider data analysis, to faster and more precise evaluations of intricate multiloop Feynman diagrams, more efficient jet clustering, improved simulations of parton showers, and many other tasks. In this work, the focus will be on two specific applications: first, the identification of the causal structure of multiloop vacuum amplitudes, a key ingredient of the Loop-Tree Duality and an area with deep connections to graph theory; and second, the integration and sampling of high-dimensional functions. The latter constitutes a first step toward the realization of a fully fledged quantum event generator operating at high perturbative orders.

hep-phCross-listedarXiv:2601.00722•Jan 5, 2026•0 citations

Quantum simulation of scattering amplitudes and interferences in perturbative QCD

Herschel A. Chawdhry, Mathieu Pellen, Simon Williams

Abstract A flagship application of quantum computers is the simulation of other quantum systems, including quantum field theories. In this article, we show how quantum computers can be employed to naturally calculate Feynman diagrams and their interferences in Quantum Chromodynamics (QCD). We simulate the colour parts of the interactions directly on the quantum computer, while the kinematic parts are for now pre-computed classically. For processes where some of the external particles are identical, we find the first hints of a potential quantum advantage. We validate our techniques using simulated quantum computers. Furthermore, for toy examples we also demonstrate our algorithms on a 56-qubit trapped-ion quantum computer. The work constitutes a further key step towards a full quantum simulation of generic perturbative QCD processes.

The European Physical Journal C•Aug 11, 2026•0 citations

Quantum algorithms for event generation in high-energy collisions

Khadeejah Bepari

The efficient simulation of accurate collider data at modern collider experiments will be crucial for the detection of Beyond the Standard Model signatures in the search for new physics. Simulation of collision processes at hadron colliders like the LHC are carried out by Monte Carlo event generators which simulate the evolution from an initial hard scattering event, downwards in energy scales, towards the formation of long lived particles. However, as we enter a new era of higher luminosity experiments, accurate simulations of these pseudo-event generated data will become further computationally intensive with the vast amounts of data to generate. With the rapid development of quantum computing hardware, quantum computation offers itself as an alternative computing paradigm that may be harnessed to provide a natural framework to model several physical processes in high-energy physics, where the inherent quantum features of the device may be exploited to provide speedups or enhance current simulations. In this thesis, we present general and extendable quantum algorithms for two crucial parts of event generation: the calculation of matrix elements for the hard interaction and the QCD parton shower stage. First, a novel algorithm is proposed for the calculation of helicity amplitudes by outlining a proposal of constructing helicity spinors directly on a quantum circuit and manipulating the spinors to compute helicity amplitudes. This was used to calculate multiple helicity amplitudes for simple tree level scattering processes simultaneously as a proof-of-principle demonstration. The second algorithm outlines a proposal for a Monte Carlo-inspired parton shower algorithm which was used to simulate two shower steps of a simplified QCD model. The final algorithm extends the quantum parton shower algorithm onto a quantum walk framework which demonstrates significant scaling improvements, simulating more realistic shower depths. These algorithms utilise the quantum computers’ ability to remain in a quantum state throughout the computation and represents a first step towards a quantum computing algorithm describing full collision events at the LHC.

•Jan 1, 2024•0 citations
In this project we probe the possibilities of efficiently simulating simple Feynman diagrams usingquantum devices. More precisely, we study Drell-Yan lepton pair creation at the partonic level of theform qq¯ → γ/Z → ℓ−ℓ+. We develop quantum gates that build up the relevant diagrams based onFeynman rules, such as vertex and propagator gates V and P. We show how the quantum circuit maybe used to compute simultaneous amplitudes in the phase space and how to reach the full integratedcross-section from the outputs. Finally we also provide a method to isolate the interference effectsof the contributing diagrams by making a basis rotation inside the circuit. The circuit design ismade to be universal, and thus this work constitutes a step towards the implementation of arbitraryscattering process computations and efficient interference analyses.
We probe the possibilities of efficiently constructing simple Feynman diagrams into quantum devices. More precisely, we study Drell-Yan lepton pair creation at the partonic level of the form q qbar -> gamma/Z -> l- l+. We develop quantum gates that build up the relevant diagrams using simple Feynman rules, such as vertex and propagator gates V and P. We show how the quantum circuit may compute simultaneous amplitudes in the phase space and how to reach the full integrated cross section from the outputs. In addition to this, we also show how the circuit is able to simultaneously isolate the interference effects of the contributing diagrams by a simple basis rotation. The circuit design is made to be general, and thus this work constitutes a step towards the implementation of arbitrary scattering process computations and efficient interference analyses.
A flagship application of quantum computers is the simulation of other quantum systems, including quantum field theories. In this article, we show how quantum computers can be employed to naturally calculate Feynman diagrams and their interferences in Quantum Chromodynamics (QCD). We simulate the colour parts of the interactions directly on the quantum computer, while the kinematic parts are for now pre-computed classically. For processes where some of the external particles are identical, we find the first hints of a potential quantum advantage. We validate our techniques using simulated quantum computers. Furthermore, for toy examples we also demonstrate our algorithms on a 56-qubit trapped-ion quantum computer. The work constitutes a further key step towards a full quantum simulation of generic perturbative QCD processes.
Quantum computers are expected to give major speed-ups for the simulation of quantum systems. In this work, we present quantum gates that simulate the colour part of the interactions of quarks and gluons in perturbative quantum chromodynamics (QCD). As a first application, we implement these circuits on a simulated noiseless quantum computer and use them to calculate colour factors for various examples of Feynman diagrams. This work constitutes a first key step towards a quantum simulation of generic scattering processes in perturbative QCD.
High-energy colliders, such as the Large Hadron Collider (LHC) at CERN, are genuine quantum machines, so, in line with Richard Feynman's original motivation for Quantum Computing, the scattering processes that take place there are natural candidates to be simulated on a quantum system. Potential applications range from quantum machine learning methods for collider data analysis, to faster and more precise evaluations of intricate multiloop Feynman diagrams, more efficient jet clustering, improved simulations of parton showers, and many other tasks. In this work, the focus will be on two specific applications: first, the identification of the causal structure of multiloop vacuum amplitudes, a key ingredient of the Loop-Tree Duality and an area with deep connections to graph theory; and second, the integration and sampling of high-dimensional functions. The latter constitutes a first step toward the realization of a fully fledged quantum event generator operating at high perturbative orders.
Abstract A flagship application of quantum computers is the simulation of other quantum systems, including quantum field theories. In this article, we show how quantum computers can be employed to naturally calculate Feynman diagrams and their interferences in Quantum Chromodynamics (QCD). We simulate the colour parts of the interactions directly on the quantum computer, while the kinematic parts are for now pre-computed classically. For processes where some of the external particles are identical, we find the first hints of a potential quantum advantage. We validate our techniques using simulated quantum computers. Furthermore, for toy examples we also demonstrate our algorithms on a 56-qubit trapped-ion quantum computer. The work constitutes a further key step towards a full quantum simulation of generic perturbative QCD processes.
The efficient simulation of accurate collider data at modern collider experiments will be crucial for the detection of Beyond the Standard Model signatures in the search for new physics. Simulation of collision processes at hadron colliders like the LHC are carried out by Monte Carlo event generators which simulate the evolution from an initial hard scattering event, downwards in energy scales, towards the formation of long lived particles. However, as we enter a new era of higher luminosity experiments, accurate simulations of these pseudo-event generated data will become further computationally intensive with the vast amounts of data to generate. With the rapid development of quantum computing hardware, quantum computation offers itself as an alternative computing paradigm that may be harnessed to provide a natural framework to model several physical processes in high-energy physics, where the inherent quantum features of the device may be exploited to provide speedups or enhance current simulations. In this thesis, we present general and extendable quantum algorithms for two crucial parts of event generation: the calculation of matrix elements for the hard interaction and the QCD parton shower stage. First, a novel algorithm is proposed for the calculation of helicity amplitudes by outlining a proposal of constructing helicity spinors directly on a quantum circuit and manipulating the spinors to compute helicity amplitudes. This was used to calculate multiple helicity amplitudes for simple tree level scattering processes simultaneously as a proof-of-principle demonstration. The second algorithm outlines a proposal for a Monte Carlo-inspired parton shower algorithm which was used to simulate two shower steps of a simplified QCD model. The final algorithm extends the quantum parton shower algorithm onto a quantum walk framework which demonstrates significant scaling improvements, simulating more realistic shower depths. These algorithms utilise the quantum computers’ ability to remain in a quantum state throughout the computation and represents a first step towards a quantum computing algorithm describing full collision events at the LHC.