Scientific Reports

Comparison of the similarity between two quantum images

Y. Liu, Zai-dong Qi, Qiang Liu

Published May 11, 2022• 7 citations

Abstract

Comparing the similarity between digital images is an important subroutine in various image processing algorithms. In this study, we present three quantum algorithms for comparing the similarity between two quantum images. These algorithms are applied to binary, grey and color images for the first time. Without considering the image preparation, the proposed algorithms achieve exponential acceleration than the existing quantum and classical methods in all three cases. At the end of this paper, an experiment based on the real quantum computer of IBMQ and simulations verify the effectiveness of the algorithms.

DOI: 10.1038/s41598-022-11863-9

Related papers

Compare the Similarity between Two Quantum Images

Y. Liu, Zai-dong Qi, Qiang Liu

Abstract Comparing the similarity between digital images is an important subroutine in various image processing algorithms. In this study, we present three quantum algorithms for comparing the similarity between two quantum images. These algorithms apply to binary, grey and color images respectively. Without considering the image preparation, the proposed algorithms achieve exponential acceleration than the existing quantum and classical methods in complexity. At the end of this paper, an experiment based on the real quantum computer of IBMQ and simulations verify the effectiveness of the algorithms.

Dec 28, 20210 citations

A Hybrid Quantum Image-Matching Algorithm

Guo-Qiang Shu, Zheng Shan, Shiqin Di +2 more

Image matching is an important research topic in computer vision and image processing. However, existing quantum algorithms mainly focus on accurate matching between template pixels, and are not robust to changes in image location and scale. In addition, the similarity calculation of the matching process is a fundamentally important issue. Therefore, this paper proposes a hybrid quantum algorithm, which uses the robustness of SIFT (scale-invariant feature transform) to extract image features, and combines the advantages of quantum exponential storage and parallel computing to represent data and calculate feature similarity. Finally, the quantum amplitude estimation is used to extract the measurement results and realize the quadratic acceleration of calculation. The experimental results show that the matching effect of this algorithm is better than the existing classical architecture. Our hybrid algorithm broadens the application scope and field of quantum computing in image processing.

EntropyDec 13, 20223 citations

A parallel comparison of multiple pairs of images on quantum computers

Fei Yan, Abdullah M. Iliyasu, Phuc Q. Le +3 more

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.

International Journal of Innovative Computing and ApplicationsJan 1, 201327 citations

Hybrid Algorithms for Image Processing Leveraging Quantum Computing for Enhanced Performance

J. Ramprabu, S Prabhavathy

The integration of quantum computing into image processing represents a significant advancement in computational technology, offering transformative capabilities that enhance performance, efficiency, and accuracy. This chapter explores hybrid quantum-classical algorithms, focusing on how quantum subroutines can be integrated into classical image processing workflows. A comparative analysis of various quantum image encoding techniques highlights their strengths and limitations, paving the way for optimized applications across diverse fields. Key advantages of quantum-enhanced image processing, such as improved speed in high-resolution data analysis and superior optimization methods, are discussed in relation to real-world applications, including medical imaging and computer vision. The chapter anticipates future developments in quantum technology, emphasizing the need for interdisciplinary collaboration to unlock the full potential of quantum computing in digital image applications. By addressing the critical gaps in current methodologies, this work aims to inspire further research and innovation in the realm of quantum-enhanced image processing.

Dec 7, 20240 citations

Evaluation of quantum image processing in CUDA-based simulation

Akira Hasegawa, Yoshihiro Maede, Norishige Fukushima

Quantum computers are expected to be the next-generation computers in various fields. Quantum computers are different from classical computers, which store the current binary information of 0 and 1. Quantum computers can use quantum superposition, which can hold 0 to 1 probability as continuous quantities in one qubit. Therefore, existing algorithms are not necessarily efficient computational algorithms on quantum computers. GPU-based quantum simulations, such as cuQuantum, have recently been released to develop quantum algorithms. This paper focuses on quantum image processing, presents how far quantum image processing can be efficiently described today and verifies on GPUs that multiple image processing can be described using cuQuantum.

SPIE Future Sensing TechnologiesMay 28, 20243 citations

Image Similarity Quantum Algorithm and Its Application in Image Retrieval Systems

Qingchuan Yang, Xianing Feng, L. F. Wei

The measurement of image similarity represents a fundamental task within the domain of image processing, enabling the application of sophisticated computational techniques to ascertain the degree of similarity between two images. To enhance the performance of these similarity measurement algorithms, the academic community has investigated a range of quantum algorithms. Notably, the swap test-based quantum inner product algorithm (ST-QIP) has emerged as a pivotal method for computing image similarity. However, the inherent destructive nature of the swap test necessitates multiple quantum state evolutions and measurements, which leads to consumption of quantum resources and prolonged computational time, ultimately constraining its practical applicability. To address these limitations, this study introduces an advanced quantum inner product algorithm based on amplitude estimation (AE-QIP) designed to compute image similarity. This innovative approach circumvents the repetitive measurement processes associated with the swap test, thereby optimizing the utilization of quantum resources and substantially enhancing the algorithm's performance. We conducted experiments using a quantum simulator to implement the AE-QIP algorithm and evaluate its effectiveness in the image retrieval tasks. It is found that the AE-QIP algorithm achieves comparable precision to the ST-QIP algorithm while exhibiting significant reductions in qubit consumption and average processing time. Additionally, our findings suggest that increasing the number of ancillary qubits can further enhance the accuracy of the AE-QIP algorithm. Overall, within the acceptable error thresholds, the AE-QIP algorithm exhibits enhanced efficiency relative to the ST-QIP algorithm. However, significant further research is needed to address the challenges involved in optimizing the performance of quantum retrieval systems as a whole.

EntropyJan 27, 20255 citations