相关论文: Quantum Parton Shower with Kinematics
We discuss general criteria that could guide us in applying quantum algorithms/computers to problems in high-energy physics. We then discuss the particular example of parton showers with quantum interference. We summarize the basic ideas…
We have previously described a mathematical formulation for a parton shower based on the approximation of strongly ordered virtualities of successive parton splittings. Quantum interference, including interference among different color and…
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…
Simulations of high-energy particle collisions, such as those used at the Large Hadron Collider, are based on quantum field theory; however, many approximations are made in practice. For example, the simulation of the parton shower, which…
We extend the previously developed small $x$ parton shower algorithm to include the kinematic constraint effect and $k_t$ resummation effect. This work enables the Monte Carlo generator to simultaneously resum large $k_t$ and small $x$…
Reference arXiv:1904.03196 recently introduced an algorithm (QPS) for simulating parton showers with intermediate flavor states using polynomial resources on a digital quantum computer. We make use of a new quantum hardware capability…
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…
We have previously described a mathematical formulation for a parton shower based on the approximation of strongly ordered virtualities of successive parton splittings. Quantum interference, including interference among different color and…
Particles produced in high energy collisions that are charged under one of the fundamental forces will radiate proportionally to their charge, such as photon radiation from electrons in quantum electrodynamics. At sufficiently high…
Quantum computing uses the physical principles of very small systems to develop computing platforms which can solve problems that are intractable on conventional supercomputers. There are challenges not only in building the required…
We introduce a method to enforce some symmetries starting from a trial wave-function prepared on quantum computers that might not respect these symmetries. The technique eliminates the necessity for performing the projection on the quantum…
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…
We describe a quantum algorithm that solves combinatorial optimization problems by quantum simulation of a classical simulated annealing process. Our algorithm exploits quantum walks and the quantum Zeno effect induced by evolution…
We report on the possibility of reweighting parton-shower Monte Carlo predictions for scale variations in the parton-shower algorithm. The method is based on a generalization of the Sudakov veto algorithm. We demonstrate the feasibility of…
This paper presents a novel quantum walk approach to simulating parton showers on a quantum computer. We demonstrate that the quantum walk paradigm offers a natural and more efficient approach to simulating parton showers on quantum…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum…
Ensuring security and integrity of elections constitutes an important challenge with wide-ranging societal implications. Classically, security guarantees can be ensured based on computational complexity, which may be challenged by quantum…
Quantum algorithms based on quantum kernel methods have been investigated previously [1]. A quantum advantage is derived from the fact that it is possible to construct a family of datasets for which, only quantum processing can recognise…
Classical verification of quantum learning allows classical clients to reliably leverage quantum computing advantages by interacting with untrusted quantum servers. Yet, current quantum devices available in practice suffers from a variety…
Artificial intelligence and machine learning have been widely adopted both in the industry and in everyday life, but at the cost of high compute demands. Recent studies show that implementing machine learning in physical systems in the deep…