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:2605.09486

CTQWformer: A CTQW-based Transformer for Graph Classification

Zhan Li, Wuqing Yu, Yusen Wu, Chuan Wang

cs.LGcs.AIquant-phSubmitted May 10, 2026• Announced May 12, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

Related papers

Continuous-Time Quantum Walks based Graph Neural Network

Yuliang Zhan, Zefeng Gao, Jian Li +2 more

Graph Neural Networks (GNNs) are widely used on graph-structured data. However, most GNNs suffer from two key weaknesses. First, message passing acts as a low-pass filter based on the homophily assumption, so it performs poorly on heterophilic graphs, where connected nodes differ. Second, stacking layers makes node features converge exponentially to constants, a problem known as oversmoothing. Existing work usually addresses the two weaknesses separately. The few methods that target both rely on empirical heuristics, and many over-smoothing solutions further sacrifice the expressive power of the model. To address both weaknesses with theoretical justification, we propose CTQW-GNN, a GNN built on Continuous-Time Quantum Walks (CTQW). The design is motivated by two properties of the CTQW propagator e-iHt. (i) It is unitary and its eigenvalues lie on the unit circle, so no frequency component is damped. This directly counters the low-pass bias. (ii) Unitarity preserves the feature norm, so the Dirichlet energy does not decay exponentially with depth. This directly counters oversmoothing. Guided by these properties, CTQW-GNN combines three aggregation modules, each motivated by a specific gap in prior work. CTQW-based Aggregation evolves node features through the unitary propagator. It captures the mid- and high-frequency signals needed for heterophilic graphs and provably keeps the Dirichlet energy from collapsing, so it addresses both weaknesses in a single branch. CTQW-Attention Aggregation builds a multi-hop neighbor graph from the CTQW amplitudes and applies attention over it, so distant homophilic nodes that single-hop aggregation misses can still be reached. LF Aggregation is a standard low-pass branch (GAT) that preserves accuracy on strongly homophilic graphs, where a pure CTQW branch is suboptimal. We further provide a spectralgap analysis that explains the energy preservation, and a Lieb– Robinson-type bound that gives a principled rule for choosing the walk-time t . Experiments on 14 benchmarks (9 heterophilic, 5 homophilic) show that CTQW-GNN reaches state-of-the-art accuracy on every dataset. Krylov propagation and Chebyshev-based sparsification keep the CTQW-related computation linear in the number of edges under the stated sparsification rule.

arXiv:2608.20738•ACM International Conference on Information and Knowledge Management (CIKM)•Nov 3, 2026•1 citation

Quantum Graph Transformer for NLP Sentiment Classification

Shamminuj Aktar, Andreas Bärtschi, Abdel‐Hameed A. Badawy +1 more

Quantum machine learning is a promising direction for building more efficient and expressive models, particularly in domains where understanding complex, structured data is critical. We present the Quantum Graph Transformer (QGT), a hybrid graph-based architecture that integrates a quantum self-attention mechanism into the message-passing framework for structured language modeling. The attention mechanism is implemented using parameterized quantum circuits (PQCs), which enable the model to capture rich contextual relationships while significantly reducing the number of trainable parameters compared to classical attention mechanisms. We evaluate QGT on five sentiment classification benchmarks. Experimental results demonstrate that QGT effectively learns sentiment representations, achieving accuracies of 93.0%, 90.5%, and 88.0% on the Yelp, IMDB, and Amazon datasets, and 100% and 95.12% on the synthetic MC and RP datasets, respectively. These results highlight the potential of graph-based quantum NLP techniques for advancing efficient and scalable language understanding.

arXiv:2506.07937•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•10 citations

Learning Graph Convolutional Networks based on Quantum Vertex Information Propagation

Lu Bai, Yuhang Jiao, Lixin Cui +4 more

This paper proposes a new Quantum Spatial Graph Convolutional Neural Network (QSGCNN) model that can directly learn a classification function for graphs of arbitrary sizes. Unlike state-of-the-art Graph Convolutional Neural Network (GCNN) models, the proposed QSGCNN model incorporates the process of identifying transitive aligned vertices between graphs and transforms arbitrary sized graphs into fixed-sized aligned vertex grid structures. In order to learn representative graph characteristics, a new quantum spatial graph convolution is proposed and employed to extract multi-scale vertex features, in terms of quantum information propagation between grid vertices of each graph. Since the quantum spatial convolution preserves the grid structures of the input vertices (i.e., the convolution layer does not alter the original spatial position of vertices), the proposed QSGCNN model allows to directly employ the traditional convolutional neural network architecture to further learn from the global graph topology, providing an end-to-end deep learning architecture that integrates the graph representation and learning in the quantum spatial graph convolution layer and the traditional convolutional layer for graph classifications. We indicate the effectiveness of the proposed QSGCNN model in relation to existing state-of-the-art methods. Experiments on benchmark graph classification datasets demonstrate the effectiveness of the proposed QSGCNN model.

arXiv:1809.01090•IEEE Transactions on Knowledge and Data Engineering•Jan 1, 2021•48 citations

Towards a Native Quantum Paradigm for Graph Representation Learning: A Sampling-based Recurrent Embedding Approach

Ge Yan, Yehui Tang, Junchi Yan

Graph representation learning has been extensively studied, and recent models can well incorporate both node features and graph structures. Despite these progress, the inherent scalability challenge for classical computers of processing graph data and solving the downstream tasks (many are NP-hard) is still a bottleneck for existing classical graph learning models. On the other hand, quantum computing is known a promising direction for its theoretically verified scalability as well as the increasing evidence for the access to physical quantum machine in near-term. Different from many existing classical-quantum hybrid machine learning models on graphs, in this paper we take a more aggressive initiative for developing a native quantum paradigm for (attributed) graph representation learning, which to our best knowledge, has not been fulfilled in literature yet. Specifically, our model adopts the well-established theory and technique in quantum computing e.g. quantum random walk, and adapt it to the attributed graph. Then the node attribute quantum state sequence is fed into a quantum recurrent network to obtain the final node embedding. Experimental results on three public datasets show the effectiveness of our quantum model which also outperforms a classical learning approach GraphRNA notably in terms of efficiency even on a classical computer. Though it is still restricted to the classical loss-based learning paradigm with gradient descent for model parameter training, while our computing scheme is compatible with quantum computing without involving classical computers. This is in fact largely in contrast to many hybrid quantum graph learning models which often involve many steps and modules having to be performed on classical computers.

ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)•Aug 12, 2022•5 citations

Bosonic Random Walk Networks for Graph Learning

Shiv Shankar Shankar, Don Towsley

The development of Graph Neural Networks (GNNs) has led to great progress in machine learning on graph-structured data. These networks operate via diffusing information across the graph nodes while capturing the structure of the graph. Recently there has also seen tremendous progress in quantum computing techniques. In this work, we explore applications of multi-particle quantum walks on diffusing information across graphs. Our model is based on learning the operators that govern the dynamics of quantum random walkers on graphs. We demonstrate the effectiveness of our method on classification and regression tasks.

arXiv:2101.00082•Dec 31, 2020•1 citation

Hybrid Quantum–Classical Graph Transformers for Efficient Sentiment Analysis

Shamminuj Aktar, Andreas Bärtschi, Abdel‐Hameed A. Badawy +1 more

ABSTRACT Quantum Machine Learning (QML) offers a promising paradigm that leverages quantum computing principles to develop efficient and expressive models for learning from complex and structured data. Recent advances in natural language processing (NLP) and artificial intelligence (AI) have demonstrated capabilities in understanding, generating, and reasoning over linguistic and multimodal information. In this work, we present the Quantum Graph Transformer (QGT) , a hybrid quantum–classical architecture that extends graph transformer capabilities through quantum self‐attention. The QGT models variable‐length sentences as token graphs, where both the embedding encoding and the self‐attention mechanisms are implemented using parameterized quantum circuits (PQCs), enabling efficient contextual learning with significantly fewer trainable parameters. We train QGT using both fully connected and ‐nearest‐neighbor graph structures and evaluate it on five benchmark sentiment‐classification datasets. Experimental results show that QGT consistently achieves higher or comparable accuracy to existing quantum NLP models and outperforms a Classical Graph Transformer (CGT) baseline with identical architecture, achieving fewer parameters while requiring 3– fewer samples to reach comparable performance. These findings highlight the potential of graph‐based quantum models as scalable and data‐efficient architectures for natural language understanding.

Advanced Quantum Technologies•Mar 1, 2026•1 citation
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.
Graph Neural Networks (GNNs) are widely used on graph-structured data. However, most GNNs suffer from two key weaknesses. First, message passing acts as a low-pass filter based on the homophily assumption, so it performs poorly on heterophilic graphs, where connected nodes differ. Second, stacking layers makes node features converge exponentially to constants, a problem known as oversmoothing. Existing work usually addresses the two weaknesses separately. The few methods that target both rely on empirical heuristics, and many over-smoothing solutions further sacrifice the expressive power of the model. To address both weaknesses with theoretical justification, we propose CTQW-GNN, a GNN built on Continuous-Time Quantum Walks (CTQW). The design is motivated by two properties of the CTQW propagator e-iHt. (i) It is unitary and its eigenvalues lie on the unit circle, so no frequency component is damped. This directly counters the low-pass bias. (ii) Unitarity preserves the feature norm, so the Dirichlet energy does not decay exponentially with depth. This directly counters oversmoothing. Guided by these properties, CTQW-GNN combines three aggregation modules, each motivated by a specific gap in prior work. CTQW-based Aggregation evolves node features through the unitary propagator. It captures the mid- and high-frequency signals needed for heterophilic graphs and provably keeps the Dirichlet energy from collapsing, so it addresses both weaknesses in a single branch. CTQW-Attention Aggregation builds a multi-hop neighbor graph from the CTQW amplitudes and applies attention over it, so distant homophilic nodes that single-hop aggregation misses can still be reached. LF Aggregation is a standard low-pass branch (GAT) that preserves accuracy on strongly homophilic graphs, where a pure CTQW branch is suboptimal. We further provide a spectralgap analysis that explains the energy preservation, and a Lieb– Robinson-type bound that gives a principled rule for choosing the walk-time t . Experiments on 14 benchmarks (9 heterophilic, 5 homophilic) show that CTQW-GNN reaches state-of-the-art accuracy on every dataset. Krylov propagation and Chebyshev-based sparsification keep the CTQW-related computation linear in the number of edges under the stated sparsification rule.
Quantum machine learning is a promising direction for building more efficient and expressive models, particularly in domains where understanding complex, structured data is critical. We present the Quantum Graph Transformer (QGT), a hybrid graph-based architecture that integrates a quantum self-attention mechanism into the message-passing framework for structured language modeling. The attention mechanism is implemented using parameterized quantum circuits (PQCs), which enable the model to capture rich contextual relationships while significantly reducing the number of trainable parameters compared to classical attention mechanisms. We evaluate QGT on five sentiment classification benchmarks. Experimental results demonstrate that QGT effectively learns sentiment representations, achieving accuracies of 93.0%, 90.5%, and 88.0% on the Yelp, IMDB, and Amazon datasets, and 100% and 95.12% on the synthetic MC and RP datasets, respectively. These results highlight the potential of graph-based quantum NLP techniques for advancing efficient and scalable language understanding.
This paper proposes a new Quantum Spatial Graph Convolutional Neural Network (QSGCNN) model that can directly learn a classification function for graphs of arbitrary sizes. Unlike state-of-the-art Graph Convolutional Neural Network (GCNN) models, the proposed QSGCNN model incorporates the process of identifying transitive aligned vertices between graphs and transforms arbitrary sized graphs into fixed-sized aligned vertex grid structures. In order to learn representative graph characteristics, a new quantum spatial graph convolution is proposed and employed to extract multi-scale vertex features, in terms of quantum information propagation between grid vertices of each graph. Since the quantum spatial convolution preserves the grid structures of the input vertices (i.e., the convolution layer does not alter the original spatial position of vertices), the proposed QSGCNN model allows to directly employ the traditional convolutional neural network architecture to further learn from the global graph topology, providing an end-to-end deep learning architecture that integrates the graph representation and learning in the quantum spatial graph convolution layer and the traditional convolutional layer for graph classifications. We indicate the effectiveness of the proposed QSGCNN model in relation to existing state-of-the-art methods. Experiments on benchmark graph classification datasets demonstrate the effectiveness of the proposed QSGCNN model.
Graph representation learning has been extensively studied, and recent models can well incorporate both node features and graph structures. Despite these progress, the inherent scalability challenge for classical computers of processing graph data and solving the downstream tasks (many are NP-hard) is still a bottleneck for existing classical graph learning models. On the other hand, quantum computing is known a promising direction for its theoretically verified scalability as well as the increasing evidence for the access to physical quantum machine in near-term. Different from many existing classical-quantum hybrid machine learning models on graphs, in this paper we take a more aggressive initiative for developing a native quantum paradigm for (attributed) graph representation learning, which to our best knowledge, has not been fulfilled in literature yet. Specifically, our model adopts the well-established theory and technique in quantum computing e.g. quantum random walk, and adapt it to the attributed graph. Then the node attribute quantum state sequence is fed into a quantum recurrent network to obtain the final node embedding. Experimental results on three public datasets show the effectiveness of our quantum model which also outperforms a classical learning approach GraphRNA notably in terms of efficiency even on a classical computer. Though it is still restricted to the classical loss-based learning paradigm with gradient descent for model parameter training, while our computing scheme is compatible with quantum computing without involving classical computers. This is in fact largely in contrast to many hybrid quantum graph learning models which often involve many steps and modules having to be performed on classical computers.
The development of Graph Neural Networks (GNNs) has led to great progress in machine learning on graph-structured data. These networks operate via diffusing information across the graph nodes while capturing the structure of the graph. Recently there has also seen tremendous progress in quantum computing techniques. In this work, we explore applications of multi-particle quantum walks on diffusing information across graphs. Our model is based on learning the operators that govern the dynamics of quantum random walkers on graphs. We demonstrate the effectiveness of our method on classification and regression tasks.
ABSTRACT Quantum Machine Learning (QML) offers a promising paradigm that leverages quantum computing principles to develop efficient and expressive models for learning from complex and structured data. Recent advances in natural language processing (NLP) and artificial intelligence (AI) have demonstrated capabilities in understanding, generating, and reasoning over linguistic and multimodal information. In this work, we present the Quantum Graph Transformer (QGT) , a hybrid quantum–classical architecture that extends graph transformer capabilities through quantum self‐attention. The QGT models variable‐length sentences as token graphs, where both the embedding encoding and the self‐attention mechanisms are implemented using parameterized quantum circuits (PQCs), enabling efficient contextual learning with significantly fewer trainable parameters. We train QGT using both fully connected and ‐nearest‐neighbor graph structures and evaluate it on five benchmark sentiment‐classification datasets. Experimental results show that QGT consistently achieves higher or comparable accuracy to existing quantum NLP models and outperforms a Classical Graph Transformer (CGT) baseline with identical architecture, achieving fewer parameters while requiring 3– fewer samples to reach comparable performance. These findings highlight the potential of graph‐based quantum models as scalable and data‐efficient architectures for natural language understanding.