Collider Events on a Quantum Computer

• URL: http://arxiv.org/abs/2207.10694v2
• Date: Tue, 8 Nov 2022 11:31:51 GMT
• Title: Collider Events on a Quantum Computer
• Authors: G\"osta Gustafson, Stefan Prestel, Michael Spannowsky and Simon Williams
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: High-quality simulated data is crucial for particle physics discoveries. Therefore, parton shower algorithms are a major building block of the data synthesis in event generator programs. However, the core algorithms used to generate parton showers have barely changed since the 1980s. With quantum computers' rapid and continuous development, dedicated algorithms are required to exploit the potential that quantum computers provide to address problems in high-energy physics. This paper presents a novel approach to synthesising parton showers using the Discrete QCD method. The algorithm benefits from an elegant quantum walk implementation which can be embedded into the classical toolchain. We use the ibm_algiers device to sample parton shower configurations and generate data that we compare against measurements taken at the ALEPH, DELPHI and OPAL experiments. This is the first time a Noisy Intermediate-Scale Quantum (NISQ) device has been used to simulate realistic high-energy particle collision events.

Related papers

• Quantum-Annealing-Inspired Algorithms for Track Reconstruction at High-Energy Colliders [0.0]
  Track reconstruction can be formulated as a quadratic unconstrained binary optimization problem. We show that simulated bifurcation algorithms can be employed to solve the particle tracking problem.
  arXiv  Detail & Related papers  (2024-02-22T17:19:03Z)
• Particle track reconstruction with noisy intermediate-scale quantum computers [0.0]
  Reconstruction of trajectories of charged particles is a key computational challenge for current and future collider experiments. The problem can be formulated as a quadratic unconstrained binary optimization (QUBO) and solved using the variational quantum eigensolver (VQE) algorithm. This work serves as a proof of principle that the VQE could be used for particle tracking and investigates modifications of the VQE to make it more suitable for optimization.
  arXiv  Detail & Related papers  (2023-03-23T13:29:20Z)
• Validation tests of GBS quantum computers give evidence for quantum advantage with a decoherent target [62.997667081978825]
  We use positive-P phase-space simulations of grouped count probabilities as a fingerprint for verifying multi-mode data. We show how one can disprove faked data, and apply this to a classical count algorithm.
  arXiv  Detail & Related papers  (2022-11-07T12:00:45Z)
• Application of Quantum Machine Learning in a Higgs Physics Study at the CEPC [5.747925022035578]
  We have pioneered employing a quantum machine learning algorithm to study the $e+e- rightarrow ZH$ process at the Circular Electron-Positron Collider (CEPC) Using 6 qubits on quantum computer simulators, we optimised the QSVM- Kernel algorithm and obtained a classification performance similar to the classical support-vector machine algorithm. Our study shows that state-of-the-art quantum computing technologies could be utilised by particle physics.
  arXiv  Detail & Related papers  (2022-09-26T15:46:30Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• Application of Quantum Machine Learning using the Quantum Variational Classifier Method to High Energy Physics Analysis at the LHC on IBM Quantum Computer Simulator and Hardware with 10 qubits [6.56216604465389]
  Quantum machine learning could become a powerful tool for data analysis in high energy physics. We employ the quantum variational classifier method in two recent LHC flagship physics analyses. We foresee the usage of quantum machine learning in future high-luminosity LHC physics analyses.
  arXiv  Detail & Related papers  (2020-12-21T18:39:36Z)
• Quantum Computing without Quantum Computers: Database Search and Data Processing Using Classical Wave Superposition [101.18253437732933]
  We present experimental data on magnetic database search using spin wave superposition. We argue that in some cases the classical wave-based approach may provide the same speedup in database search as quantum computers.
  arXiv  Detail & Related papers  (2020-12-15T16:21:53Z)
• Generation of High-Resolution Handwritten Digits with an Ion-Trap Quantum Computer [55.41644538483948]
  We implement a quantum-circuit based generative model to learn and sample the prior distribution of a Generative Adversarial Network. We train this hybrid algorithm on an ion-trap device based on $171$Yb$+$ ion qubits to generate high-quality images.
  arXiv  Detail & Related papers  (2020-12-07T18:51:28Z)
• Towards a Quantum Computing Algorithm for Helicity Amplitudes and Parton Showers [0.0]
  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.
  arXiv  Detail & Related papers  (2020-09-30T18:26:27Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

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.