Unsupervised event classification with graphs on classical and photonic quantum computers

Abstract

Abstract Photonic Quantum Computers provide several benefits over the discrete qubit-based paradigm of quantum computing. By using the power of continuous-variable computing we build an anomaly detection model to use on searches for New Physics. Our model uses Gaussian Boson Sampling, a #P-hard problem and thus not efficiently accessible to classical devices. This is used to create feature vectors from graph data, a natural format for representing data of high-energy collision events. A simple K-means clustering algorithm is used to provide a baseline method of classification. We then present a novel method of anomaly detection, combining the use of Gaussian Boson Sampling and a quantum extension to K-means known as Q-means. This is found to give equivalent results compared to the classical clustering version while also reducing the O $$ \mathcal{O} $$ complexity, with respect to the sample’s feature-vector length, from O N $$ \mathcal{O}(N) $$ to O log N $$ \mathcal{O}\left(\log (N)\right) $$ .

Keywords

• Beyond Standard Model
• Hadron-Hadron scattering (experiments)
• Particle correlations and fluctuations