Related papers: Collider Events on a Quantum Computer
The quantum statistical parton distributions approach proposed more than one decade ago is revisited by considering a larger set of recent and accurate Deep Inelastic Scattering experimental results. It enables us to improve the description…
Unlike most classical algorithms that take an input and give the solution directly as an output, quantum algorithms produce a quantum circuit that works as an indirect solution to computationally hard problems. In the full quantum computing…
We present a consistent way of combining associated weak boson radiation in hard dijet events with hard QCD radiation in Drell-Yan-like scatterings. This integrates multiple tree-level calculations with vastly different cross sections, QCD-…
Quantum computers have attracted much attention in recent years. This is because the development of the actual quantum machine is accelerating. Research on how to use quantum computers is active in the fields such as quantum chemistry and…
The prospect of quantum computing with a potential exponential speed-up compared to classical computing identifies it as a promising method in the search for alternative future High Energy Physics (HEP) simulation approaches. HEP…
Accurate simulation of physical processes is crucial for the success of modern particle physics. However, simulating the development and interaction of particle showers with calorimeter detectors is a time consuming process and drives the…
In recent years, the number of hybrid algorithms that combine quantum and classical computations has been continuously increasing. These two approaches to computing can mutually enhance each others' performances thus bringing the promise of…
Accurate computation of non-covalent, intermolecular interaction energies is important to understand various chemical phenomena, and quantum computers are anticipated to accelerate it. Although the state-of-the-art quantum computers are…
Experimental High-Energy Physics (HEP), especially the Large Hadron Collider (LHC) programme at the European Organization for Nuclear Research (CERN), is one of the most computationally intensive activities in the world. This demand is set…
It is useful to describe a leading order parton shower as the solution of a linear equation that specifies how the state of the partons evolves. This description involves an essential approximation of a strong ordering of virtualities as…
The developments of quantum computing algorithms and experiments for atomic scale simulations have largely focused on quantum chemistry for molecules, while their application in condensed matter systems is scarcely explored. Here we present…
This is a review of the parton cascade model (PCM) which provides a QCD-based description of nucleus-nucleus reactions at very high energy. The PCM describes the collision dynamics within the early and dense phase of the reaction in terms…
Quantum computers hold great promise for accelerating computationally challenging algorithms on noisy intermediate-scale quantum (NISQ) devices in the upcoming years. Much attention of the current research is directed to algorithmic…
We describe the multi-purpose Monte-Carlo event generator WHIZARD for the simulation of high-energy particle physics experiments. Besides the presentation of the general features of the program like SM physics, BSM physics, and QCD effects,…
We review the methods developed for combining the parton shower approximation to QCD with fixed-order perturbation theory, in such a way as to achieve next-to-leading-order (NLO) accuracy for inclusive observables. This has made it possible…
We study quantum advantage in one-step rendezvous games on simple graphs analytically, numerically, and using noisy intermediate-scale quantum (NISQ) processors. Our protocols realise the recently discovered [arXiv:2207.14404] optimal…
We propose a simple quantum algorithm for implementing the diffusion step of grid-based Bayesian filters. The method encodes the advected state density and the process noise density into quantum registers and realizes diffusion using a…
Quantum computers promise to solve several categories of problems faster than classical computers ever could. Current research mostly focuses on qubits, i.e., systems where the unit of information can assume only two levels. However, the…
Quantum computers promise to efficiently solve important problems classical computers never will. However, in order to capitalize on these prospects, a fully automated quantum software stack needs to be developed. This involves a multitude…
Quantum data encoding (QDE) enables faster com-putations than classical algorithms through superposition and en-tanglement. Circuit cutting and knitting are effective techniques for ameliorating current noisy quantum processing unit (QPUs)…