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

Springer proceedings in mathematics & statistics

The Quantum Detection Problem: A Survey

Sara Botelho-Andrade, Peter G. Casazza, Desai Cheng, John I. Haas, Tin T. Tran

Published Jan 1, 2018• 7 citations
Publisher
DOI
10.1007/978-981-13-2179-5_26

Related papers

A comment on quantum detection

Antonio Colavita

Physics Letters A•Feb 1, 1976•0 citations

Gated-mode single-photon detection and its applicationsusing InGaAs-APD

Songhao Liu

It is expounded that some key problems about single photon detection using InGaAs-APD with a gate mode application. In addition to summarizing the characteristics of the detection device and the gated-mode control system, it is summed up that the actually existed problems and the probably solved means in such mode. And finally its application in the quantum cryptography communication is briefly surveyed.

Chinese Journal of Quantum Electronics•Jan 1, 2004•0 citations

From Provable to Practical: A Problem-Driven Survey of Classical and Machine-Learning Defenses for DV/CV Quantum Key Distribution

Hasan Abbas Al-Mohammed, Afnan S. Al-Ali

Quantum key distribution (QKD) promises information-theoretic security, yet practical deployments in discrete-variable (DV) and continuous-variable (CV) settings remain exposed to device imperfections, channel manipulation, finite-key effects, and vulnerabilities in machine-learning (ML) components used for adaptation and monitoring. This survey adopts a problem-driven perspective based on nine practical problem classes (P1-P9) spanning device, channel, protocol, ML, and network layers. For each class, we compare classical defenses with ML-enabled solutions including anomaly detection, parameter prediction, noise estimation, adversarial purification, and resource allocation. Reported results include DBSCAN-based CV attack detection at P=99.7%, R=99.8%, F1=0.998, adversarial robustness recovery up to 79.5%, channel-amplification detection at 100%/91.26% under low/high-noise conditions, and LightGBM-based noise prediction reducing evaluation time by up to 98.8%. The survey further proposes a benchmarking framework combining datasets, stress protocols, and unified evaluation metrics including SKR impact, maximum distance, latency, and robustness. Finally, we provide defense-in-depth deployment guidelines and outline future research directions for secure and practical QKD systems.

quant-pharXiv:2605.27497•May 27, 2026•4 citations

Quantum detection theory

Masao Osaki

Proceedings of the IEICE General Conference•Mar 6, 1997•0 citations

Quantum detection and estimation theory

Carl W. Helstrom

Journal of Statistical Physics•Jan 1, 1969•4,032 citations

Quantum machine learning algorithms for anomaly detection: A review

Sebastiano Corli, Lorenzo Moro, Daniele Dragoni +2 more

The advent of quantum computers has justified the development of quantum machine learning algorithms , based on the adaptation of the principles of machine learning to the formalism of qubits . Among such quantum algorithms , anomaly detection represents an important problem crossing several disciplines from cybersecurity, to fraud detection to particle physics . We summarize the key concepts involved in quantum computing , introducing the formal concept of quantum speed up. The survey provides a structured map of anomaly detection based on quantum machine learning. We have grouped existing algorithms according to the different learning methods, namely quantum supervised, quantum unsupervised and quantum reinforcement learning, respectively. We provide an estimate of the hardware resources to provide sufficient computational power in the future. The survey provides a systematic and compact understanding of the techniques belonging to each category. We eventually provide a discussion on the computational complexity of the learning methods in real application domains.

arXiv:2408.11047•Future Generation Computer Systems•Dec 9, 2024•83 citations
Quantum key distribution (QKD) promises information-theoretic security, yet practical deployments in discrete-variable (DV) and continuous-variable (CV) settings remain exposed to device imperfections, channel manipulation, finite-key effects, and vulnerabilities in machine-learning (ML) components used for adaptation and monitoring. This survey adopts a problem-driven perspective based on nine practical problem classes (P1-P9) spanning device, channel, protocol, ML, and network layers. For each class, we compare classical defenses with ML-enabled solutions including anomaly detection, parameter prediction, noise estimation, adversarial purification, and resource allocation. Reported results include DBSCAN-based CV attack detection at P=99.7%, R=99.8%, F1=0.998, adversarial robustness recovery up to 79.5%, channel-amplification detection at 100%/91.26% under low/high-noise conditions, and LightGBM-based noise prediction reducing evaluation time by up to 98.8%. The survey further proposes a benchmarking framework combining datasets, stress protocols, and unified evaluation metrics including SKR impact, maximum distance, latency, and robustness. Finally, we provide defense-in-depth deployment guidelines and outline future research directions for secure and practical QKD systems.
The advent of quantum computers has justified the development of quantum machine learning algorithms , based on the adaptation of the principles of machine learning to the formalism of qubits . Among such quantum algorithms , anomaly detection represents an important problem crossing several disciplines from cybersecurity, to fraud detection to particle physics . We summarize the key concepts involved in quantum computing , introducing the formal concept of quantum speed up. The survey provides a structured map of anomaly detection based on quantum machine learning. We have grouped existing algorithms according to the different learning methods, namely quantum supervised, quantum unsupervised and quantum reinforcement learning, respectively. We provide an estimate of the hardware resources to provide sufficient computational power in the future. The survey provides a systematic and compact understanding of the techniques belonging to each category. We eventually provide a discussion on the computational complexity of the learning methods in real application domains.