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

A hybrid quantum-classical neural network for learning to route

Marcus Rolf Peter Ritt, Alexsandro Santos da Rosa Júnior, Marcos Vinicius Reballo, Cesar Augusto do Amaral, Fernando Augusto Caletti de Barros

cs.LGquant-phSubmitted Aug 31, 2026• Announced Sep 2, 2026• 1 citation
arXivHTMLPDF

Abstract

This work studies hybrid quantum-classical neural networks for learning routing heuristics. Specifically, this paper asks whether small quantum neural networks can replace parameter-heavy modules inside a competitive attention-based routing model while maintaining solution quality. For the capacitated vehicle routing problem, encoder feed-forward replacement emerges as the most promising design: it reduces the number of model parameters by 56.6% while keeping the hybrid model close to the classical neural baseline at small and medium instance sizes, although the gap grows for larger instances. This work also compares to classical routing algorithms, which remain highly competitive and often superior on the fixed Euclidean test sets. Our results therefore do not indicate quantum advantage or solver dominance, but identify encoder feed-forward replacement as a viable hybrid-module compression strategy for neural combinatorial optimization.

Comments
5 pages. Submitted to the Congresso Brasileiro de Ciências e Tecnologias Quânticas (CBCTQ 2026)

Related papers

Quantum Neural Networks for a Supply Chain Logistics Application

Randall Correll, Sean J. Weinberg, Fabio Sanches +2 more

Abstract Problem instances of a size suitable for practical applications are not likely to be addressed during the noisy intermediate‐scale quantum (NISQ) period with (almost) pure quantum algorithms. Hybrid classical‐quantum algorithms have potential, however, to achieve good performance on much larger problem instances. One such hybrid algorithm on a problem of substantial importance: vehicle routing for supply chain logistics with multiple trucks and complex demand structure is investigated. Reinforcement learning with neural networks with embedded quantum circuits is used. In such neural networks, projecting high‐dimensional feature vectors down to smaller vectors is necessary to accommodate restrictions on the number of qubits of NISQ hardware. However, a multi‐head attention mechanism is used where, even in classical machine learning, such projections are natural and desirable. Data from the truck routing logistics of a company in the automotive sector is considered, and the methodology is applied by decomposing into small teams of trucks and results are found comparable to human truck assignment.

arXiv:2212.00576•Advanced Quantum Technologies•May 18, 2023•32 citations

Short quantum circuits in reinforcement learning policies for the vehicle routing problem

Fabio Sanches, Sean J. Weinberg, Takanori Ide +1 more

Quantum computing and machine learning have potential for symbiosis. However, in addition to the hardware limitations from current devices, there are still basic issues that must be addressed before quantum circuits can usefully incorporate with current machine learning tasks. We report a strategy for such an integration in the context of attention models used for reinforcement learning. Agents that implement attention mechanisms have successfully been applied to certain cases of combinatorial routing problems by first encoding nodes on a graph and then sequentially decoding nodes until a route is selected. We demonstrate that simple quantum circuits can be used in place of classical attention head layers while maintaining performance. Our method modifies attention mechanisms by replacing key and query vectors for every node with quantum states that are entangled before being measured. The resulting hybrid classical-quantum agent is tested in the context of vehicle routing problems where its performance is competitive with the original classical approach. We regard our model as a prototype that can be scaled up and as an avenue for further study on the role of quantum computing in reinforcement learning.

arXiv:2109.07498•Physical Review A•Jun 3, 2022•20 citations

Learning to learn with quantum neural networks via classical neural networks

Guillaume Verdon, Michael Broughton, Jarrod R. McClean +5 more

Quantum Neural Networks (QNNs) are a promising variational learning paradigm with applications to near-term quantum processors, however they still face some significant challenges. One such challenge is finding good parameter initialization heuristics that ensure rapid and consistent convergence to local minima of the parameterized quantum circuit landscape. In this work, we train classical neural networks to assist in the quantum learning process, also know as meta-learning, to rapidly find approximate optima in the parameter landscape for several classes of quantum variational algorithms. Specifically, we train classical recurrent neural networks to find approximately optimal parameters within a small number of queries of the cost function for the Quantum Approximate Optimization Algorithm (QAOA) for MaxCut, QAOA for Sherrington-Kirkpatrick Ising model, and for a Variational Quantum Eigensolver for the Hubbard model. By initializing other optimizers at parameter values suggested by the classical neural network, we demonstrate a significant improvement in the total number of optimization iterations required to reach a given accuracy. We further demonstrate that the optimization strategies learned by the neural network generalize well across a range of problem instance sizes. This opens up the possibility of training on small, classically simulatable problem instances, in order to initialize larger, classically intractably simulatable problem instances on quantum devices, thereby significantly reducing the number of required quantum-classical optimization iterations.

arXiv:1907.05415•Jul 11, 2019•274 citations

Hybrid quantum neural networks for efficient protein-ligand binding affinity prediction

Seon-Geun Jeong, Kyeong-Hwan Moon, Won–Joo Hwang

Protein-ligand binding affinity is critical in drug discovery, but experimentally determining it is time-consuming and expensive. Artificial intelligence (AI) has been used to predict binding affinity, significantly accelerating this process. However, the high-performance requirements and vast datasets involved in affinity prediction demand increasingly large AI models, requiring substantial computational resources and training time. Quantum machine learning has emerged as a promising solution to these challenges. In particular, hybrid quantum-classical models can reduce the number of parameters while maintaining or improving performance compared to classical counterparts. Despite these advantages, challenges persist: why hybrid quantum models achieve these benefits, whether quantum neural networks (QNNs) can replace classical neural networks, and whether such models are feasible on noisy intermediate-scale quantum (NISQ) devices. This study addresses these challenges by proposing a hybrid quantum neural network (HQNN) that empirically demonstrates the capability to approximate non-linear functions in the latent feature space derived from classical embedding. The primary goal of this study is to achieve a parameter-efficient model in binding affinity prediction while ensuring feasibility on NISQ devices. Numerical results indicate that HQNN achieves comparable or superior performance and parameter efficiency compared to classical neural networks, underscoring its potential as a viable replacement. This study highlights the potential of hybrid QML in computational drug discovery, offering insights into its applicability and advantages in addressing the computational challenges of protein-ligand binding affinity prediction.

arXiv:2509.11046•EPJ Quantum Technology•Oct 22, 2025•5 citations

A Quantum Q-Learning Model for the Capacitated Vehicle Routing Problem

Junde Xu, Ningyi Xie, Xinwei Lee +3 more

The research on Variational Quantum Algorithms (VQAs) has gained significant momentum because of their promising practicality in the noisy intermediate-scale quantum (NISQ) era. Recent studies highlight the potential of VQAs in reinforcement learning (RL) by replacing classical components with parameterized quantum circuits (PQCs). Building on this, we propose a quantum Q-learning model for the Capacitated Vehicle Routing Problem (CVRP), combining a PQC with an RL training process. We present a PQC for embedding both static and dynamic states in RL environments. The proposed PQC approximates the Q-value function by using the expectation values of different observables. Experimental results demonstrate that the proposed PQC outperforms the existing PQC for the CVRP with fewer quantum resources. Furthermore, our method shows competitive performance compared to the classical counterpart.

IEEE International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC)•Dec 16, 2024•3 citations

Hybrid Quantum-Classical Neural Networks: Bridging Deep Learning and Quantum Computing for Image Classification

Akash Jha, Rahul Bhandari, Raman Chadha

Given the recent prominence of Noisy Intermediate Scale Quantum (NISQ) devices, hybrid quantum-classical neural networks have recently drawn a lot of excitement as a potential solution to improving learning efficiency. Our current paper describes a Hybrid Quantum-Classical Convolutional Neural Network (HQCNN) which is defined as a pretrained backbone of ResNet-18 and a small quantum-enhanced feature-transformation layer of Qiskit. The convolutional high-dimensional features are reduced to the classical eight-dimensional one, which in turn is encoded into a four-qubit parameterized quantum circuit. The resultant quantum expectation values are combined with the compressed features to come up with a hybridized representation of twelve dimensions, used to classify multi-class dataset. Experimental analysis of CIFAR10 data has shown that the suggested HQCNN achieves a test accuracy of 94.74% and improves class-wise precision, recall, and F1-scores than a number of existing hybrid models while using a significantly smaller number of latent features. More investigation into the quantum module indicates that it is predictable about scalability to batch, resistant to perturbations in features, and efficiently performed by evaluating circuit vectors. These results indicate that compact and expressive representations of images that can be helpful in the NISQ era can be acquired using hybrid architectures, thus providing a practical way to forward the benefits of quantum to modern deep-learning pipelines.

International Conference on Emerging Computational Intelligence (ICECI)•Apr 4, 2026•0 citations
This work studies hybrid quantum-classical neural networks for learning routing heuristics. Specifically, this paper asks whether small quantum neural networks can replace parameter-heavy modules inside a competitive attention-based routing model while maintaining solution quality. For the capacitated vehicle routing problem, encoder feed-forward replacement emerges as the most promising design: it reduces the number of model parameters by 56.6% while keeping the hybrid model close to the classical neural baseline at small and medium instance sizes, although the gap grows for larger instances. This work also compares to classical routing algorithms, which remain highly competitive and often superior on the fixed Euclidean test sets. Our results therefore do not indicate quantum advantage or solver dominance, but identify encoder feed-forward replacement as a viable hybrid-module compression strategy for neural combinatorial optimization.
Abstract Problem instances of a size suitable for practical applications are not likely to be addressed during the noisy intermediate‐scale quantum (NISQ) period with (almost) pure quantum algorithms. Hybrid classical‐quantum algorithms have potential, however, to achieve good performance on much larger problem instances. One such hybrid algorithm on a problem of substantial importance: vehicle routing for supply chain logistics with multiple trucks and complex demand structure is investigated. Reinforcement learning with neural networks with embedded quantum circuits is used. In such neural networks, projecting high‐dimensional feature vectors down to smaller vectors is necessary to accommodate restrictions on the number of qubits of NISQ hardware. However, a multi‐head attention mechanism is used where, even in classical machine learning, such projections are natural and desirable. Data from the truck routing logistics of a company in the automotive sector is considered, and the methodology is applied by decomposing into small teams of trucks and results are found comparable to human truck assignment.
Quantum computing and machine learning have potential for symbiosis. However, in addition to the hardware limitations from current devices, there are still basic issues that must be addressed before quantum circuits can usefully incorporate with current machine learning tasks. We report a strategy for such an integration in the context of attention models used for reinforcement learning. Agents that implement attention mechanisms have successfully been applied to certain cases of combinatorial routing problems by first encoding nodes on a graph and then sequentially decoding nodes until a route is selected. We demonstrate that simple quantum circuits can be used in place of classical attention head layers while maintaining performance. Our method modifies attention mechanisms by replacing key and query vectors for every node with quantum states that are entangled before being measured. The resulting hybrid classical-quantum agent is tested in the context of vehicle routing problems where its performance is competitive with the original classical approach. We regard our model as a prototype that can be scaled up and as an avenue for further study on the role of quantum computing in reinforcement learning.
Quantum Neural Networks (QNNs) are a promising variational learning paradigm with applications to near-term quantum processors, however they still face some significant challenges. One such challenge is finding good parameter initialization heuristics that ensure rapid and consistent convergence to local minima of the parameterized quantum circuit landscape. In this work, we train classical neural networks to assist in the quantum learning process, also know as meta-learning, to rapidly find approximate optima in the parameter landscape for several classes of quantum variational algorithms. Specifically, we train classical recurrent neural networks to find approximately optimal parameters within a small number of queries of the cost function for the Quantum Approximate Optimization Algorithm (QAOA) for MaxCut, QAOA for Sherrington-Kirkpatrick Ising model, and for a Variational Quantum Eigensolver for the Hubbard model. By initializing other optimizers at parameter values suggested by the classical neural network, we demonstrate a significant improvement in the total number of optimization iterations required to reach a given accuracy. We further demonstrate that the optimization strategies learned by the neural network generalize well across a range of problem instance sizes. This opens up the possibility of training on small, classically simulatable problem instances, in order to initialize larger, classically intractably simulatable problem instances on quantum devices, thereby significantly reducing the number of required quantum-classical optimization iterations.
Protein-ligand binding affinity is critical in drug discovery, but experimentally determining it is time-consuming and expensive. Artificial intelligence (AI) has been used to predict binding affinity, significantly accelerating this process. However, the high-performance requirements and vast datasets involved in affinity prediction demand increasingly large AI models, requiring substantial computational resources and training time. Quantum machine learning has emerged as a promising solution to these challenges. In particular, hybrid quantum-classical models can reduce the number of parameters while maintaining or improving performance compared to classical counterparts. Despite these advantages, challenges persist: why hybrid quantum models achieve these benefits, whether quantum neural networks (QNNs) can replace classical neural networks, and whether such models are feasible on noisy intermediate-scale quantum (NISQ) devices. This study addresses these challenges by proposing a hybrid quantum neural network (HQNN) that empirically demonstrates the capability to approximate non-linear functions in the latent feature space derived from classical embedding. The primary goal of this study is to achieve a parameter-efficient model in binding affinity prediction while ensuring feasibility on NISQ devices. Numerical results indicate that HQNN achieves comparable or superior performance and parameter efficiency compared to classical neural networks, underscoring its potential as a viable replacement. This study highlights the potential of hybrid QML in computational drug discovery, offering insights into its applicability and advantages in addressing the computational challenges of protein-ligand binding affinity prediction.
The research on Variational Quantum Algorithms (VQAs) has gained significant momentum because of their promising practicality in the noisy intermediate-scale quantum (NISQ) era. Recent studies highlight the potential of VQAs in reinforcement learning (RL) by replacing classical components with parameterized quantum circuits (PQCs). Building on this, we propose a quantum Q-learning model for the Capacitated Vehicle Routing Problem (CVRP), combining a PQC with an RL training process. We present a PQC for embedding both static and dynamic states in RL environments. The proposed PQC approximates the Q-value function by using the expectation values of different observables. Experimental results demonstrate that the proposed PQC outperforms the existing PQC for the CVRP with fewer quantum resources. Furthermore, our method shows competitive performance compared to the classical counterpart.
Given the recent prominence of Noisy Intermediate Scale Quantum (NISQ) devices, hybrid quantum-classical neural networks have recently drawn a lot of excitement as a potential solution to improving learning efficiency. Our current paper describes a Hybrid Quantum-Classical Convolutional Neural Network (HQCNN) which is defined as a pretrained backbone of ResNet-18 and a small quantum-enhanced feature-transformation layer of Qiskit. The convolutional high-dimensional features are reduced to the classical eight-dimensional one, which in turn is encoded into a four-qubit parameterized quantum circuit. The resultant quantum expectation values are combined with the compressed features to come up with a hybridized representation of twelve dimensions, used to classify multi-class dataset. Experimental analysis of CIFAR10 data has shown that the suggested HQCNN achieves a test accuracy of 94.74% and improves class-wise precision, recall, and F1-scores than a number of existing hybrid models while using a significantly smaller number of latent features. More investigation into the quantum module indicates that it is predictable about scalability to batch, resistant to perturbations in features, and efficiently performed by evaluating circuit vectors. These results indicate that compact and expressive representations of images that can be helpful in the NISQ era can be acquired using hybrid architectures, thus providing a practical way to forward the benefits of quantum to modern deep-learning pipelines.