Fitting a collider in a quantum computer: tackling the challenges of quantum machine learning for big datasets

Abstract

Current quantum systems have significant limitations affecting the processing of large datasets with high dimensionality, typical of high energy physics. In the present paper, feature and data prototype selection techniques were studied to tackle this challenge. A grid search was performed and quantum machine learning models were trained and benchmarked against classical shallow machine learning methods, trained both in the reduced and the complete datasets. The performance of the quantum algorithms was found to be comparable to the classical ones, even when using large datasets. Sequential Backward Selection and Principal Component Analysis techniques were used for feature's selection and while the former can produce the better quantum machine learning models in specific cases, it is more unstable. Additionally, we show that such variability in the results is caused by the use of discrete variables, highlighting the suitability of Principal Component analysis transformed data for quantum machine learning applications in the high energy physics context.

Jet substructure observables for jet quenching in quark gluon plasma: A machine learning driven analysis

“…Intuitively, the coefficient of determination can be seen as a normalised Mean Square Error, as the numerator of the fraction is the sum of all square errors and the denominator is the sum of all residuals. This fraction also often takes been explored for dataset dimensional reduction in HEP in [91] in the context of quantum machine learning in current and near future quantum computers. -0.00 0.01 -0.00 0.00 0.00 0.00 -0.00 0.00 0.00 -0.00 -0.00 0.67 -0.00 0.00 0.74 0.00 0.00 0.00 0.00 -0.00 0.00 0.00 -0.00 0.00 0.00 -0.00 0.00 0.00 -0.00 -0.00 0.01 -0.00 0.01 0.00 0.00 -0.00 -0.00 0.00 -0.00 -0.00 -0.00 0.00 -0.74 -0.00 -0.00 0.67 -0.00 -0.00 -0.00 -0.00 0.00 -0.01 0.01 0.01 0.00 0.00 -0.00 0.01 0.01 0.01 -0.00 -0.02 In Fig.…”