Metraipolis › archive › dc_ece776a87793
Pareto-optimal quantum kernel selection for unsupervised anomaly detection on real malware beaconing data — arXiv:2610.09717
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.09717
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T11:44:32.584Z
- SHA-256 of the archived text
fd4e6c99aaf87bc5e657f0db1c0a9877325126b33ede8c4fb8f8ac2019db8925- Stable URL of this page
https://metraipolis.com/documento/dc_ece776a87793
How to cite
Pareto-optimal quantum kernel selection for unsupervised anomaly detection on real malware beaconing data — arXiv:2610.09717 — arXiv (en), https://arxiv.org/abs/2610.09717 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ece776a87793 (Metraipolis archive dc_ece776a87793, sha256 fd4e6c99aaf87bc5e657f0db1c0a9877325126b33ede8c4fb8f8ac2019db8925)
BibTeX
@misc{dcece776a87793,
title = {Pareto-optimal quantum kernel selection for unsupervised anomaly detection on real malware beaconing data — arXiv:2610.09717},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.09717},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ece776a87793; sha256 fd4e6c99aaf87bc5e657f0db1c0a9877325126b33ede8c4fb8f8ac2019db8925},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.09717. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Quantum kernel methods are leading candidates for a practical quantum advantage in machine learning, but assessing that potential requires two quantities usually reported separately: how well a kernel performs on the task, and how far its geometry departs from the classical kernels available for the same problem. We introduce a fully unsupervised, multi-objective protocol that optimises simultaneously the normalised pseudo discrepancy (NPD), a label-free proxy for anomaly detection quality, and the geometric difference (GD) to a tuned classical reference kernel, selecting models from the resulting Pareto front. We apply it to malware beaconing detection in real network traffic, using a one-class support vector machine with fidelity and projected quantum kernels over four data encodings, on simulators and on IQM's 20-qubit Garnet processor. NPD-guided selection alone finds a fidelity kernel that beats the tuned classical baseline, but with a geometric difference too small to certify the gain as quantum. Projected kernels reach far larger geometric differences; the Pareto-selected one only marginally exceeds the baseline (AUC $0.782$ versus $0.765$, $g_{C\to Q}\approx 89>\sqrt{N}$ relative to that reference kernel), still below the NPD-selected fidelity kernel ($0.840$).
Tema degli esploratori: fiducia digitale e crittografia (elenco arXiv cs.CR, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Cryptography and Security (cs.CR); Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2610.09717 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T10:45:22.471Z dalla pagina https://arxiv.org/list/cs.CR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).