Using quantum annealing to design lattice proteins

Abstract

Quantum annealing has shown promise for finding solutions to difficult optimization problems, including protein folding. Recently, we used the D-Wave Advantage quantum annealer to explore the folding problem in a coarse-grained lattice model, the HP model, in which amino acids are classified into two broad groups: hydrophobic (H) and polar (P). Using a set of 22 HP sequences with up to 64 amino acids, we demonstrated the fast and consistent identification of the correct HP model ground states using the D-Wave hybrid quantum-classical solver. An equally relevant biophysical challenge, called the protein design problem, is the inverse of the above, where the task is to predict protein sequences that fold to a given structure. Here, we approach the design problem by a two-step procedure, implemented and executed on a D-Wave machine. In the first step, we perform a pure sequence-space search by varying the type of amino acid at each sequence position, and seek sequences which minimize the HP-model energy of the target structure. After mapping this task onto an Ising spin glass representation, we employ a hybrid quantum-classical solver to deliver energy-optimal sequences for structures with 30-64 amino acids, with a 100% success rate. In the second step, we filter the optimized sequences from the first step according to their ability to fold to the intended structure. In addition, we try solving the sequence optimization problem using only the QPU, which confines us to sizes $\le$20, due to exponentially decreasing success rates. To shed light on the pure QPU results, we investigate the effects of control errors caused by an imperfect implementation of the intended Hamiltonian on the QPU, by numerically analyzing the Schrödinger equation. We find that the simulated success rates in the presence of control noise semi-quantitatively reproduce the modest pure QPU results for larger chains.

33 pages, 11 figures

References in corpus (13)

• Quantum Annealing in the Transverse Ising Model
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Quantum annealing with more than one hundred qubits
• Quantum critical dynamics in a 5000-qubit programmable spin glass
• Model for disordered proteins with strongly sequence-dependent liquid phase behavior
• Resource-Efficient Quantum Algorithm for Protein Folding
• Quantum Annealing for Constrained Optimization
• On the networked architecture of genotype spaces and its critical effects on molecular evolution
• Analog Errors in Ising Machines
• Programmable Quantum Annealers as Noisy Gibbs Samplers
• Gate-based Quantum Computing for Protein Design
• Finite-size scaling analysis of protein droplet formation
• Tutorial: Calibration refinement in quantum annealing

Cited by in corpus (6)

• De Novo Design of Protein-Binding Peptides by Quantum Computing
• An approach to solve the coarse-grained Protein folding problem in a Quantum Computer
• Computing Canonical Averages with Quantum and Classical Optimizers: Thermodynamic Reweighting for QUBO Models of Physical Systems
• Folding lattice proteins confined on minimal grids using a quantum-inspired encoding
• Subsampling Factorization Machine Annealing
• Exploring Quantum Annealing for Coarse-Grained Protein Folding