The study evaluates quantum machine learning (QML) models for network intrusion detection against well-tuned classical baselines across four standard datasets, using a leakage-controlled protocol and noise simulation. It introduces a quantum-attribution audit to determine whether any performance gains are truly due to quantum effects. While most tuned classical models match or surpass QML, two quantum approaches— a quantum-kernel SVM and a small hybrid circuit—show statistically significant advantages on specific metrics and tasks.
By Syeda Anshrah Gillani, Mirza Samad Ahmed Baig, Shahid Munir Shah, Asher Ali, Hamzah Siddiqui
arXiv:2607. 13897v1 Announce Type: new Abstract: The broadcast nature of wireless channels exposes radio-frequency (RF) networks to anomalous and malicious transmissions, making anomaly detection a fundamental requirement for secure spectrum management.
By Abdallah Aaraba, Alexis Vieloszynski, Remon Polus, Ola Ahmad, Soumaya Cherkaoui
arXiv:2606. 27411v1 Announce Type: cross Abstract: We study a quantum autoencoder (QAE) for compression-driven anomaly detection in brain MRI data.
By Santanu Ganguly, Xing Liang, Dimitrios Makris
The broadcast nature of wireless channels exposes radio-frequency (RF) networks to anomalous and malicious transmissions, making anomaly detection a fundamental requirement for secure spectrum management. Quantum Kitchen Sinks (QKS) offer a lightweight hybrid quantum feature map suitable for near-term quantum devices, yet their behavior on structured signal data remains poorly understood.
arXiv:2508. 19437v2 Announce Type: replace-cross Abstract: The importance of analyzing nontrivial datasets when testing quantum machine learning (QML) models is becoming increasingly prominent in literature, yet a cohesive framework for understanding dataset characteristics remains elusive.
By Alona Sakhnenko, Christian B. Mendl, Jeanette M. Lorenz
arXiv:2609.01537v1 Announce Type: new
Abstract: Q-matrices play a central role in cognitive diagnosis within educational data mining (EDM), specifying which latent skills each assessment item require...
By Arif Hassan Zidan, Yi Pan, Bowen Guo, Xiang Li, Yu Bao, Yingfeng Wang, Tianming Liu, Wei Zhang
arXiv:2604. 06265v2 Announce Type: replace Abstract: Quantum-inspired tensor networks algorithms have shown to be effective and efficient models for machine learning tasks, including anomaly detection.
By Apimuk Sornsaeng, Si Min Chan, Wenxuan Zhang, Swee Liang Wong, Joshua Lim, Jonathan Pan, Dario Poletti
The paper investigates the role of quantum computing in network‑security classification through two experiments. First, it evaluates near‑term quantum‑kernel support vector machines on datasets such as KDD Cup 1999, CICIDS2017, and BoT‑IoT, finding that quantum kernels can match or sometimes improve classical baselines, though classical RBF kernels often remain stronger. Second, it explores long‑term memory efficiency using quantum oracle sketching (QOS), showing that quantum methods can achieve comparable accuracy with a smaller effective memory footprint than explicit storage, suggesting a potential advantage in memory‑efficient data access for streaming classification tasks.
By Yuqing Li, Poonam Bala Nehru, Yunpeng Zhang, Danindu Gammanpilage, Xin Jin, Zeguan Wu, Junyu Liu
arXiv:2608. 19306v1 Announce Type: cross Abstract: Given a set of input states, we consider the task of predicting the expectation value of a Pauli observable at the output of an unknown quantum evolution, using only a limited number of measurements.
By Jonas J\"ager, Yaroslav Khmelnitskiy, Paolo Braccia, Artur Miroszewski, Diego Garc\'ia-Mart\'in, M. Cerezo, Piotr Czarnik
arXiv:2503. 17020v2 Announce Type: replace-cross Abstract: Kernel methods compare inputs through feature maps.
By Joachim Tomasi, Sandrine Anthoine, Hachem Kadri
The paper introduces a classical algorithm that dequantizes a quantum sampler used for learning with optimized random features. By sampling heavy indices and reducing the transformation to a small principal block, the method produces a sparse classical representation with operator‑norm guarantees. This approach enables a classical sampler with specified accuracy and polynomial runtime, demonstrating that quantum block‑encoding factorizations can provide sufficient classical structure even when direct sampling access to the composite matrix is unavailable.
By Natsuto Isogai, Mio Murao, Hayata Yamasaki
Quantum Neural Networks (QNNs) are a promising framework for quantum machine learning on near-term quantum devices, but their security risks remain insufficiently understood. Studies have shown that QNNs are vulnerable to backdoor attacks, yet existing quantum backdoors mostly rely on a fixed trigger shared by all poisoned inputs.