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

International Conference on Computing, Intelligence, and Application (CIACON)

Quantum Walk-Based Sliding Window Image Edge Detection Framework

Dibyasree Guha, Nibaran Das

Published Jul 1, 2026• 0 citations
Publisher

Abstract

Identifying structural boundaries in an image has emerged as an important image processing and computer vision task rendering edge detection as a fundamental operation. Quantum parallelism and superposition have proven to make positive contributions in such tasks enabling quantum computing to be a foremost paradigm to be adapted for image edge detection purpose. In this work, we propose a generalized quantum-walkbased edge detection framework that operates on overlapping$N \times N$image blocks represented as grid graphs whose vertices correspond to pixel locations. Probability amplitudes associated with edge pixels identified through local gradient criteria, undergo amplification employing a discrete-time coined quantum walk. The dimension-independent formulation improves spatial continuity and reduces block boundary artifacts by probability aggregation producing a continuous edge probability map prior to thresholding. The method is robust to noise and has flexible post-processing capabilities. Comparative analysis with existing quantum walk edge detection methods demonstrates that the proposed framework offers enhanced spatial modeling, improved edge continuity, and greater theoretical generality while retaining the advantages of quantum-walk-based probability amplification. Evaluations of quantitative metrics such as Structural Similarity Index Measures and Pratt's Figure of Merit, further validate the effectiveness of the proposed method.

DOI
10.1109/ciacon70148.2026.11689270

Related papers

A Fully Quantum Algorithm for Image Edge Detection

Fred Sun

This work introduces a novel quantum algorithm for gradient-based edge detection that operates entirely within the quantum circuit model. Grayscale images are encoded using the Novel Enhanced Quantum Representation (NEQR), allowing exact arithmetic on pixel intensities. Directional gradients are computed by generating superpositions of neighboring pixels via cyclic shift operations and performing subtraction with an exact quantum arithmetic circuit. To refine accuracy, we introduce a direction-aware shifting mechanism that aligns edges with the darker side of intensity transitions. Our novel Quantum Partitioning Algorithm enables efficient in-place thresholding of edge candidates. This work exhibits polynomial-time improvements and optimizes the ancilla count compared to previous NEQR-based quantum edge detection algorithms. These results demonstrate a resource-efficient and fully quantum approach to edge detection, highlighting a practical quantum advantage in image processing.

quant-pharXiv:2604.23535•Apr 28, 2026•0 citations

Quantum Walk Algorithms for Graph Partitioning

Jincheng Zhang

Graph partitioning is a crucial problem in computer science with applications in diverse areas like VLSI design, image segmentation, and network analysis. Traditional classical algorithms often face significant challenges when dealing with large and complex graphs, leading to increased computational time and memory requirements. This paper explores the potential of quantum walk algorithms to address this issue. We propose a framework for leveraging quantum walk algorithms to efficiently explore the connectivity structure of a graph and identify optimal partitions. The core idea involves mapping the graph's nodes and edges onto a quantum system and utilizing the inherent parallelism of quantum walks to traverse the graph. We present a theoretical analysis of the algorithm's potential speedup compared to classical approaches, focusing on scenarios where quantum computation offers a significant advantage. Specifically, we formulate the graph partitioning problem as a search problem on a graph represented as a quantum walk, considering the Hamiltonian operator and its eigenstates for efficient traversal. The effectiveness of the algorithm is dependent on the graph's structure and the ability to accurately simulate the quantum walk. The presented methodology provides a novel approach to graph partitioning, potentially leading to substantial performance improvements for large, complex graphs.

•Sep 2, 2026•0 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 hybrid quantum walk model unifying discrete and continuous quantum walks

Tianen Chen, Yun Shang

Quantum walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with the Hamiltonian-driven time evolution of continuous walks. Through systematic analysis of probability distributions, standard deviations, and entanglement entropy on fundamental graph structures, we reveal distinctive dynamical characteristics that differentiate our model from conventional quantum walk paradigms. The proposed framework demonstrates unifying capabilities by naturally encompassing existing quantum walk models as special cases. Two significant applications emerge from this hybrid architecture: (1) We develop a novel protocol for perfect state transfer(PST) in general connected graphs, overcoming the limitations of previous graph-specific approaches. A PST on a tree graph has been implemented on a quantum superconducting processor. (2) We devise a quantum algorithm for multiplying K adjacency matrices of n -vertex regular graphs with time complexity O ( n 2 d 1 ⋯ d K ), outperforming classical matrix multiplication ( O ( n 2.371552 )) when vertex degrees d i are bounded. The algorithm’s efficacy for triangle counting is experimentally validated through the quantum simulation on PennyLane. These results establish the hybrid quantum walk as a versatile framework bridging discrete and continuous paradigms while enabling practical quantum advantage in graph computation tasks.

arXiv:2509.09221•npj Quantum Information•Dec 30, 2025•3 citations

Quantum methods in image processing based on the use of Hadamar gates for object boundary detection

Dilnoz Muhamediyeva, Narzullo Mamatov, Gulsara Ametova +1 more

In this study, both traditional and quantum image processing methods are considered in order to highlight the boundaries of objects. For efficient encoding and processing of pixel intensities, the use of quantum ventilation, in particular the Hadamard transform, is being studied. Quantum algorithms can work with exponential acceleration compared to classical methods; this is especially important for working with large images. The study examines the influence of quantum transformations on the boundary determination process, as well as methods of amplitude permutations to obtain data on edge elements. The superposition and entanglement of qubits have shown to improve the performance and accuracy of the algorithm when processing multiple boundaries simultaneously. It has now been established that quantum computation of intensity differences between neighboring pixels plays an important role in boundary detection. Experiments with 64x64 pixel images have shown that the quantum algorithm performs well in image processing tasks. It has been substantiated that the use of the quantum approach increases processing speed and reduces computational costs. A quantum circuit of the algorithm with its main transformation stages is presented. In general, pathways for further optimization of the algorithm have been developed, which include reducing the number of qubits and adapting it for more complex images.

AIP conference proceedings•Jan 1, 2025•0 citations

Quantum Walk-Based Graph Traversal for Network Security Analysis

Jincheng Zhang

This paper investigates the application of quantum walks to network security analysis, specifically focusing on graph traversal algorithms for anomaly detection and vulnerability assessment. Traditional graph traversal methods often struggle with the complexity of large and dynamic network topologies. Quantum walks, leveraging superposition and interference, offer a potentially more efficient approach. We propose a framework utilizing quantum walks to systematically explore network graphs, identifying patterns and deviations from normal behavior that may indicate malicious activity. The core idea is to represent network nodes and edges as quantum states and utilize the walk's propagation to efficiently discover anomalous routes or node behaviors. We formally define the quantum walk algorithm, including the Hamiltonian operator, initial state preparation, and measurement process. The theoretical analysis demonstrates the potential for exponential speedups in certain scenarios compared to classical graph traversal algorithms. This work lays the groundwork for a novel approach to network security, capitalizing on the inherent advantages of quantum computing for complex pattern recognition and anomaly detection. The key contributions are the formalized quantum walk algorithm for graph traversal and an analysis of its potential advantages.

•Sep 5, 2026•0 citations
Identifying structural boundaries in an image has emerged as an important image processing and computer vision task rendering edge detection as a fundamental operation. Quantum parallelism and superposition have proven to make positive contributions in such tasks enabling quantum computing to be a foremost paradigm to be adapted for image edge detection purpose. In this work, we propose a generalized quantum-walkbased edge detection framework that operates on overlappingN×NN \times NN×Nimage blocks represented as grid graphs whose vertices correspond to pixel locations. Probability amplitudes associated with edge pixels identified through local gradient criteria, undergo amplification employing a discrete-time coined quantum walk. The dimension-independent formulation improves spatial continuity and reduces block boundary artifacts by probability aggregation producing a continuous edge probability map prior to thresholding. The method is robust to noise and has flexible post-processing capabilities. Comparative analysis with existing quantum walk edge detection methods demonstrates that the proposed framework offers enhanced spatial modeling, improved edge continuity, and greater theoretical generality while retaining the advantages of quantum-walk-based probability amplification. Evaluations of quantitative metrics such as Structural Similarity Index Measures and Pratt's Figure of Merit, further validate the effectiveness of the proposed method.
This work introduces a novel quantum algorithm for gradient-based edge detection that operates entirely within the quantum circuit model. Grayscale images are encoded using the Novel Enhanced Quantum Representation (NEQR), allowing exact arithmetic on pixel intensities. Directional gradients are computed by generating superpositions of neighboring pixels via cyclic shift operations and performing subtraction with an exact quantum arithmetic circuit. To refine accuracy, we introduce a direction-aware shifting mechanism that aligns edges with the darker side of intensity transitions. Our novel Quantum Partitioning Algorithm enables efficient in-place thresholding of edge candidates. This work exhibits polynomial-time improvements and optimizes the ancilla count compared to previous NEQR-based quantum edge detection algorithms. These results demonstrate a resource-efficient and fully quantum approach to edge detection, highlighting a practical quantum advantage in image processing.
Graph partitioning is a crucial problem in computer science with applications in diverse areas like VLSI design, image segmentation, and network analysis. Traditional classical algorithms often face significant challenges when dealing with large and complex graphs, leading to increased computational time and memory requirements. This paper explores the potential of quantum walk algorithms to address this issue. We propose a framework for leveraging quantum walk algorithms to efficiently explore the connectivity structure of a graph and identify optimal partitions. The core idea involves mapping the graph's nodes and edges onto a quantum system and utilizing the inherent parallelism of quantum walks to traverse the graph. We present a theoretical analysis of the algorithm's potential speedup compared to classical approaches, focusing on scenarios where quantum computation offers a significant advantage. Specifically, we formulate the graph partitioning problem as a search problem on a graph represented as a quantum walk, considering the Hamiltonian operator and its eigenstates for efficient traversal. The effectiveness of the algorithm is dependent on the graph's structure and the ability to accurately simulate the quantum walk. The presented methodology provides a novel approach to graph partitioning, potentially leading to substantial performance improvements for large, complex graphs.
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.
Quantum walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with the Hamiltonian-driven time evolution of continuous walks. Through systematic analysis of probability distributions, standard deviations, and entanglement entropy on fundamental graph structures, we reveal distinctive dynamical characteristics that differentiate our model from conventional quantum walk paradigms. The proposed framework demonstrates unifying capabilities by naturally encompassing existing quantum walk models as special cases. Two significant applications emerge from this hybrid architecture: (1) We develop a novel protocol for perfect state transfer(PST) in general connected graphs, overcoming the limitations of previous graph-specific approaches. A PST on a tree graph has been implemented on a quantum superconducting processor. (2) We devise a quantum algorithm for multiplying K adjacency matrices of n -vertex regular graphs with time complexity O ( n 2 d 1 ⋯ d K ), outperforming classical matrix multiplication ( O ( n 2.371552 )) when vertex degrees d i are bounded. The algorithm’s efficacy for triangle counting is experimentally validated through the quantum simulation on PennyLane. These results establish the hybrid quantum walk as a versatile framework bridging discrete and continuous paradigms while enabling practical quantum advantage in graph computation tasks.
In this study, both traditional and quantum image processing methods are considered in order to highlight the boundaries of objects. For efficient encoding and processing of pixel intensities, the use of quantum ventilation, in particular the Hadamard transform, is being studied. Quantum algorithms can work with exponential acceleration compared to classical methods; this is especially important for working with large images. The study examines the influence of quantum transformations on the boundary determination process, as well as methods of amplitude permutations to obtain data on edge elements. The superposition and entanglement of qubits have shown to improve the performance and accuracy of the algorithm when processing multiple boundaries simultaneously. It has now been established that quantum computation of intensity differences between neighboring pixels plays an important role in boundary detection. Experiments with 64x64 pixel images have shown that the quantum algorithm performs well in image processing tasks. It has been substantiated that the use of the quantum approach increases processing speed and reduces computational costs. A quantum circuit of the algorithm with its main transformation stages is presented. In general, pathways for further optimization of the algorithm have been developed, which include reducing the number of qubits and adapting it for more complex images.
This paper investigates the application of quantum walks to network security analysis, specifically focusing on graph traversal algorithms for anomaly detection and vulnerability assessment. Traditional graph traversal methods often struggle with the complexity of large and dynamic network topologies. Quantum walks, leveraging superposition and interference, offer a potentially more efficient approach. We propose a framework utilizing quantum walks to systematically explore network graphs, identifying patterns and deviations from normal behavior that may indicate malicious activity. The core idea is to represent network nodes and edges as quantum states and utilize the walk's propagation to efficiently discover anomalous routes or node behaviors. We formally define the quantum walk algorithm, including the Hamiltonian operator, initial state preparation, and measurement process. The theoretical analysis demonstrates the potential for exponential speedups in certain scenarios compared to classical graph traversal algorithms. This work lays the groundwork for a novel approach to network security, capitalizing on the inherent advantages of quantum computing for complex pattern recognition and anomaly detection. The key contributions are the formalized quantum walk algorithm for graph traversal and an analysis of its potential advantages.