A novel method is proposed in this paper to store and retrieve images in entangled quantum systems, i.e., we employ a 2-qubit (or 3-qubit) entangled quantum state to represent the colors of 3 pixels (or 5 pixels) of color or gray images, and design quantum circuits to store images in entangled quantum systems, in addition, illustrate how to retrieve images stored in entangled quantum systems and analyze that the number of measurement is needed at most to retrieve a correct entangled quantum state. Simulation results on the Lena image shows compression ratio is 5.7 when PSNR is 32.8DB by Fourier transform while compression ratio of 2-qubit entangled coding (i.e., 2-qubit entangled quantum states represent image colors) is 12 without losing any information of the image. Due to take advantage of the superposition and entanglement properties of quantum states, our method improves the ability of image compression.
A novel method is proposed in this paper to store and retrieve images in entangled quantum systems, i.e., we employ a 2-qubit (or 3-qubit) entangled quantum state to represent the colors of 3 pixels (or 5 pixels) of color or gray images, and design quantum circuits to store images in entangled quantum systems, in addition, illustrate how to retrieve images stored in entangled quantum systems and analyze that the number of measurement is needed at most to retrieve a correct entangled quantum state. Simulation results on the Lena image shows compression ratio is 5.7 when PSNR is 32.8DB by Fourier transform while compression ratio of 2-qubit entangled coding (i.e., 2-qubit entangled quantum states represent image colors) is 12 without losing any information of the image. Due to take advantage of the superposition and entanglement properties of quantum states, our method improves the ability of image compression.
Quantum image processing represents an emerging image processing technology by taking advantage of quantum computation. Quantum image processing faces the first question: How is an image stored in and retrieved from a quantum system? To solve the issue, the authors provide six quantum image representations, which can be divided into three categories. The first, second, and third categories store color information using amplitudes, phases, and basis states, respectively. Next, they design their circuits to implement the storage of quantum image. Then, retrieval methods are introduced. The storage and retrieval technologies of quantum image are the basis and premise condition to process quantum images.
Quantum image computing has attracted attention due to its vast storage and faster processing of image data than classical computers. Although classical computing power has grown substantially in the last decade, its abilities have plateaued, struggling to meet the needs of huge datasets. Quantum computers, on the other hand, take advantage of unique qualities like quantum parallelism, superposition, and entanglement to provide faster solutions to complicated problems. Managing huge image data in classical systems necessitates significant memory and hardware resources, which makes quantum computing a possible alternative. Several approaches have arisen for encoding and compressing classical images in the quantum processor. However, one of the most significant limitations is the complexity of quantum state preparation, which translates pixel coordinates to corresponding quantum circuits. Current approaches for representing large-scale images require a huge number of quantum resources including qubit, and qubit connection, which presents significant hurdles. Therefore, this article aims to overview the pixel intensity and state preparation circuit that needs fewer connections, i.e., quantum gates to represent quantum image data, and then explore and design effective compression and processing methods for medium and high-resolution images. This work specializes in emerging quantum models’ potential for enhancing image representation and compression capabilities. It also conducts a comprehensive study of quantum image representation and compression techniques, categorizing existing methods by grayscale and color image types and evaluating their methods, strengths, and limitations. It focuses on crucial difficulties, such as high qubit requirements and complex state preparation, that limit scalability for huge images. This paper also assesses each model’s compression efficacy, which will help future research focus on efficient circuit designs with lower complexity for medium to high-resolution images. It is an essential reference for advancing quantum image processing research since it provides a systematic framework for evaluating quantum image compression and representation algorithms.
Quantum Image Processing (QIP)is an exciting new field showing a lot of promise as a powerful addition to the arsenal of Image Processing techniques. Representing image pixel by pixel using classical information requires an enormous amount of computational resources. Hence, exploring methods to represent images in a different paradigm of information is important. In this work, we study the representation of images in Quantum Information. The main motivation for this pursuit is the ability of storing N bits of classical information in only log(2N) quantum bits (qubits). The promising first step was the exponentially efficient implementation of the Fourier transform in quantum computers as compared to Fast Fourier Transform in classical computers. In addition, images encoded in quantum information could obey unique quantum properties like superposition or entanglement.
RGB multi channel representation is proposed for images on quantum computers (MCQI) that captures information about colors (RGB channels) and their corresponding positions in an image in a normalized quantum state. The proposed representation makes it possible to store the RGB information about an image simultaneously by using 2n+3 qubits for encoding 2n× 2npixel images, whereas pixel-wise processing is necessary in many other quantum image representations, e.g., qubit lattice, grid qubit, and quantum lattice. Simulation of storage and retrieval of MCQI images using human facial images demonstrated that 15 qubits are required for encoding 64 × 64 colored images, and encoded information is retrieved by measurement. Perspectives of designing quantum image operators are also discussed based onMCQI representation, e.g., channel of interest, channel swapping, and restrict version of color transformation.
In recent years, quantum image computing has gained significant attention due to its ability to provide more data storage and process faster than classical computation. These are possible due to the unique properties of quantum mechanism of parallelism, superposition, and entanglement. Compressing and representing classical image data in the quantum domain, as well as state label preparation complexity, is still a challenging issue. The existing techniques typically directly connect the pixel values and their corresponding state label connection without exploring quantum bits i.e. qubits and connection pattern correlation. As a result, the required number of quantum resources, such as gates and qubits to implement quantum circuits, is quite high. This thesis proposes several novel approaches by exploiting correlations within qubits/connections in the state preparation within pixel domain and transform domain. The existing quantum methods need qubits, and quantum gates to represent both pixel intensity and their corresponding position i.e. state preparation information. To reduce the number of qubits and gates required for state preparation, transformation and quantization are applied to the image data. This is because the transformed coefficients are concentrated in a smaller region compared to the pixel domain, allowing the number of state-preparation qubits to be significantly lower. Theoretical analysis and experimental results show that it provides better compression and representation than existing approaches. To represent the quantized transformed coefficient using the existing quantum representing approach, two control gates are needed, one for opening and another for closing the connection to locate each quantized transformed state value. Due to the repetitive use of the same control gates to locate each quantized state connection, a significant number of quantum resources are still required. Furthermore, resetting the output effect of each quantized transformed coefficient state connection on the qubit introduces redundancy in control gate usage and increases circuit complexity. To address state complexity challenges of the quantized transform coefficient approach, a novel reset gate is introduced that can perform the same task for closing the connection of state position. It modifies the closing state connection that nullifies the previous quantized transformed coefficient state connection effect on the next one, eliminating the need for repetitive use of control gates. Although using the reset gate instead of control gate, the proposed approach improves the compression performance, still, this approach requires higher quantum resources to locate the state position of the quantized transformed coefficient alongside. To address this, a novel control gate state connection approach is proposed. It modifies the quantized transformed coefficient connections by discarding ‘0’ values in the state preparation stage, since only input ‘1’ influences the output. This approach significantly reduces the circuit complexity. The experimental results confirm its superior performance in quantum image compression and representation. The required number of qubits for representing large magnitude of coefficient is sometimes higher for high quality images. To address this, a non-zero state connection of pixel values circuit is proposed on top of the block truncation coding compression approach. This approach is easy to implement, cost-effective, and memory-efficient and requires fewer qubits compared to the transformed-based approach. However, this approach requires more connections to complete the whole image circuit. Recently, an autoencoder-based approach has been used to compress quantum images. The main limitation of the autoencoder approach is that it is only applicable to small-scale images with unclear state compression mechanisms. To overcome this limitation, a parameterized position-aware lossy quantum autoencoder is proposed by utilizing the least significant bit (LSB) as a control qubit for optimized state-label information management. We have used a block-based position-aware LSB control qubit approach to improve further compression efficiency. Comparative analysis shows that it outperforms the existing quantum autoencoder approach in terms of gate efficiency as well as image quality.
Quantum image processing is an emerging topic in the field of quantum information and technology. In this paper, we propose a new quantum image representation of RGB images with deterministic image retrieval, which is an improvement over all the similar existing representations in terms of using minimum resource. We use two entangled quantum registers constituting of total 7 qutrits to encode the color channels and their intensities. Additionally, we generalize the existing encoding methods by using both qubits and qutrits to encode the pixel positions of a rectangular image. This hybrid-qudit approach aligns well with the current progress of NISQ devices in incorporating higher dimensional quantum systems than qubits. We then describe the image encoding method using higher-order qubit-qutrit gates, and demonstrate the decomposition of these gates in terms of simpler elementary gates. We use the Google Cirq's quantum simulator to verify the image preparation in both the ideal noise-free scenario and in presence of realistic noise modelling. We show that the complexity of the image encoding process is linear in the number of pixels. Lastly, we discuss the image compression and some basic RGB image processing protocols using our representation.