Hybrid Quantum-Classical Annealing for Protein Side-Chain Optimization: A Feasibility Study
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.
Related
- Multiscale Quantum-Classical Simulation of Protein Autoproteolysis in a Million-Atom Membrane Environment
- QUBO-Based Conformer Selection with Quantum-Classical Hybrid Optimization for Multiconformer Ligand Modeling
- Minimum evolution molecular clock: quantum annealing for guide tree construction in multiple sequence alignment
- Beyond Sequence Optimization in Enzyme Engineering: Protein Maturation and Operational Stability
- Preservation of intracellular protein-protein interactions in archived cytological specimens: Optimization of preanalytical variables for in situ proximity ligation assay
BibTeX
@misc{visani2026hybrid,
title = {{Hybrid Quantum-Classical Annealing for Protein Side-Chain Optimization: A Feasibility Study}},
author = {Valeria B. C. Visani and Simone Reale and Alfonso Gautieri and Elisabetta Di Nitto},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.08696},
eprint = {2611.08696},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.08696},
}
RIS
TY - UNPB
TI - Hybrid Quantum-Classical Annealing for Protein Side-Chain Optimization: A Feasibility Study
AU - Valeria B. C. Visani
AU - Simone Reale
AU - Alfonso Gautieri
AU - Elisabetta Di Nitto
PY - 2026
DA - 2026/11/05
PB - arXiv
DO - 10.48550/arxiv.2611.08696
UR - https://arxiv.org/abs/2611.08696
AB - 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.
ER -