NEWS
Journal Article
Editor in Chief: M. Rehena Sulthana
pISSN: XXXX-XXXXeISSN: XXXX-XXXX
2026 Vol. 1 No. 1
Abstract: Adversarial attacks pose a major challenge to classical deep learning systems, often leading to misclassification and reduced model reliability. To address this limitation, researchers propose a hybrid Quantum Generative Adversarial Network (QGAN) that integrates quantum feature extraction with classical adversarial learning. The model employs a four-qubit parameterized quantum generator to produce representative image features, which are then upsampled to 28×28 images. At the same time, a classical neural network discriminator distinguishes real samples from generated outputs and from adversarial perturbations. This hybrid design leverages the unique representational capacity of quantum circuits and the learning efficiency of classical networks, thereby achieving greater robustness and adaptability. The system is trained and evaluated on the MNIST dataset, a standard benchmark for image classification, allowing validation of generative fidelity and adversarial resistance. However, challenges arise due to the noise sensitivity of quantum circuits, limitations of small-qubit generators, and the need to balance convergence in adversarial training. Despite these constraints, the QGAN successfully produces visually realistic images while enabling the discriminator to identify subtle adversarial manipulations with higher precision. This work highlights the potential of hybrid quantum-classical models as resilient frameworks against adversarial attacks. It offers a pathway toward secure, quantum-enhanced machine learning pipelines for future large-scale applications.
Received on: 12/08/2025Revised on: 23/10/2025Accepted on: 16/11/2025Published on: 03/03/2026
A. S. Sundhar, J. A. Jeba, B. Singh, S. J. V. Aravintha, S. Somayajula, and A. J. Obaid, “Quantum Generative Adversarial Networks for Image Generation and Adversarial Image Detection,” Ale Journal of Sustainable Intelligent Network, vol. 1, no. 1, pp. 33–48, 2026.
Access the entire article database from our website
Purchase the article and get access forever.