Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2004.01118 · New Journal of Physics

Investigating the potential for a limited quantum speedup on protein lattice problems

Carlos Outeiral, Garrett M. Morris, Jiye Shi, Martin Strahm, Simon C. Benjamin, Charlotte Mary Deane

Published Sep 24, 2021• 25 citations
arXivHTMLPDF

Abstract

Protein folding is a central challenge in computational biology, with important applications in molecular biology, drug discovery and catalyst design. As a hard combinatorial optimisation problem, it has been studied as a potential target problem for quantum annealing. Although several experimental implementations have been discussed in the literature, the computational scaling of these approaches has not been elucidated. In this article, we present a numerical study of quantum annealing applied to a large number of small peptide folding problems, aiming to infer useful insights for near-term applications. We present two conclusions: that even naïve quantum annealing, when applied to protein lattice folding, has the potential to outperform classical approaches, and that careful engineering of the Hamiltonians and schedules involved can deliver notable relative improvements for this problem. Overall, our results suggest that quantum algorithms may well offer improvements for problems in the protein folding and structure prediction realm.

DOI
10.1088/1367-2630/ac29ff

Related papers

Efficient quantum algorithm for lattice protein folding

Youle Wang, Xiangzhen Zhou

Abstract Predicting a protein’s three-dimensional structure from its primary amino acid sequence constitutes the protein folding problem, a pivotal challenge within computational biology. This task has been identified as a fitting domain for applying quantum annealing, an algorithmic technique posited to be faster than its classical counterparts. Nevertheless, the utility of quantum annealing is intrinsically contingent upon the spectral gap associated with the Hamiltonian of lattice proteins. This critical dependence introduces a limitation to the efficacy of these techniques, particularly in the context of simulating the intricate folding processes of proteins. In this paper, we address lattice protein folding as a polynomial unconstrained binary optimization problem, devising a hybrid quantum–classical algorithm to determine the minimum energy conformation effectively. Our method is distinguished by its logarithmic scaling with the spectral gap, conferring a significant edge over the conventional quantum annealing algorithms. The present findings indicate that the folding of lattice proteins can be achieved with a resource consumption that is polynomial in the lattice protein length, provided an ansatz state that encodes the target conformation is utilized. We also provide a simple and scalable method for preparing such states and further explore the adaptation of our method for extension to off-lattice protein models. This work paves a new avenue for surmounting complex computational biology problems via the utilization of quantum computers.

Quantum Science and Technology•Dec 17, 2024•10 citations

Quantum Algorithmic Approaches to Protein Folding: A Comprehensive Study of Diverse Lattice Structures

Venugopal K, Anagha Muralidharan, Cherishma Kumar Subhasa +2 more

In computational biology, protein folding continues to be a key challenge with important implications for drug design and biological function comprehension. Using both classical and quantum computing methods, this paper provides an in-depth analysis of various possible lattice configurations and how theyare used in protein folding. To assess the protein design, we investigate classic models including the more intricate Miyazawa-Jernigan (MJ) interaction matrix and the hydrophobic-hydrophilic (HP) lattice model. Furthermore, we use integer programming methods to protein folding problems on lattices, addressing their NP-hardness and proving their effectiveness in obtaining optimal solutions. Expanding upon these conventional techniques, we present sophisticated graph neural network (GNN) models, particularly the RG-MPNN, which integrate pharmacophore ideas to predict chemical properties by using task-related representations. In the latter section of our paper, we examine how protein folding simulations on lattice structures could be transformed using quantum algorithms. Compared to classical methods, quantum computational techniques promise to be more accurate and efficient at handling the enormous diversity and complexity of protein folding.

International Conference on Computation System and Information Technology for Sustainable Solutions (CSITSS)•Nov 7, 2024•1 citation

Coarse-grained lattice protein folding on a quantum annealer

Tomáš Babej, Christopher E. Ing, Mark Fingerhuth

Lattice models have been used extensively over the past thirty years to examine the principles of protein folding and design. These models can be used to determine the conformation of the lowest energy fold out of a large number of possible conformations. However, due to the size of the conformational space, new algorithms are required for folding longer proteins sequences. Preliminary work was performed by Babbush et al. (2012) to fold a small peptide on a planar lattice using a quantum annealing device. We extend this work by providing improved Ising-type Hamiltonian encodings for the problem of finding the lowest energy conformation of a lattice protein. We demonstrate a decrease in quantum circuit complexity from quadratic to quasilinear in certain cases. Additionally, we generalize to three spatial dimensions in order to obtain results with higher correlation to the actual atomistic 3D structure of the protein and outline our heuristic approach for splitting large problem instances into smaller subproblems that can be directly solved with the current D-Wave 2000Q architecture. To the best of our knowledge, this work sets a new record for lattice protein folding on a quantum annealer by folding Chignolin (10 residues) on a planar lattice and Trp-Cage (8 residues) on a cubic lattice.

arXiv:1811.00713•Nov 2, 2018•62 citations

基于量子计算的蛋白质折叠预测

Jincheng Zhang

Protein folding prediction is a critical challenge in bioinformatics, demanding significant computational resources. This research explores the potential of quantum computing to accelerate and enhance this process. We formulate the protein folding problem as a quantum optimization problem, employing quantum simulation algorithms for efficient solution. The methodology involves mapping the protein's amino acid sequence into a quantum Hamiltonian, followed by simulating the system using quantum algorithms. We investigate the effectiveness of Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA) in determining the ground state energy and, consequently, the folded conformation of the protein. The predicted structures are then validated through comparison with known experimental data and integration with classical molecular dynamics simulations. The core claim of this work is to leverage the computational power of quantum computers to drastically reduce the time required for protein folding prediction, leading to improved accuracy and efficiency. The results demonstrate a promising approach for tackling this computationally intensive problem, potentially revolutionizing drug discovery and protein engineering.

•Sep 7, 2026•0 citations

Variational Quantum Approach for QUBO Lattice Protein Folding model

Ayushi, Madhvi Shakya

Protein folding is a fundamental biological process in which a linear chain of amino acids spontaneously adopts a unique three-dimensional structure essential for proper biological function, molecular recognition and transport of nutrients. Protein misfolding, on the other hand can lead to severe neurodegenerative disorders such as Alzheimer’s, Parkinson’s and cystic fibrosis. Traditional approaches to protein folding, such as knowledge-based and statistical methods, often face limitations in scalability and physical accuracy. To overcome these challenges, the problem has been reformulated as a combinatorial optimization problem classified as NP-hard. In this work, we implement the CVaR-VQE algorithm to solve a previously proposed QUBO formulation of lattice protein folding within a gate-based quantum computing framework. We demonstrate that, compared to the quantum annealing approach, this method significantly reduces qubit requirements and improves scalability, enabling more efficient and practical implementations on NISQ devices. Additionally, we benchmarked our results against classical optimization using IBM CPLEX, we observed that the proposed quantum approach yields high-quality solutions across multiple peptide instances.

IEEE International Conference on Recent Advances in Electronics, Communication, Computing, Automation and Power (RECCAP)•May 1, 2026•0 citations

Solving the Challenge of Protein Folding with Quantum Computing... Demonstration of a Resource-Efficient Quantum Algorithm

inquantio

- A study published in the international journal npj Quantum Information (Nature Portfolio) presents a resource-efficient quantum algorithm framework based on the Variational Quantum Eigensolver (VQE) for peptide and protein folding. - By translating protein folding into a tetrahedral lattice model and combining Conditional Value-at-Risk (CVaR) VQE with a classical evolutionary algorithm, the number of required qubits was drastically reduced. - It successfully folded a 7-amino acid neuropeptide using only 9 qubits on actual IBM 20-qubit quantum hardware, demonstrating its practical potential for next-generation drug discovery in the NISQ (Noisy Intermediate-Scale Quantum) era. [Quantum Biology Society] The protein folding problem, which involves predicting the three-dimensional structure of proteins and peptides from their primary amino acid sequence, plays a central role in various applications such as chemistry, biology, and medicine. However, as the sequence lengthens, the number of possible structures to explore explodes exponentially, making it difficult for classical computers to handle its intrinsic NP-hard complexity. Recently, a new quantum algorithm that can efficiently solve this long-standing challenge even on noisy intermediate-scale quantum (NISQ) computers has been developed, drawing the attention of the academic community. The paper titled "Resource-efficient quantum algorithm for protein folding," published in the international journal npj Quantum Information, presents an innovative computing framework for the discovery of next-generation peptide drugs. The research team of Anton Robert and Ivano Tavernelli from IBM Quantum, IBM Research - Zurich in Switzerland successfully led this groundbreaking study. ■ The Meeting of Lattice Models and Qubit Optimization Until now, attempts to introduce quantum computing to protein folding have required an unattainably high number of qubits that current, near-term quantum hardware cannot handle. To solve this, the research team converted protein folding into a tetrahedral lattice model. This model can efficiently depict the growth of a polymer chain while maintaining chemically plausible bond angles. In particular, they adopted a method of adding penalty terms to the Hamiltonian to prevent unphysical amino acid overlaps (e.g., beads occupying the same lattice site). Through this, they succeeded in drastically reducing the number of qubits required for calculation while suppressing the complexity of the algorithm to the level of O(N⁴). ■ Demonstration of Folding on Actual Quantum Hardware This algorithm maximized efficiency by combining CVaR-VQE, a variation of the Variational Quantum Eigensolver (VQE), with a classical Differential Evolution optimizer. Applying this technique, the researchers simulated the folding of the 10-amino acid Angiotensin peptide using only 22 qubits, successfully finding the most stable energy state (native fold). Furthermore, they successfully demonstrated the folding of a 7-amino acid neuropeptide (APRLRFY) using only 9 qubits on IBM's 20-qubit quantum computer hardware. This study is a groundbreaking achievement proving that the protein folding problem, which previously required massive computing resources, can be successfully solved even in a noisy real quantum processor environment. It is expected to bring tremendous innovation to next-generation /de novo/ drug design and disease treatment research utilizing quantum computing in the future.

•Jul 13, 2026•0 citations
Protein folding is a central challenge in computational biology, with important applications in molecular biology, drug discovery and catalyst design. As a hard combinatorial optimisation problem, it has been studied as a potential target problem for quantum annealing. Although several experimental implementations have been discussed in the literature, the computational scaling of these approaches has not been elucidated. In this article, we present a numerical study of quantum annealing applied to a large number of small peptide folding problems, aiming to infer useful insights for near-term applications. We present two conclusions: that even naïve quantum annealing, when applied to protein lattice folding, has the potential to outperform classical approaches, and that careful engineering of the Hamiltonians and schedules involved can deliver notable relative improvements for this problem. Overall, our results suggest that quantum algorithms may well offer improvements for problems in the protein folding and structure prediction realm.
Abstract Predicting a protein’s three-dimensional structure from its primary amino acid sequence constitutes the protein folding problem, a pivotal challenge within computational biology. This task has been identified as a fitting domain for applying quantum annealing, an algorithmic technique posited to be faster than its classical counterparts. Nevertheless, the utility of quantum annealing is intrinsically contingent upon the spectral gap associated with the Hamiltonian of lattice proteins. This critical dependence introduces a limitation to the efficacy of these techniques, particularly in the context of simulating the intricate folding processes of proteins. In this paper, we address lattice protein folding as a polynomial unconstrained binary optimization problem, devising a hybrid quantum–classical algorithm to determine the minimum energy conformation effectively. Our method is distinguished by its logarithmic scaling with the spectral gap, conferring a significant edge over the conventional quantum annealing algorithms. The present findings indicate that the folding of lattice proteins can be achieved with a resource consumption that is polynomial in the lattice protein length, provided an ansatz state that encodes the target conformation is utilized. We also provide a simple and scalable method for preparing such states and further explore the adaptation of our method for extension to off-lattice protein models. This work paves a new avenue for surmounting complex computational biology problems via the utilization of quantum computers.
In computational biology, protein folding continues to be a key challenge with important implications for drug design and biological function comprehension. Using both classical and quantum computing methods, this paper provides an in-depth analysis of various possible lattice configurations and how theyare used in protein folding. To assess the protein design, we investigate classic models including the more intricate Miyazawa-Jernigan (MJ) interaction matrix and the hydrophobic-hydrophilic (HP) lattice model. Furthermore, we use integer programming methods to protein folding problems on lattices, addressing their NP-hardness and proving their effectiveness in obtaining optimal solutions. Expanding upon these conventional techniques, we present sophisticated graph neural network (GNN) models, particularly the RG-MPNN, which integrate pharmacophore ideas to predict chemical properties by using task-related representations. In the latter section of our paper, we examine how protein folding simulations on lattice structures could be transformed using quantum algorithms. Compared to classical methods, quantum computational techniques promise to be more accurate and efficient at handling the enormous diversity and complexity of protein folding.
Lattice models have been used extensively over the past thirty years to examine the principles of protein folding and design. These models can be used to determine the conformation of the lowest energy fold out of a large number of possible conformations. However, due to the size of the conformational space, new algorithms are required for folding longer proteins sequences. Preliminary work was performed by Babbush et al. (2012) to fold a small peptide on a planar lattice using a quantum annealing device. We extend this work by providing improved Ising-type Hamiltonian encodings for the problem of finding the lowest energy conformation of a lattice protein. We demonstrate a decrease in quantum circuit complexity from quadratic to quasilinear in certain cases. Additionally, we generalize to three spatial dimensions in order to obtain results with higher correlation to the actual atomistic 3D structure of the protein and outline our heuristic approach for splitting large problem instances into smaller subproblems that can be directly solved with the current D-Wave 2000Q architecture. To the best of our knowledge, this work sets a new record for lattice protein folding on a quantum annealer by folding Chignolin (10 residues) on a planar lattice and Trp-Cage (8 residues) on a cubic lattice.
Protein folding prediction is a critical challenge in bioinformatics, demanding significant computational resources. This research explores the potential of quantum computing to accelerate and enhance this process. We formulate the protein folding problem as a quantum optimization problem, employing quantum simulation algorithms for efficient solution. The methodology involves mapping the protein's amino acid sequence into a quantum Hamiltonian, followed by simulating the system using quantum algorithms. We investigate the effectiveness of Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA) in determining the ground state energy and, consequently, the folded conformation of the protein. The predicted structures are then validated through comparison with known experimental data and integration with classical molecular dynamics simulations. The core claim of this work is to leverage the computational power of quantum computers to drastically reduce the time required for protein folding prediction, leading to improved accuracy and efficiency. The results demonstrate a promising approach for tackling this computationally intensive problem, potentially revolutionizing drug discovery and protein engineering.
Protein folding is a fundamental biological process in which a linear chain of amino acids spontaneously adopts a unique three-dimensional structure essential for proper biological function, molecular recognition and transport of nutrients. Protein misfolding, on the other hand can lead to severe neurodegenerative disorders such as Alzheimer’s, Parkinson’s and cystic fibrosis. Traditional approaches to protein folding, such as knowledge-based and statistical methods, often face limitations in scalability and physical accuracy. To overcome these challenges, the problem has been reformulated as a combinatorial optimization problem classified as NP-hard. In this work, we implement the CVaR-VQE algorithm to solve a previously proposed QUBO formulation of lattice protein folding within a gate-based quantum computing framework. We demonstrate that, compared to the quantum annealing approach, this method significantly reduces qubit requirements and improves scalability, enabling more efficient and practical implementations on NISQ devices. Additionally, we benchmarked our results against classical optimization using IBM CPLEX, we observed that the proposed quantum approach yields high-quality solutions across multiple peptide instances.
- A study published in the international journal npj Quantum Information (Nature Portfolio) presents a resource-efficient quantum algorithm framework based on the Variational Quantum Eigensolver (VQE) for peptide and protein folding. - By translating protein folding into a tetrahedral lattice model and combining Conditional Value-at-Risk (CVaR) VQE with a classical evolutionary algorithm, the number of required qubits was drastically reduced. - It successfully folded a 7-amino acid neuropeptide using only 9 qubits on actual IBM 20-qubit quantum hardware, demonstrating its practical potential for next-generation drug discovery in the NISQ (Noisy Intermediate-Scale Quantum) era. [Quantum Biology Society] The protein folding problem, which involves predicting the three-dimensional structure of proteins and peptides from their primary amino acid sequence, plays a central role in various applications such as chemistry, biology, and medicine. However, as the sequence lengthens, the number of possible structures to explore explodes exponentially, making it difficult for classical computers to handle its intrinsic NP-hard complexity. Recently, a new quantum algorithm that can efficiently solve this long-standing challenge even on noisy intermediate-scale quantum (NISQ) computers has been developed, drawing the attention of the academic community. The paper titled "Resource-efficient quantum algorithm for protein folding," published in the international journal npj Quantum Information, presents an innovative computing framework for the discovery of next-generation peptide drugs. The research team of Anton Robert and Ivano Tavernelli from IBM Quantum, IBM Research - Zurich in Switzerland successfully led this groundbreaking study. ■ The Meeting of Lattice Models and Qubit Optimization Until now, attempts to introduce quantum computing to protein folding have required an unattainably high number of qubits that current, near-term quantum hardware cannot handle. To solve this, the research team converted protein folding into a tetrahedral lattice model. This model can efficiently depict the growth of a polymer chain while maintaining chemically plausible bond angles. In particular, they adopted a method of adding penalty terms to the Hamiltonian to prevent unphysical amino acid overlaps (e.g., beads occupying the same lattice site). Through this, they succeeded in drastically reducing the number of qubits required for calculation while suppressing the complexity of the algorithm to the level of O(N⁴). ■ Demonstration of Folding on Actual Quantum Hardware This algorithm maximized efficiency by combining CVaR-VQE, a variation of the Variational Quantum Eigensolver (VQE), with a classical Differential Evolution optimizer. Applying this technique, the researchers simulated the folding of the 10-amino acid Angiotensin peptide using only 22 qubits, successfully finding the most stable energy state (native fold). Furthermore, they successfully demonstrated the folding of a 7-amino acid neuropeptide (APRLRFY) using only 9 qubits on IBM's 20-qubit quantum computer hardware. This study is a groundbreaking achievement proving that the protein folding problem, which previously required massive computing resources, can be successfully solved even in a noisy real quantum processor environment. It is expected to bring tremendous innovation to next-generation /de novo/ drug design and disease treatment research utilizing quantum computing in the future.