Protein Design by Integrating Machine Learning and Quantum-Encoded Optimization
Open accessPublished version of a preprint
Abstract
The protein design problem involves finding polypeptide sequences folding into a given three-dimensional structure. Its rigorous algorithmic solution is computationally demanding, involving a nested search in sequence and structure spaces. Structure searches can now be bypassed thanks to recent machine-learning breakthroughs, which have enabled accurate and rapid structure predictions. Similarly, sequence searches might be entirely transformed by the advent of quantum annealing machines and by the required new encodings of the search problem, which could be performative even on classical machines. In this work, we introduce a general protein design scheme where algorithmic and technological advancements in machine learning and quantum-inspired algorithms can be integrated, and an optimal physics-based scoring function is iteratively learned. In this first proof-of-concept application, we apply the iterative method to a lattice protein model amenable to exhaustive benchmarks, finding that it can rapidly learn a physics-based scoring function and achieve promising design performances. Strikingly, our quantum-inspired reformulation outperforms conventional sequence optimization even when adopted on classical machines. The scheme is general and can be extended, e.g., to encompass off-lattice models, and it can integrate progress on various computational platforms, thus representing a new paradigm approach for protein design. Published by the American Physical Society 2024
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
No citation lists for this paper
No citation lists for this paper yet — checked again daily.
References 74 · Cited by 10
- Authors
- Panizza, V., Hauke, P., Micheletti, C., & Faccioli, P.
- Affiliations
- Istituto Nazionale di Fisica Nucleare (IT)
- Scuola Internazionale Superiore di Studi Avanzati (IT)
- University of Milano-Bicocca (IT)
- Venue
- PRX Life
- Publisher
- American Physical Society (APS)
- Published
- 2024-11-15
- Volume
- 2
- Issue
- 4
- ISSN
- 2835-8279 (ISSN-L)
- OpenAlex
- W4404414278
- Cited by
- 10
- References
- 74
- Citations by year
- 2026: 5 · 2025: 5
- FWCI
- 1.36
- Type
- journal article
- Language
- en
- Open access
- diamond
- doi.org
- Licence
- Locations
- PRX Life (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion, cc-by)
- SDL (submittedVersion, cc-by)
- Iris (University of Trento) (submittedVersion, other-oa)
- arXiv (Cornell University) (cc-by)
- Funders
- Istituto Nazionale di Fisica Nucleare Sezione di Padova
- NextGenerationEU
- Consiglio Nazionale delle Ricerche
- HORIZON EUROPE Research Infrastructures (101080086)
- Ministero dell'Università e della Ricerca
- Topics
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Protein Structure and Dynamics
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › RNA and protein synthesis mechanisms
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Computational Drug Discovery Methods
- Keywords
- protein design, machine learning, quantum annealing, quantum-inspired algorithms, iterative learning, lattice protein models, sequence optimization, structure prediction, protein folding
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review