Quantum image representation is an essential component of quantum image processing and plays a critical role in quantum information processing. Flexible Representation of Quantum Images (FRQI) presents pixel colors and associated locations as a state to represent images on quantum computers. A fundamental part of the quantum image processing system is quantum image compression (QIC), which is utilized to maintain and retrieve binary images. This compression allows us to minimize the number of controlled rotation gates in the quantum circuits. This paper designed optimized quantum circuits and simulated them using Qiskit on a real quantum computer based on minimum boolean expressions to retrieve the 8×4 binary single-digit images. To demonstrate the feasibility and efficacy of quantum image representation, quantum circuits for images were developed using FRQI, and quantum image representation experiments were done on IBM Quantum Experience (IBMQ). We were able to visualize quantum information by doing the quantum measurement on the image information that we had prepared. Without utilizing this method, the number of controlled rotation gates is equal to the number of pixels in the image; however, we showed that by using the QIC algorithm, we could decrease the number of gates significantly. On these images, the maximum and minimum compression ratios of QIC are 90.63% and 68.75%, respectively.
Quantum image representation is an essential component of quantum image processing and plays a critical role in quantum information processing. Flexible Representation of Quantum Images (FRQI) presents pixel colors and associated locations as a state to represent images on quantum computers. A fundamental part of the quantum image processing system is quantum image compression (QIC), which is utilized to maintain and retrieve binary images. This compression allows us to minimize the number of controlled rotation gates in the quantum circuits. This paper designed optimized quantum circuits and simulated them using Qiskit on a real quantum computer based on minimum boolean expressions to retrieve the 8×4 binary single-digit images. To demonstrate the feasibility and efficacy of quantum image representation, quantum circuits for images were developed using FRQI, and quantum image representation experiments were done on IBM Quantum Experience (IBMQ). We were able to visualize quantum information by doing the quantum measurement on the image information that we had prepared. Without utilizing this method, the number of controlled rotation gates is equal to the number of pixels in the image; however, we showed that by using the QIC algorithm, we could decrease the number of gates significantly. On these images, the maximum and minimum compression ratios of QIC are 90.63% and 68.75%, respectively.
Flexible Representation of Quantum Images (FRQI) is proposed to provide a representation of images that enables efficient preparation and image processing operators on quantum computers. FRQI captures colors and their corresponding positions in an image into a quantum state. The preparation with polynomial simple operations for FRQI turning a quantum computer from the initialized state to the FRQI state is done by using Hadamard and controlled rotation gates. The Quantum Image Compression (QIC) algorithm reduces simple operations used in the preparation process based on the minimization of Boolean equations are from same color groups of positions. Quantum image processing operators on FRQI based unitary transforms dealing with only colors, colors at some positions and the combination by the quantum Fourier transform of both colors and positions are addressed. The experiments for the storage and retrieval of images using FRQI are implemented in Matlab. The compression ratio of QIC among same color groups ranges from 6.67% to 31.62% on the Lena image.
Quantum image processing represents a transformative approach to visual data analysis, leveraging the principles of quantum computing to overcome classical limitations. This work explores two prominent quantum image encoding methods: FRQI (Flexible Representation of Quantum Images) and NEQR (Novel Enhanced Quantum Representation). FRQI excels in qubit efficiency, making it suitable for hardware implementation, while NEQR offers superior precision in pixel intensity representation, ideal for complex image processing tasks. We detail the implementation of these algorithms, including preprocessing, quantum circuit design, and simulation, using platforms like Qiskit. The study highlights the potential of quantum image processing in fields such as medicine, industry, and environmental monitoring, while addressing challenges like qubit limitations and noise sensitivity. This research contributes to advancing quantum computing applications, paving the way for innovative and sustainable technological solutions.
Abstract In image processing, the amount of data to be processed grows rapidly, in particular when dealing with images of more than two dimensions or time series of images. Thus, efficient processing is a challenge, as data sizes may push even supercomputers to their limits. Quantum image processing promises to encode images with logarithmically less qubits than classical pixels in the image. In theory, this is a huge progress, but so far not many experiments have been conducted in practice, in particular on real backends. Often, the precise conversion of classical data to quantum states, the exact implementation, and the interpretation of the measurements in the classical context are challenging. We investigate these practical questions in this paper. In particular, we study the feasibility of the flexible representation of quantum images (FRQI). Furthermore, we check experimentally the limit in the current noisy intermediate-scale quantum era, i.e., up to which image size an image can be encoded, both on simulators and on real backends. Finally, we propose a method for simplifying the circuits needed for the FRQI. With our alteration, the number of gates can be reduced, especially the one of the error-prone controlled-NOT gates. As a consequence, the size of manageable images increases.
We introduce a novel and uniform framework for quantum pixel representations that overarches many of the most popular representations proposed in the recent literature, such as (I)FRQI, (I)NEQR, MCRQI, and (I)NCQI. The proposed QPIXL framework results in more efficient circuit implementations and significantly reduces the gate complexity for all considered quantum pixel representations. Our method scales linearly in the number of pixels and does not use ancilla qubits. Furthermore, the circuits only consist of [Formula: see text] gates and [Formula: see text] gates making them practical in the NISQ era. Additionally, we propose a circuit and image compression algorithm that is shown to be highly effective, being able to reduce the necessary gates to prepare an FRQI state for example scientific images by up to 90% without sacrificing image quality. Our algorithms are made publicly available as part of QPIXL++, a Quantum Image Pixel Library.
Quantum image computing has attracted attention due to its vast storage capacity and faster image data processing, leveraging unique properties such as parallelism, superposition, and entanglement, surpassing classical computers. Although classical computing power has grown substantially over the last decade, its rate of improvement has slowed, struggling to meet the demands of massive datasets. Several approaches have emerged for encoding and compressing classical images on quantum processors. However, a significant limitation is the complexity of preparing the quantum state, which translates pixel coordinates into corresponding quantum circuits. Current approaches for representing large-scale images require higher quantum resources, such as qubits and connection gates, presenting significant hurdles. This article aims to overview the pixel intensity and state preparation circuits requiring fewer quantum resources and explore effective compression techniques for medium and high-resolution images. It also conducts a comprehensive study of quantum image representation and compression techniques, categorizing methods by grayscale and color image types and evaluating their strengths and weaknesses. Moreover, the efficacy of each model’s compression can guide future research toward efficient circuit designs for medium- to high-resolution images. Furthermore, it is a valuable reference for advancing quantum image processing research by providing a systematic framework for evaluating quantum image compression and representation algorithms.
From the quantum images and their preparation methods described in Chapter 2, it can be seen that preparing a quantum image requires a large number of basic quantum gates. For example, to prepare a quantum color image Quantum Image Representation based on HSI (QIRHSI) with a size of https://www.w3.org/1998/Math/MathML" display="inline"> 2 8 × 2 8 pixels and an intensity value range of https://www.w3.org/1998/Math/MathML" display="inline"> 0 ∼ 2 8 − 1 , approximately the number of basic quantum gates required is 2 64 . Therefore, in this chapter, the resources for image preparation will be optimized. The principle of Boolean expression minimization will be used to simplify the quantum circuit in the quantum image QIRHSI. In essence, it is to replace the original preparation of the quantum image with a new unitary transformation that has fewer quantum logic gates.