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 Joint Conference on Neural Networks (IJCNN)

Hybrid Quantum-Classical Graph Neural Networks for Solving Unit Commitment Problem

Xuanzi Ma, Junchao Cui, Wenxia Wang, Yizhen Huang, Bei Zhou, Jinchen Xu

Published Jun 1, 2026• 0 citations
Publisher

Abstract

The Unit Commitment Problem (UCP) is a core optimization task for ensuring secure and economically efficient operation of power grids. However, existing methodologies face two major limitations: first, there is a lack of a general and efficient way to represent the complex relationships between UCP variables and constraints; second, exponential parameter growth with problem scale impedes characterization of complex dependencies in UCP, thereby limiting predictive accuracy. To address these issues, we propose a hybrid quantum-classical graph neural network framework (HQGNN) that establishes a novel paradigm for UCP by: (1) modeling UCP as a unified bipartite graph format, and (2) integrating quantum feature extraction modules to reduce the parameter size and enhance classical GNNs’ capability in capturing high-dimensional structural characteristics. Extensive experiments on IEEE and RTS benchmark datasets demonstrate that HQGNN achieves improvements in UCP solution accuracy while validating the effectiveness of quantum modules in enhancing graph-structured feature learning. The quantum module in HQGNN is proven to be the key enabler of performance gains. Its integration cuts parameters by 16.8% and reduces mean squared error (MSE) in optimal solution prediction by 24.4% across all benchmarks, while achieving full-task superiority on the IEEE-9 dataset.These results substantiate the proposed method’s capacity to simultaneously enhance solution quality and computational efficiency through quantum-enhanced graph representation learning.

DOI
10.1109/ijcnn69854.2026.11728852

Related papers

Integrating Quantum Approximate Optimization Algorithm with Machine Learning for Graph-Structured Problem Solving

Dr. Mamta Singh

The integration of quantum algorithms into machine learning pipelines offers a promising direction for addressing complex combinatorial optimization problems inherent in graph-structured data. This study investigates the use of the Quantum Approximate Optimization Algorithm (QAOA) as a quantum subroutine within a hybrid quantum–classical framework to enhance machine learning solutions for graph-based tasks. QAOA is employed to solve NP-hard graph optimization problems such as Max-Cut, graph coloring, and community detection, which are reformulated as Quadratic Unconstrained Binary Optimization (QUBO) problems. The solutions provided by QAOA are then incorporated into machine learning models, such as Graph Neural Networks (GNNs) or clustering algorithms, as enriched features or optimized graph partitions. The hybrid approach is evaluated on benchmark datasets, demonstrating competitive accuracy and improved scalability in certain problem instances compared to purely classical methods. The findings highlight the potential of leveraging near-term quantum hardware for augmenting classical learning systems in domains such as logistics, social network analysis, and computational biology.

•Mar 25, 2026•0 citations

Representational efficiency and noise robustness in hybrid quantum-classical graph neural networks

Istiyak Amin Santo, Hasanul Bannah, Md Serajun Nabi +1 more

A central question in hybrid quantum–classical learning is whether variational quantum circuits (VQCs) preserve task-relevant information more efficiently than classical nonlinearities of equal output dimension. We study this question for drug–target interaction prediction in Alzheimer’s disease drug-repurposing workflows using a Hybrid Quantum–Classical Graph Neural Network (HQGNN). The model compresses 512-dimensional GNN embeddings into a four-qubit VQC (128 $$\times $$ compression) before a classical prediction head. On the DAVIS kinase benchmark, HQGNN achieves concordance index (CI) $$=0.527$$ and root mean squared error (RMSE) $$=0.850$$ , outperforming a dimension-matched classical bottleneck baseline (CI $$=0.500$$ ; random ranking). Under the same compression, the quantum layer recovers 51% of the ranking signal lost by compression relative to the full classical model and yields a 5.4% relative CI gain over the classical bottleneck. This effect is obtained with 24 trainable quantum parameters (representational yield $$\Delta $$ CI/parameter $$\approx 1.13\times 10^{-3}$$ ). Under depolarizing noise, RMSE degradation remains below 3.3% at realistic noisy intermediate-scale quantum (NISQ) levels ( $$p \le 0.01$$ ). Because the present benchmark is evaluated on a single transductive split, these results are interpreted as controlled proof-of-concept evidence of representational efficiency rather than definitive deployment-level generalization.

Discover Quantum Science•Jul 23, 2026•0 citations

Inductive Graph Representation Learning with Quantum Graph Neural Networks

Arthur Mendonça Faria, Ignacio Fernández Graña, Savvas Varsamopoulos

Graph Neural Networks (QGNNs) offer a promising approach to combining quantum computing with graph-structured data processing. While classical Graph Neural Networks (GNNs) are scalable and robust, existing QGNNs often lack flexibility due to graph-specific quantum circuit designs, limiting their applicability to diverse real-world problems. To address this, we propose a versatile QGNN framework inspired by GraphSAGE, using quantum models as aggregators to generate quantum-native node embeddings. We integrate inductive representation learning techniques with parameterized quantum convolutional and pooling layers, bridging classical and quantum paradigms. The convolutional layer is flexible, allowing tailored designs for specific tasks. Benchmarked on a node regression task with the QM9 dataset, our framework, using a single minimal circuit for all aggregation steps, handles molecules with varying numbers of atoms without changing qubits or circuit architecture. While classical GNNs achieve higher training performance, our quantum approach remains competitive and often shows enhanced generalization as molecular complexity increases. We also observe faster learning in early training epochs. To mitigate trainability limitations of a single-circuit setup, we extend the framework with multiple quantum aggregators on QM9. Assigning distinct circuits to each hop substantially improves training performance across all cases. Additionally, we numerically demonstrate the absence of barren plateaus as qubit numbers increase, suggesting that the proposed model remains trainable to larger, more complex graph-based problems.

arXiv:2503.24111•Mar 31, 2025•3 citations

Quantum Annealing for Combinatorial Optimization with Graph Neural Networks

Jincheng Zhang

This paper investigates the application of quantum annealing in conjunction with graph neural networks (GNNs) for solving complex combinatorial optimization problems. Traditional classical optimization algorithms often face significant challenges in identifying optimal solutions within large and intricate solution spaces. The core idea presented herein is to represent these problems as graphs and utilize the inherent quantum mechanical properties of quantum annealing to explore this space more efficiently. Specifically, GNNs are employed to generate embeddings of the graph, effectively encoding problem-specific features and relationships. This approach aims to bridge the gap between the probabilistic nature of quantum computation and the structural information captured by GNNs. We detail the theoretical framework, explore the potential benefits of this hybrid approach, and outline a methodology for integrating these techniques. The potential for improved optimization performance compared to conventional methods is discussed, highlighting the synergy between quantum annealing's ability to find low-energy states and GNNs' capacity to learn complex graph representations.

•Aug 31, 2026•0 citations

A Novel Integrated Quantum Computing Approach for Unit Commitment

Bing Yan, Junpeng Zhan, Obumneme Umeonwuka +7 more

The transition toward a decarbonized power grid introduces increasing operational complexity driven by variable renewable, distributed energy resources, electric vehicles, and energy storage resources. These dynamics require rapid and efficient solutions to the Unit Commitment (UC) problem, which classical computing may struggle. Quantum Computing (QC) offers a promising alternative by exploiting qubits’ exponential information capacity to accelerate large-scale optimization. This paper presents a novel integrated QC-based approach to solve UC through synergistic integration of Quantum Feasibility Labeling (QFL), Variational Quantum Search (VQS), and Quantum Global Minimum Finder (QGMF). It enhances feasible-state identification and global optimum discovery, addressing the limitations of existing algorithms such as the Quantum Approximate Optimization Algorithm. Two illustrative UC case studies are used to demonstrate the approach. Results indicate that the combined QFL-VQS-QGMF framework can identify the optimal UC solution accurately. This work highlights the potential of hybrid quantum–classical optimization as a foundational step toward scalable quantum solutions for future grid operations.

IEEE Power Engineering Society General Meeting•Jul 1, 2026•0 citations

Fidelity-Based Quantum Device Selection Using Graph Neural Networks

Antonio Tudisco, Patrick Hopf, Linus Schulte +3 more

Modern High-Performance Computing (HPC) infrastructures are increasingly integrating multiple Quantum Processing Units (QPUs) of different types alongside classical resources. Unlike traditional accelerator scheduling, quantum device selection affects not only performance but also the quality of the computed result because current quantum hardware exhibits device-dependent noise characteristics. This makes efficient and fidelity-based device selection a key challenge in multi-QPU environments. In this work, we propose a Graph Neural Network (GNN) model that exploits the structural representation of quantum circuits to predict their execution fidelity across different QPUs. By operating on uncompiled circuits, the approach supports earlystage device selection and enables making informed scheduling decisions. We evaluate the model on a diverse set of benchmark circuits compiled for superconducting and trapped-ion devices. The results show that the proposed approach outperforms existing baseline models, achieving 30% Mean Squared Error (MSE) and 20% Mean Absolute Error (MAE) reduction, and provides an effective basis for fidelity-based scheduling in heterogeneous HPC-quantum systems.

IEEE International Conference on Quantum Software (QSW)•Jul 1, 2026•0 citations
The Unit Commitment Problem (UCP) is a core optimization task for ensuring secure and economically efficient operation of power grids. However, existing methodologies face two major limitations: first, there is a lack of a general and efficient way to represent the complex relationships between UCP variables and constraints; second, exponential parameter growth with problem scale impedes characterization of complex dependencies in UCP, thereby limiting predictive accuracy. To address these issues, we propose a hybrid quantum-classical graph neural network framework (HQGNN) that establishes a novel paradigm for UCP by: (1) modeling UCP as a unified bipartite graph format, and (2) integrating quantum feature extraction modules to reduce the parameter size and enhance classical GNNs’ capability in capturing high-dimensional structural characteristics. Extensive experiments on IEEE and RTS benchmark datasets demonstrate that HQGNN achieves improvements in UCP solution accuracy while validating the effectiveness of quantum modules in enhancing graph-structured feature learning. The quantum module in HQGNN is proven to be the key enabler of performance gains. Its integration cuts parameters by 16.8% and reduces mean squared error (MSE) in optimal solution prediction by 24.4% across all benchmarks, while achieving full-task superiority on the IEEE-9 dataset.These results substantiate the proposed method’s capacity to simultaneously enhance solution quality and computational efficiency through quantum-enhanced graph representation learning.
The integration of quantum algorithms into machine learning pipelines offers a promising direction for addressing complex combinatorial optimization problems inherent in graph-structured data. This study investigates the use of the Quantum Approximate Optimization Algorithm (QAOA) as a quantum subroutine within a hybrid quantum–classical framework to enhance machine learning solutions for graph-based tasks. QAOA is employed to solve NP-hard graph optimization problems such as Max-Cut, graph coloring, and community detection, which are reformulated as Quadratic Unconstrained Binary Optimization (QUBO) problems. The solutions provided by QAOA are then incorporated into machine learning models, such as Graph Neural Networks (GNNs) or clustering algorithms, as enriched features or optimized graph partitions. The hybrid approach is evaluated on benchmark datasets, demonstrating competitive accuracy and improved scalability in certain problem instances compared to purely classical methods. The findings highlight the potential of leveraging near-term quantum hardware for augmenting classical learning systems in domains such as logistics, social network analysis, and computational biology.
A central question in hybrid quantum–classical learning is whether variational quantum circuits (VQCs) preserve task-relevant information more efficiently than classical nonlinearities of equal output dimension. We study this question for drug–target interaction prediction in Alzheimer’s disease drug-repurposing workflows using a Hybrid Quantum–Classical Graph Neural Network (HQGNN). The model compresses 512-dimensional GNN embeddings into a four-qubit VQC (128 ×\times × compression) before a classical prediction head. On the DAVIS kinase benchmark, HQGNN achieves concordance index (CI) =0.527=0.527=0.527 and root mean squared error (RMSE) =0.850=0.850=0.850 , outperforming a dimension-matched classical bottleneck baseline (CI =0.500=0.500=0.500 ; random ranking). Under the same compression, the quantum layer recovers 51% of the ranking signal lost by compression relative to the full classical model and yields a 5.4% relative CI gain over the classical bottleneck. This effect is obtained with 24 trainable quantum parameters (representational yield Δ\Delta Δ CI/parameter ≈1.13×10−3\approx 1.13\times 10^{-3}≈1.13×10−3 ). Under depolarizing noise, RMSE degradation remains below 3.3% at realistic noisy intermediate-scale quantum (NISQ) levels ( p≤0.01p \le 0.01p≤0.01 ). Because the present benchmark is evaluated on a single transductive split, these results are interpreted as controlled proof-of-concept evidence of representational efficiency rather than definitive deployment-level generalization.
Graph Neural Networks (QGNNs) offer a promising approach to combining quantum computing with graph-structured data processing. While classical Graph Neural Networks (GNNs) are scalable and robust, existing QGNNs often lack flexibility due to graph-specific quantum circuit designs, limiting their applicability to diverse real-world problems. To address this, we propose a versatile QGNN framework inspired by GraphSAGE, using quantum models as aggregators to generate quantum-native node embeddings. We integrate inductive representation learning techniques with parameterized quantum convolutional and pooling layers, bridging classical and quantum paradigms. The convolutional layer is flexible, allowing tailored designs for specific tasks. Benchmarked on a node regression task with the QM9 dataset, our framework, using a single minimal circuit for all aggregation steps, handles molecules with varying numbers of atoms without changing qubits or circuit architecture. While classical GNNs achieve higher training performance, our quantum approach remains competitive and often shows enhanced generalization as molecular complexity increases. We also observe faster learning in early training epochs. To mitigate trainability limitations of a single-circuit setup, we extend the framework with multiple quantum aggregators on QM9. Assigning distinct circuits to each hop substantially improves training performance across all cases. Additionally, we numerically demonstrate the absence of barren plateaus as qubit numbers increase, suggesting that the proposed model remains trainable to larger, more complex graph-based problems.
This paper investigates the application of quantum annealing in conjunction with graph neural networks (GNNs) for solving complex combinatorial optimization problems. Traditional classical optimization algorithms often face significant challenges in identifying optimal solutions within large and intricate solution spaces. The core idea presented herein is to represent these problems as graphs and utilize the inherent quantum mechanical properties of quantum annealing to explore this space more efficiently. Specifically, GNNs are employed to generate embeddings of the graph, effectively encoding problem-specific features and relationships. This approach aims to bridge the gap between the probabilistic nature of quantum computation and the structural information captured by GNNs. We detail the theoretical framework, explore the potential benefits of this hybrid approach, and outline a methodology for integrating these techniques. The potential for improved optimization performance compared to conventional methods is discussed, highlighting the synergy between quantum annealing's ability to find low-energy states and GNNs' capacity to learn complex graph representations.
The transition toward a decarbonized power grid introduces increasing operational complexity driven by variable renewable, distributed energy resources, electric vehicles, and energy storage resources. These dynamics require rapid and efficient solutions to the Unit Commitment (UC) problem, which classical computing may struggle. Quantum Computing (QC) offers a promising alternative by exploiting qubits’ exponential information capacity to accelerate large-scale optimization. This paper presents a novel integrated QC-based approach to solve UC through synergistic integration of Quantum Feasibility Labeling (QFL), Variational Quantum Search (VQS), and Quantum Global Minimum Finder (QGMF). It enhances feasible-state identification and global optimum discovery, addressing the limitations of existing algorithms such as the Quantum Approximate Optimization Algorithm. Two illustrative UC case studies are used to demonstrate the approach. Results indicate that the combined QFL-VQS-QGMF framework can identify the optimal UC solution accurately. This work highlights the potential of hybrid quantum–classical optimization as a foundational step toward scalable quantum solutions for future grid operations.
Modern High-Performance Computing (HPC) infrastructures are increasingly integrating multiple Quantum Processing Units (QPUs) of different types alongside classical resources. Unlike traditional accelerator scheduling, quantum device selection affects not only performance but also the quality of the computed result because current quantum hardware exhibits device-dependent noise characteristics. This makes efficient and fidelity-based device selection a key challenge in multi-QPU environments. In this work, we propose a Graph Neural Network (GNN) model that exploits the structural representation of quantum circuits to predict their execution fidelity across different QPUs. By operating on uncompiled circuits, the approach supports earlystage device selection and enables making informed scheduling decisions. We evaluate the model on a diverse set of benchmark circuits compiled for superconducting and trapped-ion devices. The results show that the proposed approach outperforms existing baseline models, achieving 30% Mean Squared Error (MSE) and 20% Mean Absolute Error (MAE) reduction, and provides an effective basis for fidelity-based scheduling in heterogeneous HPC-quantum systems.