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

International Journal of Electronics and Telecommunications

Where a domain specific quantum feature map pays: a cross-domain

Jean Marie Vianney Sindayigaya

Published Oct 29, 2026• 0 citations
PDF (CC BY)Publisher

Abstract

Claims about quantum machine learning are routinely established on a single dataset and generalised informally. This paper tests one such claim directly. Earlier work in this series found, under a leakage-controlled predeclared protocol, that a financial-transaction-specific quantum feature map does not outperform matched classical baselines on the Kaggle Credit-Card Fraud dataset. We freeze source-column contracts and an experimental protocol in advance, inherit every predicted direction from that published result, and replicate on CICIDS-2017 (2.8 million flows) and UNSW-NB15 (257,673 records) — six paired comparisons under one Holm–Bonferroni correction. The replication is partial, and the failure is informative. The map’s advantage over naive amplitude encoding replicates on both datasets and is now established across three datasets and two domains. But the prediction that a matched RBF-SVM would win is significantly reversed on UNSW-NB15, where the quantum kernel wins by a median 0.021 F1 — identifying a regime in which the approach pays. That result is bounded: a random forest on identical cohorts outperforms the quantum kernel on both datasets, so no general claim of quantum advantage is supportable. Two further findings weaken the premise of domain-specific encoding itself. The advantage over generic quantum encodings differs in sign between the two network datasets, and the unanimous entanglement strength selected on financial data does not reproduce on either. We conclude that quantum kernel results reported on one dataset should not be assumed to transfer, in either direction, and that predeclared cross-domain replication is cheap enough to be routine. Balanced-cohort metrics are benchmark values, not deployment-prevalence estimates.

DOI
10.24425/ijet.2026.6340

Related papers

Entanglement entropy is not a faithful explanation: auditing a financial quantum feature map

Jean Marie Vianney Sindayigaya

Entanglement entropy is an attractive candidate for explaining quantum machine-learning models: it is intrinsic to the encoding, cheap to compute, and requires no measurement. We test whether it is a faithful feature attribution for a financial-transaction quantum feature map, under a protocol predeclared down to its thresholds, its comparison family, and its posture on failure. Two questions are separated by construction. First, does the operating point selected for accuracy leave usable attribution signal? Second, does that signal correspond to what actually drives the model’s decisions? On the Kaggle Credit-Card Fraud dataset over ten repeated case-control splits, per-feature entropy dispersion is 71% lower at the accuracy-selected entanglement strength than at the midpoint of the grid, and the difference is significant after Holm–Bonferroni correction; however, a lower-strength regime with 3.4× the dispersion is available at no statistically detectable accuracy cost. Faithfulness fails decisively. Entropy rankings are significantly anti-correlated with model-aware occlusion attributions (median Spearman −0.299), and on a synthetic task whose informative features are known by construction and which the quantum model demonstrably learns, occlusion recovers ground truth (+0.237) while entropy does not (−0.025), both significant after correction. A model-randomisation check identifies the cause exactly: per-feature entropy is invariant to the trained model, with maximum change of exactly zero across all ten seeds, so it cannot distinguish a correctly trained model from one fitted to shuffled labels. We conclude that entanglement entropy is a genuine and inexpensive diagnostic of the encoding but not an explanation of the model, and we report this refutation as predeclared. Balanced-cohort metrics are benchmark values, not deployment-prevalence estimates.

International Journal of Electronics and Telecommunications•Oct 29, 2026•0 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

Matched but Not Better: An Equivalence-Tested Benchmark of Quantum Machine Learning on Six Clinical Datasets and the QML-Health-READY Reporting Framework

Mohammed Siraj B, Gousia Habib, Ruban S

Background: Quantum machine learning (QML) is promoted for clinical prediction, but comparisons with classical models are rarely paired or tested for equivalence. Methods: We compared a quantum-kernel support vector machine (QSVM; 4 qubits, tuned bandwidth) and a variational quantum classifier (VQC) with five tuned classical models across six public clinical datasets. All models used identical four-component inputs and 25 cross-validation splits. Paired AUROC differences were assessed using a corrected resampled t-test, Holm-adjusted equivalence tests (margins: +/-0.02 and +/-0.05), and random-effects pooling. Ablation, noise, finite-shot, and implementation-fault analyses were conducted. We propose QML-Health-READY, an eight-domain reporting framework. Results: Neither quantum model significantly outperformed any classical comparator. Pooled across datasets, QSVM differed from the kernel-matched radial basis function (RBF) SVM by -0.006 AUROC (95% CI: -0.017 to +0.004), equivalent to +/-0.02. VQC differed from the best classical model by -0.007 (95% CI: -0.019 to +0.004). QSVM was equivalent to RBF SVM within +/-0.05 in four of six datasets but was significantly worse than the best classical model on NHANES 2017-18 (-0.076). A classically trivial product-state kernel performed as well as the entangling kernel. With depolarizing noise (p = 0.01) and 1,024 shots per kernel entry, QSVM AUROC decreased by 0.054 (95% CI: 0.036 to 0.071). Untuned bandwidth produced near-chance AUROC (0.48-0.59). Conclusions: Correctly configured quantum classifiers approached but did not exceed tuned classical models. Finite-shot estimation, rather than gate noise, was their main practical cost, while configuration errors could reverse conclusions. QML-Health-READY defines reporting requirements for credible claims.

arXiv:2611.05442•Nov 3, 2026•0 citations

FT-FM-lite: Tunable-Entanglement Refinement and Empirical Benchmarking on Financial-Cybersecurity Datasets

Jean Marie Vianney Sindayigaya

The financial-transaction feature map FT-FM, introduced in the first paper of this series, is empirically more expressive than generic quantum encodings but operates in a near-maximally entangled regime in which quantum-kernel values concentrate and kernel-based classification fails. This paper introduces FT-FM-lite, a refinement of FT-FM with a single entanglement-strength hyperparameter β ∈ [0, 1] that preserves the domain-informed encoding axioms while allowing the feature map to operate in the intermediate expressibility–trainability regime; β = 1 recovers FT-FM exactly. A validation-based protocol selects β per training split. In a ten-seed synthetic diagnostic against exactly implemented matched controls, validation-selected FT-FM-lite attains a mean held-out F1 of 0.620 (95% bootstrap CI [0.530, 0.709]), exceeding exact amplitude encoding (0.362) and Qiskit’s ZZFeatureMap (0.033) with Holm–Bonferroni-corrected significance, while its advantage over full-strength FT-FM (0.490) is not significant after correction. We further specify a leakage-controlled, case-control benchmarking protocol with paired Wilcoxon significance testing and apply it to the Kaggle Credit-Card Fraud dataset over ten repeated stratified case-control splits. In contrast to the synthetic diagnostic, validation selection chose full strength (β = 1) in every seed, and FT-FM-lite attained a mean case-control test F1 of 0.891 (95% bootstrap CI [0.870, 0.907]; ROC-AUC 0.971; PR-AUC 0.976) — significantly above exact amplitude encoding and significantly below a matched RBF-SVM after Holm–Bonferroni correction, and statistically indistinguishable from Qiskit’s ZZFeatureMap and the remaining classical baselines. Balanced-cohort metrics are benchmark values, not deployment-prevalence estimates.

International Journal of Electronics and Telecommunications•Oct 29, 2026•0 citations

A Matched Spectral Benchmark of Quantum Inspired Feature Maps

Toheeb Ogunade, Taofeek Kassim, Etinosa Osaro

Quantum machine learning is often motivated by the idea that quantum systems can expose useful high-dimensional structure that is difficult to access with classical models. We isolate one central component of this claim: the fixed data-encoding map. Amplitude, angle, and basis encoding are evaluated as deterministic feature maps for classical supervised learning under matched output dimensionality and strong classical controls. The benchmark compares these encodings against raw linear models, random Fourier features, polynomial features, PCA, RBF SVMs, and shallow neural networks across diverse classical datasets. Rather than treating performance as a single endpoint, we analyze the geometry of each representation through effective rank, condition number, centered kernel alignment, predictive performance, and practical overhead. The resulting picture is mechanistic: amplitude encoding can remove magnitude information through unit-sphere normalization, angle encoding can become geometrically redundant with raw linear features, and basis encoding can impose a binary Hamming geometry that is poorly aligned with smooth decision structure. These findings do not argue against quantum computation, however, they show that fixed quantum-inspired encoding geometry alone is not a reliable source of machine-learning advantage on classical data.

quant-pharXiv:2605.24324•May 26, 2026•1 citation

Benchmarking Quantum Kernel SVMs for Credit Card Fraud Detection: Performance Realities Under NISQ Constraints

Hitanshi Arora, Mohit Swarnkar, Aswani Kumar Cherukuri

Detecting credit card fraud is notoriously difficult because fraudulent charges make up less than 0.2% of total transactions. Quantum Machine Learning (QML), particularly Quantum Kernel Support Vector Machines (QSVM), promises richer feature representations by embedding classical data into high-dimensional Hilbert spaces. However, whether this theoretical advantage holds up when managing real-world financial data bottlenecks remains unclear. We designed a controlled benchmark comparing three quantum encodings, Angle, ZZFeatureMap, and IQP against classical models while keeping sample sizes, feature counts, and scaling strictly matched. To handle class skew without corrupting quantum state overlaps, we embedded synthetic minority oversampling (SMOTE) directly into the quantum Gram matrix workflow, raising PR-AUC scores by roughly +0.04 across feature maps. When trained on the full European credit card dataset with 30 features, classical baselines reached a top PR-AUC of 0.983. However, restricting classical models to match QSVM hardware constraints (500 samples, 4 PCA features) dropped their PR-AUC to 0.750. This puts our best quantum result 0.730 PR-AUC using IQP encoding on 150 samples into realistic context. Testing on physical quantum hardware reduced performance further to 0.62 due to CNOT gate errors and thermal noise. Overall, our findings pinpoint two main operational bottlenecks for near-term quantum kernels: the scaling of Gram matrix evaluation and heavy information loss from squeezing features onto small qubit registers.

arXiv:2610.17027•Oct 12, 2026•0 citations
Claims about quantum machine learning are routinely established on a single dataset and generalised informally. This paper tests one such claim directly. Earlier work in this series found, under a leakage-controlled predeclared protocol, that a financial-transaction-specific quantum feature map does not outperform matched classical baselines on the Kaggle Credit-Card Fraud dataset. We freeze source-column contracts and an experimental protocol in advance, inherit every predicted direction from that published result, and replicate on CICIDS-2017 (2.8 million flows) and UNSW-NB15 (257,673 records) — six paired comparisons under one Holm–Bonferroni correction. The replication is partial, and the failure is informative. The map’s advantage over naive amplitude encoding replicates on both datasets and is now established across three datasets and two domains. But the prediction that a matched RBF-SVM would win is significantly reversed on UNSW-NB15, where the quantum kernel wins by a median 0.021 F1 — identifying a regime in which the approach pays. That result is bounded: a random forest on identical cohorts outperforms the quantum kernel on both datasets, so no general claim of quantum advantage is supportable. Two further findings weaken the premise of domain-specific encoding itself. The advantage over generic quantum encodings differs in sign between the two network datasets, and the unanimous entanglement strength selected on financial data does not reproduce on either. We conclude that quantum kernel results reported on one dataset should not be assumed to transfer, in either direction, and that predeclared cross-domain replication is cheap enough to be routine. Balanced-cohort metrics are benchmark values, not deployment-prevalence estimates.
Entanglement entropy is an attractive candidate for explaining quantum machine-learning models: it is intrinsic to the encoding, cheap to compute, and requires no measurement. We test whether it is a faithful feature attribution for a financial-transaction quantum feature map, under a protocol predeclared down to its thresholds, its comparison family, and its posture on failure. Two questions are separated by construction. First, does the operating point selected for accuracy leave usable attribution signal? Second, does that signal correspond to what actually drives the model’s decisions? On the Kaggle Credit-Card Fraud dataset over ten repeated case-control splits, per-feature entropy dispersion is 71% lower at the accuracy-selected entanglement strength than at the midpoint of the grid, and the difference is significant after Holm–Bonferroni correction; however, a lower-strength regime with 3.4× the dispersion is available at no statistically detectable accuracy cost. Faithfulness fails decisively. Entropy rankings are significantly anti-correlated with model-aware occlusion attributions (median Spearman −0.299), and on a synthetic task whose informative features are known by construction and which the quantum model demonstrably learns, occlusion recovers ground truth (+0.237) while entropy does not (−0.025), both significant after correction. A model-randomisation check identifies the cause exactly: per-feature entropy is invariant to the trained model, with maximum change of exactly zero across all ten seeds, so it cannot distinguish a correctly trained model from one fitted to shuffled labels. We conclude that entanglement entropy is a genuine and inexpensive diagnostic of the encoding but not an explanation of the model, and we report this refutation as predeclared. Balanced-cohort metrics are benchmark values, not deployment-prevalence estimates.
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.
Background: Quantum machine learning (QML) is promoted for clinical prediction, but comparisons with classical models are rarely paired or tested for equivalence. Methods: We compared a quantum-kernel support vector machine (QSVM; 4 qubits, tuned bandwidth) and a variational quantum classifier (VQC) with five tuned classical models across six public clinical datasets. All models used identical four-component inputs and 25 cross-validation splits. Paired AUROC differences were assessed using a corrected resampled t-test, Holm-adjusted equivalence tests (margins: +/-0.02 and +/-0.05), and random-effects pooling. Ablation, noise, finite-shot, and implementation-fault analyses were conducted. We propose QML-Health-READY, an eight-domain reporting framework. Results: Neither quantum model significantly outperformed any classical comparator. Pooled across datasets, QSVM differed from the kernel-matched radial basis function (RBF) SVM by -0.006 AUROC (95% CI: -0.017 to +0.004), equivalent to +/-0.02. VQC differed from the best classical model by -0.007 (95% CI: -0.019 to +0.004). QSVM was equivalent to RBF SVM within +/-0.05 in four of six datasets but was significantly worse than the best classical model on NHANES 2017-18 (-0.076). A classically trivial product-state kernel performed as well as the entangling kernel. With depolarizing noise (p = 0.01) and 1,024 shots per kernel entry, QSVM AUROC decreased by 0.054 (95% CI: 0.036 to 0.071). Untuned bandwidth produced near-chance AUROC (0.48-0.59). Conclusions: Correctly configured quantum classifiers approached but did not exceed tuned classical models. Finite-shot estimation, rather than gate noise, was their main practical cost, while configuration errors could reverse conclusions. QML-Health-READY defines reporting requirements for credible claims.
The financial-transaction feature map FT-FM, introduced in the first paper of this series, is empirically more expressive than generic quantum encodings but operates in a near-maximally entangled regime in which quantum-kernel values concentrate and kernel-based classification fails. This paper introduces FT-FM-lite, a refinement of FT-FM with a single entanglement-strength hyperparameter β ∈ [0, 1] that preserves the domain-informed encoding axioms while allowing the feature map to operate in the intermediate expressibility–trainability regime; β = 1 recovers FT-FM exactly. A validation-based protocol selects β per training split. In a ten-seed synthetic diagnostic against exactly implemented matched controls, validation-selected FT-FM-lite attains a mean held-out F1 of 0.620 (95% bootstrap CI [0.530, 0.709]), exceeding exact amplitude encoding (0.362) and Qiskit’s ZZFeatureMap (0.033) with Holm–Bonferroni-corrected significance, while its advantage over full-strength FT-FM (0.490) is not significant after correction. We further specify a leakage-controlled, case-control benchmarking protocol with paired Wilcoxon significance testing and apply it to the Kaggle Credit-Card Fraud dataset over ten repeated stratified case-control splits. In contrast to the synthetic diagnostic, validation selection chose full strength (β = 1) in every seed, and FT-FM-lite attained a mean case-control test F1 of 0.891 (95% bootstrap CI [0.870, 0.907]; ROC-AUC 0.971; PR-AUC 0.976) — significantly above exact amplitude encoding and significantly below a matched RBF-SVM after Holm–Bonferroni correction, and statistically indistinguishable from Qiskit’s ZZFeatureMap and the remaining classical baselines. Balanced-cohort metrics are benchmark values, not deployment-prevalence estimates.
Quantum machine learning is often motivated by the idea that quantum systems can expose useful high-dimensional structure that is difficult to access with classical models. We isolate one central component of this claim: the fixed data-encoding map. Amplitude, angle, and basis encoding are evaluated as deterministic feature maps for classical supervised learning under matched output dimensionality and strong classical controls. The benchmark compares these encodings against raw linear models, random Fourier features, polynomial features, PCA, RBF SVMs, and shallow neural networks across diverse classical datasets. Rather than treating performance as a single endpoint, we analyze the geometry of each representation through effective rank, condition number, centered kernel alignment, predictive performance, and practical overhead. The resulting picture is mechanistic: amplitude encoding can remove magnitude information through unit-sphere normalization, angle encoding can become geometrically redundant with raw linear features, and basis encoding can impose a binary Hamming geometry that is poorly aligned with smooth decision structure. These findings do not argue against quantum computation, however, they show that fixed quantum-inspired encoding geometry alone is not a reliable source of machine-learning advantage on classical data.
Detecting credit card fraud is notoriously difficult because fraudulent charges make up less than 0.2% of total transactions. Quantum Machine Learning (QML), particularly Quantum Kernel Support Vector Machines (QSVM), promises richer feature representations by embedding classical data into high-dimensional Hilbert spaces. However, whether this theoretical advantage holds up when managing real-world financial data bottlenecks remains unclear. We designed a controlled benchmark comparing three quantum encodings, Angle, ZZFeatureMap, and IQP against classical models while keeping sample sizes, feature counts, and scaling strictly matched. To handle class skew without corrupting quantum state overlaps, we embedded synthetic minority oversampling (SMOTE) directly into the quantum Gram matrix workflow, raising PR-AUC scores by roughly +0.04 across feature maps. When trained on the full European credit card dataset with 30 features, classical baselines reached a top PR-AUC of 0.983. However, restricting classical models to match QSVM hardware constraints (500 samples, 4 PCA features) dropped their PR-AUC to 0.750. This puts our best quantum result 0.730 PR-AUC using IQP encoding on 150 samples into realistic context. Testing on physical quantum hardware reduced performance further to 0.62 due to CNOT gate errors and thermal noise. Overall, our findings pinpoint two main operational bottlenecks for near-term quantum kernels: the scaling of Gram matrix evaluation and heavy information loss from squeezing features onto small qubit registers.