← Lab /Security & privacy

Quantum SVM cuts false-positive rate vs. random forest but slightly lowers true-positive rate

Security & privacy Measurement · Maturity unclear · arXiv

The claim

A quantum support vector machine reduces FPR while marginally decreasing TPR compared to a random forest in QML intrusion detection

Roberto Fernández-Barrios, Iker Pastor-López, Asier González-Santocildes, Pablo García Bringas · arXiv Paper PDF

Published as: “False-Alarm Improvements and Detection Trade-Offs in QML Intrusion Detection: A Secondary Analysis of the Kaissar Corpus”

So what

The analysis shows that reported low false-positive rates in QML-IDS papers often lack independent-test validation and cannot be directly translated into operational guarantees.

The five-minute version

A quantum support vector machine (QSVM) reduces the false-positive rate compared with a random forest (3.329% vs 6.875%) but its true-positive rate drops slightly (93.682% vs 93.955%). The secondary analysis reconstructs joint FPR/TPR operating points from five QML-IDS papers, finding that QSVM also lowers false alarms against other classical baselines, though sometimes at the cost of detection (e.g., against random forest). Evidence is limited to 24 descriptive points with conditional confidence intervals; many points lack verified independent-test independence and sample sizes are too small to support ultra-low FPR claims such as 0.01%.

What they found 3

What undercuts it the paper’s own results

Stated limits 3

What’s new here 4

Artifacts & methods 10

Topics

false-positive ratetrue-positive ratequantum support vector machineintrusion detection systemClopper-Pearson intervalprovenance rulesecondary analysisquantum machine learning
← Previous Fee level dominates revenue, skew has minor effect in Lightning routing