Metraipolis › archive › dc_fe92e370210d

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

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.08696
License (as archived)
CC0-1.0
Archived
2026-11-09T22:47:56.016Z
SHA-256 of the archived text
92376b3d3de549419d9fcaa8fb916d3179754a7e0997c78253ef93321e51e9e3
Stable URL of this page
https://metraipolis.com/documento/dc_fe92e370210d

How to cite

Hybrid Quantum-Classical Annealing for Protein Side-Chain Optimization: A Feasibility Study — arXiv:2611.08696 — arXiv (en), https://arxiv.org/abs/2611.08696 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fe92e370210d (Metraipolis archive dc_fe92e370210d, sha256 92376b3d3de549419d9fcaa8fb916d3179754a7e0997c78253ef93321e51e9e3)
BibTeX
@misc{dcfe92e370210d,
  title = {Hybrid Quantum-Classical Annealing for Protein Side-Chain Optimization: A Feasibility Study — arXiv:2611.08696},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.08696},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fe92e370210d; sha256 92376b3d3de549419d9fcaa8fb916d3179754a7e0997c78253ef93321e51e9e3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08696. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.ET, nuovi lavori del giorno).
Categorie arXiv: Emerging Technologies (cs.ET) ; Biomolecules (q-bio.BM); Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2611.08696 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-09T22:41:44.958Z dalla pagina https://arxiv.org/list/cs.ET/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).