Protein folding is one of the age-old biological problems that refers to the mechanism of understanding and predicting how a protein's linear sequence of amino acids folds into its specific three dimensional structure.This structure is critical, as a protein's functionality is inherently linked to its final folded form. Misfolding can lead to severe diseases such as Alzheimer's and cystic fibrosis, highlighting the biological and clinical importance of understanding protein folding mechanisms. This work presents a novel turn based encoding optimization algorithm for predicting the folded structures of peptides and small proteins. Our approach builds upon our previous research, where our objective function focused on hydrophobic collapse, a fundamental phenomenon underlying the protein folding process. In this work, we extend that framework by not only incorporating hydrophobic interactions but also including all non bonded interactions modeled using the Miyazawa Jernigan potential. We constructed a Hamiltonian from the defined objective function that encodes the folding process on a three dimensional face centered cubic lattice, offering superior packing efficiency and a realistic representation of protein conformations. This Hamiltonian is then solved using classical and quantum solvers to explore the vast conformational space of proteins. To identify the lowest-energy folded configurations, we utilize the Variational Quantum Eigensolver implemented on IBM 133 qubit hardware. The predicted structures are validated against experimental data using root mean square deviation as a metric and compared against classical simulated annealing and molecular dynamics simulation results. Our findings highlight the promise of hybrid classical and quantum approaches in advancing protein folding predictions, particularly for sequences with low homology.
Protein folding is one of the age-old biological problems that refers to the mechanism of understanding and predicting how a protein's linear sequence of amino acids folds into its specific three dimensional structure.This structure is critical, as a protein's functionality is inherently linked to its final folded form. Misfolding can lead to severe diseases such as Alzheimer's and cystic fibrosis, highlighting the biological and clinical importance of understanding protein folding mechanisms. This work presents a novel turn based encoding optimization algorithm for predicting the folded structures of peptides and small proteins. Our approach builds upon our previous research, where our objective function focused on hydrophobic collapse, a fundamental phenomenon underlying the protein folding process. In this work, we extend that framework by not only incorporating hydrophobic interactions but also including all non bonded interactions modeled using the Miyazawa Jernigan potential. We constructed a Hamiltonian from the defined objective function that encodes the folding process on a three dimensional face centered cubic lattice, offering superior packing efficiency and a realistic representation of protein conformations. This Hamiltonian is then solved using classical and quantum solvers to explore the vast conformational space of proteins. To identify the lowest-energy folded configurations, we utilize the Variational Quantum Eigensolver implemented on IBM 133 qubit hardware. The predicted structures are validated against experimental data using root mean square deviation as a metric and compared against classical simulated annealing and molecular dynamics simulation results. Our findings highlight the promise of hybrid classical and quantum approaches in advancing protein folding predictions, particularly for sequences with low homology.
Protein folding, which traces the protein three-dimensional (3D) structure from its amino acid sequence, is a half-a-century-old problem in biology. The function of the protein correlates with its structure, emphasizing the need to study protein folding to understand the cellular and molecular processes better. While recent AI-based methods have shown significant success in protein structure prediction, their accuracy diminishes with proteins of low sequence similarity. Classical simulations face challenges in generating extensive conformational samplings. In this work, we develop a novel turn-based encoding algorithm with more significant degrees of freedom that successfully runs on a gate-based quantum computer and predicts the structure of proteins of varied lengths utilizing up to 114 qubits (IBM hardware). To make the problem tractable in quantum computers, the protein sequences were described with the simplistic HP model (H = hydrophobic residues, P = polar residues). The proposed formulation successfully captures the so-called nucleation step in protein folding, the hydrophobic collapse, that brings the hydrophobic residues to the core of the protein.
Abstract Predicting the three-dimensional structure of a protein from its primary sequence of amino acids is known as the protein folding problem. Due to the central role of proteins’ structures in chemistry, biology and medicine applications, this subject has been intensively studied for over half a century. Although classical algorithms provide practical solutions for the sampling of the conformation space of small proteins, they cannot tackle the intrinsic NP-hard complexity of the problem, even when reduced to the simplest Hydrophobic-Polar model. On the other hand, while fault-tolerant quantum computers are beyond reach for state-of-the-art quantum technologies, there is evidence that quantum algorithms can be successfully used in noisy state-of-the-art quantum computers to accelerate energy optimization in frustrated systems. In this work, we present a model Hamiltonian with O(N4) O ( N 4 ) scaling and a corresponding quantum variational algorithm for the folding of a polymer chain with N monomers on a lattice. The model reflects many physico-chemical properties of the protein, reducing the gap between coarse-grained representations and mere lattice models. In addition, we use a robust and versatile optimization scheme, bringing together variational quantum algorithms specifically adapted to classical cost functions and evolutionary strategies to simulate the folding of the 10 amino acid Angiotensin on 22 qubits. The same method is also successfully applied to the study of the folding of a 7 amino acid neuropeptide using 9 qubits on an IBM 20-qubit quantum computer. Bringing together recent advances in building gate-based quantum computers with noise-tolerant hybrid quantum-classical algorithms, this work paves the way towards accessible and relevant scientific experiments on real quantum processors.
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.
Lattice protein folding models are a cornerstone of computational biophysics. Although these models are a coarse grained representation, they provide useful insight into the energy landscape of natural proteins. Finding low-energy threedimensional structures is an intractable problem even in the simplest model, the Hydrophobic-Polar (HP) model. Description of protein-like properties are more accurately described by generalized models, such as the one proposed by Miyazawa and Jernigan (MJ), which explicitly take into account the unique interactions among all 20 amino acids. There is theoretical and experimental evidence of the advantage of solving classical optimization problems using quantum annealing over its classical analogue (simulated annealing). In this report, we present a benchmark implementation of quantum annealing for lattice protein folding problems (six different experiments up to 81 superconducting quantum bits). This first implementation of a biophysical problem paves the way towards studying optimization problems in biophysics and statistical mechanics using quantum devices.
Protein folding is a computationally intensive problem in bioinformatics that involves predicting the three-dimensional structure of a protein from its amino acid sequence. Classical approaches face challenges due to the exponential complexity of the search space. In this paper, we propose Q-ProteinFold, a quantum-classical hybrid system that leverages the Variational Quantum Eigensolver (VQE) for protein folding approximation. The system encodes protein sequences into parameterized quantum circuits using Qiskit and explores multiple conformations through quantum superposition and entanglement. A classical optimizer iteratively minimizes the energy function to identify stable protein structures. The implementation is developed using Python, Streamlit, and Qiskit Aer simulator. Experimental results demonstrate energy convergence, probabilistic state distribution, and effective fold prediction. This work highlights the potential of quantum computing in solving complex biological optimization problems.
Protein structure prediction remains central to computational biology and drug discovery. While deep learning models such as AlphaFold have achieved remarkable accuracy for known fold families, they struggle with novel folds, intrinsically disordered regions, and conformational dynamics, and they do not explicitly optimize physics-based energy functions. We present a quantum-assisted approach to protein conformation optimization that uses parameterized quantum circuits within a variational framework to explore the energy landscape of small proteins and fragments from first-principles or coarse-grained physics. Our method encodes backbone torsion angles (ϕ, ψ) and selected side-chain degrees of freedom into qubit registers and employs a variational quantum eigensolver (VQE)-inspired optimization to minimize an approximate Hamiltonian incorporating bonded interactions, sterics, hydrogen bonding, and hydrophobic contacts. We introduce problem-inspired ansätze that respect chain connectivity and secondary-structure motifs (helices, beta-sheets) and propose hierarchical circuit growth strategies for scaling from peptides to larger domains. Through classical simulations of small peptides and secondary-structure motifs, we demonstrate that quantum variational optimization can identify low-energy conformations consistent with experimentally determined structures. We provide explicit resource estimates for NISQ and early fault-tolerant quantum computers and discuss hybrid classical-quantum strategies for refining quantum solutions with classical molecular dynamics and machinelearning priors. While full protein-folding quantum advantage remains distant, we identify concrete subproblems where nearterm quantum devices offer complementary physics-based insight beyond data-driven approaches, opening pathways toward practical quantum-classical protein structure and drug discovery pipelines.