Collider Events on a Quantum Computer
arXiv:2207.10694 · doi:10.1007/JHEP11(2022)035
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.
22 pages, 10 figures. Updated to peer-reviewed published version
References in corpus (12)
- PYTHIA 6.4 Physics and Manual
- Matching NLO QCD computations with Parton Shower simulations: the POWHEG method
- A parton shower algorithm based on Catani-Seymour dipole factorisation
- Comparative study of various algorithms for the merging of parton showers and matrix elements in hadronic collisions
- Tuning PYTHIA 8.1: the Monash 2013 Tune
- A standard format for Les Houches Event Files
- Robust Independent Validation of Experiment and Theory: Rivet version 3
- Quantum Simulations of Classical Annealing Processes
- Speed-up via Quantum Sampling
- Anomaly detection in high-energy physics using a quantum autoencoder
- Fermion-Fermion Scattering in Quantum Field Theory with Superconducting Circuits
- History Dependent Quantum Random Walks as Quantum Lattice Gas Automata