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:1906.09184 · Chinese Physics Letters

Quantum Approach to Fast Protein-Folding Time*

Li-Hua Lu, You-Quan Li

Published Aug 1, 2019• 13 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1088/0256-307x/36/8/080305

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

Protein folding using quantum computers

Rajat Kumar Vishwakarma

Protein folding has been one of the most difficult problems for over a half-century,The random thermal motions causing conformational changes that lead energetically downhill towards the native structure, a principle captured in funnel-shaped energy landscapes.Unfolded polypeptides have a wide range of possible conformations. The search problem becomes intractable for classical computers due to the exponential growth of potential conformations with chain length. So far, there is theoretical and experimental evidence that solving such optimization problems using Quantum Computing approaches such as Quantum Annealing, VQE, and QAOA has an advantage. Although Google's DeepMind-AlphaFold has accomplished much,But we can go even further with the quantum approach.Here we show how to predict structure of protein as well as RNA folding using the Variational Quantum Eigensolver with Conditional Value at Risk (CVaR) expectation values for the solution of the problem and for finding the minimum configuration energy and our task is to identify a protein's minimal energy structure. The protein's structure is optimized to reduce energy. Also making sure that all physical constraints are met and encoding the protein folding problem into a qubit operator.

•Oct 4, 2022•0 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

Quantum Bioinformatics: Protein Structure Prediction Based on Quantum Entanglement

Jincheng Zhang

This paper presents a novel approach to protein structure prediction leveraging the principles of quantum entanglement. Traditional protein structure prediction methods are often limited by the computational complexity of simulating large biomolecular systems. We propose a framework that utilizes quantum entanglement to model the complex correlations inherent in protein folding, potentially overcoming these limitations. The core idea involves translating the amino acid sequence of a protein into a quantum state and employing quantum computation, specifically entanglement-based algorithms, to predict the protein's three-dimensional structure. The theoretical framework outlines the transformation process, the quantum algorithm design, and the methods for interpreting the results. We explore the potential advantages of this approach, focusing on its ability to capture long-range interactions and conformational flexibility that are difficult to model accurately with classical methods. The ultimate goal is to establish a new paradigm for protein structure prediction, offering improved accuracy and efficiency.

•Aug 29, 2026•0 citations

A Quantum-Classical Hybrid System for Protein Folding

Manikanta Gandivalasa, Vamsi Bandana, Chandini Patnaikuni +2 more

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.

•Mar 25, 2026•0 citations

Protein folding using quantum computers

Rajat Kumar Vishwakarma

Protein folding has been one of the most difficult problems for over a half-century,Therandom thermal motions causing conformational changes that lead energeticallydownhill towards the native structure, a principle captured in funnel-shaped energylandscapes.Unfolded polypeptides have a wide range of possible conformations. Thesearch problem becomes intractable for classical computers due to the exponentialgrowth of potential conformations with chain length. So far, there is theoretical andexperimental evidence that solving such optimization problems using QuantumComputing approaches such as Quantum Annealing, VQE, and QAOA has anadvantage. Although Google's DeepMind-AlphaFold has accomplished much,But wecan go even further with the quantum approach.Here we show how to predict structureof protein as well as RNA folding using the Variational Quantum Eigensolver withConditional Value at Risk (CVaR) expectation values for the solution of the problem andfor finding the minimum configuration energy and our task is to identify a protein'sminimal energy structure. The protein's structure is optimized to reduce energy. Alsomaking sure that all physical constraints are met and encoding the protein foldingproblem into a qubit operator.

•Oct 2, 2022•0 citations
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.
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.
Protein folding has been one of the most difficult problems for over a half-century,The random thermal motions causing conformational changes that lead energetically downhill towards the native structure, a principle captured in funnel-shaped energy landscapes.Unfolded polypeptides have a wide range of possible conformations. The search problem becomes intractable for classical computers due to the exponential growth of potential conformations with chain length. So far, there is theoretical and experimental evidence that solving such optimization problems using Quantum Computing approaches such as Quantum Annealing, VQE, and QAOA has an advantage. Although Google's DeepMind-AlphaFold has accomplished much,But we can go even further with the quantum approach.Here we show how to predict structure of protein as well as RNA folding using the Variational Quantum Eigensolver with Conditional Value at Risk (CVaR) expectation values for the solution of the problem and for finding the minimum configuration energy and our task is to identify a protein's minimal energy structure. The protein's structure is optimized to reduce energy. Also making sure that all physical constraints are met and encoding the protein folding problem into a qubit operator.
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.
This paper presents a novel approach to protein structure prediction leveraging the principles of quantum entanglement. Traditional protein structure prediction methods are often limited by the computational complexity of simulating large biomolecular systems. We propose a framework that utilizes quantum entanglement to model the complex correlations inherent in protein folding, potentially overcoming these limitations. The core idea involves translating the amino acid sequence of a protein into a quantum state and employing quantum computation, specifically entanglement-based algorithms, to predict the protein's three-dimensional structure. The theoretical framework outlines the transformation process, the quantum algorithm design, and the methods for interpreting the results. We explore the potential advantages of this approach, focusing on its ability to capture long-range interactions and conformational flexibility that are difficult to model accurately with classical methods. The ultimate goal is to establish a new paradigm for protein structure prediction, offering improved accuracy and efficiency.
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 folding has been one of the most difficult problems for over a half-century,Therandom thermal motions causing conformational changes that lead energeticallydownhill towards the native structure, a principle captured in funnel-shaped energylandscapes.Unfolded polypeptides have a wide range of possible conformations. Thesearch problem becomes intractable for classical computers due to the exponentialgrowth of potential conformations with chain length. So far, there is theoretical andexperimental evidence that solving such optimization problems using QuantumComputing approaches such as Quantum Annealing, VQE, and QAOA has anadvantage. Although Google's DeepMind-AlphaFold has accomplished much,But wecan go even further with the quantum approach.Here we show how to predict structureof protein as well as RNA folding using the Variational Quantum Eigensolver withConditional Value at Risk (CVaR) expectation values for the solution of the problem andfor finding the minimum configuration energy and our task is to identify a protein'sminimal energy structure. The protein's structure is optimized to reduce energy. Alsomaking sure that all physical constraints are met and encoding the protein foldingproblem into a qubit operator.