arrow
Return

Enhancing a convolutional autoencoder with a quantum approximate optimization algorithm for image noise reduction

delete2025-12-30
delete0
PRE
AI
T
Tara Kit
K
Kimsay Pov
K
Kimleang Kea
W
Won-Du Chang
H
Hee Chul Park
Y
Youngsun Han *
DOI:10.1088/2632-2153/ae1656delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Image denoising is essential for removing noise in images caused by electric device malfunctions or other factors during image acquisition. It ensures the preservation of image quality and accurate interpretation. Many convolutional autoencoder algorithms have proven effective in image denoising. Owing to their promising efficiency, quantum computers have gained popularity. This paper proposes a method, the quantum convolutional autoencoder (QCAE), which enhances traditional convolutional autoencoders by replacing their latent space with a quantum counterpart implemented via a quantum approximate optimization algorithm (QAOA)-inspired ansatz circuit. To enhance efficiency, we leveraged the advantages of the QAOA-incorporated parameter-shift rule to identify an optimized cost function, facilitating effective learning from data and gradient computation on an actual quantum computer. The proposed QCAE method outperformed its classical counterpart as it exhibited lower training loss and a higher structural similarity index (SSIM) value. QCAE also outperformed its classical counterpart in denoising the MNIST dataset by up to 40% in terms of SSIM value, confirming its enhanced capabilities in real-world applications. Evaluation of QAOA performance across different circuit configurations and layer variations showed that our technique outperformed other circuit designs by 25% on average.
Keywords:
quantum computing
quantum convolutional autoencoder
variational quantum algorithm
quantum machine learning

Journal

M
Machine Learning-Science and Technology
IF:
4.6
Papers:
1.1K
Citations:
3.4K

Organization

P
pukyong national university
Scholars:
1.8K
Papers: 827
Citations: 0