Hybrid Quantum Neural Networks for Efficient Protein-Ligand Binding Affinity Prediction
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 22 of its 80 references that are in the map. First posted on arXiv 14 Sep 2025.
Builds on
22 of 80 references.
References · 22
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,442
- 2020The effect of data encoding on the expressive power of variational quantum machine learning modelscited by 333
- 2017The Expressive Power of Neural Networks: A View from the Widthcited by 320
- 2018DeepDTA: Deep Drug-Target Binding Affinity Predictioncited by 173
- 2020Robust data encodings for quantum classifierscited by 91
- 2023Quantum machine learning for image classificationcited by 57
- 2018DeepAffinity: Interpretable Deep Learning of Compound-Protein Affinity through Unified Recurrent and Convolutional Neural Networkscited by 52
- 2017Development and evaluation of a deep learning model for protein-ligand binding affinity predictioncited by 51
- 2017Quantum Neuron: an elementary building block for machine learning on quantum computerscited by 35
- 2019WideDTA: prediction of drug-target binding affinitycited by 30
- 2023QKSAN: A Quantum Kernel Self-Attention Networkcited by 23
10 more
- 2021Hybrid Quantum Classical Graph Neural Networks for Particle Track Reconstructioncited by 20
- 2022Power and limitations of single-qubit native quantum neural networkscited by 19
- 2019DeepAtom: A Framework for Protein-Ligand Binding Affinity Predictioncited by 14
- 2022The Complexity of NISQcited by 13
- 2024IBM Quantum Computers: Evolution, Performance, and Future Directionscited by 11
- 2022Quantum activation functions for quantum neural networkscited by 10
- 2023Nav-Q: Quantum Deep Reinforcement Learning for Collision-Free Navigation of Self-Driving Carscited by 8
- 2023A hybrid quantum-classical fusion neural network to improve protein-ligand binding affinity predictions for drug discoverycited by 4
- 2023Enabling Non-Linear Quantum Operations through Variational Quantum Splinescited by 3
- 2025Quantum Annealing-Based Sum Rate Maximization for Multi-UAV-Aided Wireless Networkscited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.