Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2611.12219

An Empirical Evaluation of Quantum Kernel Stability in Network Intrusion Detection

Sreejonty Chakraborty, Adrita Rahman Tory, Muhammad Aminur Rahaman, Khondokar Fida Hasan

Published Nov 9, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum kernel methods have been proposed for network intrusion detection, yet their performance limitations are often attributed to noise in current quantum hardware. This study evaluates that assumption through a controlled analysis of Pegasos-QSVC on the NSL-KDD and ToN-IoT datasets. We perform 56 quantum experiments using one exact noiseless statevector backend and three noise-simulated superconducting backends while keeping preprocessing, PCA features, data splits, and classical baselines identical. XGBoost achieves accuracies of 98.94% on NSL-KDD and 99.41% on ToN-IoT, compared with 91.80% and 82.98% for Pegasos-QSVC. The quantum model also exhibits substantially greater seed-dependent variability. Eight runs collapse into degenerate classifiers, including four recall-collapse cases and four trivial-positive classifiers. Notably, two failures occur on the noiseless backend, demonstrating that hardware noise is not a necessary condition for classi-fier collapse. Kernel Gram matrix analysis further reveals low effective rank and severe ill-conditioning even in the absence of noise, indicating intrinsic fragility in the learned quantum representation. These results show that average accuracy alone can conceal operationally unacceptable behavior and highlight the importance of reporting worst-case performance, seed-level variability, class-specific metrics, and explicit degeneracy tests in quantum intrusion detection studies.

DOI
10.48550/arxiv.2611.12219

Related papers

Benchmarking quantum machine learning methods for intrusion detection on noisy quantum computers

Franco Cirillo, Christian Esposito, Jung Taek Seo

Intrusion detection systems (IDS) are essential for identifying cyber threats in complex digital environments. Machine learning (ML) is widely used to improve IDS by detecting anomalies, but classical ML methods often struggle with high-dimensional data and evolving threats. Quantum machine learning (QML) has been proposed as a potential paradigm to overcome some of these limitations, but is constrained by noisy intermediate-scale quantum (NISQ) challenges, affecting quality. This study systematically evaluates three QML models, Pegasos Quantum Support Vector Classifier (QSVC), Variational Quantum Classifier (VQC), and a Hybrid Quantum–Classical Neural Network (HQNN), for network anomaly detection. The models were optimized and tested on the ToN_IoT and NSL-KDD datasets using IBM quantum simulators under both ideal and noisy conditions. Performance was analyzed through the F1-score distribution as a function of circuit complexity, revealing how entanglement and noise affect robustness across different backends. Comparisons with classical models contextualize the current maturity of QML for cybersecurity, while computational time was used as an indicator of model complexity to explore accuracy–efficiency trade-offs. Among all configurations, Pegasos-QSVC achieved the best results, with 94.60% accuracy and an F1-score of 94.13%. The findings provide practical guidelines for designing noise-resilient QML models and highlight their potential for reliable intrusion detection under realistic quantum conditions.

Quantum Machine Intelligence•Mar 11, 2026•8 citations

How Quantum Is the Advantage? A Fair, Calibration- and Noise-Aware Benchmark and Attribution Audit of Quantum Machine Learning for Network Intrusion Detection

Syeda Anshrah Gillani, Mirza Samad Ahmed Baig, Shahid Munir Shah +2 more

Quantum machine learning (QML) for network intrusion detection (NIDS) is routinely reported to reach near-perfect accuracy, yet the most rigorous studies find that well-tuned classical models remain competitive, and that apparent quantum gains may be artefacts of classical dimensionality reduction and implicit regularisation rather than genuine quantum effects. We ask not whether a quantum model can post a high accuracy, but how quantum the advantage really is. We present a unified, reproducible QML-IDS benchmark evaluating hybrid variational quantum circuits and quantum-kernel SVMs against five honestly-tuned classical baselines across four standard NIDS datasets (NSL-KDD, UNSW-NB15, CICIDS2017, NF-ToN-IoT-v2) under one leakage-controlled protocol, with an equal-budget feature view, imbalance- and calibration-aware metrics with significance testing, and a simulated NISQ noise sweep. We introduce a quantum-attribution audit (parameter-matched classical controls, a random-feature kernel, and a regularisation sweep) that quantifies how much of any gain is genuinely attributable to the quantum component. Tuned classical models (Random Forest, XGBoost) match or exceed the quantum models on aggregate detection on every dataset, and the audit attributes this to classical preprocessing and regularisation rather than quantum effects. Two advantages survive false-discovery-rate correction: the quantum-kernel SVM out-ranks its direct classical surrogate (a random-feature kernel) on AUPRC and ROC-AUC, and a small four-qubit hybrid out-detects the best classical baseline at the 1% false-positive operating point on the distribution-shifted NSL-KDD task (p = 0.005, BH q = 0.030). Code, seeds, and splits are released; our contribution stands whether quantum wins, ties, or loses.

quant-pharXiv:2608.18155•Aug 14, 2026•5 citations

QKIDS: Quantum Kernel Learning for Network Intrusion Detection Systems

Santanu Roy, R. S. Ramya, Abhinava P +3 more

Network intrusion detection is very critical for cybersecurity in modern infrastructure in order to maintain secure digital systems. This research paper presents QKIDS (Quantum Kernel Learning for Intrusion Detection System), a comparative study on the quantum kernel methods against classical machine learning approaches on the NSL-KDD dataset. We implement a variational quantum classifier using parameterized quantum circuits with angle encoding and entanglement-based feature maps, demonstrating performance competitiveness can be achieved by quantum kernel methods with classical baselines including Support Vector Machines. Through systematic qubit ablation studies, we establish that quantum kernels can match classical models on real-world cybersecurity data while revealing current practical limitations including computational overhead. The proposed quantum approach demonstrates competitive de-taction performance comparable to the best classical methods, with identical attack detection rates on critical security metrics. Our experimental setup with stratified train-test splitting and mutual information-based feature selection establishes practical baselines for quantum machine learning in network security applications. What makes our framework new is that it uses quantum kernel methods that use high-dimensional Hilbert space transformations to find complicated, non-linear patterns in data on network traffic that classical kernels might not be able to represent well. Our variational quantum circuits encode data into a quantum state space through parameterized rotation gates and controlled entanglement operations. The proposed approach is different from classical SVMs, which work in original feature space. This could help separate normal and malicious network behaviors better.

•Jul 1, 2026•0 citations

Towards Practical Quantum Kernels for Network Intrusion Detection

Mary L. Cotrupi, Brian Callahan

With cyber-attacks becoming increasingly sophisticated, modern network intrusion detection systems (NIDSs) are relying on machine learning (ML) methods for their flexibility in detecting subtle anomalous patterns in huge amounts of network data. However, classical ML methods such as support vector machines (SVMs) often rely on the conversion of low-dimensional data into a high-dimensional space, creating complex linear systems that are time-consuming to evaluate on large data inputs such as network flow logs. We propose addressing this limitation by employing a hybrid quantum-classical ML model to leverage quantum computing's (QC's) superiority in high-dimensional areas. We constructed a quantum kernel with an SVM model and evaluated it on four different network attacks from a modern intrusion detection dataset. Results reveal an average hardware accuracy rate of 85% with noticeably small deviations between runs, suggesting that quantum kernels may be a noise-resistant solution. We evaluated these results alongside classical and noiseless quantum simulator benchmarks.

Proceedings of the AAAI Symposium Series•Nov 23, 2025•5 citations

Quantum Machine Learning for Intrusion Detection on Noisy Quantum Computers

Franco Cirillo, Christian Esposito

Intrusion Detection Systems (IDS) play a fundamental role in safeguarding digital infrastructures against cyber threats. Quantum Machine Learning (QML) presents a promising frontier in this domain, offering potential computational speedups and improved management of complex datasets. However, its practical deployment is currently limited by the constraints of Noisy Intermediate-Scale Quantum (NISQ) devices. This work explores the application of various QML approaches, specifically Quantum Support Vector Classifiers (QSVC), Variational Quantum Classifiers (VQC), and hybrid quantum-classical neural networks for anomaly detection tasks. The models were fine-tuned and benchmarked using the ToN_IoT dataset, with performance assessed on IBM's noisy quantum simulators to evaluate their behavior under realistic noise conditions. Results indicate that the Pegasos-QSVC model outperformed others, reaching an accuracy of 93.05% and an F1 score of 93.73%. Through a comparative analysis of different circuit architectures, this study identifies strategies to improve the robustness of QML systems, emphasizing their emerging potential in cybersecurity scenarios.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•5 citations

Comparative Analysis and Noise Robustness Study of Quantum Kernel Methods and Variational Quantum Classifiers for Financial Fraud Detection

Ionuț-Cosmin Dinuț, Rodica Constantinescu, Bogdan Alexandrescu

Quantum machine learning on near-term noisy quantum devices has generated substantial theoretical interest, but rigorous empirical comparisons under realistic noise on practically relevant data remain scarce. This paper compares two paradigmatic quantum learning models, a Quantum Support Vector Machine (QSVM) built on the ZZFeatureMap quantum kernel and a Variational Quantum Classifier (VQC) with an EfficientSU2/RealAmplitudes ansatz, against tuned classical baselines (SVM with four kernels, Random Forest, XGBoost, LightGBM and CatBoost) on the ULB Credit Card Fraud dataset (284,807 transactions, 0.17% fraud). All models share an identical 4-qubit PCA-reduced feature space, evaluated on the full unbalanced test fold over 15 fits (3 folds × 5 seeds) and reported as mean ± standard deviation with bootstrap confidence intervals, AUPRC as the primary metric. Noise robustness is assessed under depolarizing noise p∈{0,0.001,0.01,0.05}, with ranking preservation measured directly through Spearman ρ and Kendall τ between the noisy and noiseless decision scores rather than read off AUPRC, alongside the per-paradigm computational cost. At four qubits the classical baselines lead (AUPRC 0.60 to 0.74, CatBoost best), above the VQC (0.494) and the QSVM (0.240); the controlled QSVM-versus-RBF–SVM comparison puts the cost of the quantum kernel at about 0.45 AUPRC. Under noise the QSVM keeps its score ranking (ρ=0.998 at p=0.001, 0.906 at p=0.01) and an operational decision threshold (recall 0.87 to 0.89, stable calibration), while the VQC AUPRC peaks non-monotonically at p=0.01 (0.494 rising to 0.654, then easing to 0.569 at p=0.05) even as its ranking decays monotonically (ρ from 0.72 to near zero), so average precision on its own misrepresents how noise affects it. The quantum models do not surpass the tuned classical reference at four qubits; the contribution is methodological: under noise, AUPRC has to be read together with a genuine rank statistic, because the two can move in opposite directions.

Electronics•Jun 5, 2026•1 citation
Quantum kernel methods have been proposed for network intrusion detection, yet their performance limitations are often attributed to noise in current quantum hardware. This study evaluates that assumption through a controlled analysis of Pegasos-QSVC on the NSL-KDD and ToN-IoT datasets. We perform 56 quantum experiments using one exact noiseless statevector backend and three noise-simulated superconducting backends while keeping preprocessing, PCA features, data splits, and classical baselines identical. XGBoost achieves accuracies of 98.94% on NSL-KDD and 99.41% on ToN-IoT, compared with 91.80% and 82.98% for Pegasos-QSVC. The quantum model also exhibits substantially greater seed-dependent variability. Eight runs collapse into degenerate classifiers, including four recall-collapse cases and four trivial-positive classifiers. Notably, two failures occur on the noiseless backend, demonstrating that hardware noise is not a necessary condition for classi-fier collapse. Kernel Gram matrix analysis further reveals low effective rank and severe ill-conditioning even in the absence of noise, indicating intrinsic fragility in the learned quantum representation. These results show that average accuracy alone can conceal operationally unacceptable behavior and highlight the importance of reporting worst-case performance, seed-level variability, class-specific metrics, and explicit degeneracy tests in quantum intrusion detection studies.
Intrusion detection systems (IDS) are essential for identifying cyber threats in complex digital environments. Machine learning (ML) is widely used to improve IDS by detecting anomalies, but classical ML methods often struggle with high-dimensional data and evolving threats. Quantum machine learning (QML) has been proposed as a potential paradigm to overcome some of these limitations, but is constrained by noisy intermediate-scale quantum (NISQ) challenges, affecting quality. This study systematically evaluates three QML models, Pegasos Quantum Support Vector Classifier (QSVC), Variational Quantum Classifier (VQC), and a Hybrid Quantum–Classical Neural Network (HQNN), for network anomaly detection. The models were optimized and tested on the ToN_IoT and NSL-KDD datasets using IBM quantum simulators under both ideal and noisy conditions. Performance was analyzed through the F1-score distribution as a function of circuit complexity, revealing how entanglement and noise affect robustness across different backends. Comparisons with classical models contextualize the current maturity of QML for cybersecurity, while computational time was used as an indicator of model complexity to explore accuracy–efficiency trade-offs. Among all configurations, Pegasos-QSVC achieved the best results, with 94.60% accuracy and an F1-score of 94.13%. The findings provide practical guidelines for designing noise-resilient QML models and highlight their potential for reliable intrusion detection under realistic quantum conditions.
Quantum machine learning (QML) for network intrusion detection (NIDS) is routinely reported to reach near-perfect accuracy, yet the most rigorous studies find that well-tuned classical models remain competitive, and that apparent quantum gains may be artefacts of classical dimensionality reduction and implicit regularisation rather than genuine quantum effects. We ask not whether a quantum model can post a high accuracy, but how quantum the advantage really is. We present a unified, reproducible QML-IDS benchmark evaluating hybrid variational quantum circuits and quantum-kernel SVMs against five honestly-tuned classical baselines across four standard NIDS datasets (NSL-KDD, UNSW-NB15, CICIDS2017, NF-ToN-IoT-v2) under one leakage-controlled protocol, with an equal-budget feature view, imbalance- and calibration-aware metrics with significance testing, and a simulated NISQ noise sweep. We introduce a quantum-attribution audit (parameter-matched classical controls, a random-feature kernel, and a regularisation sweep) that quantifies how much of any gain is genuinely attributable to the quantum component. Tuned classical models (Random Forest, XGBoost) match or exceed the quantum models on aggregate detection on every dataset, and the audit attributes this to classical preprocessing and regularisation rather than quantum effects. Two advantages survive false-discovery-rate correction: the quantum-kernel SVM out-ranks its direct classical surrogate (a random-feature kernel) on AUPRC and ROC-AUC, and a small four-qubit hybrid out-detects the best classical baseline at the 1% false-positive operating point on the distribution-shifted NSL-KDD task (p = 0.005, BH q = 0.030). Code, seeds, and splits are released; our contribution stands whether quantum wins, ties, or loses.
Network intrusion detection is very critical for cybersecurity in modern infrastructure in order to maintain secure digital systems. This research paper presents QKIDS (Quantum Kernel Learning for Intrusion Detection System), a comparative study on the quantum kernel methods against classical machine learning approaches on the NSL-KDD dataset. We implement a variational quantum classifier using parameterized quantum circuits with angle encoding and entanglement-based feature maps, demonstrating performance competitiveness can be achieved by quantum kernel methods with classical baselines including Support Vector Machines. Through systematic qubit ablation studies, we establish that quantum kernels can match classical models on real-world cybersecurity data while revealing current practical limitations including computational overhead. The proposed quantum approach demonstrates competitive de-taction performance comparable to the best classical methods, with identical attack detection rates on critical security metrics. Our experimental setup with stratified train-test splitting and mutual information-based feature selection establishes practical baselines for quantum machine learning in network security applications. What makes our framework new is that it uses quantum kernel methods that use high-dimensional Hilbert space transformations to find complicated, non-linear patterns in data on network traffic that classical kernels might not be able to represent well. Our variational quantum circuits encode data into a quantum state space through parameterized rotation gates and controlled entanglement operations. The proposed approach is different from classical SVMs, which work in original feature space. This could help separate normal and malicious network behaviors better.
With cyber-attacks becoming increasingly sophisticated, modern network intrusion detection systems (NIDSs) are relying on machine learning (ML) methods for their flexibility in detecting subtle anomalous patterns in huge amounts of network data. However, classical ML methods such as support vector machines (SVMs) often rely on the conversion of low-dimensional data into a high-dimensional space, creating complex linear systems that are time-consuming to evaluate on large data inputs such as network flow logs. We propose addressing this limitation by employing a hybrid quantum-classical ML model to leverage quantum computing's (QC's) superiority in high-dimensional areas. We constructed a quantum kernel with an SVM model and evaluated it on four different network attacks from a modern intrusion detection dataset. Results reveal an average hardware accuracy rate of 85% with noticeably small deviations between runs, suggesting that quantum kernels may be a noise-resistant solution. We evaluated these results alongside classical and noiseless quantum simulator benchmarks.
Intrusion Detection Systems (IDS) play a fundamental role in safeguarding digital infrastructures against cyber threats. Quantum Machine Learning (QML) presents a promising frontier in this domain, offering potential computational speedups and improved management of complex datasets. However, its practical deployment is currently limited by the constraints of Noisy Intermediate-Scale Quantum (NISQ) devices. This work explores the application of various QML approaches, specifically Quantum Support Vector Classifiers (QSVC), Variational Quantum Classifiers (VQC), and hybrid quantum-classical neural networks for anomaly detection tasks. The models were fine-tuned and benchmarked using the ToN_IoT dataset, with performance assessed on IBM's noisy quantum simulators to evaluate their behavior under realistic noise conditions. Results indicate that the Pegasos-QSVC model outperformed others, reaching an accuracy of 93.05% and an F1 score of 93.73%. Through a comparative analysis of different circuit architectures, this study identifies strategies to improve the robustness of QML systems, emphasizing their emerging potential in cybersecurity scenarios.
Quantum machine learning on near-term noisy quantum devices has generated substantial theoretical interest, but rigorous empirical comparisons under realistic noise on practically relevant data remain scarce. This paper compares two paradigmatic quantum learning models, a Quantum Support Vector Machine (QSVM) built on the ZZFeatureMap quantum kernel and a Variational Quantum Classifier (VQC) with an EfficientSU2/RealAmplitudes ansatz, against tuned classical baselines (SVM with four kernels, Random Forest, XGBoost, LightGBM and CatBoost) on the ULB Credit Card Fraud dataset (284,807 transactions, 0.17% fraud). All models share an identical 4-qubit PCA-reduced feature space, evaluated on the full unbalanced test fold over 15 fits (3 folds × 5 seeds) and reported as mean ± standard deviation with bootstrap confidence intervals, AUPRC as the primary metric. Noise robustness is assessed under depolarizing noise p∈{0,0.001,0.01,0.05}, with ranking preservation measured directly through Spearman ρ and Kendall τ between the noisy and noiseless decision scores rather than read off AUPRC, alongside the per-paradigm computational cost. At four qubits the classical baselines lead (AUPRC 0.60 to 0.74, CatBoost best), above the VQC (0.494) and the QSVM (0.240); the controlled QSVM-versus-RBF–SVM comparison puts the cost of the quantum kernel at about 0.45 AUPRC. Under noise the QSVM keeps its score ranking (ρ=0.998 at p=0.001, 0.906 at p=0.01) and an operational decision threshold (recall 0.87 to 0.89, stable calibration), while the VQC AUPRC peaks non-monotonically at p=0.01 (0.494 rising to 0.654, then easing to 0.569 at p=0.05) even as its ranking decays monotonically (ρ from 0.72 to near zero), so average precision on its own misrepresents how noise affects it. The quantum models do not surpass the tuned classical reference at four qubits; the contribution is methodological: under noise, AUPRC has to be read together with a genuine rank statistic, because the two can move in opposite directions.