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

arXiv:1409.2918

Quantum Edge Detection for Image Segmentation in Optical Environments

Mario Mastriani

Published Sep 9, 2014• 13 citations
arXivHTMLPDF

Abstract

A quantum edge detector for image segmentation in optical environments is presented in this work. A Boolean version of the same detector is presented too. The quantum version of the new edge detector works with computational basis states, exclusively. This way, we can easily avoid the problem of quantum measurement retrieving the result of applying the new detector on the image. Besides, a new criterion and logic based on projections onto vertical axis of Bloch's Sphere exclusively are presented too. This approach will allow us: 1) a simpler development of logic quantum operations, where they will closer to those used in the classical logic operations, 2) building simple and robust classical-to-quantum and quantum-to-classical interfaces. Said so far is extended to quantum algorithms outside image processing too. In a special section on metric and simulations, a new metric based on the comparison between the classical and quantum versions algorithms for edge detection of images is presented. Notable differences between the results of classical and quantum versions of such algorithms (outside and inside of quantum computer, respectively) show the existence of implementation problems involved in the experiment, and that they have not been properly modeled for optical environments. However, although they are different, the quantum results are equally valid. The latter is clearly seen in the computer simulations

DOI
10.48550/arxiv.1409.2918

Related papers

A Quantum-Classical Hybrid Method for Image Classification and Segmentation

Sayantan Pramanik, M Girish Chandra, C V Sridhar +8 more

Enormous activity in the Quantum Computing area has resulted in it being considered, together with classical computers, for solving different difficult problems - including those of applied nature. An attempt is made in this work to assemble a pipeline consisting of both quantum and classical processing blocks for the task of image classification and segmentation, keeping in mind the present limitations of the gate-model quantum computers. It is based on the work done for the recent BMW Quantum Computing Challenge related to Automotive Industry. The pipeline handles the real-life sized images as the input and output, rather than the toy-sized examples prevalent in Quantum Computing literature. Apart from breaking down the problem to modules, some of which can be accommodated in the existing simulators and hardware, simplifications of the relevant quantum algorithms are also carried out. Its functionality and utility are brought out by applying it to surface crack segmentation on the popular Kaggle Surface Crack Detection data set. The results of the paper are not only limited to simulations, but also involve running models on Noisy, Intermediate-Scale Quantum processors through AWS. In its entirety, this work may lay the groundwork for quantum/quantum-enhanced image segmentation, and providing interested researchers with a stepping-stone in that direction, as the results demonstrate the efficacy of the proposed method, even with simple versions of the quantum modules.

arXiv:2109.14431•IEEE/ACM Symposium on Edge Computing (SEC)•Dec 1, 2022•26 citations

Quantum fuzzy logic for edge detection: A demonstration on NISQ hardware

G. Nunziata, Serena Crisci, G. De Gregorio +4 more

Quantum computing offers the potential to enhance computational efficiency beyond classical methods, but practical implementation remains challenging due to the limitations of Noisy Intermediate-Scale Quantum (NISQ) hardware, namely, restricted qubit counts, limited connectivity, and the presence of noise and decoherence. This study presents a novel approach to edge detection by leveraging a recently developed Quantum Fuzzy Inference Engine, implemented on a NISQ device. We introduce an optimized quantum circuit for its implementation, reducing qubit requirements and gate depth to improve execution on NISQ hardware. To overcome constraints related to large-scale image processing, a hybrid quantum–classical lookup table approach is employed. Edge detection performance is evaluated on the Berkeley Segmentation Data Set and Benchmarks 500 dataset under different conditions, including classical execution, ideal quantum simulation, noisy quantum simulation, and NISQ hardware calculation. Results demonstrate that the quantum fuzzy logic-based edge detection achieves outcomes comparable to classical methods by using fewer operations, marking a step toward practical quantum-enhanced image processing.

Applied Soft Computing•Sep 10, 2025•5 citations

In-depth Study of Quantum Hadamard Gate EdgeDetection: Complexity Analysis, Experiments,and Future Directions

Ridho Nur Rohman Wijaya, Budi Setiyono, Dwi Ratna Sulistyaningrum

Quantum computing is a rapidly developing field with faster computational capabilities than classical computing.The popularity of quantum computing has reached the field of image processing, particularly with a breakthrough method known as Quantum Hadamard Edge Detection.This approach represents a significant advancement in edge detection techniques using quantum computing.Quantum Hadamard Edge Detection is a method that can detect image edges more quickly than classical methods with exponential acceleration.This paper explains the Quantum Hadamard Edge Detection method in detail, including how it is implemented, a time complexity explanation, some experiments, and future research directions.Our experiments utilize a quantum computer simulator and employ four measurement metrics: Structural Similarity Index, Figure of Merit, Entropy, and a Proposed Metric with radius-based features, to detect simple binary images, MNIST images, and the Berkeley Segmentation datasets.We recognize the potential of quantum computing and believe that image processing with quantum representation will make processing more efficient and significantly valuable in the future.

International Journal of Image Graphics and Signal Processing•Oct 1, 2025•0 citations

A Quantum Edge Detection Algorithm

Giacomo Cavalieri, Dario Maio

The application of quantum computing to the field of image processing has produced several promising applications: quantum image representation techniques have been developed showing how, by taking advantage of quantum properties like entanglement and superposition, many image processing algorithms could have an exponential speed-up in comparison to their "classical" counterparts. In this paper, after briefly discussing some of the main quantum image representation methods, we propose an improved version of a quantum edge detection algorithm.

arXiv:2012.11036•Dec 20, 2020•15 citations

Optimal Estimation of States in Quantum Image Processing

Mario Mastriani

An optimal estimator of quantum states based on a modified Kalman Filter is presented in this work. Such estimator acts after state measurement, allowing to obtain an optimal estimation of quantum state resulting in the output of any quantum image algorithm. Besides, a new criteria, logic, and arithmetic based on projections onto vertical axis of Bloch Sphere exclusively are presented too. This approach will allow us: 1) a simpler development of logic and arithmetic quantum operations, where they will closer to those used in the classical digital image processing algorithms, 2) building simple and robust classical-to-quantum and quantum-to-classical interfaces. Said so far is extended to quantum algorithms outside image processing too. In a special section on metrics and simulations, three new metrics based on the comparison between the classical and quantum versions algorithms for filtering and edge detection of images are presented. Notable differences between the results of classical and quantum versions of such algorithms (outside and inside of quantum computer, respectively) show the need for modeling state and measurement noise inside estimation scheme.

arXiv:1406.5121•Jun 19, 2014•11 citations

A quantum edge detection algorithm for quantum multi-wavelength images

Engin Şahin, İhsan Yılmaz

Quantum edge detection is one of the important part of quantum image processing. In this paper, a quantum edge detection algorithm is designed for the quantum representation of multi-wavelength image (QRMW) model. The algorithm includes all stages of filtering, enhancement and detection. The proposed algorithm is also designed to apply any filtering operation to QRMW images, not only for a particular filtering operation. The proposed algorithm aims to solve the problems that quantum edge detection algorithms in the literature have processing only for a particular operator and noise reduction. Moreover, the algorithm aims to perform operations more efficiently by using less resources. Low-pass filter (LPF) smoothing operators are applied in the filtering stage for the noise reduction problem. In order to apply all filtering operations to the image, arithmetic operators that can operate with all signed integers are used in the algorithm. The operators Sobel, Prewitt and Scharr in the enhancement stage and the gradient method in the detection stage are used for both verification of the proposed algorithm and comparisons with the existing algorithms. A method with quantitative outcomes is shown to evaluate the performance of the edge detection algorithms. Analysis of the simulations performed on sample images with different operators. The circuit complexity of the algorithm is presented and the comparisons are made with the existing studies. The superiority of the proposed algorithm and its flexibility to be used in other studies are clearly demonstrated by analysis.

International Journal of Quantum Information•Apr 1, 2021•4 citations
A quantum edge detector for image segmentation in optical environments is presented in this work. A Boolean version of the same detector is presented too. The quantum version of the new edge detector works with computational basis states, exclusively. This way, we can easily avoid the problem of quantum measurement retrieving the result of applying the new detector on the image. Besides, a new criterion and logic based on projections onto vertical axis of Bloch's Sphere exclusively are presented too. This approach will allow us: 1) a simpler development of logic quantum operations, where they will closer to those used in the classical logic operations, 2) building simple and robust classical-to-quantum and quantum-to-classical interfaces. Said so far is extended to quantum algorithms outside image processing too. In a special section on metric and simulations, a new metric based on the comparison between the classical and quantum versions algorithms for edge detection of images is presented. Notable differences between the results of classical and quantum versions of such algorithms (outside and inside of quantum computer, respectively) show the existence of implementation problems involved in the experiment, and that they have not been properly modeled for optical environments. However, although they are different, the quantum results are equally valid. The latter is clearly seen in the computer simulations
Enormous activity in the Quantum Computing area has resulted in it being considered, together with classical computers, for solving different difficult problems - including those of applied nature. An attempt is made in this work to assemble a pipeline consisting of both quantum and classical processing blocks for the task of image classification and segmentation, keeping in mind the present limitations of the gate-model quantum computers. It is based on the work done for the recent BMW Quantum Computing Challenge related to Automotive Industry. The pipeline handles the real-life sized images as the input and output, rather than the toy-sized examples prevalent in Quantum Computing literature. Apart from breaking down the problem to modules, some of which can be accommodated in the existing simulators and hardware, simplifications of the relevant quantum algorithms are also carried out. Its functionality and utility are brought out by applying it to surface crack segmentation on the popular Kaggle Surface Crack Detection data set. The results of the paper are not only limited to simulations, but also involve running models on Noisy, Intermediate-Scale Quantum processors through AWS. In its entirety, this work may lay the groundwork for quantum/quantum-enhanced image segmentation, and providing interested researchers with a stepping-stone in that direction, as the results demonstrate the efficacy of the proposed method, even with simple versions of the quantum modules.
Quantum computing offers the potential to enhance computational efficiency beyond classical methods, but practical implementation remains challenging due to the limitations of Noisy Intermediate-Scale Quantum (NISQ) hardware, namely, restricted qubit counts, limited connectivity, and the presence of noise and decoherence. This study presents a novel approach to edge detection by leveraging a recently developed Quantum Fuzzy Inference Engine, implemented on a NISQ device. We introduce an optimized quantum circuit for its implementation, reducing qubit requirements and gate depth to improve execution on NISQ hardware. To overcome constraints related to large-scale image processing, a hybrid quantum–classical lookup table approach is employed. Edge detection performance is evaluated on the Berkeley Segmentation Data Set and Benchmarks 500 dataset under different conditions, including classical execution, ideal quantum simulation, noisy quantum simulation, and NISQ hardware calculation. Results demonstrate that the quantum fuzzy logic-based edge detection achieves outcomes comparable to classical methods by using fewer operations, marking a step toward practical quantum-enhanced image processing.
Quantum computing is a rapidly developing field with faster computational capabilities than classical computing.The popularity of quantum computing has reached the field of image processing, particularly with a breakthrough method known as Quantum Hadamard Edge Detection.This approach represents a significant advancement in edge detection techniques using quantum computing.Quantum Hadamard Edge Detection is a method that can detect image edges more quickly than classical methods with exponential acceleration.This paper explains the Quantum Hadamard Edge Detection method in detail, including how it is implemented, a time complexity explanation, some experiments, and future research directions.Our experiments utilize a quantum computer simulator and employ four measurement metrics: Structural Similarity Index, Figure of Merit, Entropy, and a Proposed Metric with radius-based features, to detect simple binary images, MNIST images, and the Berkeley Segmentation datasets.We recognize the potential of quantum computing and believe that image processing with quantum representation will make processing more efficient and significantly valuable in the future.
The application of quantum computing to the field of image processing has produced several promising applications: quantum image representation techniques have been developed showing how, by taking advantage of quantum properties like entanglement and superposition, many image processing algorithms could have an exponential speed-up in comparison to their "classical" counterparts. In this paper, after briefly discussing some of the main quantum image representation methods, we propose an improved version of a quantum edge detection algorithm.
An optimal estimator of quantum states based on a modified Kalman Filter is presented in this work. Such estimator acts after state measurement, allowing to obtain an optimal estimation of quantum state resulting in the output of any quantum image algorithm. Besides, a new criteria, logic, and arithmetic based on projections onto vertical axis of Bloch Sphere exclusively are presented too. This approach will allow us: 1) a simpler development of logic and arithmetic quantum operations, where they will closer to those used in the classical digital image processing algorithms, 2) building simple and robust classical-to-quantum and quantum-to-classical interfaces. Said so far is extended to quantum algorithms outside image processing too. In a special section on metrics and simulations, three new metrics based on the comparison between the classical and quantum versions algorithms for filtering and edge detection of images are presented. Notable differences between the results of classical and quantum versions of such algorithms (outside and inside of quantum computer, respectively) show the need for modeling state and measurement noise inside estimation scheme.
Quantum edge detection is one of the important part of quantum image processing. In this paper, a quantum edge detection algorithm is designed for the quantum representation of multi-wavelength image (QRMW) model. The algorithm includes all stages of filtering, enhancement and detection. The proposed algorithm is also designed to apply any filtering operation to QRMW images, not only for a particular filtering operation. The proposed algorithm aims to solve the problems that quantum edge detection algorithms in the literature have processing only for a particular operator and noise reduction. Moreover, the algorithm aims to perform operations more efficiently by using less resources. Low-pass filter (LPF) smoothing operators are applied in the filtering stage for the noise reduction problem. In order to apply all filtering operations to the image, arithmetic operators that can operate with all signed integers are used in the algorithm. The operators Sobel, Prewitt and Scharr in the enhancement stage and the gradient method in the detection stage are used for both verification of the proposed algorithm and comparisons with the existing algorithms. A method with quantitative outcomes is shown to evaluate the performance of the edge detection algorithms. Analysis of the simulations performed on sample images with different operators. The circuit complexity of the algorithm is presented and the comparisons are made with the existing studies. The superiority of the proposed algorithm and its flexibility to be used in other studies are clearly demonstrated by analysis.