Quantum anomaly detection in the latent space of proton collision events at the LHC

• URL: http://arxiv.org/abs/2301.10780v1
• Date: Wed, 25 Jan 2023 19:00:01 GMT
• Title: Quantum anomaly detection in the latent space of proton collision events at the LHC
• Authors: Kinga Anna Wo\'zniak, Vasilis Belis, Ema Puljak, Panagiotis Barkoutsos, G\"unther Dissertori, Michele Grossi, Maurizio Pierini, Florentin Reiter, Ivano Tavernelli, Sofia Vallecorsa
• Abstract summary: We propose a new strategy for anomaly detection at the LHC based on unsupervised quantum machine learning algorithms. For kernel-based anomaly detection, we identify a regime where the quantum model significantly outperforms its classical counterpart. We demonstrate that the observed consistent performance advantage is related to the inherent quantum properties of the circuit used.
• Score: 1.0480625205078853
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a new strategy for anomaly detection at the LHC based on unsupervised quantum machine learning algorithms. To accommodate the constraints on the problem size dictated by the limitations of current quantum hardware we develop a classical convolutional autoencoder. The designed quantum anomaly detection models, namely an unsupervised kernel machine and two clustering algorithms, are trained to find new-physics events in the latent representation of LHC data produced by the autoencoder. The performance of the quantum algorithms is benchmarked against classical counterparts on different new-physics scenarios and its dependence on the dimensionality of the latent space and the size of the training dataset is studied. For kernel-based anomaly detection, we identify a regime where the quantum model significantly outperforms its classical counterpart. An instance of the kernel machine is implemented on a quantum computer to verify its suitability for available hardware. We demonstrate that the observed consistent performance advantage is related to the inherent quantum properties of the circuit used.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Unsupervised Beyond-Standard-Model Event Discovery at the LHC with a Novel Quantum Autoencoder [0.0]
  This study explores the potential of unsupervised anomaly detection for identifying physics beyond the Standard Model at the Large Hadron Collider. We introduce a novel quantum autoencoder circuit ansatz that is specifically designed for this task and demonstrates superior performance compared to previous approaches. We investigate the properties of quantum autoencoder circuits, focusing on entanglement and magic.
  arXiv  Detail & Related papers  (2024-07-10T18:01:11Z)
• Quantum Visual Feature Encoding Revisited [8.839645003062456]
  This paper revisits the quantum visual encoding strategies, the initial step in quantum machine learning. Investigating the root cause, we uncover that the existing quantum encoding design fails to ensure information preservation of the visual features after the encoding process. We introduce a new loss function named Quantum Information Preserving to minimize this gap, resulting in enhanced performance of quantum machine learning algorithms.
  arXiv  Detail & Related papers  (2024-05-30T06:15:08Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Long-lived Particles Anomaly Detection with Parametrized Quantum Circuits [0.0]
  We propose an anomaly detection algorithm based on a parametrized quantum circuit. This algorithm has been trained on a classical computer and tested with simulations as well as on real quantum hardware.
  arXiv  Detail & Related papers  (2023-12-07T11:50:42Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Noisy Quantum Kernel Machines [58.09028887465797]
  An emerging class of quantum learning machines is that based on the paradigm of quantum kernels. We study how dissipation and decoherence affect their performance. We show that decoherence and dissipation can be seen as an implicit regularization for the quantum kernel machines.
  arXiv  Detail & Related papers  (2022-04-26T09:52:02Z)
• Characterizing quantum instruments: from non-demolition measurements to quantum error correction [48.43720700248091]
  In quantum information processing quantum operations are often processed alongside measurements which result in classical data. Non-unitary dynamical processes can take place on the system, for which common quantum channel descriptions fail to describe the time evolution. Quantum measurements are correctly treated by means of so-called quantum instruments capturing both classical outputs and post-measurement quantum states.
  arXiv  Detail & Related papers  (2021-10-13T18:00:13Z)
• Robustness Verification of Quantum Classifiers [1.3534683694551501]
  We define a formal framework for the verification and analysis of quantum machine learning algorithms against noises. A robust bound is derived and an algorithm is developed to check whether or not a quantum machine learning algorithm is robust with respect to quantum training data. Our approach is implemented on Google's Quantum classifier and can verify the robustness of quantum machine learning algorithms with respect to a small disturbance of noises.
  arXiv  Detail & Related papers  (2020-08-17T11:56:23Z)
• Quantum One-class Classification With a Distance-based Classifier [1.316309856358873]
  existing errors in the current quantum hardware and the low number of qubits available make it necessary to use solutions that use fewer qubits and fewer operations. We present a new classifier based on named Quantum One-class Quantum computers (QOCC) that consists of a minimal quantum machine learning model with fewer operations and qubits.
  arXiv  Detail & Related papers  (2020-07-31T17:53:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.