A method to analyze the similarity between two quantum images of the same size is proposed based on a representation for the quantum images. The similarity value is estimated according to the probability distribution of the results from quantum measurements. The proposed method is fast because a single operation can transform the entire information encoded in two images simultaneously. Two simulation-based experiments, which provide a reasonable estimation to the quantum images' similarity, are implemented using Matlab on a classical computer by means of linear algebra with complex vectors as quantum states and unitary matrices as unitary transformations. It also opens the door towards image searching from a database on quantum computers.
A method to analyze the similarity between two quantum images of the same size is proposed based on a representation for the quantum images. The similarity value is estimated according to the probability distribution of the results from quantum measurements. The proposed method is fast because a single operation can transform the entire information encoded in two images simultaneously. Two simulation-based experiments, which provide a reasonable estimation to the quantum images' similarity, are implemented using Matlab on a classical computer by means of linear algebra with complex vectors as quantum states and unitary matrices as unitary transformations. It also opens the door towards image searching from a database on quantum computers.
A method to compare multiple pairs of quantum images in parallel is proposed, where the similarities of the images are estimated according to the probability distributions of the readouts from quantum measurements. The proposed method by means of a single Hadamard gate with control-conditions to transform the entire information encoding the quantum images in a strip, offers a significant speed-up in comparison to performing the same task on traditional computing devices. Three simulation experiments comprising of the comparison of two images, multiple pairs of images, and the sub-blocks from two images are implemented using MATLAB to demonstrate the feasibility and efficiency of the parallel comparison. The proposal advances a fundamental step towards image searching on quantum computers in which the image with the highest similarity to a particular reference image is retrieved as a search result from a database.
A quantum image searching method is proposed based on the probability distributions of the readouts from the quantum measurements. It is achieved by using low computational resources which are only a single Hadamard gate combined with m + 1 quantum measurement operations. To validate the proposed method, a simulation experiment is used where the image with the highest similarity value of 0.93 to the particular test image is retrieved as the search result from 4 × 4 binary image database. The proposal provides a basic step for designing a search engine on quantum computing devices where the image in the database is retrieved based on its similarity to the test image.
Quantum computation is a promising and rapidly growing field that has witnessed a series of significant breakthroughs in the last several decades.While some practitioners envision the realization of complete quantum computing devices, the research presented in the thesis focusses on the works that we can do with quantum computing hardware when they are realized.One of such areas is that of quantum image processing.A Flexible Representation of Quantum Images (FRQI) allows us to dedicate n-qubits and 1-qubit to capturing the information about the position and color of every pixel in the image, respectively.A method to compare multiple pairs of quantum images in parallel is proposed, where the similarities of the images are estimated according to the probability distributions of the readouts from quantum measurements.It offers a significant speed-up in comparison to performing the same task on traditional computing devices by means of a single Hadamard gate with control-conditions to transform the entire information encoding the quantum images in a strip.The simulation experiments comprising of the comparison of two images, multiple pairs of images, and the sub-blocks from two images are implemented to demonstrate the feasibility and efficiency of the parallel comparison.On the basis of such a comparison strategy, a quantum image searching method is presented where the image in a 4 × 4 binary image database with the highest similarity value to the particular test image is retrieved as the search result using low computational resources.To process the RGB-like quantum image, the representation for Multi-Channel Quantum Images (MCQI) is given, and a double-key, double-domain watermarking strategy for i
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.
Quantum image processing is a new and exciting subdiscipline of quantum computation that aims to extend classical image processing applications on a quantum computer.The research starts with a proposal of a representation of images on a quantum computer, named Multi-Channel Representation for Quantum Images (MCQI).This representation encodes the positions and their corresponding colors in the images as a normalized quantum state.For an n by n sized image, 2n qubits and 3 qubits are used to carry the position and color respectively.The preparation procedure of a quantum image is discussed by the multi-channel polynomial preparation, which turns the initial quantum states to the MC-QI quantum states.The image retrieval procedure by quantum measurement is proposed which converts the quantum states to classical images.Furthermore, based on MCQI, some categories of possible processing transformations are suggested.By considering the structure of MCQI representation, the Channel of Interest (CoI), the Channel Swapping (CS), the Color Space Transformation (CST), and Alpha Blending (αB) quantum image processing operators are discussed using unitary transformations with low complexity.All the 4 operators are used to process the information about color in the images.Their complexity are analyzed in terms of the number of basic quantum gates which are needed to build the transformations, and they can be built by 9, 3, 287, 28 basic quantum gates, respectively.Some strategies for designing new transformations from known ones are proposed as well.These strategies can be used to design further algorithms for image processing.Based on the MCQI representation and the four image processing operators, a quantum measurement based double-key double-domain watermarking strategy for multichannel quantum images (MC-WaQI) is developed.In these application, a revised of the original MCQI representation and some restricted versions of the transformations are considered.The research provides the foundation to design other quantum image processing algorithms and can be extend to the following areas:• MCQI representation can be used to build quantum image database,• new frequency operations on quantum images based on quantum Fourier quantum discrete cosine, and quantum wavelet transformations,• building the special effect on color quantum movie,• image data transmission by quantum communication.
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.