Answers are grounded in this paper and cite their sources.
Signature- and rule-based firewalls score packets one at a time against a fixed threshold, which leaves them weak against multi-stage attacks and drifting traffic. We present the final design and a complete re-evaluation of QEAFIS, a quantum-inspired architecture that places three modules around a simulated 7-qubit quantum neural network (QNN). Entanglement-Guided Inter-Packet Correlation (EGIPC) scores a session with the entropy of a dephased register qubit. Behavioral Fingerprint Memory (BFM) matches traffic against confirmed threats. Dynamic Threshold Adaptation (DTA) moves the decision threshold by stochastic-approximation descent on an explicit cost. Every result was regenerated on NSL-KDD and UNSW-NB15 under de-duplicated, leakage-free partitions with up to ten seeds. The evaluation covers the end-to-end pipeline, a ten-configuration ablation, classical and neural sequence baselines, withheld attack categories, poisoning and drift tests, and per-stage latency. BFM with an admission guard and DTA on rank-calibrated scores gave practically meaningful gains: DTA lowered the post-shift error cost by 0.104 and 0.047, and on NSL-KDD the guard held the BFM false-positive rate at 1.0% with 20% of memory poisoned, against 68.7% without it. The quantum-inspired parts did not. We show that the EGIPC score is a classical sequential statistic. It matched a transition-weighted CUSUM, trailed LSTM, GRU, Transformer and TCN models by 0.23–0.28 AUROC on evasive NSL-KDD attacks, and saturated under distribution shift. The QNN detected no better than a classical network at about thirty times its per-event cost (about 1 ms), and withheld categories were detected unreliably. Earlier shadow-mode results are retained only as provisional.
No takes yet. Share an insight, caveat, or question.
Senthilkumar et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: