Sampling Rare Conformational Transitions with a Quantum Computer

Abstract

Spontaneous structural rearrangements play a central role in the organization and function of complex biomolecular systems. In principle, physics-based computer simulations like Molecular Dynamics (MD) enable us to investigate these thermally activated processes with an atomic level of resolution. However, rare conformational transitions are intrinsically hard to investigate with MD, because an exponentially large fraction of computational resources must be invested to simulate thermal fluctuations in metastable states. Path sampling methods like Transition Path Sampling hold the great promise of focusing the available computational power on sampling the rare stochastic transition between metastable states. In these approaches, one of the outstanding limitations is to generate paths that visit significantly different regions of the conformational space at a low computational cost. To overcome these problems we introduce a rigorous approach that integrates a machine learning algorithm and MD simulations implemented on a classical computer with adiabatic quantum computing. First, using functional integral methods, we derive a rigorous low-resolution representation of the system's dynamics, based on a small set of molecular configurations generated with machine learning. Then, a quantum annealing machine is employed to explore the transition path ensemble of this low-resolution theory, without introducing un-physical biasing forces to steer the system's dynamics. Using the D-Wave quantum computer, we validate our scheme by simulating a benchmark conformational transition in a state-of-the-art atomistic description. We show that the quantum computing step generates uncorrelated trajectories, thus facilitating the sampling of the transition region in configuration space. Our results provide a new paradigm for MD simulations to integrate machine learning and quantum computing.

arXiv comment21 pages, 14 figures

References in corpus (38)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Escaping free-energy minima
• Quantum computational advantage using photons
• Quantum computational chemistry
• Adiabatic Quantum Computing
• Quantum Chemistry in the Age of Quantum Computing
• Machine learning for molecular simulation
• Programmable quantum simulation of 2D antiferromagnets with hundreds of Rydberg atoms
• Quantum Annealing and Analog Quantum Computation
• Perspectives of quantum annealing: Methods and implementations
• Simulating Lattice Gauge Theories within Quantum Technologies
• Quantum chemistry calculations on a trapped-ion quantum simulator
• Quantum Simulations of Lattice Gauge Theories using Ultracold Atoms in Optical Lattices
• Cloud Quantum Computing of an Atomic Nucleus
• A compact ion-trap quantum computing demonstrator
• Can One Trust Quantum Simulators?
• Lattice gauge theories simulations in the quantum information era
• Estimation of effective temperatures in quantum annealers for sampling applications: A case study with possible applications in deep learning
• The prospects of quantum computing in computational molecular biology
• Dominant Pathways in Protein Folding
• Searching for quantum speedup in quasistatic quantum annealers
• Neural networks-based variationally enhanced sampling
• iMapD: intrinsic Map Dynamics exploration for uncharted effective free energy landscapes
• Quantum-Assisted Learning of Hardware-Embedded Probabilistic Graphical Models
• Quantitative Protein Dynamics from Dominant Folding Pathways
• A cross-disciplinary introduction to quantum annealing-based algorithms
• Role of Single Qubit Decoherence Time in Adiabatic Quantum Computation
• Polymer Physics by Quantum Computing
• Uncertain fate of fair sampling in quantum annealing
• Maximum-Entropy Inference with a Programmable Annealer
• Fair Sampling by Simulated Annealing on Quantum Annealer
• Programmable Superpositions of Ising Configurations
• Dimensional Reduction of Markov State Models from Renormalization Group Theory
• Sampling, rates, and reaction currents through reverse stochastic quantization on quantum computers
• Dominant Reaction Pathways by Quantum Computing
• Fair Sampling Error Analysis on NISQ Devices
• Quantum Approach to Fast Protein-Folding Time
• Simulating Stochastic Dynamics Using Large Time Steps

Cited by in corpus (6)

• Quantum Computing for Molecular Biology
• Quantum computing for chemistry and physics applications from a Monte Carlo perspective
• De Novo Design of Protein-Binding Peptides by Quantum Computing
• Accelerating equilibrium spin-glass simulations using quantum annealers via generative deep learning
• Sampling a rare protein transition with a hybrid classical-quantum computing algorithm
• Computing Canonical Averages with Quantum and Classical Optimizers: Thermodynamic Reweighting for QUBO Models of Physical Systems