Quantum Machine Learning for Predicting Binding Free Energies in Structure-Based Virtual Screening

• URL: http://arxiv.org/abs/2507.18425v1
• Date: Thu, 24 Jul 2025 14:01:39 GMT
• Title: Quantum Machine Learning for Predicting Binding Free Energies in Structure-Based Virtual Screening
• Authors: Pei-Kun Yang,
• Abstract summary: We introduce a quantum machine learning approach that encodes molecular information into quantum states.<n>With six quantum circuit units, the model achieves an RMSD of 2.37 kcal/mol and a Pearson correlation of 0.650.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In structure-based virtual screening, it is often necessary to evaluate the binding free energy of protein-ligand complexes by considering not only molecular conformations but also how these structures shift and rotate in space. The number of possible combinations grows rapidly and can become overwhelming. While classical computing has limitations in this context, quantum computing offers a promising alternative due to its inherent parallelism. In this study, we introduce a quantum machine learning approach that encodes molecular information into quantum states and processes them using parameterized quantum gates. The model is implemented and trained using PyTorch, and its performance is evaluated under three settings: ideal simulation, limited-shot sampling, and simulations with quantum noise. With six quantum circuit units, the model achieves an RMSD of 2.37 kcal/mol and a Pearson correlation of 0.650. Even when using 100,000 shots, the predictions remain consistent, indicating that the model is compatible with near-term quantum hardware. Although noise slightly reduces accuracy, the ranking of ligand affinities remains largely unchanged. These findings point to a practical and scalable strategy that balances robustness and predictive power, offering a viable path to accelerate virtual screening through moderately deep quantum circuits.

Related papers

• High-fidelity collisional quantum gates with fermionic atoms [0.9185835982622453]
  Fermionic quantum computers offer prospect of directly implementing electronic structure problems.<n>We demonstrate collisional entangling gates with fidelities up to 99.75(6)% and lifetimes of Bell states beyond $10,s$ via the control of fermionic atoms in an optical superlattice.
  arXiv  Detail & Related papers  (2025-06-17T16:50:08Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Equilibrium Propagation for efficient training of quantum systems based on Onsager reciprocity [0.0]
  Equilibrium propagation (EP) is a procedure that has been introduced and applied to classical energy-based models which relax to an equilibrium. Here, we show a direct connection between EP and Onsager reciprocity and exploit this to derive a quantum version of EP. This can be used to optimize loss functions that depend on the expectation values of observables of an arbitrary quantum system.
  arXiv  Detail & Related papers  (2024-06-10T17:22:09Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• TenCirChem: An Efficient Quantum Computational Chemistry Package for the NISQ Era [11.231358835691962]
  TenCirChem is an open-source library for variation simulatingal quantum algorithms for quantum computational chemistry. TenCirChem shows high performance on the simulation of unitary coupled-cluster circuits. TenCirChem is capable of running real quantum hardware experiments.
  arXiv  Detail & Related papers  (2023-03-20T01:47:45Z)
• Differentiable matrix product states for simulating variational quantum computational chemistry [6.954927515599816]
  We propose a parallelizable classical simulator for variational quantum eigensolver(VQE) Our simulator seamlessly integrates the quantum circuit evolution into the classical auto-differentiation framework. As applications, we use our simulator to study commonly used small molecules such as HF, LiH and H$$O, as well as larger molecules CO$$, BeH$ and H$_4$ with up to $40$ qubits.
  arXiv  Detail & Related papers  (2022-11-15T08:36:26Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• Holographic dynamics simulations with a trapped ion quantum computer [0.0]
  We demonstrate and benchmark a new scalable quantum simulation paradigm. Using a Honeywell trapped ion quantum processor, we simulate the non-integrable dynamics of the self-dual kicked Ising model. Results suggest that quantum tensor network methods, together with state-of-the-art quantum processor capabilities, enable a viable path to practical quantum advantage in the near term.
  arXiv  Detail & Related papers  (2021-05-19T18:00:02Z)
• A systematic variational approach to band theory in a quantum computer [0.0]
  We present a hybrid quantum-classical algorithm to solve the band structure of any periodic system. We show that the algorithm is reliable in a low-noise device, functional with low precision on present-day noisy quantum computers.
  arXiv  Detail & Related papers  (2021-04-07T21:50:19Z)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.