Evaluating the Potential of Quantum Machine Learning in Cybersecurity: A Case-Study on PCA-based Intrusion Detection Systems

Abstract

Quantum computing promises to revolutionize our understanding of the limits of computation, and its implications in cryptography have long been evident. Today, cryptographers are actively devising post-quantum solutions to counter the threats posed by quantum-enabled adversaries. Meanwhile, quantum scientists are innovating quantum protocols to empower defenders. However, the broader impact of quantum computing and quantum machine learning (QML) on other cybersecurity domains still needs to be explored. In this work, we investigate the potential impact of QML on cybersecurity applications of traditional ML. First, we explore the potential advantages of quantum computing in machine learning problems specifically related to cybersecurity. Then, we describe a methodology to quantify the future impact of fault-tolerant QML algorithms on real-world problems. As a case study, we apply our approach to standard methods and datasets in network intrusion detection, one of the most studied applications of machine learning in cybersecurity. Our results provide insight into the conditions for obtaining a quantum advantage and the need for future quantum hardware and software advancements.

Computers & Security (2025): 104341

References in corpus (32)

• Scikit-learn: Machine Learning in Python
• Array Programming with NumPy
• Quantum Machine Learning
• Quantum algorithm for solving linear systems of equations
• Quantum information with Rydberg atoms
• Quantum support vector machine for big data classification
• Advances in Quantum Cryptography
• Noisy intermediate-scale quantum (NISQ) algorithms
• Superconducting Qubits: Current State of Play
• Trapped-Ion Quantum Computing: Progress and Challenges
• Hamiltonian Simulation by Qubitization
• Survey of Machine Learning Techniques for Malware Analysis
• Quantum algorithms for supervised and unsupervised machine learning
• Architectures for a quantum random access memory
• Quantum attacks on Bitcoin, and how to protect against them
• Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
• Quantum gradient descent for linear systems and least squares
• Hardware-efficient quantum random access memory with hybrid quantum acoustic systems
• The quantum query complexity of the hidden subgroup problem is polynomial
• Focus beyond quadratic speedups for error-corrected quantum advantage
• QUBO Formulations for Training Machine Learning Models
• Fault tolerant resource estimation of quantum random-access memories
• Quantum Algorithms for Deep Convolutional Neural Networks
• A polynomial-time classical algorithm for noisy random circuit sampling
• Quantum Spectral Clustering
• Quantum classification of the MNIST dataset with Slow Feature Analysis
• Quantum Regularized Least Squares
• End-to-end resource analysis for quantum interior point methods and portfolio optimization
• Quantum algorithms for SVD-based data representation and analysis
• Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm
• Quantum tomography using state-preparation unitaries
• Quantum matching pursuit: A quantum algorithm for sparse representations