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

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.

arXiv:2507.07194•The European Physical Journal C•Aug 11, 2026•7 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•20 citations

Gate-Level Simulation of Quantum Circuits

George F. Viamontes, Manoj Rajagopalan, Igor L. Markov +1 more

While thousands of experimental physicists and chemists are currently trying to build scalable quantum computers, it appears that simulation of quantum computation will be at least as critical as circuit simulation in classical VLSI design. However, since the work of Richard Feynman in the early 1980s little progress was made in practical quantum simulation. Most researchers focused on polynomial-time simulation of restricted types of quantum circuits that fall short of the full power of quantum computation. Simulating quantum computing devices and useful quantum algorithms on classical hardware now requires excessive computational resources, making many important simulation tasks infeasible. In this work we propose a new technique for gate-level simulation of quantum circuits which greatly reduces the difficulty and cost of such simulations. The proposed technique is implemented in a simulation tool called the Quantum Information Decision Diagram (QuIDD) and evaluated by simulating Grover's quantum search algorithm. The back-end of our package, QuIDD Pro, is based on Binary Decision Diagrams, well-known for their ability to efficiently represent many seemingly intractable combinatorial structures. This reliance on a well-established area of research allows us to take advantage of existing software for BDD manipulation and achieve unparalleled empirical results for quantum simulation.

arXiv:quant-ph/0208003•Aug 1, 2002•6 citations

Towards a quantum computing algorithm for helicity amplitudes and parton showers

Khadeejah Bepari, Sarah Alam Malik, Michael Spannowsky +1 more

The interpretation of measurements of high-energy particle collisions relies heavily on the performance of full event generators, which include the calculation of the hard process and the subsequent parton shower step. With the continuous improvement of quantum devices, dedicated algorithms are needed to exploit the potential quantum that computers can provide. We propose general and extendable algorithms for quantum gate computers to facilitate calculations of helicity amplitudes and the parton shower process. The helicity amplitude calculation exploits the equivalence between spinors and qubits and the unique features of a quantum computer to compute the helicities of each particle involved simultaneously, thus fully utilizing the quantum nature of the computation. This advantage over classical computers is further exploited by the simultaneous computation of s- and t-channel amplitudes for a $2\ensuremath{\rightarrow}2$ process. The parton shower algorithm simulates collinear emission for a two-step, discrete parton shower. In contrast to classical implementations, the quantum algorithm constructs a wave function with a superposition of all shower histories for the whole parton shower process, thus removing the need to explicitly keep track of individual shower histories. Both algorithms utilize the quantum computers ability to remain in a quantum state throughout the computation and represent a first step towards a quantum computing algorithm describing the full collision event at the LHC.

arXiv:2010.00046•Physical review. D/Physical review. D.•Apr 26, 2021•51 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.
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.
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.
While thousands of experimental physicists and chemists are currently trying to build scalable quantum computers, it appears that simulation of quantum computation will be at least as critical as circuit simulation in classical VLSI design. However, since the work of Richard Feynman in the early 1980s little progress was made in practical quantum simulation. Most researchers focused on polynomial-time simulation of restricted types of quantum circuits that fall short of the full power of quantum computation. Simulating quantum computing devices and useful quantum algorithms on classical hardware now requires excessive computational resources, making many important simulation tasks infeasible. In this work we propose a new technique for gate-level simulation of quantum circuits which greatly reduces the difficulty and cost of such simulations. The proposed technique is implemented in a simulation tool called the Quantum Information Decision Diagram (QuIDD) and evaluated by simulating Grover's quantum search algorithm. The back-end of our package, QuIDD Pro, is based on Binary Decision Diagrams, well-known for their ability to efficiently represent many seemingly intractable combinatorial structures. This reliance on a well-established area of research allows us to take advantage of existing software for BDD manipulation and achieve unparalleled empirical results for quantum simulation.
The interpretation of measurements of high-energy particle collisions relies heavily on the performance of full event generators, which include the calculation of the hard process and the subsequent parton shower step. With the continuous improvement of quantum devices, dedicated algorithms are needed to exploit the potential quantum that computers can provide. We propose general and extendable algorithms for quantum gate computers to facilitate calculations of helicity amplitudes and the parton shower process. The helicity amplitude calculation exploits the equivalence between spinors and qubits and the unique features of a quantum computer to compute the helicities of each particle involved simultaneously, thus fully utilizing the quantum nature of the computation. This advantage over classical computers is further exploited by the simultaneous computation of s- and t-channel amplitudes for a $2\ensuremath{\rightarrow}2$ process. The parton shower algorithm simulates collinear emission for a two-step, discrete parton shower. In contrast to classical implementations, the quantum algorithm constructs a wave function with a superposition of all shower histories for the whole parton shower process, thus removing the need to explicitly keep track of individual shower histories. Both algorithms utilize the quantum computers ability to remain in a quantum state throughout the computation and represent a first step towards a quantum computing algorithm describing the full collision event at the LHC.