Towards a quantum computing algorithm for helicity amplitudes and parton showers

被引:26
作者
Bepari, Khadeejah [1 ]
Malik, Sarah [2 ]
Spannowsky, Michael [1 ]
Williams, Simon [2 ]
机构
[1] Univ Durham, Inst Particle Phys Phenomenol, Dept Phys, Durham DH1 3LE, England
[2] Imperial Coll, Blackett Lab, High Energy Phys Grp, Prince Consort Rd, London SW7 2AZ, England
关键词
MATRIX-ELEMENTS; SCATTERING; PHYSICS;
D O I
10.1103/PhysRevD.103.076020
中图分类号
P1 [天文学];
学科分类号
0704 ;
摘要
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.
引用
收藏
页数:20
相关论文
共 59 条
[1]  
Abel, ARXIV200606003
[2]   Quantum computing for quantum tunneling [J].
Abel, Steven ;
Chancellor, Nicholas ;
Spannowsky, Michael .
PHYSICAL REVIEW D, 2021, 103 (01)
[3]   Gluon field digitization for quantum computers [J].
Alexandru, Andrei ;
Bedaque, Paulo F. ;
Harmalkar, Siddhartha ;
Lamm, Henry ;
Lawrence, Scott ;
Warrington, Neill C. .
PHYSICAL REVIEW D, 2019, 100 (11)
[4]   σ Models on Quantum Computers [J].
Alexandru, Andrei ;
Bedaque, Paulo F. ;
Lamm, Henry ;
Lawrence, Scott .
PHYSICAL REVIEW LETTERS, 2019, 123 (09)
[5]   ASYMPTOTIC FREEDOM IN PARTON LANGUAGE [J].
ALTARELLI, G ;
PARISI, G .
NUCLEAR PHYSICS B, 1977, 126 (02) :298-318
[6]  
[Anonymous], 2020, Ibm's roadmap for scaling quantum technology
[7]   Dirac equation as a quantum walk over the honeycomb and triangular lattices [J].
Arrighi, Pablo ;
Di Molfetta, Giuseppe ;
Marquez-Martin, Ivan ;
Perez, Armando .
PHYSICAL REVIEW A, 2018, 97 (06)
[8]   Herwig plus plus physics and manual [J].
Baehr, Manuel ;
Gieseke, Stefan ;
Gigg, Martyn A. ;
Grellscheid, David ;
Hamilton, Keith ;
Latunde-Dada, Oluseyi ;
Platzer, Simon ;
Richardson, Peter ;
Seymour, Michael H. ;
Sherstnev, Alexander ;
Webber, Bryan R. .
EUROPEAN PHYSICAL JOURNAL C, 2008, 58 (04) :639-707
[9]   RECURSIVE CALCULATIONS FOR PROCESSES WITH N GLUONS [J].
BERENDS, FA ;
GIELE, WT .
NUCLEAR PHYSICS B, 1988, 306 (04) :759-808
[10]   Direct proof of the tree-level scattering amplitude recursion relation in Yang-Mills theory [J].
Britto, R ;
Cachazo, F ;
Feng, B ;
Witten, E .
PHYSICAL REVIEW LETTERS, 2005, 94 (18)