A quantum algorithm for the n-gluon MHV scattering amplitude
We propose a quantum algorithm for computing the n <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mi>n</mml:mi> </mml:math> -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 <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>=</mml:mo> <mml:mn>4</mml:mn> </mml:mrow> </mml:math> 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.
Authors
- Stefano Moretti (ORCID: https://orcid.org/0000-0002-8601-7246)
- Timea Vitos (ORCID: https://orcid.org/0000-0001-7880-5851)
- Erik Bashore
Institutions
- Eötvös Loránd University (HU)
- Uppsala University (SE)
- University of Southampton (GB)
Publication Details
- Journal
- SciPost Physics
- Published
- 2026-04-16
- DOI
- https://doi.org/10.21468/scipostphys.20.4.114
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Vetenskapsrådet
- Science and Technology Facilities Council
- Uppsala Multidisciplinary Center for Advanced Computational Science