Leveraging Analog Quantum Computing with Neutral Atoms for Solvent Configuration Prediction in Drug Discovery
arXiv:2309.12129 · doi:10.1103/PhysRevResearch.6.043020
Abstract
We introduce quantum algorithms able to sample equilibrium water solvent molecules configurations within proteins thanks to analog quantum computing. To do so, we combine a quantum placement strategy to the 3D Reference Interaction Site Model (3D-RISM), an approach capable of predicting continuous solvent distributions. The intrinsic quantum nature of such coupling guarantees molecules not to be placed too close to each other, a constraint usually imposed by hand in classical approaches. We present first a full quantum adiabatic evolution model that uses a local Rydberg Hamiltonian to cast the general problem into an anti-ferromagnetic Ising model. Its solution, an NP-hard problem in classical computing, is embodied into a Rydberg atom array Quantum Processing Unit (QPU). Following a classical emulator implementation, a QPU portage allows to experimentally validate the algorithm performances on an actual quantum computer. As a perspective of use on next generation devices, we emulate a second hybrid quantum-classical version of the algorithm. Such a variational quantum approach (VQA) uses a classical Bayesian minimization routine to find the optimal laser parameters. Overall, these Quantum-3D-RISM (Q-3D-RISM) algorithms open a new route towards the application of analog quantum computing in molecular modelling and drug design.
References in corpus (27)
- SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
- Variational Quantum Algorithms
- Ising formulations of many NP problems
- Quantum Annealing in the Transverse Ising Model
- Barren plateaus in quantum neural network training landscapes
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Noisy intermediate-scale quantum (NISQ) algorithms
- Quantum computational chemistry
- Quantum Chemistry in the Age of Quantum Computing
- Programmable quantum simulation of 2D antiferromagnets with hundreds of Rydberg atoms
- Quantum Annealing and Analog Quantum Computation
- Quantum computing with neutral atoms
- Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays
- Is there evidence for exponential quantum advantage in quantum chemistry?
- The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size
- Coherent quantum annealing in a programmable 2000-qubit Ising chain
- First order phase transition in the Quantum Adiabatic Algorithm
- Molecular Docking with Gaussian Boson Sampling
- Gaussian Boson Sampling with Pseudo-Photon-Number Resolving Detectors and Quantum Computational Advantage
- Tinker-HP : Accelerating Molecular Dynamics Simulations of Large Complex Systems with Advanced Point Dipole Polarizable Force Fields using GPUs and Multi-GPUs systems
- Exponential Complexity of the Quantum Adiabatic Algorithm for certain Satisfiability Problems
- Pulser: An open-source package for the design of pulse sequences in programmable neutral-atom arrays
- Overlap-ADAPT-VQE: Practical Quantum Chemistry on Quantum Computers via Overlap-Guided Compact Ansätze
- A universal programmable Gaussian Boson Sampler for drug discovery
- Complexity of several constraint satisfaction problems using the heuristic, classical, algorithm, WalkSAT
- Calculating the ground state energy of benzene under spatial deformations with noisy quantum computing
- Robustly Learning Mixtures of Arbitrary Gaussians