Synergy of quantum computing and federated learning in information technology detection of hidden target groups
DOI:
https://doi.org/10.32347/2411-4049.2025.4.114-122Keywords:
information technologies, federated learning, quantum computing, hybrid algorithms, big data analysis, hidden target groupsAbstract
The article considers the information technology of detecting hidden target groups in large distributed data sets based on the synergy of quantum computing and federated learning. It is shown that in modern information systems for analyzing big data, traditional methods of machine learning and intelligent analysis demonstrate limited effectiveness in identifying poorly represented or hidden structures, especially under conditions of statistical imbalance of samples, high dimensionality of the feature space and distributed storage of information. The proposed approach combines federated learning as an information technology of distributed model formation without data centralization with quantum algorithms of amplitude amplification, which allows to increase sensitivity to weak signals in subspaces with increased information significance. The paper considers the architecture of a hybrid information technology, which includes classical computing nodes, a level of federated aggregation and a quantum computing module, as well as a structural and algorithmic scheme of interaction of classical and quantum components. The algorithmic aspects of the implementation of the proposed approach are analyzed, taking into account the limitations of modern quantum computing platforms of the NISQ (Noisy Intermediate-Scale Quantum) class, in particular the limited number of qubits and the influence of noise. It is shown that the use of selective quantum processing and iterative interaction between classical and quantum circuits allows to ensure the reproducibility of the results and the possibility of practical implementation of the proposed information technology. The proposed approach is a promising direction in the development of information technologies for analyzing large distributed data and can be used as a theoretical and applied basis for further research in the field of hybrid classical-quantum computing systems.
References
Aledhari, M., Razzak, R., Parizi, R. M., & Saeed, F. (2020). Federated learning: A survey on enabling technologies, protocols, and applications. IEEE Access, 8, 140699–140725. https://doi.org/10.1109/ACCESS.2020.3013541
Shor, P. W. (1999). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Review, 41(2), 303–332. https://doi.org/10.1137/S0036144598347011
Li, Q., Wen, Z., Wu, Z., et al. (2021). A survey on federated learning systems: Vision, hype and reality for data privacy and protection. IEEE Transactions on Knowledge and Data Engineering, 35(1), 573–588. https://doi.org/10.1109/TKDE.2021.3124599
Yang, Q., Liu, Y., Chen, T., & Tong, Y. (2019). Federated machine learning: Concept and applications. ACM Transactions on Intelligent Systems and Technology, 10(2), Article 12. https://doi.org/10.1145/3298981
Schuld, M., & Petruccione, F. (2018). Supervised learning with quantum computers. Springer. https://doi.org/10.1007/978-3-319-96424-9
Havlíček, V., Córcoles, A. D., Temme, K., et al. (2019). Supervised learning with quantum-enhanced feature spaces. Nature, 567(7747), 209–212. https://doi.org/10.1038/s41586-019-0980-2
Kandala, A., Mezzacapo, A., Temme, K., et al. (2017). Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets. Nature, 549(7671), 242–246. https://doi.org/10.1038/nature23879
Bonawitz, K., Ivanov, V., Kreuter, B., et al. (2017). Practical secure aggregation for privacy-preserving machine learning. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (pp. 1175–1191). https://doi.org/10.1145/3133956.3133982
Ustimenko, V., & Pustovit, O. (2025). On the postquantum protocol-based short digital signatures with multivariate maps over arithmetical rings. In K. Arai (Ed.), Advances in information and communication (Lecture Notes in Networks and Systems, Vol. 1285, pp. 688–699). Springer.
Ustimenko, V., & Pustovit, O. (2025). On symbolic computations over arbitrary commutative rings via temporal Jordan–Gauss graphs and multivariate cryptosystems. In Proceedings of the Cybersecurity Providing in Information and Telecommunication Systems (pp. 405–424). Kyiv.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 С.В. Фадейчев, О.М. Трофимчук, В.М. Триснюк
This work is licensed under a Creative Commons Attribution 4.0 International License.
The journal «Environmental safety and natural resources» works under Creative Commons Attribution 4.0 International (CC BY 4.0).
The licensing policy is compatible with the overwhelming majority of open access and archiving policies.
