pith. sign in

arxiv: 2507.14252 · v2 · submitted 2025-07-18 · ✦ hep-ph · hep-th· quant-ph

A quantum algorithm for the n-gluon MHV scattering amplitude

Erik Bashore , Stefano Moretti , Timea Vitos This is my paper

Pith reviewed 2026-05-19 04:20 UTC · model grok-4.3

classification ✦ hep-ph hep-thquant-ph
keywords quantum algorithmMHV amplitudegluon scatteringtree-level amplitudeunitarisationquantum gatesquantum simulation
0
0 comments X

The pith

A quantum algorithm computes the squared n-gluon MHV tree-level scattering amplitude by mapping color and kinematic factors onto unitarised gates.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proposes a quantum algorithm for the n-gluon maximally helicity violating tree-level scattering amplitude. It revisits a unitarisation method for non-unitary operations to build quantum gates that encode the color and kinematic factors of the amplitude. As a proof of concept the authors implement the building blocks on simulated noiseless quantum circuits for n equals four, where the algorithm yields the squared amplitude and performs well once parameters are optimized.

Core claim

The central claim is that a revisited unitarisation method for non-unitary operations can be used to construct quantum gates responsible for the color and kinematic factors of the gluon scattering amplitude, thereby yielding a full conceptual algorithm that produces the squared MHV amplitude, with the building blocks successfully implemented and performing well on simulated noiseless circuits for n equals four.

What carries the argument

Unitarised quantum gates that encode the color and kinematic factors of the MHV amplitude.

If this is right

  • The squared amplitude for any n can be read out from the final state of the quantum circuit.
  • Parameter optimization improves the fidelity of the n equals four implementation on simulated circuits.
  • The same gate-construction approach extends in principle to higher multiplicities.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If gate overhead stays linear in n the method could reach multiplicities where classical recursion relations become expensive.
  • The same unitarisation technique might apply to other tree-level amplitudes that involve non-unitary color or kinematic structures.
  • Hardware runs with realistic noise would test whether the n equals four performance survives when n increases.

Load-bearing premise

The revisited unitarisation method for non-unitary operations maps efficiently onto quantum gates for the color and kinematic factors of the MHV amplitude without prohibitive overhead or accuracy loss as n grows.

What would settle it

Executing the circuit for n equals five on a quantum simulator or hardware and comparing the output squared amplitude against the known analytic MHV expression to within numerical precision.

Figures

Figures reproduced from arXiv: 2507.14252 by Erik Bashore, Stefano Moretti, Timea Vitos.

Figure 1
Figure 1. Figure 1: The composition R † qq¯UCRqq¯ acts then on the initial state |ψ0⟩ = |a1a2...an⟩{gi} ⊗ |ΩΩ⟩qq¯ ⊗ |Ω⟩U (9) in the following way, using Eq. (7) and Eq. (6), R † qq¯UCRqq¯|ψ0⟩ = R † qq¯ O 1 j=n Q (j) 1 √ 3 X 3 k=1 |a1a2...an⟩{gi}|kk⟩qq¯|Ω⟩U = 1 √ 3 R † qq¯Q (1)Q (2)...Q(n−1)X 3 k,l1 T an l1k |a1a2...an⟩{gi}|l1k⟩qq¯|Ω⟩U +  ⊥ |Ω⟩U  = 1 √ 3 R † qq¯ X k,{li} T a1 lnln−1 T a2 ln−1ln−2 ...T an l1k |a1a2...an⟩{gi}|… view at source ↗
Figure 1
Figure 1. Figure 1: Circuit decomposition of the UC gate defined in Eq. (8). 2.2.2 Helicity-amplitude gate Next, the dual amplitudes are considered from Eq. (2), for which the UA gate is introduced, provid￾ing with UA|ψref⟩ 7→ A|ψref⟩ for some reference state |ψref⟩, where A is given by the Parke-Taylor formula in Eq. (3). The procedure is to setup a set of n − 1 momentum registers {ki} that de￾termine the ordering in A(1, k2… view at source ↗
Figure 2
Figure 2. Figure 2: Circuit decomposition of the UA gate defined in Eq. (10). 3 The algorithm With the introduced gates UC and UA we now propose a method to fully compute the n-gluon MHV scattering amplitude in a quantum circuit. By computing the amplitude, we mean to initialize a quantum state on a set of registers and then utilize unitary operations so that the amplitude defined in Eq. (2) becomes the probability amplitude … view at source ↗
Figure 3
Figure 3. Figure 3: Circuit diagram representation of the algorithm detailed in steps 0-4. [PITH_FULL_IMAGE:figures/full_fig_p011_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Color-factor computation circuit for the color input [PITH_FULL_IMAGE:figures/full_fig_p012_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Multi-partial amplitude circuit diagram that performs the computation in Eq. (34). [PITH_FULL_IMAGE:figures/full_fig_p014_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Simplified version of the 4-gluon scattering amplitude algorithm meant to test the effi [PITH_FULL_IMAGE:figures/full_fig_p015_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Relative errors of the partial amplitudes labeled [PITH_FULL_IMAGE:figures/full_fig_p017_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Relative errors for the partial amplitudes labeled [PITH_FULL_IMAGE:figures/full_fig_p018_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Scaling of total number of qubits for n gluon process compared with possible trends. layer given in step 1.1, we note that all gates will scale linearly with n. For instance, Rλ and Rσ might need to be decomposed but, by our assumption that the scaling is linear, the Hadamard transformation on the gluon registers will always need 3n individual Hadamard gates. The Rk gate is built from X gates that encode t… view at source ↗
read the original 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper proposes a quantum algorithm for computing n-gluon MHV tree-level scattering amplitudes. It revisits a unitarisation method for non-unitary operations to construct quantum gates for the color (SU(3) traces) and kinematic (Parke-Taylor) factors. A full conceptual algorithm for the squared amplitude is detailed, with explicit building blocks implemented and tested via noiseless quantum circuit simulation for n=4, where performance improves with parameter optimization; the work suggests the approach remains viable for higher multiplicities.

Significance. If the unitarisation maps the non-unitary factors to gates with only polynomial overhead in n, the algorithm could provide a new route to quantum computation of multi-gluon amplitudes, where classical complexity grows factorially; the n=4 noiseless simulation and explicit circuit construction constitute a concrete starting point, though the absence of scaling data limits immediate impact.

major comments (2)
  1. [Abstract and results section] Abstract and results section: the claim that 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' rests solely on n=4 noiseless simulation; no error bars, classical baseline comparison, or fidelity metrics are reported, and this limited evidence is load-bearing for the central suggestion of viability beyond n=4.
  2. [Circuit construction and unitarisation discussion] Circuit construction and unitarisation discussion: the revisited unitarisation procedure is asserted to map color and kinematic factors efficiently, but no qubit count, gate depth, or Trotter-step scaling is provided for n=5 or n=6, where the color-space dimension and number of MHV terms grow factorially; without this analysis the polynomial-overhead assumption required for the higher-multiplicity claim cannot be assessed.
minor comments (2)
  1. [Abstract] The abstract and introduction would benefit from an explicit statement of the target observable (e.g., the squared amplitude |M|^2) and how the final measurement extracts it.
  2. Notation for the Parke-Taylor factors and color traces should be cross-referenced to a standard reference (e.g., the original Parke-Taylor formula) to aid readers unfamiliar with the precise MHV expression used.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful review of our manuscript. Below we address each of the major comments in turn.

read point-by-point responses

  1. Referee: [Abstract and results section] Abstract and results section: the claim that 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' rests solely on n=4 noiseless simulation; no error bars, classical baseline comparison, or fidelity metrics are reported, and this limited evidence is load-bearing for the central suggestion of viability beyond n=4.

    Authors: We concur that the current evidence for the algorithm's performance at higher multiplicities is based on the n=4 case. In the revised manuscript, we will modify the abstract and results section to clarify that the n=4 simulation is a proof-of-concept. We will include error bars and fidelity metrics from our simulations and add a discussion noting that while the results are promising, additional work is required to confirm viability for larger n. This addresses the load-bearing nature of the claim. revision: yes

  2. Referee: [Circuit construction and unitarisation discussion] Circuit construction and unitarisation discussion: the revisited unitarisation procedure is asserted to map color and kinematic factors efficiently, but no qubit count, gate depth, or Trotter-step scaling is provided for n=5 or n=6, where the color-space dimension and number of MHV terms grow factorially; without this analysis the polynomial-overhead assumption required for the higher-multiplicity claim cannot be assessed.

    Authors: The unitarisation procedure is constructed to have an overhead that scales polynomially with n by using a number of ancillary qubits proportional to the logarithm of the operator norm and a Trotter decomposition whose step count depends on the desired precision rather than the factorial growth of the number of terms. We agree that explicit numerical values for qubit counts and gate depths at n=5 and n=6 would strengthen the paper. In the revision, we will include a general scaling analysis and rough estimates for these quantities based on the structure of the color and kinematic operators. However, full explicit circuit constructions for n>4 are left for future work as they require significant additional computational resources even for classical simulation. revision: partial

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained construction plus simulation

full rationale

The paper constructs an explicit quantum circuit for the n-gluon MHV amplitude by applying a revisited unitarisation procedure to the color traces and Parke-Taylor kinematic factors, then implements and simulates the building blocks on noiseless circuits for n=4 only. Performance is measured directly from those simulations after parameter optimization; the suggestion of viability for higher n follows from the observed scaling behavior at n=4 rather than from any fitted quantity being relabeled as a prediction or from a self-referential definition. No equation reduces the claimed output to an input by construction, no uniqueness theorem is imported from overlapping prior work to forbid alternatives, and the central algorithmic claim remains independently checkable via the provided circuit diagrams and simulation results.

Axiom & Free-Parameter Ledger

1 free parameters · 1 axioms · 0 invented entities

The proposal depends on the validity of the unitarisation technique for the amplitude factors and on the assumption that noiseless simulation results will translate to real hardware performance.

free parameters (1)
  • circuit optimization parameters
    Parameters tuned to improve performance on the simulated circuits for n=4.
axioms (1)
  • domain assumption The unitarisation method for non-unitary operations produces valid quantum gates for color and kinematic factors.
    The abstract states that the method is revisited and applied to create the gates.

pith-pipeline@v0.9.0 · 5638 in / 1255 out tokens · 39826 ms · 2026-05-19T04:20:34.378259+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

60 extracted references · 60 canonical work pages

  1. [1]

    Challenges in Monte Carlo Event Generator Software for High-Luminosity LHC,

    S. Amoroso et al., “Challenges in Monte Carlo Event Generator Software for High-Luminosity LHC,” Comput. Softw. Big Sci. , vol. 5, no. 1, p. 12, 2021

    work page 2021

  2. [2]

    Speeding up MadGraph5 aMC@NLO,

    O. Mattelaer and K. Ostrolenk, “Speeding up MadGraph5 aMC@NLO,” Eur. Phys. J. C , vol. 81, no. 5, p. 435, 2021

    work page 2021

  3. [3]

    Duality and Multi - Gluon Scattering,

    M. L. Mangano, S. J. Parke, and Z. Xu, “Duality and Multi - Gluon Scattering,” Nucl. Phys. B, vol. 298, pp. 653–672, 1988

    work page 1988

  4. [4]

    Recursive Calculations for Processes with n Gluons,

    F. A. Berends and W. T. Giele, “Recursive Calculations for Processes with n Gluons,” Nucl. Phys. B, vol. 306, pp. 759–808, 1988

    work page 1988

  5. [5]

    Multiparton amplitudes in gauge theories,

    M. L. Mangano and S. J. Parke, “Multiparton amplitudes in gauge theories,” Phys. Rept. , vol. 200, pp. 301–367, 1991

    work page 1991

  6. [6]

    A New approach to multijet calculations in hadron collisions,

    F. Caravaglios, M. L. Mangano, M. Moretti, and R. Pittau, “A New approach to multijet calculations in hadron collisions,” Nucl. Phys. B , vol. 539, pp. 215–232, 1999

    work page 1999

  7. [7]

    Improving colour computations in MadGraph5 aMC@NLO and exploring a 1 /Nc expansion,

    A. Lifson and O. Mattelaer, “Improving colour computations in MadGraph5 aMC@NLO and exploring a 1 /Nc expansion,” Eur. Phys. J. C , vol. 82, no. 12, p. 1144, 2022

    work page 2022

  8. [8]

    The colour matrix at next-to-leading-colour accuracy for tree-level multi-parton processes,

    R. Frederix and T. Vitos, “The colour matrix at next-to-leading-colour accuracy for tree-level multi-parton processes,” JHEP, vol. 12, p. 157, 2021

    work page 2021

  9. [9]

    Leading-colour-based unweighted event generation for multi-parton tree-level processes,

    R. Frederix and T. Vitos, “Leading-colour-based unweighted event generation for multi-parton tree-level processes,” JHEP, vol. 12, p. 201, 2024

    work page 2024

  10. [10]

    Madgraph5aMC@NLO on GPUs and vector CPUs Experience with the first alpha release,

    S. Hageboeck, T. Childers, W. Hopkins, O. Mattelaer, N. Nichols, S. Roiser, J. Teig, A. Valassi, C. Vuosalo, and Z. Wettersten, “Madgraph5aMC@NLO on GPUs and vector CPUs Experience with the first alpha release,” EPJ Web Conf. , vol. 295, p. 11013, 2024

    work page 2024

  11. [11]

    Design and engineering of a simplified workflow execution for the MG5aMC event generator on GPUs and vector CPUs,

    A. Valassi, S. Roiser, O. Mattelaer, and S. Hageboeck, “Design and engineering of a simplified workflow execution for the MG5aMC event generator on GPUs and vector CPUs,” EPJ Web Conf., vol. 251, p. 03045, 2021

    work page 2021

  12. [12]

    Madgraph on GPUs and vector CPUs: towards produc- tion (The 5-year journey to the first LO release CUDACPP v1.00.00),

    A. Valassi, T. Childers, S. Hageb¨ ock, D. Massaro, O. Mattelaer, N. Nichols, F. Optolowicz, S. Roiser, J. Teig, and Z. Wettersten, “Madgraph on GPUs and vector CPUs: towards produc- tion (The 5-year journey to the first LO release CUDACPP v1.00.00),” in 27th International Conference on Computing in High Energy and Nuclear Physics , 3 2025

    work page 2025

  13. [13]

    Hardware acceleration for next-to-leading order event generation within MadGraph5 aMC@NLO,

    Z. Wettersten, O. Mattelaer, S. Roiser, A. Valassi, and M. Zaro, “Hardware acceleration for next-to-leading order event generation within MadGraph5 aMC@NLO,” 3 2025

    work page 2025

  14. [14]

    Efficient Monte Carlo Integration Using Boosted Decision Trees and Generative Deep Neural Networks,

    J. Bendavid, “Efficient Monte Carlo Integration Using Boosted Decision Trees and Generative Deep Neural Networks,” 6 2017

    work page 2017

  15. [15]

    Neural Network-Based Approach to Phase Space Integra- tion,

    M. D. Klimek and M. Perelstein, “Neural Network-Based Approach to Phase Space Integra- tion,” SciPost Phys., vol. 9, p. 053, 2020

    work page 2020

  16. [16]

    Improved neural network Monte Carlo simula- tion,

    I.-K. Chen, M. D. Klimek, and M. Perelstein, “Improved neural network Monte Carlo simula- tion,” SciPost Phys., vol. 10, no. 1, p. 023, 2021

    work page 2021

  17. [17]

    i-flow: High-dimensional Integration and Sampling with Normalizing Flows,

    C. Gao, J. Isaacson, and C. Krause, “i-flow: High-dimensional Integration and Sampling with Normalizing Flows,” Mach. Learn. Sci. Tech., vol. 1, no. 4, p. 045023, 2020

    work page 2020

  18. [18]

    Exploring phase space with Neural Importance Sampling,

    E. Bothmann, T. Janßen, M. Knobbe, T. Schmale, and S. Schumann, “Exploring phase space with Neural Importance Sampling,” SciPost Phys., vol. 8, no. 4, p. 069, 2020

    work page 2020

  19. [19]

    Event Generation with Normalizing Flows,

    C. Gao, S. H¨ oche, J. Isaacson, C. Krause, and H. Schulz, “Event Generation with Normalizing Flows,” Phys. Rev. D , vol. 101, no. 7, p. 076002, 2020

    work page 2020

  20. [20]

    Accelerating Monte Carlo event genera- tion – rejection sampling using neural network event-weight estimates,

    K. Danziger, T. Janßen, S. Schumann, and F. Siegert, “Accelerating Monte Carlo event genera- tion – rejection sampling using neural network event-weight estimates,” SciPost Phys., vol. 12, p. 164, 2022

    work page 2022

  21. [21]

    MadNIS - Neural multi-channel importance sampling,

    T. Heimel, R. Winterhalder, A. Butter, J. Isaacson, C. Krause, F. Maltoni, O. Mattelaer, and T. Plehn, “MadNIS - Neural multi-channel importance sampling,” SciPost Phys., vol. 15, no. 4, p. 141, 2023

    work page 2023

  22. [22]

    Unweighting multijet event generation using factorisation-aware neural networks,

    T. Janßen, D. Maˆ ıtre, S. Schumann, F. Siegert, and H. Truong, “Unweighting multijet event generation using factorisation-aware neural networks,” SciPost Phys. , vol. 15, no. 3, p. 107, 2023

    work page 2023

  23. [23]

    The MadNIS reloaded,

    T. Heimel, N. Huetsch, F. Maltoni, O. Mattelaer, T. Plehn, and R. Winterhalder, “The MadNIS reloaded,” SciPost Phys., vol. 17, no. 1, p. 023, 2024

    work page 2024

  24. [24]

    Accelerating HEP simulations with Neural Importance Sam- pling,

    N. Deutschmann and N. G¨ otz, “Accelerating HEP simulations with Neural Importance Sam- pling,” JHEP, vol. 03, p. 083, 2024. 29

    work page 2024

  25. [25]

    Differentiable MadNIS-Lite,

    T. Heimel, O. Mattelaer, T. Plehn, and R. Winterhalder, “Differentiable MadNIS-Lite,” Sci- Post Phys., vol. 18, no. 1, p. 017, 2025

    work page 2025

  26. [26]

    Standard model physics and the digital quantum revolution: thoughts about the interface,

    N. Klco, A. Roggero, and M. J. Savage, “Standard model physics and the digital quantum revolution: thoughts about the interface,” Rept. Prog. Phys., vol. 85, no. 6, p. 064301, 2022

    work page 2022

  27. [27]

    Review on Quantum Computing for Lattice Field Theory,

    L. Funcke, T. Hartung, K. Jansen, and S. K¨ uhn, “Review on Quantum Computing for Lattice Field Theory,” PoS, vol. LATTICE2022, p. 228, 2023

    work page 2023

  28. [28]

    Toward Nuclear Physics from Lattice QCD on Quantum Comput- ers,

    A. Yamamoto and T. Doi, “Toward Nuclear Physics from Lattice QCD on Quantum Comput- ers,” PTEP, vol. 2024, no. 3, p. 033D02, 2024

    work page 2024

  29. [29]

    Tensor lattice field theory for renormalization and quantum computing,

    Y. Meurice, R. Sakai, and J. Unmuth-Yockey, “Tensor lattice field theory for renormalization and quantum computing,” Rev. Mod. Phys., vol. 94, no. 2, p. 025005, 2022

    work page 2022

  30. [30]

    Loop Feynman integration on a quantum computer,

    J. J. M. de Lejarza, L. Cieri, M. Grossi, S. Vallecorsa, and G. Rodrigo, “Loop Feynman integration on a quantum computer,” Phys. Rev. D , vol. 110, no. 7, p. 074031, 2024

    work page 2024

  31. [31]

    Quantum algorithm for Feynman loop integrals,

    S. Ram´ ırez-Uribe, A. E. Renter´ ıa-Olivo, G. Rodrigo, G. F. R. Sborlini, and L. Vale Silva, “Quantum algorithm for Feynman loop integrals,” JHEP, vol. 05, p. 100, 2022

    work page 2022

  32. [32]

    Variational quantum eigensolver for causal loop Feynman diagrams and directed acyclic graphs,

    G. Clemente, A. Crippa, K. Jansen, S. Ram´ ırez-Uribe, A. E. Renter´ ıa-Olivo, G. Rodrigo, G. F. R. Sborlini, and L. Vale Silva, “Variational quantum eigensolver for causal loop Feynman diagrams and directed acyclic graphs,” Phys. Rev. D , vol. 108, no. 9, p. 096035, 2023

    work page 2023

  33. [33]

    Simulating Collider Physics on Quantum Com- puters Using Effective Field Theories,

    C. W. Bauer, M. Freytsis, and B. Nachman, “Simulating Collider Physics on Quantum Com- puters Using Effective Field Theories,” Phys. Rev. Lett., vol. 127, no. 21, p. 212001, 2021

    work page 2021

  34. [34]

    Determining the proton content with a quantum computer,

    A. P´ erez-Salinas, J. Cruz-Martinez, A. A. Alhajri, and S. Carrazza, “Determining the proton content with a quantum computer,” Phys. Rev. D , vol. 103, no. 3, p. 034027, 2021

    work page 2021

  35. [35]

    Partonic collinear structure by quantum computing,

    T. Li and H. Xing, “Partonic collinear structure by quantum computing,” PoS, vol. DIS2024, p. 029, 2025

    work page 2025

  36. [36]

    Towards a quantum computing algo- rithm for helicity amplitudes and parton showers,

    K. Bepari, S. Malik, M. Spannowsky, and S. Williams, “Towards a quantum computing algo- rithm for helicity amplitudes and parton showers,” Phys. Rev. D , vol. 103, no. 7, p. 076020, 2021

    work page 2021

  37. [37]

    Quantum walk approach to simulating parton showers,

    K. Bepari, S. Malik, M. Spannowsky, and S. Williams, “Quantum walk approach to simulating parton showers,” Phys. Rev. D , vol. 106, no. 5, p. 056002, 2022

    work page 2022

  38. [38]

    Quantum integration of elementary particle processes,

    G. Agliardi, M. Grossi, M. Pellen, and E. Prati, “Quantum integration of elementary particle processes,” Phys. Lett. B , vol. 832, p. 137228, 2022

    work page 2022

  39. [39]

    Collider events on a quantum computer,

    G. Gustafson, S. Prestel, M. Spannowsky, and S. Williams, “Collider events on a quantum computer,” JHEP, vol. 11, p. 035, 2022

    work page 2022

  40. [40]

    Style-based quantum generative adversarial networks for Monte Carlo events,

    C. Bravo-Prieto, J. Baglio, M. C` e, A. Francis, D. M. Grabowska, and S. Carrazza, “Style-based quantum generative adversarial networks for Monte Carlo events,” Quantum, vol. 6, p. 777, 2022. 30

    work page 2022

  41. [41]

    Conditional Born machine for Monte Carlo event generation,

    O. Kiss, M. Grossi, E. Kajomovitz, and S. Vallecorsa, “Conditional Born machine for Monte Carlo event generation,” Phys. Rev. A , vol. 106, no. 2, p. 022612, 2022

    work page 2022

  42. [42]

    Quantum Simulation for High-Energy Physics,

    C. W. Bauer et al. , “Quantum Simulation for High-Energy Physics,” PRX Quantum , vol. 4, no. 2, p. 027001, 2023

    work page 2023

  43. [43]

    Quantum Computing for High-Energy Physics: State of the Art and Challenges,

    A. Di Meglio et al. , “Quantum Computing for High-Energy Physics: State of the Art and Challenges,” PRX Quantum, vol. 5, no. 3, p. 037001, 2024

    work page 2024

  44. [44]

    Quantum simulation of colour in perturbative quantum chromodynamics,

    H. A. Chawdhry and M. Pellen, “Quantum simulation of colour in perturbative quantum chromodynamics,” SciPost Phys., vol. 15, no. 5, p. 205, 2023

    work page 2023

  45. [45]

    Quantum algorithms for the simulation of perturbative QCD processes,

    H. A. Chawdhry and M. Pellen, “Quantum algorithms for the simulation of perturbative QCD processes,” PoS, vol. RADCOR2023, p. 087, 2023

    work page 2023

  46. [46]

    Quantum simulation of scattering amplitudes and interferences in perturbative QCD,

    H. A. Chawdhry, M. Pellen, and S. Williams, “Quantum simulation of scattering amplitudes and interferences in perturbative QCD,” 7 2025

    work page 2025

  47. [47]

    Color Flow Decomposition of QCD Amplitudes,

    F. Maltoni, K. Paul, T. Stelzer, and S. Willenbrock, “Color Flow Decomposition of QCD Amplitudes,” Phys. Rev. D , vol. 67, p. 014026, 2003

    work page 2003

  48. [48]

    New color decompositions for gauge amplitudes at tree and loop level,

    V. Del Duca, L. J. Dixon, and F. Maltoni, “New color decompositions for gauge amplitudes at tree and loop level,” Nucl. Phys. B , vol. 571, pp. 51–70, 2000

    work page 2000

  49. [49]

    Orthogonal multiplet bases in SU(Nc) color space,

    S. Keppeler and M. Sjodahl, “Orthogonal multiplet bases in SU(Nc) color space,” JHEP, vol. 09, p. 124, 2012

    work page 2012

  50. [50]

    An Amplitude for n Gluon Scattering,

    S. J. Parke and T. R. Taylor, “An Amplitude for n Gluon Scattering,” Phys. Rev. Lett., vol. 56, p. 2459, 1986

    work page 1986

  51. [51]

    All tree-level amplitudes in massless QCD,

    L. J. Dixon, J. M. Henn, J. Plefka, and T. Schuster, “All tree-level amplitudes in massless QCD,” JHEP, vol. 01, p. 035, 2011

    work page 2011

  52. [52]

    Quantum computation and quantum information,

    C. I. Nielsen M., “Quantum computation and quantum information,” 2010

    work page 2010

  53. [53]

    Qiskit Experiments: A Python package to characterize and calibrate quantum computers,

    N. Kanazawa, D. J. Egger, Y. Ben-Haim, H. Zhang, W. E. Shanks, G. Aleksandrowicz, and C. J. Wood, “Qiskit Experiments: A Python package to characterize and calibrate quantum computers,” J. Open Source Softw. , vol. 8, no. 84, p. 5329, 2023

    work page 2023

  54. [54]

    Quantum circuits for the Ising spin networks,

    G. Czelusta and J. Mielczarek, “Quantum circuits for the Ising spin networks,” Phys. Rev. D, vol. 108, no. 8, p. 086027, 2023

    work page 2023

  55. [55]

    Matrix product state represen- tations,

    D. Perez-Garcia, F. Verstraete, M. M. Wolf, and J. I. Cirac, “Matrix product state represen- tations,” Quant. Inf. Comput. , vol. 7, no. 5-6, pp. 401–430, 2007

    work page 2007

  56. [56]

    Matrix product states and projected entangled pair states: Concepts, symmetries, theorems,

    J. I. Cirac, D. Perez-Garcia, N. Schuch, and F. Verstraete, “Matrix product states and projected entangled pair states: Concepts, symmetries, theorems,” Rev. Mod. Phys. , vol. 93, no. 4, p. 045003, 2021

    work page 2021

  57. [57]

    Quantum Circuit Matrix Product State Ansatz for Large- Scale Simulations of Molecules,

    Y. Fan, J. Liu, Z. Li, and J. Yang, “Quantum Circuit Matrix Product State Ansatz for Large- Scale Simulations of Molecules,” J. Chem. Theor. Comput. , vol. 19, no. 16, pp. 5407–5417, 2023. 31

    work page 2023

  58. [58]

    Encoding of matrix product states into quantum circuits of one- and two-qubit gates,

    S.-J. Ran, “Encoding of matrix product states into quantum circuits of one- and two-qubit gates,” Phys. Rev. A , vol. 101, no. 3, p. 032310, 2020

    work page 2020

  59. [59]

    Scattering Amplitudes,

    H. Elvang and Y.-t. Huang, “Scattering Amplitudes,” 8 2013

    work page 2013

  60. [60]

    Comparison of quantum-walk implementations on noisy intermediate-scale quantum computers,

    K. Georgopoulos, C. Emary, and P. Zuliani, “Comparison of quantum-walk implementations on noisy intermediate-scale quantum computers,” Phys. Rev. A , vol. 103, no. 2, p. 022408, 2021. 32

    work page 2021