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:1904.03196 · Physical Review Letters

Quantum Algorithm for High Energy Physics Simulations

Benjamin Philip Nachman, Davide Provasoli, Wibe Albert de Jong, C. Bauer

Published Feb 10, 2021• 127 citations
arXivHTMLPDF

Abstract

Simulating quantum field theories is a flagship application of quantum computing. However, calculating experimentally relevant high energy scattering amplitudes entirely on a quantum computer is prohibitively difficult. It is well known that such high energy scattering processes can be factored into pieces that can be computed using well established perturbative techniques, and pieces which currently have to be simulated using classical Markov chain algorithms. These classical Markov chain simulation approaches work well to capture many of the salient features, but cannot capture all quantum effects. To exploit quantum resources in the most efficient way, we introduce a new paradigm for quantum algorithms in field theories. This approach uses quantum computers only for those parts of the problem which are not computable using existing techniques. In particular, we develop a polynomial time quantum final state shower that accurately models the effects of intermediate spin states similar to those present in high energy electroweak showers with a global evolution variable. The algorithm is explicitly demonstrated for a simplified quantum field theory on a quantum computer.

DOI
10.1103/physrevlett.126.062001

Related papers

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

An introduction to quantum computing for high energy physics

Davide Provasoli

Applications of quantum computing to high energy physics (HEP) is a relatively new field of research. As such, the relevant literature is not well organized in one place and a clear road-map for people approaching the field is not currently available. Addressing this issue was the main motivation for this article, which is intended a pedagogical introduction to the field and specifically to our research direction, i.e. application of quantum computing to parton shower event generators, with the hope of more people becoming interested in exploring this path. Our paper on the subject, “A quantum algorithm for high energy physics simulations” [8], is the subject of chapter 4. I hope this article can provide a direct path for people familiar with quantum mechanics and quantum field theory to start reading papers or conducting research in this area of quantum computing applications in HEP. In this regard, the quantum algorithm we present in Chapter 4, can serve as an example of development of a novel efficient quantum algorithm to solve a problem in a particle physics model.

•Jan 1, 2020•1 citation

Quantum computing applications in High Energy Physics: clustering, integration and generative models

Jorge J. Martínez de Lejarza

This PhD thesis explores the potential of quantum computing to address computational challenges in high-energy physics (HEP). As the Standard Model (SM) leaves key questions unanswered and no signs of new physics have emerged since the Higgs boson discovery, advanced experimental and computational tools become necessary. Quantum computing offers a promising alternative to classical methods, and this work investigates three main avenues where quantum algorithms can be useful in HEP research. First, we develop quantum subroutines for computing Minkowski distances and identifying maximum values in unsorted data, inserting them into clustering algorithms such as $k$-means, Affinity Propagation, and $k_T$-jet clustering. These quantum algorithms match classical performance while offering theoretical advantages when implemented on quantum hardware with qRAM. Then, we introduce a novel quantum Monte Carlo integrator, Quantum Fourier Iterative Amplitude Estimation (QFIAE), which combines a quantum neural network with amplitude estimation to integrate multivariate functions. QFIAE is executed on simulators and real quantum computers to evaluate Feynman loop integrals via Loop-Tree Duality, and is extended to compute (partially on hardware) a physical observable at NLO in perturbative quantum field theory. Finally, we present Quantum Chebyshev Probabilistic Models (QCPMs) for modeling multivariate distributions, applying them to fragmentation functions of partons fragmenting into kaons and pions. These models demonstrate accurate generative and interpolation capabilities. We also show how entanglement between variables plays a key role in training, enhancing model accuracy. Overall, these results show how quantum algorithms can already tackle relevant HEP problems on current hardware, while paving the way for future fault-tolerant applications that fully exploit quantum computational advantages.

quant-pharXiv:2512.01597•Dec 2, 2025•0 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•38 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•52 citations

Overview of Applications of Quantum Computing in QCD

Germán Rodrigo

Quantum computing has emerged as a promising framework for addressing computationally demanding problems in collider physics. In recent years, a growing number of quantum algorithms have been proposed for applications ranging from event generation and parton shower simulation to the evaluation of scattering amplitudes, loop and phase-space integration, and optimization problems relevant to experimental analysis. We provide a concise overview of the main ideas behind these developments, with emphasis on the potential advantages of quantum approaches in comparison with classical methods, as well as on the current limitations imposed by noisy intermediate-scale quantum hardware.

hep-phCross-listedarXiv:2607.08169•Jul 10, 2026•0 citations
Simulating quantum field theories is a flagship application of quantum computing. However, calculating experimentally relevant high energy scattering amplitudes entirely on a quantum computer is prohibitively difficult. It is well known that such high energy scattering processes can be factored into pieces that can be computed using well established perturbative techniques, and pieces which currently have to be simulated using classical Markov chain algorithms. These classical Markov chain simulation approaches work well to capture many of the salient features, but cannot capture all quantum effects. To exploit quantum resources in the most efficient way, we introduce a new paradigm for quantum algorithms in field theories. This approach uses quantum computers only for those parts of the problem which are not computable using existing techniques. In particular, we develop a polynomial time quantum final state shower that accurately models the effects of intermediate spin states similar to those present in high energy electroweak showers with a global evolution variable. The algorithm is explicitly demonstrated for a simplified quantum field theory on a quantum computer.
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.
Applications of quantum computing to high energy physics (HEP) is a relatively new field of research. As such, the relevant literature is not well organized in one place and a clear road-map for people approaching the field is not currently available. Addressing this issue was the main motivation for this article, which is intended a pedagogical introduction to the field and specifically to our research direction, i.e. application of quantum computing to parton shower event generators, with the hope of more people becoming interested in exploring this path. Our paper on the subject, “A quantum algorithm for high energy physics simulations” [8], is the subject of chapter 4. I hope this article can provide a direct path for people familiar with quantum mechanics and quantum field theory to start reading papers or conducting research in this area of quantum computing applications in HEP. In this regard, the quantum algorithm we present in Chapter 4, can serve as an example of development of a novel efficient quantum algorithm to solve a problem in a particle physics model.
This PhD thesis explores the potential of quantum computing to address computational challenges in high-energy physics (HEP). As the Standard Model (SM) leaves key questions unanswered and no signs of new physics have emerged since the Higgs boson discovery, advanced experimental and computational tools become necessary. Quantum computing offers a promising alternative to classical methods, and this work investigates three main avenues where quantum algorithms can be useful in HEP research. First, we develop quantum subroutines for computing Minkowski distances and identifying maximum values in unsorted data, inserting them into clustering algorithms such as kkk-means, Affinity Propagation, and kTk_TkT​-jet clustering. These quantum algorithms match classical performance while offering theoretical advantages when implemented on quantum hardware with qRAM. Then, we introduce a novel quantum Monte Carlo integrator, Quantum Fourier Iterative Amplitude Estimation (QFIAE), which combines a quantum neural network with amplitude estimation to integrate multivariate functions. QFIAE is executed on simulators and real quantum computers to evaluate Feynman loop integrals via Loop-Tree Duality, and is extended to compute (partially on hardware) a physical observable at NLO in perturbative quantum field theory. Finally, we present Quantum Chebyshev Probabilistic Models (QCPMs) for modeling multivariate distributions, applying them to fragmentation functions of partons fragmenting into kaons and pions. These models demonstrate accurate generative and interpolation capabilities. We also show how entanglement between variables plays a key role in training, enhancing model accuracy. Overall, these results show how quantum algorithms can already tackle relevant HEP problems on current hardware, while paving the way for future fault-tolerant applications that fully exploit quantum computational advantages.
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.
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.
Quantum computing has emerged as a promising framework for addressing computationally demanding problems in collider physics. In recent years, a growing number of quantum algorithms have been proposed for applications ranging from event generation and parton shower simulation to the evaluation of scattering amplitudes, loop and phase-space integration, and optimization problems relevant to experimental analysis. We provide a concise overview of the main ideas behind these developments, with emphasis on the potential advantages of quantum approaches in comparison with classical methods, as well as on the current limitations imposed by noisy intermediate-scale quantum hardware.