Hybrid quantum solver competes with classical tools on protein tasks

Hybrid Quantum-Classical Annealing for Protein Side-Chain Optimization: A Feasibility Study

Emerging Technologies

Summary

Optimizing how protein parts fit together is a tough puzzle important for biology and medicine. This study shows that a new type of solver combining quantum and classical computing can solve these protein puzzles as well as, or better than, leading classical solvers, especially for larger problems. The researchers tested this on real protein structures and found that the hybrid solver often finds the best or better solutions in less time. This suggests that these hybrid solvers could be useful for improving protein design in practical settings.

What this means in practice

  • For computational biology teams: Improve protein design workflows by using hybrid quantum-classical solvers to find better side-chain configurations for proteins.
  • For quantum computing engineers: Test hybrid quantum-classical annealers on real-world binary quadratic optimization problems beyond synthetic benchmarks.

Authors

Valeria B. C. Visani, Simone Reale, Alfonso Gautieri, Elisabetta Di Nitto

Abstract

Hybrid quantum-classical annealing solvers are moving from research laboratories toward industrial use, but their advantage over classical optimization appears to be confined to a narrow class of problems. A recent systematic benchmark of the D-Wave hybrid solver against industry-leading classical solvers, across several classes of optimization problems, found it to be most competitive on binary quadratic programs, while noting that few industrial problems take this form. Therefore, identifying real-world industrial problems that can be modeled with this structure is a key challenge. We propose protein side-chain optimization, a core step of computational protein design, as one of these problems: it is natively a binary quadratic program, and its application context requires pools of low-energy solutions, which annealers naturally return. In this feasibility study, we test whether the competitiveness of the hybrid solver against industry-leading classical solvers extends to this problem. On 40 instances derived from 20 experimentally determined protein structures with up to about 200 amino acids and 2000 binary variables, we compare the results achieved with a hybrid solver, run for 5 seconds, against those of the commercial solver Gurobi, run for 10 seconds, 1000 seconds, and 4 hours. The hybrid solver reaches the certified optimum whenever one is available, matches Gurobi's performance on smaller instances, and outperforms it on larger instances, finding lower-energy solutions. These results show that the competitiveness of the hybrid solver on binary quadratic programs, so far observed only on a synthetic benchmark, extends to a real-world problem. This motivates comparisons with classical heuristics specific to protein side-chain optimization.