Towards a Quantum Computing Algorithm for Helicity Amplitudes and Parton Showers

• URL: http://arxiv.org/abs/2010.00046v2
• Date: Tue, 13 Oct 2020 17:05:51 GMT
• Title: Towards a Quantum Computing Algorithm for Helicity Amplitudes and Parton Showers
• Authors: Khadeejah Bepari, Sarah Malik, Michael Spannowsky, Simon Williams
• Abstract summary: We propose 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. The parton shower algorithm simulates collinear emission for a two-step, discrete parton shower.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The interpretation of measurements of high-energy particle collisions relies heavily on the performance of full event generators. By far the largest amount of time to predict the kinematics of multi-particle final states is dedicated to 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 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 utilising 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$\rightarrow$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 wavefunction 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 utilise the quantum computer's ability to remain in a quantum state throughout the computation and represent a first step towards a quantum computing algorithm to describe the full collision event at the LHC.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Calculating the many-body density of states on a digital quantum computer [58.720142291102135]
  We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer. We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
  arXiv  Detail & Related papers  (2023-03-23T17:46:28Z)
• Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering [3.187381965457262]
  We develop a quantum algorithm that tests for and quantifies the separability of a general bipartite state by using the quantum steering effect. Our findings provide a meaningful connection between steering, entanglement, quantum algorithms, and quantum computational complexity theory.
  arXiv  Detail & Related papers  (2023-03-14T13:55:06Z)
• Verifiably Exact Solution of the Electronic Schr\"odinger Equation on Quantum Devices [0.0]
  We present an algorithm that yields verifiably exact solutions of the many-electron Schr"odinger equation. We demonstrate the algorithm on both quantum simulators and noisy quantum computers.
  arXiv  Detail & Related papers  (2023-03-01T19:00:00Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Collider Events on a Quantum Computer [0.0]
  We present a novel approach to synthesising parton showers using the Discrete QCD method. This is the first time a Noisy Intermediate-Scale Quantum (NISQ) device has been used to simulate realistic high-energy particle collision events.
  arXiv  Detail & Related papers  (2022-07-21T18:07:22Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Quantum State Preparation and Non-Unitary Evolution with Diagonal Operators [0.0]
  We present a dilation based algorithm to simulate non-unitary operations on unitary quantum devices. We use this algorithm to prepare random sub-normalized two-level states on a quantum device with high fidelity. We also present the accurate non-unitary dynamics of two-level open quantum systems in a dephasing channel and an amplitude damping channel computed on a quantum device.
  arXiv  Detail & Related papers  (2022-05-05T17:56:41Z)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Algorithms for quantum simulation at finite energies [0.7734726150561088]
  We introduce two kinds of quantum algorithms to explore microcanonical and canonical properties of many-body systems. One is a hybrid quantum algorithm that computes expectation values in a finite energy interval around its mean energy. The other is a quantum-assisted Monte Carlo sampling method to compute other quantities.
  arXiv  Detail & Related papers  (2020-06-04T17:40:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.