Dominant Reaction Pathways by Quantum Computing
arXiv:2007.13788 · doi:10.1103/PhysRevLett.126.028104
Abstract
Characterizing thermally activated transitions in high-dimensional rugged energy surfaces is a very challenging task for classical computers. Here, we develop a quantum annealing scheme to solve this problem. First, the task of finding the most probable transition paths in configuration space is reduced to a shortest-path problem defined on a suitable weighted graph. Next, this optimization problem is mapped into finding the ground state of a generalized Ising model. A finite-size scaling analysis suggests this task may be solvable efficiently by a quantum annealing machine. Our approach leverages on the quantized nature of qubits to describe transitions between different system's configurations. Since it does not involve any lattice space discretization, it paves the way towards future biophysical applications of quantum computing based on realistic all-atom models.
arXiv comment4 + 4 pages, 2 + 3 figures. Version accepted at PRL. Includes classical solution for a small protein, a finite-size scaling analysis, and calculations on a D-WAVE quantum annealer
References in corpus (20)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Escaping free-energy minima
- Adiabatic Quantum Computing
- Quantum Chemistry in the Age of Quantum Computing
- Quantum Annealing and Analog Quantum Computation
- Perspectives of quantum annealing: Methods and implementations
- Anderson localization casts clouds over adiabatic quantum optimization
- The prospects of quantum computing in computational molecular biology
- Quantum annealing versus classical machine learning applied to a simplified computational biology problem
- Dominant Pathways in Protein Folding
- Adiabatic quantum dynamics of a random Ising chain across its quantum critical point
- iMapD: intrinsic Map Dynamics exploration for uncharted effective free energy landscapes
- Exponential Complexity of the Quantum Adiabatic Algorithm for certain Satisfiability Problems
- Quantitative Protein Dynamics from Dominant Folding Pathways
- A cross-disciplinary introduction to quantum annealing-based algorithms
- Quantum annealing of the -spin model under inhomogeneous transverse field driving
- Probing Entanglement in Adiabatic Quantum Optimization with Trapped Ions
- VanQver: The Variational and Adiabatically Navigated Quantum Eigensolver
- Quantum Approach to Fast Protein-Folding Time
- Microscopically Computing Free-energy Profiles and Transition Path Time of Rare Macromolecular Transitions
Cited by in corpus (7)
- Quantum Computing for Molecular Biology
- Biology and medicine in the landscape of quantum advantages
- Polymer Physics by Quantum Computing
- Sampling, rates, and reaction currents through reverse stochastic quantization on quantum computers
- Sampling Rare Conformational Transitions with a Quantum Computer
- Multi-Objective Optimization and Network Routing with Near-Term Quantum Computers
- Sampling a rare protein transition with a hybrid classical-quantum computing algorithm