Quantum computing offers parallel processing capabilities and resource-saving advantages, particularly useful for managing expansive datasets and complex image processing tasks. Grayscale images, being the simplest single-channel image mode, are frequently employed in artificial intelligence training. Before actual image applications, various image processing operations are typically required. However, the restoration of a grayscale image of dimensions 2n× 2nafter a series of linear transformations poses a challenge. Existing methods typically involve finding the inverse of the most recent linear transformation or re-encoding the image followed by repeated operations until the final transformation, resulting in excessive computational overhead and disconnection from subsequent quantum grayscale image applications. To address this issue, we propose a universal quantum linear restoration algorithm for grayscale image, denoted as QLR, which effectively bridges the stages of linear transformation and subsequent image applications. QLR reduces the time complexity from O(2n) to O(n) compared to classical counterpart. Building upon the QLR algorithm, we further propose two quantum resource-optimized compression methods for optional lossless image storage. Combining with other quantum algorithms and techniques, we design a framework (QGIP) aimed at bridging the processes of quantum grayscale image processing and applications. Experiments simulated on the IBM Quantum platform validate the correctness and efficiency of our proposal.
Quantum computing offers parallel processing capabilities and resource-saving advantages, particularly useful for managing expansive datasets and complex image processing tasks. Grayscale images, being the simplest single-channel image mode, are frequently employed in artificial intelligence training. Before actual image applications, various image processing operations are typically required. However, the restoration of a grayscale image of dimensions 2n× 2nafter a series of linear transformations poses a challenge. Existing methods typically involve finding the inverse of the most recent linear transformation or re-encoding the image followed by repeated operations until the final transformation, resulting in excessive computational overhead and disconnection from subsequent quantum grayscale image applications. To address this issue, we propose a universal quantum linear restoration algorithm for grayscale image, denoted as QLR, which effectively bridges the stages of linear transformation and subsequent image applications. QLR reduces the time complexity from O(2n) to O(n) compared to classical counterpart. Building upon the QLR algorithm, we further propose two quantum resource-optimized compression methods for optional lossless image storage. Combining with other quantum algorithms and techniques, we design a framework (QGIP) aimed at bridging the processes of quantum grayscale image processing and applications. Experiments simulated on the IBM Quantum platform validate the correctness and efficiency of our proposal.
This paper presents a hybrid quantum-classical framework for grayscale image compression and decompression, leveraging the strengths of quantum computing and deep learning. The compression pipeline integrates a Variational Quantum Daubechies Wavelet Transform (V-QDWT) and a trainable Quantum Convolutional Neural Network (QCNN) optimized end-to-end to achieve efficient, image-adaptive multi-resolution analysis and entanglement-based feature reduction. Input images are encoded using the Normal Arbitrary Superposition State (NASS) representation, enabling compact and scalable quantum storage. For decompression, we implement inverse QCNN and V-QDWT circuits to reconstruct coarse image features natively, followed by a classical Super-Resolution Generative Adversarial Network (SRGAN) to enhance perceptual quality. Experimental evaluations on benchmark grayscale datasets demonstrate the efficacy of our hybrid approach. By jointly training the quantum layers, the base quantum pipeline closely rivals classical JPEG2000 standards. Subsequent SRGAN refinement substantially pushes the boundaries of the reconstruction, achieving superior structural fidelity (PSNR: 30.0667 dB, SSIM: 0.8744, Histogram Correlation: 0.9244). Histogram analysis and qualitative comparisons further validate the restoration of fine textures and intensity distributions. Our findings highlight the potential of combining variational quantum compression with classical deep learning to enable efficient, scalable, and perceptually-aware image processing in quantum-enhanced computing environments.
Quantum algorithms have emerged as a transformative approach to address the computational challenges of high-dimensional image processing tasks. This research investigates the integration of quantum computing principles, such as Quantum Fourier Transform (QFT) and Quantum Principal Component Analysis (QPCA), to optimize processes like edge detection, noise reduction, and image segmentation. These quantum-enhanced techniques promise significant improvements in computational efficiency and accuracy compared to classical methods, especially when handling complex visual data in real-time applications like medical imaging, satellite imagery, and autonomous systems. Additionally, the study explores hybrid quantum-classical architectures to bridge current limitations in noisy intermediate-scale quantum (NISQ) devices, ensuring resource optimization and scalability. The potential of quantum algorithms to provide faster, more precise solutions is evaluated alongside challenges like error mitigation and algorithmic stability. This research highlights the future role of quantum computing in revolutionizing image processing, paving the way for breakthroughs in computer vision and artificial intelligence.
Abstract Color images (i.e. RGB) contain rich visual information essential for object recognition, spatial context analysis, and decision-making across fields such as medical imaging, remote sensing, and computer vision. Processing such data efficiently requires significant computational resources, which can be addressed by the parallelism and speed of quantum computing. Representing RGB image data within quantum states enables efficient and scalable processing compared to classical methods. In recent years, various quantum image representation techniques have been developed based on probabilistic and basis state encoding. Probabilistic encoding methods are efficient for representing quantum binary images but face challenges in accurately reconstructing RGB images. This is due to the randomness introduced by measurement. To overcome this limitation, several basis state encoding approaches have been proposed. These methods map classical pixel values directly to quantum basis states. Thus enabling accurate grayscale and RGB image representation. However, they often require a larger number of qubits and complex gate operations, leading to higher circuit preparation costs. So, there exists substantial potential for quantum probabilistic RGB image representation using randomized measurements. Hence, our objective is to develop a probabilistic quantum image representation, capable of representing RGB images using fewer qubits. This method aims to reconstruct the classical image with high accuracy using randomized measurements, thereby addressing the major limitations of probabilistic methods. To balance image quality with resource efficiency, we propose an Improved Probabilistic Quantum Image Representation (IPQIR) method based on equal superposition states. This approach utilizes a quantum circuit with Hadamard Gate to encode classical pixel values into equal superposition states. The original image is then reconstructed by performing multiple quantum measurements and applying expectation value estimation to average the outcomes. To align with existing research in quantum image representation, quantum state tomography and different applications are utilized as standard evaluation methods to assess the effectiveness of the proposed algorithm. The tomography achieved a fidelity of 97.51%. In addition, various parametric and non-parametric statistical tests were performed to verify the accuracy of the reconstructed classical image. The high Pearson (0.9983) and Spearman (0.9959) correlation coefficients indicate a nearly perfect linear and monotonic relationship between the original and reconstructed images.
Abstract Quantum image processing in qubit-based image representations for more than two dimensions seems to offer great opportunities for advanced data analysis and processing in quantum computers. Of fundamental importance is cycle shifting an image along an arbitrary direction, as various operations are based on it. In this work, a widely used image representation scheme is generalized into a single, multidimensional encoding. Within this framework, we define a cycle shifting method capable of translating a representation along any linear combination of its dimensional axes. The algorithmic procedure is appropriately redefined to accommodate arbitrary shifts in the Hilbert space. The corresponding computational complexity is optimized, achieving an exponential reduction in quantum resource requirements with respect to the shift-step magnitude. A comparative complexity analysis substantiates the efficiency gain, while simulation results validate the proposed multidimensional framework for two- and three-dimensional representations.
Techniques for exploiting visual information play an important and topical role. Image processing is an area of Artificial Intelligence, dealing with how to represent, reconstruct, classify, recognition and analysis of images using computers. The idea behind this study is to follow how the quantum properties of superposition and entanglement are used by the Bit-plane Representation of Quantum Images BRQI model, grayscale image, to map and store the image as qubits. For this, we used the IBM Quantum Experience platform that provides the opportunity to implement and run programs with quantum applications.
This paper explores the application of quantum quantumization for image processing, aiming to improve image compression ratios and quality. The core concept involves transforming images into quantum quantumized information, leveraging the unique properties of quantum computing to perform image processing operations. This approach facilitates both image compression and enhancement. We propose a novel framework utilizing quantum techniques to represent and manipulate image data, offering potential advantages over classical methods, particularly for high-resolution images and complex scenes. The theoretical underpinnings of this work are detailed, focusing on the mathematical formulations involved in the quantum encoding, processing, and decoding stages. We demonstrate the feasibility of this approach and suggest future research directions.