Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Compare the Similarity between Two Quantum Images

Y. Liu, Zai-dong Qi, Qiang Liu

Published Dec 28, 2021• 0 citations
Publisher

Abstract

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.

DOI
10.21203/rs.3.rs-1187866/v1

Related papers

Comparison of the similarity between two quantum images

Y. Liu, Zai-dong Qi, Qiang Liu

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.

Scientific Reports•May 11, 2022•7 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.

Entropy•Dec 13, 2022•3 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, 2024•0 citations

A New Trend of Quantum Image Representations

Jie Su, Xuchao Guo, Chengqi Liu +1 more

Quantum image processing will be an important issue in the age of quantum computers. Quantum image processing generally includes quantum image representations, quantum image processing algorithms, and quantum image measurement. Among them, quantum image representation is a very important part of quantum image processing. Therefore, it is of great significance for quantum image processing to study the representation of quantum images. First, we elaborate on the main quantum image representations and analyze, compare and summarize them. This paper focuses on the definition of these quantum image representations the preparation of quantum images and the number of quantum bits required as well as the computational complexity. Then, this paper analyzes, compares and summarizes the similarities and differences between these quantum image representations. Finally, the challenges and future development in the field of quantum image processing are summarized and forecasted. This work will help researchers to understand the advances related to quantum image representations in the field of quantum image processing and is therefore of some reference value.

IEEE Access•Jan 1, 2020•71 citations

Improved dual-threshold quantum image segmentation algorithm and simulation*

Yumin Dong, Rui Yan, Dingkang Mou +1 more

Abstract Quantum image segmentation algorithm is crucial for quantum image processing. In this paper, a dual-threshold quantum image segmentation algorithm is designed and simulated in IBM Quantum Experience (IBM Q) platform, which can segment a complex image into three parts using fewer quantum bits. In our algorithm, given a high threshold and a low threshold, grayscale values larger than the high threshold are set to the high threshold and grayscale values smaller than the low threshold are set to the low threshold, with no change for the part between the two thresholds. Then we use a low-cost quantum comparator and design a complete and scalable quantum image segmentation circuit. Analysis of the circuit cost shows that the quantum gates required for the circuit are only related to the grayscale range q and are independent of the image size. The feasibility of the algorithm and the correctness of the quantum circuit are verified by simulation in IBM Q platform, and finally the MSE, PSNR AND SSIM value of the image is analyzed to prove the effectiveness of the segmentation algorithm.

Physica Scripta•May 24, 2024•0 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 Technologies•May 28, 2024•3 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 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.
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.
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.
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.
Quantum image processing will be an important issue in the age of quantum computers. Quantum image processing generally includes quantum image representations, quantum image processing algorithms, and quantum image measurement. Among them, quantum image representation is a very important part of quantum image processing. Therefore, it is of great significance for quantum image processing to study the representation of quantum images. First, we elaborate on the main quantum image representations and analyze, compare and summarize them. This paper focuses on the definition of these quantum image representations the preparation of quantum images and the number of quantum bits required as well as the computational complexity. Then, this paper analyzes, compares and summarizes the similarities and differences between these quantum image representations. Finally, the challenges and future development in the field of quantum image processing are summarized and forecasted. This work will help researchers to understand the advances related to quantum image representations in the field of quantum image processing and is therefore of some reference value.
Abstract Quantum image segmentation algorithm is crucial for quantum image processing. In this paper, a dual-threshold quantum image segmentation algorithm is designed and simulated in IBM Quantum Experience (IBM Q) platform, which can segment a complex image into three parts using fewer quantum bits. In our algorithm, given a high threshold and a low threshold, grayscale values larger than the high threshold are set to the high threshold and grayscale values smaller than the low threshold are set to the low threshold, with no change for the part between the two thresholds. Then we use a low-cost quantum comparator and design a complete and scalable quantum image segmentation circuit. Analysis of the circuit cost shows that the quantum gates required for the circuit are only related to the grayscale range q and are independent of the image size. The feasibility of the algorithm and the correctness of the quantum circuit are verified by simulation in IBM Q platform, and finally the MSE, PSNR AND SSIM value of the image is analyzed to prove the effectiveness of the segmentation algorithm.
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.