Back to News
quantum-computing

A quantum algorithm for the n-gluon MHV scattering amplitude, by Erik Bashore, Stefano Moretti, Timea Vitos

SciPost Quantum
Loading...
3 min read
0 likes
⚡ Quantum Brief
Researchers from Uppsala University, the University of Southampton, and Eötvös Loránd University developed a quantum algorithm to compute n-gluon MHV tree-level scattering amplitudes, a key challenge in quantum chromodynamics. The team introduced a novel method for "unitarizing" non-unitary operations, enabling quantum gates to encode color and kinematic factors of gluon interactions—critical for simulating high-energy particle physics processes. A proof-of-concept implementation on noiseless quantum circuits for n=4 gluons demonstrated the algorithm’s viability, with parameter optimizations yielding accurate squared amplitude calculations. Simulations suggest the approach scales efficiently, positioning it as a promising candidate for near-term quantum computers tackling higher-multiplicity scattering events beyond classical computational limits. Funded by the UK’s STFC and Sweden’s Vetenskapsrådet, the work bridges quantum computing with high-energy physics, potentially accelerating collider physics and QCD research.
A quantum algorithm for the n-gluon MHV scattering amplitude, by Erik Bashore, Stefano Moretti, Timea Vitos

Summarize this article with:

SciPost Physics Home Authoring Refereeing Submit a manuscript About A quantum algorithm for the n-gluon MHV scattering amplitude Erik Bashore, Stefano Moretti, Timea Vitos SciPost Phys. 20, 114 (2026) · published 16 April 2026 doi: 10.21468/SciPostPhys.20.4.114 pdf BiBTeX RIS Submissions/Reports Abstract We propose a quantum algorithm for computing the $n$-gluon maximally helicity violating (MHV) tree-level scattering amplitude. We revisit a newly proposed method for unitarisation of non-unitary operations and present how this implementation can be used to create quantum gates responsible for the color and kinematic factors of the gluon scattering amplitude. As a proof-of-concept, we detail the full conceptual algorithm that yields the squared amplitude and implement the corresponding building blocks on simulated noiseless quantum circuits for $n=4$ to analyze its performance. The algorithm is found to perform well with parameter optimizations, suggesting it to be a good candidate for implementing on quantum computers also for higher multiplicities. × TY - JOURPB - SciPost FoundationDO - 10.21468/SciPostPhys.20.4.114TI - A quantum algorithm for the n-gluon MHV scattering amplitudePY - 2026/04/16UR - https://scipost.org/SciPostPhys.20.4.114JF - SciPost PhysicsJA - SciPost Phys.VL - 20IS - 4SP - 114A1 - Bashore, ErikAU - Moretti, StefanoAU - Vitos, TimeaAB - We propose a quantum algorithm for computing the $n$-gluon maximally helicity violating (MHV) tree-level scattering amplitude. We revisit a newly proposed method for unitarisation of non-unitary operations and present how this implementation can be used to create quantum gates responsible for the color and kinematic factors of the gluon scattering amplitude. As a proof-of-concept, we detail the full conceptual algorithm that yields the squared amplitude and implement the corresponding building blocks on simulated noiseless quantum circuits for $n=4$ to analyze its performance. The algorithm is found to perform well with parameter optimizations, suggesting it to be a good candidate for implementing on quantum computers also for higher multiplicities.ER - × @Article{10.21468/SciPostPhys.20.4.114, title={{A quantum algorithm for the n-gluon MHV scattering amplitude}}, author={Erik Bashore and Stefano Moretti and Timea Vitos}, journal={SciPost Phys.}, volume={20}, pages={114}, year={2026}, publisher={SciPost}, doi={10.21468/SciPostPhys.20.4.114}, url={https://scipost.org/10.21468/SciPostPhys.20.4.114},} Ontology / Topics See full Ontology or Topics database. Quantum chromodynamics (QCD) Authors / Affiliations: mappings to Contributors and Organizations See all Organizations. 1 Erik Bashore, 1 2 Stefano Moretti, 1 3 Timea Vitos 1 Uppsala universitet / Uppsala University 2 University of Southampton 3 Eötvös Loránd Tudományegyetem / Eötvös Loránd University [ELTE] Funders for the research work leading to this publication Science and Technology Facilities Council [STFC] Vetenskapsrådet / Swedish Research Council

Read Original

Tags

quantum-investment
quantum-computing
quantum-algorithms

Source Information

Source: SciPost Quantum