Towards molecular docking with neutral atoms
- URL: http://arxiv.org/abs/2402.06770v1
- Date: Fri, 9 Feb 2024 20:13:55 GMT
- Title: Towards molecular docking with neutral atoms
- Authors: Mathieu Garrigues, Victor Onofre, No\'e Bosc-Haddad
- Abstract summary: 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.
Results for multiple graphs are presented, and a small instance of the molecular docking problem is solved.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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.
Related papers
- Quantum Information Processing with Molecular Nanomagnets: an introduction [49.89725935672549]
We provide an introduction to Quantum Information Processing, focusing on a promising setup for its implementation.
We introduce the basic tools to understand and design quantum algorithms, always referring to their actual realization on a molecular spin architecture.
We present some examples of quantum algorithms proposed and implemented on a molecular spin qudit hardware.
arXiv Detail & Related papers (2024-05-31T16:43:20Z) - Molecular unfolding formulation with enhanced quantum annealing approach [0.0]
Molecular unfolding problem aims to find the torsional configuration that increases the inter-atomic distance within a molecule.
Quantum annealing approach first encodes the problem into a Higher-order Unconstrained Binary Optimization (HUBO) equation.
The resultant HUBO is then converted to a Quadratic Unconstrained Binary Optimization equation (QUBO)
arXiv Detail & Related papers (2024-03-01T13:09:46Z) - ATOM: An Efficient Topology Adaptive Algorithm for Minor Embedding in
Quantum Computing [18.594343052664335]
We introduce a novel notion of adaptive topology which is an expandable subgraph of the hardware graph.
ATOM iteratively selects a node from the logical graph, and embeds it to the adaptive topology of the hardware graph.
Our experimental results show that ATOM is able to provide a feasible embedding in much smaller running time than that of the state-of-the-art.
arXiv Detail & Related papers (2023-07-04T17:45:07Z) - A hybrid quantum-classical algorithm for multichannel quantum scattering
of atoms and molecules [62.997667081978825]
We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions.
The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix.
We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
arXiv Detail & Related papers (2023-04-12T18:10:47Z) - Ab-initio quantum chemistry with neural-network wavefunctions [2.3306857544105686]
Key application of machine learning in the molecular sciences is to learn potential energy surfaces or force fields.
We focus on quantum Monte Carlo (QMC) methods that use neural network ansatz functions in order to solve the electronic Schr"odinger equation.
arXiv Detail & Related papers (2022-08-26T11:33:31Z) - From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions.
For its practicability and wide-applicability, we give a brief review of typical graph learning techniques.
We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
arXiv Detail & Related papers (2022-02-19T02:56:47Z) - Quantum Molecular Unfolding [0.5677685109155078]
We focus on one specific phase of the molecular docking procedure i.e. Molecular Unfolding (MU)
The objective of the MU problem is to find the configuration that maximizes the molecular area, or equivalently, that maximizes the internal distances between atoms inside the molecule.
We propose a quantum annealing approach to MU by formulating it as a High-order Unconstrained Binary Optimization (HUBO)
Results and performances obtained with quantum annealers are compared with state of art classical solvers.
arXiv Detail & Related papers (2021-07-28T19:28:28Z) - Computing molecular excited states on a D-Wave quantum annealer [52.5289706853773]
We demonstrate the use of a D-Wave quantum annealer for the calculation of excited electronic states of molecular systems.
These simulations play an important role in a number of areas, such as photovoltaics, semiconductor technology and nanoscience.
arXiv Detail & Related papers (2021-07-01T01:02:17Z) - Variational quantum algorithm for molecular geometry optimization [0.0]
We introduce a variational quantum algorithm for finding the most stable structure of a molecule.
The equilibrium geometry of the molecule is obtained by minimizing a more general cost function.
All quantum simulations are performed using the PennyLane library for quantum differentiable programming.
arXiv Detail & Related papers (2021-06-25T18:34:44Z) - Advanced Graph and Sequence Neural Networks for Molecular Property
Prediction and Drug Discovery [53.00288162642151]
We develop MoleculeKit, a suite of comprehensive machine learning tools spanning different computational models and molecular representations.
Built on these representations, MoleculeKit includes both deep learning and traditional machine learning methods for graph and sequence data.
Results on both online and offline antibiotics discovery and molecular property prediction tasks show that MoleculeKit achieves consistent improvements over prior methods.
arXiv Detail & Related papers (2020-12-02T02:09:31Z) - ASGN: An Active Semi-supervised Graph Neural Network for Molecular
Property Prediction [61.33144688400446]
We propose a novel framework called Active Semi-supervised Graph Neural Network (ASGN) by incorporating both labeled and unlabeled molecules.
In the teacher model, we propose a novel semi-supervised learning method to learn general representation that jointly exploits information from molecular structure and molecular distribution.
At last, we proposed a novel active learning strategy in terms of molecular diversities to select informative data during the whole framework learning.
arXiv Detail & Related papers (2020-07-07T04:22:39Z)
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.