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

Resource-Efficient Bio-Molecular Docking on a NISQ-era Digital Quantum Computer

Tianqi Chen, Adrian M. Mak, Jianguo Li, Jian Feng Kong, Chandra Verma, Sebastian Maurer-Stroh

On Aqora:Tianqi ChenTianqi Chen
quant-phcond-mat.softphysics.chem-phq-bio.BMSubmitted Aug 20, 2026• Announced Aug 21, 2026• 0 citations
arXivHTMLPDF

Abstract

Molecular docking is a vital computational task in drug discovery, wherein the objective is to efficiently identify optimal binding poses between a ligand and a target receptor protein. Due to the combinatorial explosion of possible binding configurations, docking of large and flexible molecules remains a computationally intensive problem, especially at scale. Early studies have revealed that the molecular docking can be re-cast as a maximum vertex-weighted clique problem (MVWCP) problem on a compatibility graph to be solved classically. In this work, we proposed a hybrid quantum-classical approach for molecular docking leveraging the MVWCP formalism with a variational full-basis encoding (FBE) strategy, which enables efficient encoding of classical binary variables with Bloch sphere vectors. We further prove that a global minimizer of the FBE objective can always be chosen to be a pure product state, thereby providing a rigorous justification for its optimization using a unitary variational circuit. The molecular docking problem is first mapped to a cost Hamiltonian that is minimized within a variational framework, optimized via a randomized imaginary time evolution (ITE)-inspired warm start, and gradient-based techniques. Finally, we also executed the circuit on an IBM quantum computer, underlying the feasibility and of quantum-assisted optimization for structure-based drug design and point towards the broader utility of advanced encoding techniques in quantum optimization for computational biology.

Comments
22 pages, 8 figures; Comments are welcome

Related papers

Quantum–Classical Neural Networks with Variational Circuits for Molecular Docking in Drug Discovery

K. Kalaiselvi, G. Husna Khouser, Kavitha A K +3 more

This work aims to propose a Quantum-Classical Neural Network with Variational quantum circuit (QCNN-VQC) to improve the accuracy of molecular docking in drug discovery. The model combines the classical feature extraction framework with quantum representations and energy-based optimisation to simulate intricate protein-ligand interactions. The molecular features are initially encoded into quantum states by first a standard neural network and then by encoding them into quantum states, where non-linear correlations and entanglement effects are modeled by variational circuits. An optimization strategy is used, that is quantum-inspired to achieve the minimum docking energy and find stable binding conformations. The experimental analysis of molecular docking datasets reveals that the proposed model achieves an accuracy of 91.2% compared to the classical neural networks (78.5%), and deep learning models (82.3%). The model also has a lower RMSE of 0.38 and higher R2score of 0.89 which means that it predicts better. The results of energy minimization indicate that the docking energy is greatly reduced, which proves the increased binding stability. The hybrid model is slightly more expensive to compute but it has competitive inference time. In general, QCNN VQC architecture offers a scalable and efficient drug discovery system; it can be optimally applied to quantum optimization in conjunction with deep learning and can result in a better prediction and strong molecular interaction modeling.

International Conference on Cognitive Computing and Networking Systems (ICC-CNS)•Jun 1, 2026•0 citations

Towards molecular docking with neutral atoms

Mathieu Garrigues, Victor Onofre, Noé Bosc-Haddad

New computational strategies, such as molecular docking, are emerging to speed up the drug discovery process. This method predicts the activity of molecules at the binding site of proteins, helping to select the ones that exhibit desirable behavior and rejecting the rest. However, for large chemical libraries, it is essential to search and score configurations using fewer computational resources while maintaining high precision. In this work, we map the molecular docking problem to a graph problem, a maximum-weight independent set problem on a unit-disk graph in a physical neutral atom quantum processor. Here, each vertex represents an atom trapped by optical tweezers. The Variational Quantum Adiabatic Algorithm (VQAA) approach is used to solve the generic graph problem with two optimization methods, Scipy and Hyperopt. Additionally, a machine learning method is explored using the adiabatic algorithm. Results for multiple graphs are presented, and a small instance of the molecular docking problem is solved, demonstrating the potential for near-term quantum applications.

arXiv:2402.06770•Feb 9, 2024•5 citations

Molecular Docking with Quantum Circuit Evolution

Gleydson Fernandes de Jesus, Bruno Oziel Fernandez, Marcelo A. Moret

Molecular docking is an important step in drug discovery, enabling the evaluation of receptor-ligand affinity while reducing experimental costs and increasing the number of possible tests. However, the high computational cost associated with molecular docking remains a limiting factor that can restrict both the experimental precision and the scale of the problems being addressed. To improve the future applicability of molecular docking, recent works have proposed the use of quantum algorithms based on Gaussian Boson Sampling quantum computers and also gate-based quantum computers. In this work, we propose the use of Quantum Circuit Evolution (QCE) for solving the molecular docking problem, a gate based and gradient-free quantum evolutionary method whose evolution is driven by the random application of unitary operations to a quantum circuit. The proposed algorithm demonstrated the ability to find the best solution to the problem in fewer steps than the methods presented in previous studies, exhibiting fast and stable convergence.

quant-pharXiv:2607.12060•Jul 15, 2026•1 citation

Quantum-Enhanced Computational Drug Discovery: Leveraging Variational Quantum Algorithms for Accurate Binding Affinity Prediction and Lead Optimization in Complex Biological Targets

Hande Selvi Yanık

Accurate prediction of binding affinities and efficient lead optimization remain central challenges in computational drug discovery, particularly for complex biological targets characterized by rugged energy landscapes, conformational heterogeneity, and high-dimensional interaction spaces. Classical computational methods—such as molecular docking, force-field–based simulations, and deep learning models—have made substantial progress, yet they often struggle to capture quantum-mechanical effects and long-range correlations critical to molecular recognition. This study explores a quantum-enhanced framework that integrates Variational Quantum Algorithms (VQAs), quantum-inspired Hamiltonian modeling, and hybrid quantum–classical optimization workflows to improve the fidelity and scalability of drug discovery pipelines. By encoding molecular interactions into parameterized quantum circuits, the framework leverages quantum superposition and entanglement to explore complex chemical space more efficiently, enabling refined estimation of binding energies and accelerated identification of high-quality leads. Preliminary simulations indicate that VQA-based estimators outperform classical baselines for challenging protein–ligand systems, reducing prediction error while maintaining computational tractability. These findings highlight the emerging potential of quantum technologies to enable more accurate, data-efficient, and mechanistically grounded drug discovery for next-generation therapeutics.

Next frontier.•Nov 28, 2025•0 citations

Quantum Approximate Optimization Algorithms for Molecular Docking

Christos Papalitsas, Yanfei Guan, Shreyas Waghe +3 more

Molecular docking is a critical process for drug discovery and challenging due to the complexity and size of biomolecular systems, where the optimal binding configuration of a drug to a target protein is determined. Hybrid classical-quantum computing techniques offer a novel approach to address these challenges. The Quantum Approximate Optimization Algorithm (QAOA) and its variations are hybrid classical-quantum techniques, and a promising tool for combinatorial optimization challenges. This paper presents a Digitized Counterdiabatic QAOA (DC-QAOA) approach to molecular docking. Simulated quantum runs were conducted on a GPU cluster. We examined 14 and 17 nodes instances - to the best of our knowledge the biggest published instance is 12-node at Ding et al. and we present the results. Based on computational results, we conclude that binding interactions represent the anticipated exact solution. Additionally, as the size of the examined instance increases, the computational times exhibit a significant escalation.

arXiv:2503.04239•Mar 6, 2025•11 citations

Quantum Molecular Docking with a Quantum-Inspired Algorithm

Yunting Li, Xiaopeng Cui, Zhaoping Xiong +5 more

Molecular docking (MD) is a crucial task in drug design, which predicts the position, orientation, and conformation of the ligand when it is bound to a target protein. It can be interpreted as a combinatorial optimization problem, where quantum annealing (QA) has shown a promising advantage for solving combinatorial optimization. In this work, we propose a novel quantum molecular docking (QMD) approach based on a QA-inspired algorithm. We construct two binary encoding methods to efficiently discretize the degrees of freedom with an exponentially reduced number of bits and propose a smoothing filter to rescale the rugged objective function. We propose a new quantum-inspired algorithm, hopscotch simulated bifurcation (hSB), showing great advantages in optimizing over extremely rugged energy landscapes. This hSB can be applied to any formulation of an objective function under binary variables. An adaptive local continuous search is also introduced for further optimization of the discretized solution from hSB. Concerning the stability of docking, we propose a perturbation detection method to help rank the candidate poses. We demonstrate our approach on a typical data set. QMD has shown advantages over the search-based Autodock Vina and the deep-learning DIFFDOCK in both redocking and self-docking scenarios. These results indicate that quantum-inspired algorithms can be applied to solve practical problems in drug discovery even before quantum hardware become mature.

arXiv:2404.08265•Journal of Chemical Theory and Computation•Jul 29, 2024•17 citations
Molecular docking is a vital computational task in drug discovery, wherein the objective is to efficiently identify optimal binding poses between a ligand and a target receptor protein. Due to the combinatorial explosion of possible binding configurations, docking of large and flexible molecules remains a computationally intensive problem, especially at scale. Early studies have revealed that the molecular docking can be re-cast as a maximum vertex-weighted clique problem (MVWCP) problem on a compatibility graph to be solved classically. In this work, we proposed a hybrid quantum-classical approach for molecular docking leveraging the MVWCP formalism with a variational full-basis encoding (FBE) strategy, which enables efficient encoding of classical binary variables with Bloch sphere vectors. We further prove that a global minimizer of the FBE objective can always be chosen to be a pure product state, thereby providing a rigorous justification for its optimization using a unitary variational circuit. The molecular docking problem is first mapped to a cost Hamiltonian that is minimized within a variational framework, optimized via a randomized imaginary time evolution (ITE)-inspired warm start, and gradient-based techniques. Finally, we also executed the circuit on an IBM quantum computer, underlying the feasibility and of quantum-assisted optimization for structure-based drug design and point towards the broader utility of advanced encoding techniques in quantum optimization for computational biology.
This work aims to propose a Quantum-Classical Neural Network with Variational quantum circuit (QCNN-VQC) to improve the accuracy of molecular docking in drug discovery. The model combines the classical feature extraction framework with quantum representations and energy-based optimisation to simulate intricate protein-ligand interactions. The molecular features are initially encoded into quantum states by first a standard neural network and then by encoding them into quantum states, where non-linear correlations and entanglement effects are modeled by variational circuits. An optimization strategy is used, that is quantum-inspired to achieve the minimum docking energy and find stable binding conformations. The experimental analysis of molecular docking datasets reveals that the proposed model achieves an accuracy of 91.2% compared to the classical neural networks (78.5%), and deep learning models (82.3%). The model also has a lower RMSE of 0.38 and higher R2score of 0.89 which means that it predicts better. The results of energy minimization indicate that the docking energy is greatly reduced, which proves the increased binding stability. The hybrid model is slightly more expensive to compute but it has competitive inference time. In general, QCNN VQC architecture offers a scalable and efficient drug discovery system; it can be optimally applied to quantum optimization in conjunction with deep learning and can result in a better prediction and strong molecular interaction modeling.
New computational strategies, such as molecular docking, are emerging to speed up the drug discovery process. This method predicts the activity of molecules at the binding site of proteins, helping to select the ones that exhibit desirable behavior and rejecting the rest. However, for large chemical libraries, it is essential to search and score configurations using fewer computational resources while maintaining high precision. In this work, we map the molecular docking problem to a graph problem, a maximum-weight independent set problem on a unit-disk graph in a physical neutral atom quantum processor. Here, each vertex represents an atom trapped by optical tweezers. The Variational Quantum Adiabatic Algorithm (VQAA) approach is used to solve the generic graph problem with two optimization methods, Scipy and Hyperopt. Additionally, a machine learning method is explored using the adiabatic algorithm. Results for multiple graphs are presented, and a small instance of the molecular docking problem is solved, demonstrating the potential for near-term quantum applications.
Molecular docking is an important step in drug discovery, enabling the evaluation of receptor-ligand affinity while reducing experimental costs and increasing the number of possible tests. However, the high computational cost associated with molecular docking remains a limiting factor that can restrict both the experimental precision and the scale of the problems being addressed. To improve the future applicability of molecular docking, recent works have proposed the use of quantum algorithms based on Gaussian Boson Sampling quantum computers and also gate-based quantum computers. In this work, we propose the use of Quantum Circuit Evolution (QCE) for solving the molecular docking problem, a gate based and gradient-free quantum evolutionary method whose evolution is driven by the random application of unitary operations to a quantum circuit. The proposed algorithm demonstrated the ability to find the best solution to the problem in fewer steps than the methods presented in previous studies, exhibiting fast and stable convergence.
Accurate prediction of binding affinities and efficient lead optimization remain central challenges in computational drug discovery, particularly for complex biological targets characterized by rugged energy landscapes, conformational heterogeneity, and high-dimensional interaction spaces. Classical computational methods—such as molecular docking, force-field–based simulations, and deep learning models—have made substantial progress, yet they often struggle to capture quantum-mechanical effects and long-range correlations critical to molecular recognition. This study explores a quantum-enhanced framework that integrates Variational Quantum Algorithms (VQAs), quantum-inspired Hamiltonian modeling, and hybrid quantum–classical optimization workflows to improve the fidelity and scalability of drug discovery pipelines. By encoding molecular interactions into parameterized quantum circuits, the framework leverages quantum superposition and entanglement to explore complex chemical space more efficiently, enabling refined estimation of binding energies and accelerated identification of high-quality leads. Preliminary simulations indicate that VQA-based estimators outperform classical baselines for challenging protein–ligand systems, reducing prediction error while maintaining computational tractability. These findings highlight the emerging potential of quantum technologies to enable more accurate, data-efficient, and mechanistically grounded drug discovery for next-generation therapeutics.
Molecular docking is a critical process for drug discovery and challenging due to the complexity and size of biomolecular systems, where the optimal binding configuration of a drug to a target protein is determined. Hybrid classical-quantum computing techniques offer a novel approach to address these challenges. The Quantum Approximate Optimization Algorithm (QAOA) and its variations are hybrid classical-quantum techniques, and a promising tool for combinatorial optimization challenges. This paper presents a Digitized Counterdiabatic QAOA (DC-QAOA) approach to molecular docking. Simulated quantum runs were conducted on a GPU cluster. We examined 14 and 17 nodes instances - to the best of our knowledge the biggest published instance is 12-node at Ding et al. and we present the results. Based on computational results, we conclude that binding interactions represent the anticipated exact solution. Additionally, as the size of the examined instance increases, the computational times exhibit a significant escalation.
Molecular docking (MD) is a crucial task in drug design, which predicts the position, orientation, and conformation of the ligand when it is bound to a target protein. It can be interpreted as a combinatorial optimization problem, where quantum annealing (QA) has shown a promising advantage for solving combinatorial optimization. In this work, we propose a novel quantum molecular docking (QMD) approach based on a QA-inspired algorithm. We construct two binary encoding methods to efficiently discretize the degrees of freedom with an exponentially reduced number of bits and propose a smoothing filter to rescale the rugged objective function. We propose a new quantum-inspired algorithm, hopscotch simulated bifurcation (hSB), showing great advantages in optimizing over extremely rugged energy landscapes. This hSB can be applied to any formulation of an objective function under binary variables. An adaptive local continuous search is also introduced for further optimization of the discretized solution from hSB. Concerning the stability of docking, we propose a perturbation detection method to help rank the candidate poses. We demonstrate our approach on a typical data set. QMD has shown advantages over the search-based Autodock Vina and the deep-learning DIFFDOCK in both redocking and self-docking scenarios. These results indicate that quantum-inspired algorithms can be applied to solve practical problems in drug discovery even before quantum hardware become mature.