© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

Journal of Electronic Imaging

Image two-classification algorithm based on continuous-time quantum walk

Wei-Min Shi, Binbin Chen, Yi‐Hua Zhou, Yu‐Guang Yang

Published Aug 11, 2022• 0 citations

Abstract

To further improve the performance of image retrieval, we propose an image two-classification algorithm based on continuous-time quantum walk (CTQW) model. First, a weighted undirected complete graph is constructed based on a new weighted edge method, that is, the images in the image set are used to represent the nodes on the weighted complete graph, and every two images are connected to represent the edge on the weighted complete image, the weighted value of which represents the similarity between adjacent images. Then, the CTQW is executed to realize the image two-classification based on the quantum walk model of the weighted complete graph, that is, the CTQW is performed from two types of unrelated images, and the two-classification of images is realized that the relevant and unrelated labels are assigned to each image according to the obtained probability distribution two-classification. Finally, the experimental results show that the proposed two-classification algorithm based on CTQW has a good classification effect from the visual effect, and the evaluation indexes of image classification, such as the average precision rate, the recall rate, and the accuracy rate, are all higher than 0.85. In addition, the proposed image two-classification algorithm based on CTQW can be extended to image multiclassification if the quantum walk is performed using multiple irrelevant pictures as the starting point. Similarly, the extended image multiclassification method also has a better classification effect through the experiments and the evaluation indexes of image classification.

DOI: 10.1117/1.jei.31.4.043037

Related papers

Image Classification Based on Quantum KNN Algorithm

Yijie Dang, Nan Jiang, Hao Hu +2 more

Image classification is an important task in the field of machine learning and image processing. However, the usually used classification method --- the K Nearest-Neighbor algorithm has high complexity, because its two main processes: similarity computing and searching are time-consuming. Especially in the era of big data, the problem is prominent when the amount of images to be classified is large. In this paper, we try to use the powerful parallel computing ability of quantum computers to optimize the efficiency of image classification. The scheme is based on quantum K Nearest-Neighbor algorithm. Firstly, the feature vectors of images are extracted on classical computers. Then the feature vectors are inputted into a quantum superposition state, which is used to achieve parallel computing of similarity. Next, the quantum minimum search algorithm is used to speed up searching process for similarity. Finally, the image is classified by quantum measurement. The complexity of the quantum algorithm is only O((kM)^(1/2)), which is superior to the classical algorithms. Moreover, the measurement step is executed only once to ensure the validity of the scheme. The experimental results show that, the classification accuracy is 83.1% on Graz-01 dataset and 78% on Caltech-101 dataset, which is close to existing classical algorithms. Hence, our quantum scheme has a good classification performance while greatly improving the efficiency.

arXiv:1805.06260•May 16, 2018•6 citations

A Continuous - Time Quantum Walk for Attributed Graphs Matching

Tewabe Chekole

Diverse facets Of the Theory of Quantum Walks on Graph are reviewed Till now .In specific, Quantum network routing, Quantum Walk Search Algorithm, Element distinctness associated to the eigenvalues of Graphs and the use of these relation /connection in the study of Quantum walks is furthermore described. Different Researchers had contribution and put their benchmark idea Pertaining with this research concept. I furthermore try to investigate recent Application of Quantum walks, In specific the problem pertained with Graph matching i.e Matching nodes(vertices) of the Graphs. In this research paper,I consider how Continuous-time quantum walk (CTQW) can be directed to Graph-matching problems. The matching problem is abstracted using weighted(attributed) Graphs that connects vertices's of one Graph to other and Try to compute the distance b/n those Graphs Node's Beside that finding the matched nodes and the Cost related to Matching. eventually measuring the distance between two Graphs which might have different size then by using k-nearest neighbor (k-NN) method try to classifying those graph based on closest training examples in the feature space.

arXiv:1801.10339•Jan 31, 2018•0 citations

CTQWformer: A CTQW-based Transformer for Graph Classification

Zhan Li, Wuqing Yu, Yusen Wu +1 more

Graph Neural Networks (GNN) and Transformer-based architectures have achieved remarkable progress in graph learning, yet they still struggle to capture both global structural dependencies and model the dynamic information propagation. In this paper, we propose CTQWformer, a hybrid graph learning framework that integrates continuous-time quantum walks (CTQW) with GNN. CTQWformer employs a trainable Hamiltonian that fuses graph topology and node features, enabling physically grounded modeling of quantum walk dynamics that captures rich and intricate graph structure information. The extracted CTQW-based representations are incorporated into two complementary modules:(i) a Graph Transformer module that embeds final-time propagation probabilities as structural biases in the self-attention mechanism, and (ii) a Graph Recurrent Module that captures temporal evolution patterns with bidirectional recurrent networks. Extensive experiments on benchmark graph classification datasets demonstrate that CTQWformer outperforms graph kernel and GNN-based methods, demonstrating the potential of integrating quantum dynamics into trainable deep learning frameworks for graph representation learning. To the best of our knowledge, CTQWformer is the first hybrid CTQW-based Transformer, integrating CTQW-derived structural bias with temporal evolution modeling to advance graph learning.

cs.LGCross-listedarXiv:2605.09486•May 12, 2026•0 citations

A Continuous - Time Quantum Walk for Attributed GraphsMatching

Tewabe Chekole Workneh

Diverse facets Of the Theory of Quantum Walks on Graph are reviewed Till now .In specific, Quantum network routing, Quantum Walk Search Algorithm, Element distinctness associated to the eigenvalues of Graphs and the use of these relation /connection in the study of Quantum walks is furthermore described. Different Researchers had contribution and put their benchmark idea Pertaining with this research concept. I furthermore try to investigate recent Application of Quantum walks, In specific the problem pertained with Graph matching i.e Matching nodes(vertices) of the Graphs. In this research paper,I consider how Continuous-time quantum walk (CTQW) can be directed to Graph-matching problems. The matching problem is abstracted using weighted(attributed) Graphs that connects vertices's of one Graph to other and Try to compute the distance b/n those Graphs Node's Beside that finding the matched nodes and the Cost related to Matching. eventually measuring the distance between two Graphs which might have different size then by using k-nearest neighbor (k-NN) method try to classifying those graph based on closest training examples in the feature space.

•Oct 30, 2013•0 citations

Improving Image Classification with Quantum Neural Network

A S Reejisha, Anuraj Mohan

Image classification is a fundamental task in computer vision that involves assigning labels to images based on their content. In recent years, deep learning techniques based on classical neural networks (CNN) have achieved modern performance on many image classification tasks. However, there is growing interest in using quantum neural networks (QNNs) for image classification, as quantum computing has the potential to improve the accuracy and speed of computation. We demonstrate the potential of our QNN model and QCNN model by applying it to the fashion MNIST dataset. The results indicate that the QNN model exhibits faster training speed and higher testing set accuracy compared to a QCNN with a similar architecture.

International Conference on Computer, Electronics & Electrical Engineering & their Applications (IC2E3)•Jun 8, 2023•5 citations

An enhanced classical approach to graph isomorphism using continuous-time quantum walk

Xiaogang Qiang, Xuejun Yang, Junjie Wu +1 more

Studies on graph isomorphism play an important role in graph research, and graph isomorphism algorithms have a wide range of applications in image matching, pattern recognition, computer vision, biochemistry and other fields. Previous research demonstrated that involving discrete-time quantum walk in the graph isomorphism algorithm could achieve complexity O ( N 7 ) for general graphs, since quantum walk could be utilized as a new toolbox for solving graph problems. We develop an enhanced classical approach to graph isomorphism using continuous-time quantum walk, which has lower complexity O ( N 5 ) and can effectively distinguish the graphs that are generally considered difficult. In addition, we define a graph similarity measure based on the proposed algorithm, which can be used for graph isomorphism and graph clustering. In the experiment, we test a wide variety of classes of graphs; the results show that the algorithm has a wide range of applications rather than being limited to a specific type of graph.

Journal of Physics A Mathematical and Theoretical•Jan 4, 2012•23 citations

To further improve the performance of image retrieval, we propose an image two-classification algorithm based on continuous-time quantum walk (CTQW) model. First, a weighted undirected complete graph is constructed based on a new weighted edge method, that is, the images in the image set are used to represent the nodes on the weighted complete graph, and every two images are connected to represent the edge on the weighted complete image, the weighted value of which represents the similarity between adjacent images. Then, the CTQW is executed to realize the image two-classification based on the quantum walk model of the weighted complete graph, that is, the CTQW is performed from two types of unrelated images, and the two-classification of images is realized that the relevant and unrelated labels are assigned to each image according to the obtained probability distribution two-classification. Finally, the experimental results show that the proposed two-classification algorithm based on CTQW has a good classification effect from the visual effect, and the evaluation indexes of image classification, such as the average precision rate, the recall rate, and the accuracy rate, are all higher than 0.85. In addition, the proposed image two-classification algorithm based on CTQW can be extended to image multiclassification if the quantum walk is performed using multiple irrelevant pictures as the starting point. Similarly, the extended image multiclassification method also has a better classification effect through the experiments and the evaluation indexes of image classification.

Image classification is an important task in the field of machine learning and image processing. However, the usually used classification method --- the K Nearest-Neighbor algorithm has high complexity, because its two main processes: similarity computing and searching are time-consuming. Especially in the era of big data, the problem is prominent when the amount of images to be classified is large. In this paper, we try to use the powerful parallel computing ability of quantum computers to optimize the efficiency of image classification. The scheme is based on quantum K Nearest-Neighbor algorithm. Firstly, the feature vectors of images are extracted on classical computers. Then the feature vectors are inputted into a quantum superposition state, which is used to achieve parallel computing of similarity. Next, the quantum minimum search algorithm is used to speed up searching process for similarity. Finally, the image is classified by quantum measurement. The complexity of the quantum algorithm is only O((kM)^(1/2)), which is superior to the classical algorithms. Moreover, the measurement step is executed only once to ensure the validity of the scheme. The experimental results show that, the classification accuracy is 83.1% on Graz-01 dataset and 78% on Caltech-101 dataset, which is close to existing classical algorithms. Hence, our quantum scheme has a good classification performance while greatly improving the efficiency.

Diverse facets Of the Theory of Quantum Walks on Graph are reviewed Till now .In specific, Quantum network routing, Quantum Walk Search Algorithm, Element distinctness associated to the eigenvalues of Graphs and the use of these relation /connection in the study of Quantum walks is furthermore described. Different Researchers had contribution and put their benchmark idea Pertaining with this research concept. I furthermore try to investigate recent Application of Quantum walks, In specific the problem pertained with Graph matching i.e Matching nodes(vertices) of the Graphs. In this research paper,I consider how Continuous-time quantum walk (CTQW) can be directed to Graph-matching problems. The matching problem is abstracted using weighted(attributed) Graphs that connects vertices's of one Graph to other and Try to compute the distance b/n those Graphs Node's Beside that finding the matched nodes and the Cost related to Matching. eventually measuring the distance between two Graphs which might have different size then by using k-nearest neighbor (k-NN) method try to classifying those graph based on closest training examples in the feature space.

Graph Neural Networks (GNN) and Transformer-based architectures have achieved remarkable progress in graph learning, yet they still struggle to capture both global structural dependencies and model the dynamic information propagation. In this paper, we propose CTQWformer, a hybrid graph learning framework that integrates continuous-time quantum walks (CTQW) with GNN. CTQWformer employs a trainable Hamiltonian that fuses graph topology and node features, enabling physically grounded modeling of quantum walk dynamics that captures rich and intricate graph structure information. The extracted CTQW-based representations are incorporated into two complementary modules:(i) a Graph Transformer module that embeds final-time propagation probabilities as structural biases in the self-attention mechanism, and (ii) a Graph Recurrent Module that captures temporal evolution patterns with bidirectional recurrent networks. Extensive experiments on benchmark graph classification datasets demonstrate that CTQWformer outperforms graph kernel and GNN-based methods, demonstrating the potential of integrating quantum dynamics into trainable deep learning frameworks for graph representation learning. To the best of our knowledge, CTQWformer is the first hybrid CTQW-based Transformer, integrating CTQW-derived structural bias with temporal evolution modeling to advance graph learning.

Diverse facets Of the Theory of Quantum Walks on Graph are reviewed Till now .In specific, Quantum network routing, Quantum Walk Search Algorithm, Element distinctness associated to the eigenvalues of Graphs and the use of these relation /connection in the study of Quantum walks is furthermore described. Different Researchers had contribution and put their benchmark idea Pertaining with this research concept. I furthermore try to investigate recent Application of Quantum walks, In specific the problem pertained with Graph matching i.e Matching nodes(vertices) of the Graphs. In this research paper,I consider how Continuous-time quantum walk (CTQW) can be directed to Graph-matching problems. The matching problem is abstracted using weighted(attributed) Graphs that connects vertices's of one Graph to other and Try to compute the distance b/n those Graphs Node's Beside that finding the matched nodes and the Cost related to Matching. eventually measuring the distance between two Graphs which might have different size then by using k-nearest neighbor (k-NN) method try to classifying those graph based on closest training examples in the feature space.

Image classification is a fundamental task in computer vision that involves assigning labels to images based on their content. In recent years, deep learning techniques based on classical neural networks (CNN) have achieved modern performance on many image classification tasks. However, there is growing interest in using quantum neural networks (QNNs) for image classification, as quantum computing has the potential to improve the accuracy and speed of computation. We demonstrate the potential of our QNN model and QCNN model by applying it to the fashion MNIST dataset. The results indicate that the QNN model exhibits faster training speed and higher testing set accuracy compared to a QCNN with a similar architecture.

Studies on graph isomorphism play an important role in graph research, and graph isomorphism algorithms have a wide range of applications in image matching, pattern recognition, computer vision, biochemistry and other fields. Previous research demonstrated that involving discrete-time quantum walk in the graph isomorphism algorithm could achieve complexity O ( N 7 ) for general graphs, since quantum walk could be utilized as a new toolbox for solving graph problems. We develop an enhanced classical approach to graph isomorphism using continuous-time quantum walk, which has lower complexity O ( N 5 ) and can effectively distinguish the graphs that are generally considered difficult. In addition, we define a graph similarity measure based on the proposed algorithm, which can be used for graph isomorphism and graph clustering. In the experiment, we test a wide variety of classes of graphs; the results show that the algorithm has a wide range of applications rather than being limited to a specific type of graph.