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:1907.07179 · Chinese Physics B

Quantum intelligence on protein folding pathways*

Wen-Wen Mao, Li-Hua Lv, Yong-Yun Ji, You-Quan Li

Published Dec 9, 2019• 5 citations
arXivHTMLPDF

Abstract

We study the protein folding problem on the base of our quantum approach by considering the model of protein chain with nine amino-acid residues. We introduce the concept of distance space and its projections on a XY-plane, and two characteristic quantities, one is called compactness of protein structure and another is called probability ratio involving shortest path. The concept of shortest path enables us to reduce the 388 × 388 density matrix to a 2 × 2 one from which the von Neumann entropy reflecting certain quantum coherence feature is naturally defined. We observe the time evolution of average distance and compactness solved from the classical random walk and quantum walk, we also compare the features of the time-dependence of Shannon entropy and von Neumann entropy. All the results not only reveal the fast quantum folding time but also unveil the existence of quantum intelligence hidden behind in choosing protein folding pathways.

DOI
10.1088/1674-1056/ab5fbe

Related papers

Quantum walk and fast protein-folding time

Fei Wan, Li-Hua Lü, You-Quan Li

The Levinthal paradox states that it would be impossible for a protein to reach its native conformation in a physically meaningful time by randomly searching over all possible conformations. So far, it has been widely assumed that this random conformational search does not occur in the folding process, for which various putative hypotheses have had to be employed in model studies. Here we show that the quantum approach, describing the folding process as a quantum walk on a definite graph, gives rise to a fast protein-folding time. In terms of the conventional lattice model describing protein conformation, we introduce a procedure to enumerate all possible structures and then determine the definite connection graphs. Evaluating the mean first-passage time, we find it is much shorter than that obtained via random searching, and the magnitude of the quantum approach is reasonably in agreement with the experimental result. Some further discussions of various characteristic average quantities are also made by comparing both cases of quantum walk and classical random walk.

AIP Advances•Dec 1, 2025•0 citations

Resource-efficient quantum algorithm for protein folding

Anton Robert, Panagiotis Kl. Barkoutsos, Stefan Woerner +1 more

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 $${\mathcal{O}}({N}^{4})$$ 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.

arXiv:1908.02163•npj Quantum Information•Feb 17, 2021•236 citations

Quantum Approach to Fast Protein-Folding Time*

Li-Hua Lu, You-Quan Li

In the traditional random-conformational-search model, various hypotheses with a series of meta-stable intermediate states were proposed to resolve the Levinthal paradox in protein-folding time. Here we introduce a quantum strategy to formulate protein folding as a quantum walk on a definite graph, which provides us a general framework without making hypotheses. Evaluating it by the mean of first passage time, we find that the folding time via our quantum approach is much shorter than the one obtained via classical random walks. This idea is expected to evoke more insights for future studies.

arXiv:1906.09184•Chinese Physics Letters•Aug 1, 2019•13 citations

QFold: quantum walks and deep learning to solve protein folding

Pablo A. M. Casares, Roberto Campos, Miguel Angel Martin-Delgado

Abstract We develop quantum computational tools to predict the 3D structure of proteins, one of the most important problems in current biochemical research. We explain how to combine recent deep learning advances with the well known technique of quantum walks applied to a Metropolis algorithm. The result, QFold, is a fully scalable hybrid quantum algorithm that, in contrast to previous quantum approaches, does not require a lattice model simplification and instead relies on the much more realistic assumption of parameterization in terms of torsion angles of the amino acids. We compare it with its classical analog for different annealing schedules and find a polynomial quantum advantage, and implement a minimal realization of the quantum Metropolis in IBMQ Casablanca quantum system.

arXiv:2101.10279•Quantum Science and Technology•Jan 26, 2022•59 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

Protein Structure Prediction with High Degrees of Freedom in a Gate-Based Quantum Computer

Jaya Vasavi Pamidimukkala, Soham Bopardikar, Avinash Dakshinamoorthy +3 more

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.

arXiv:2311.14141•Journal of Chemical Theory and Computation•Nov 6, 2024•16 citations
We study the protein folding problem on the base of our quantum approach by considering the model of protein chain with nine amino-acid residues. We introduce the concept of distance space and its projections on a XY-plane, and two characteristic quantities, one is called compactness of protein structure and another is called probability ratio involving shortest path. The concept of shortest path enables us to reduce the 388 × 388 density matrix to a 2 × 2 one from which the von Neumann entropy reflecting certain quantum coherence feature is naturally defined. We observe the time evolution of average distance and compactness solved from the classical random walk and quantum walk, we also compare the features of the time-dependence of Shannon entropy and von Neumann entropy. All the results not only reveal the fast quantum folding time but also unveil the existence of quantum intelligence hidden behind in choosing protein folding pathways.
The Levinthal paradox states that it would be impossible for a protein to reach its native conformation in a physically meaningful time by randomly searching over all possible conformations. So far, it has been widely assumed that this random conformational search does not occur in the folding process, for which various putative hypotheses have had to be employed in model studies. Here we show that the quantum approach, describing the folding process as a quantum walk on a definite graph, gives rise to a fast protein-folding time. In terms of the conventional lattice model describing protein conformation, we introduce a procedure to enumerate all possible structures and then determine the definite connection graphs. Evaluating the mean first-passage time, we find it is much shorter than that obtained via random searching, and the magnitude of the quantum approach is reasonably in agreement with the experimental result. Some further discussions of various characteristic average quantities are also made by comparing both cases of quantum walk and classical random walk.
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){\mathcal{O}}({N}^{4})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.
In the traditional random-conformational-search model, various hypotheses with a series of meta-stable intermediate states were proposed to resolve the Levinthal paradox in protein-folding time. Here we introduce a quantum strategy to formulate protein folding as a quantum walk on a definite graph, which provides us a general framework without making hypotheses. Evaluating it by the mean of first passage time, we find that the folding time via our quantum approach is much shorter than the one obtained via classical random walks. This idea is expected to evoke more insights for future studies.
Abstract We develop quantum computational tools to predict the 3D structure of proteins, one of the most important problems in current biochemical research. We explain how to combine recent deep learning advances with the well known technique of quantum walks applied to a Metropolis algorithm. The result, QFold, is a fully scalable hybrid quantum algorithm that, in contrast to previous quantum approaches, does not require a lattice model simplification and instead relies on the much more realistic assumption of parameterization in terms of torsion angles of the amino acids. We compare it with its classical analog for different annealing schedules and find a polynomial quantum advantage, and implement a minimal realization of the quantum Metropolis in IBMQ Casablanca quantum system.
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.
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.