QFold: Quantum Walks and Deep Learning to Solve Protein Folding
arXiv:2101.10279 · doi:10.1088/2058-9565/ac4f2f
Abstract
Predicting the 3D structure of proteins is one of the most important problems in current biochemical research. In this article, we explain how to combine recent deep learning advances with the well known technique of quantum walks applied to a Metropolis algorithm. The result, QFold, is a fully scalable hybrid quantum algorithm that, in contrast to previous quantum approaches, does not require a lattice model simplification and instead relies on the much more realistic assumption of parameterization in terms of torsion angles of the amino acids. We compare it with its classical analog for different annealing schedules and find a polynomial quantum advantage, and implement a minimal realization of the quantum Metropolis in the IBMQ Casablanca quantum system.
arXiv commentRevTex 4.1, 9 color figures, 2 tables
References in corpus (24)
- TensorFlow: A system for large-scale machine learning
- Quantum Mechanics helps in searching for a needle in a haystack
- Error mitigation for short-depth quantum circuits
- Quantum Metropolis Sampling
- Search via Quantum Walk
- Creating superpositions that correspond to efficiently integrable probability distributions
- Demonstration of a scaling advantage for a quantum annealer over simulated annealing
- Quantum speedup for active learning agents
- Resource-Efficient Quantum Algorithm for Protein Folding
- Quantum Simulations of Classical Annealing Processes
- Molecular Docking with Gaussian Boson Sampling
- A Quantum-Quantum Metropolis Algorithm
- Focus beyond quadratic speedups for error-corrected quantum advantage
- On the construction of model Hamiltonians for adiabatic quantum computation and its application to finding low energy conformations of lattice protein models
- Speed-up via Quantum Sampling
- Google in a Quantum Network
- Quantum Google in a Complex Network
- Efficient Quantum Walk Circuits for Metropolis-Hastings Algorithm
- A quantum alternating operator ansatz with hard and soft constraints for lattice protein folding
- Construction of Energy Functions for Lattice Heteropolymer Models: A Case Study in Constraint Satisfaction Programming and Adiabatic Quantum Optimization
- Coarse-grained lattice protein folding on a quantum annealer
- Quantum Simulated Annealing
- T-count Optimized Design of Quantum Integer Multiplication
- Investigating the potential for a limited quantum speedup on protein lattice problems
Cited by in corpus (17)
- The state of quantum computing applications in health and medicine
- Quantum Computing for Molecular Biology
- Biology and medicine in the landscape of quantum advantages
- Accelerated quantum Monte Carlo with mitigated error on noisy quantum computer
- Quantum Metropolis Solver: A Quantum Walks Approach to Optimization Problems
- The prospects of Monte Carlo antibody loop modelling on a fault-tolerant quantum computer
- Parameter Estimation of Gravitational Waves with a Quantum Metropolis Algorithm
- Resource analysis of quantum algorithms for coarse-grained protein folding models
- Discrete-time Semiclassical Szegedy Quantum Walks
- SQUWALS: A Szegedy QUantum WALks Simulator
- Implementing Semiclassical Szegedy Walks in Classical-Quantum Circuits for Homomorphic Encryption
- Predicting Quantum Potentials by Deep Neural Network and Metropolis Sampling
- Recurrence in discrete-time quantum stochastic walks
- Complex-Phase Extensions of Szegedy Quantum Walk on Graphs
- Quantum Algorithm for Testing Graph Completeness
- Quantum Speedup for Nonreversible Markov Chains
- Quantum Walks, Feynman Propagators and Graph Topology on an IBM Quantum Computer