Thrust can be computed in O(N^2) time with a Grover-based quantum algorithm under a sequential data-loading model, and in O(N^2 log N) time classically with sorting, but the quantum advantage is only formal for very restrictive memory models.
$J_{E_T}^{\rm II}$: A Two-prong Jet Finding Algorithm
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We propose a new global jet-finding algorithm for reconstructing two-prong objects like hadronic weak gauge bosons at a hadron collider. The selection of particles in a two-prong jet is required to maximize a $J_{E_T}^{\rm II}$ function, which contains a modified second Fox-Wolfram moment and prefers a two-prong structure for a fixed jet mass. Compared to the traditional jet-substructure method, our algorithm can provide a similar or better performance for identifying boosted weak gauge bosons that are produced from either Standard Model processes or heavy di-boson resonance decays.
fields
hep-ph 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Quantum Algorithms for Jet Clustering
Thrust can be computed in O(N^2) time with a Grover-based quantum algorithm under a sequential data-loading model, and in O(N^2 log N) time classically with sorting, but the quantum advantage is only formal for very restrictive memory models.