Bepari, Khadeejah and Malik, Sarah and Spannowsky, Michael and Williams, Simon (2021) 'Towards a quantum computing algorithm for helicity amplitudes and parton showers.', Physical Review D, 103 (7).
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 → 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.
|Full text:||(VoR) Version of Record|
Available under License - Creative Commons Attribution 4.0.
Download PDF (1717Kb)
|Publisher Web site:||https://doi.org/10.1103/PhysRevD.103.076020|
|Publisher statement:||Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article’s title, journal citation, and DOI. Funded by SCOAP3.|
|Date accepted:||18 March 2021|
|Date deposited:||13 September 2021|
|Date of first online publication:||26 April 2021|
|Date first made open access:||13 September 2021|
Save or Share this output
|Look up in GoogleScholar|