Researchers demonstrate quantum algorithm for particle physics calculations
Scientists have successfully tested a quantum algorithm that calculates particle collision outcomes—a core physics problem that could run faster on quantum computers than classical machines. The breakthrough suggests quantum systems are moving closer to solving real-world physics simulations, a capability that could reshape drug discovery, materials science, and fundamental research timelines.
Originaltitel: 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.