Exploring Unsupervised Anomaly Detection with Quantum Boltzmann Machines in Fraud Detection

• URL: http://arxiv.org/abs/2306.04998v3
• Date: Wed, 17 Jan 2024 09:57:12 GMT
• Title: Exploring Unsupervised Anomaly Detection with Quantum Boltzmann Machines in Fraud Detection
• Authors: Jonas Stein, Dani\"elle Schuman, Magdalena Benkard, Thomas Holger, Wanja Sajko, Michael K\"olle, Jonas N\"u{\ss}lein, Leo S\"unkel, Olivier Salomon, Claudia Linnhoff-Popien
• Abstract summary: Anomaly detection in Restricted Detection and Response (EDR) is a critical task in cybersecurity programs of large companies. Classical machine learning approaches to this problem exist, but they frequently show unsatisfactory performance in differentiating malicious from benign anomalies. A promising approach to attain superior generalization than currently employed machine learning techniques are quantum generative models.
• Score: 3.955274213382716
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Anomaly detection in Endpoint Detection and Response (EDR) is a critical task in cybersecurity programs of large companies. With rapidly growing amounts of data and the omnipresence of zero-day attacks, manual and rule-based detection techniques are no longer eligible in practice. While classical machine learning approaches to this problem exist, they frequently show unsatisfactory performance in differentiating malicious from benign anomalies. A promising approach to attain superior generalization than currently employed machine learning techniques are quantum generative models. Allowing for the largest representation of data on available quantum hardware, we investigate Quantum Annealing based Quantum Boltzmann Machines (QBMs) for the given problem. We contribute the first fully unsupervised approach for the problem of anomaly detection using QBMs and evaluate its performance on an EDR inspired synthetic dataset. Our results indicate that QBMs can outperform their classical analog (i.e., Restricted Boltzmann Machines) in terms of result quality and training steps in special cases. When employing Quantum Annealers from D-Wave Systems, we conclude that either more accurate classical simulators or substantially more QPU time is needed to conduct the necessary hyperparameter optimization allowing to replicate our simulation results on quantum hardware.

Related papers

• 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)
• GQHAN: A Grover-inspired Quantum Hard Attention Network [53.96779043113156]
  Grover-inspired Quantum Hard Attention Mechanism (GQHAM) is proposed. GQHAN adeptly surmounts the non-differentiability hurdle, surpassing the efficacy of extant quantum soft self-attention mechanisms. The proposal of GQHAN lays the foundation for future quantum computers to process large-scale data, and promotes the development of quantum computer vision.
  arXiv  Detail & Related papers  (2024-01-25T11:11:16Z)
• 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)
• Machine Learning for Practical Quantum Error Mitigation [0.0]
  We show that machine learning for quantum error mitigation can drastically reduce overheads, maintain or even surpass the accuracy of conventional methods. Our results highlight the potential of classical machine learning for practical quantum computation.
  arXiv  Detail & Related papers  (2023-09-29T16:17:12Z)
• Drastic Circuit Depth Reductions with Preserved Adversarial Robustness by Approximate Encoding for Quantum Machine Learning [0.5181797490530444]
  We implement methods for the efficient preparation of quantum states representing encoded image data using variational, genetic and matrix product state based algorithms. Results show that these methods can approximately prepare states to a level suitable for QML using circuits two orders of magnitude shallower than a standard state preparation implementation.
  arXiv  Detail & Related papers  (2023-09-18T01:49:36Z)
• Towards quantum enhanced adversarial robustness in machine learning [18.663564729815615]
  Integration of machine learning with quantum computing could yield better accuracy and computational efficiency. Recent work has employed quantum mechanical phenomena to defend against adversarial attacks. Despite promising early results, there remain challenges towards building robust real-world QAML tools.
  arXiv  Detail & Related papers  (2023-06-22T06:21:45Z)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Quantum artificial vision for defect detection in manufacturing [0.0]
  We consider several algorithms for quantum computer vision using Noisy Intermediate-Scale Quantum (NISQ) devices. We benchmark them for a real problem against their classical counterparts. This is the first implementation of quantum computer vision systems for a problem of industrial relevance in a manufacturing production line.
  arXiv  Detail & Related papers  (2022-08-09T18:30:23Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Quantum-tailored machine-learning characterization of a superconducting qubit [50.591267188664666]
  We develop an approach to characterize the dynamics of a quantum device and learn device parameters. This approach outperforms physics-agnostic recurrent neural networks trained on numerically generated and experimental data. This demonstration shows how leveraging domain knowledge improves the accuracy and efficiency of this characterization task.
  arXiv  Detail & Related papers  (2021-06-24T15:58:57Z)

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.