Quantum Machine Learning Algorithms for Anomaly Detection: a Survey

• URL: http://arxiv.org/abs/2408.11047v1
• Date: Tue, 20 Aug 2024 17:55:25 GMT
• Title: Quantum Machine Learning Algorithms for Anomaly Detection: a Survey
• Authors: Sebastiano Corli, Lorenzo Moro, Daniele Dragoni, Massimiliano Dispenza, Enrico Prati,
• Abstract summary: We summarize the key concepts involved in quantum computing, introducing the formal concept of quantum speed up. The survey provides a structured map of anomaly detection based on quantum machine learning.
• Score: 1.747623282473278
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The advent of quantum computers has justified the development of quantum machine learning algorithms , based on the adaptation of the principles of machine learning to the formalism of qubits. Among such quantum algorithms, anomaly detection represents an important problem crossing several disciplines from cybersecurity, to fraud detection to particle physics. We summarize the key concepts involved in quantum computing, introducing the formal concept of quantum speed up. The survey provides a structured map of anomaly detection based on quantum machine learning. We have grouped existing algorithms according to the different learning methods, namely quantum supervised, quantum unsupervised and quantum reinforcement learning, respectively. We provide an estimate of the hardware resources to provide sufficient computational power in the future. The survey provides a systematic and compact understanding of the techniques belonging to each category. We eventually provide a discussion on the computational complexity of the learning methods in real application domains.

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)
• A comprehensive review of Quantum Machine Learning: from NISQ to Fault Tolerance [8.050429258747256]
  We offer a comprehensive and unbiased review of the various concepts that have emerged in the field of quantum machine learning. Our review covers fundamental concepts, algorithms, and the statistical learning theory pertinent to quantum machine learning.
  arXiv  Detail & Related papers  (2024-01-21T00:19:16Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• Modern applications of machine learning in quantum sciences [51.09906911582811]
  We cover the use of deep learning and kernel methods in supervised, unsupervised, and reinforcement learning algorithms. We discuss more specialized topics such as differentiable programming, generative models, statistical approach to machine learning, and quantum machine learning.
  arXiv  Detail & Related papers  (2022-04-08T17:48:59Z)
• Quantum Phase Recognition via Quantum Kernel Methods [6.3286116342955845]
  We explore the power of quantum learning algorithms in solving an important class of Quantum Phase Recognition problems. We numerically benchmark our algorithm for a variety of problems, including recognizing symmetry-protected topological phases and symmetry-broken phases. Our results highlight the capability of quantum machine learning in predicting such quantum phase transitions in many-particle systems.
  arXiv  Detail & Related papers  (2021-11-15T06:17:52Z)
• Quantum Algorithms for Unsupervised Machine Learning and Neural Networks [2.28438857884398]
  We introduce quantum algorithms to solve tasks such as matrix product or distance estimation. These results are then used to develop new quantum algorithms for unsupervised machine learning. We will also present new quantum algorithms for neural networks, or deep learning.
  arXiv  Detail & Related papers  (2021-11-05T16:36:09Z)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Quantum Fair Machine Learning [1.8275108630751844]
  We undertake a comparative analysis of differences and similarities between classical and quantum fair machine learning algorithms. We present the first results in quantum fair machine learning by demonstrating the use of Grover's search algorithm. We extend canonical Lipschitz-conditioned individual fairness criteria to the quantum setting using quantum metrics.
  arXiv  Detail & Related papers  (2021-02-01T10:36:46Z)
• 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)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)

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.