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

Toward quantum computational biomolecular structure prediction

Tristan Zaborniak

Published Jan 1, 2025• 0 citations
OpenAlex

Abstract

Biomolecules and their interactions form the material and processual basis underlying all biological phenomena, from photosynthesis to Alzheimer’s disease. Studying these systems is therefore central to the purview of all biological sciences. Computational biomolecular structure prediction (CBSP) supports this effort by leveraging computers to determine, model, and engineer biomolecular structures, properties, and processes—offering a powerful complement to laboratory-based methods. However, many core CBSP problems—such as finding minimum free energy or conformationally-stable structures given sequence information—are computationally challenging. These problems are typically NP-hard in their general form, while their corresponding decision variants are NP-complete. As a result, both formulations are resistant to efficient exact solution at large scales. Quantum computing, a developing computational paradigm leveraging quantum mechanics, offers a potential path forward, given recent evidence suggesting that certain quantum approaches may reduce resource demands for certain NP-hard problem families. Approaches include fully quantum algorithms, quantum-inspired classical heuristics, and hybrid quantum-classical frameworks, all of which may help address long-standing computational bottlenecks in CBSP. This dissertation offers a preliminary investigation of the practical potential of quantum computing for three core CBSP challenges—RNA folding, multi-body molecular docking, and protein design—that, despite their diverse applications, share structural features well suited to exploration by quantum optimization methods. Specifically, we cast each problem as a cost function network (CFN), and develop transformations of these CFNs to quadratic unconstrained binary optimization (QUBO) models in order to render them compatible with current quantum and quantum-inspired hardware. We argue that these transformations not only broaden the range of solvable CFNs across quantum platforms, but in some cases possess intrinsic features which may offer optimization advantages over native CFN formulations. Using a current‑generation superconducting flux‑qubit quantum annealer, we: (a) demonstrate its use for tuning free QUBO parameters against biomolecular structure data, and (b) benchmark solution quality and resource usage against optimized classical Monte Carlo methods, finding comparable performance. Finally, we package these methods into the Masala Quantum Computing Plugins library, an open‑source, modular CBSP platform that supports CFN construction, multiple QUBO encodings (one‑hot, domain‑wall, approximate‑binary, hybrid), and execution on both classical and quantum backends. Our contribution lays the groundwork for extensible, state‑of‑the‑art, quantum-compatible CBSP workflows.

Related papers

A QUBO model of the RNA folding problem optimized by variational hybrid quantum annealing

Tristan Zaborniak, Juan Giraldo, Hausi A. Müller +2 more

RNAs self-interact through hydrogen-bond base-pairing between nucleotides and fold into specific, stable structures that substantially govern their biochemical behaviour. Experimental characterization of these structures remains difficult, hence the desire to predict them computationally from sequence information. However, correctly predicting even the base pairs involved in the folded structure of an RNA, known as secondary structure, from its sequence using minimum free energy models is understood to be NP-hard. Classical approaches rely on heuristics or avoid considering pseudoknots in order to render this problem more tractable, with the cost of inexactness or excluding an entire class of important RNA structures. Given their prospective and demonstrable advantages in certain domains, including combinatorial optimization, quantum computing approaches by contrast have the potential to compute the full RNA folding problem while remaining more feasible and exact. Herein, we present a physically-motivated QUBO model of the RNA folding problem amenable to both quantum annealers and circuit-model quantum computers and compare the performance of this formulation versus current RNA folding QUBOs after tuning the parameters of all against known RNA structures using an approach we call "variational hybrid quantum annealing".

arXiv:2208.04367•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•15 citations

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

Quantum Bioinformatics: Protein Structure Prediction Based on Quantum Mechanical Principles

Jincheng Zhang

This paper proposes a novel approach to protein structure prediction leveraging principles from quantum mechanics, specifically entanglement and superposition. Traditional methods for protein folding, reliant on classical computational techniques, frequently struggle with accuracy and efficiency, particularly when dealing with complex protein structures. We posit that protein folding can be modeled as solving the Schrödinger equation, a problem ideally suited for quantum computation. This work outlines a framework where quantum algorithms are utilized to accelerate the solution of the Schrödinger equation for a given protein, significantly reducing the computational burden. Furthermore, we incorporate biological information, such as sequence data and known structural constraints, to refine the quantum solution and enhance predictive accuracy. The core claim is that utilizing quantum mechanical phenomena can lead to a more accurate protein structure prediction method. The mechanism involves transforming the protein folding problem into a quantum mechanical equation solving task, accelerating the process with quantum computation, and optimizing the solution with biological data. We present a conceptual model and discuss the potential benefits and challenges of this approach, highlighting its potential to surpass the limitations of current classical methods.

•Aug 31, 2026•0 citations

RNA folding using quantum computers

Dillion M. Fox, Christopher M. MacDermaid, Andrea M. A. Schreij +2 more

The 3-dimensional fold of an RNA molecule is largely determined by patterns of intramolecular hydrogen bonds between bases. Predicting the base pairing network from the sequence, also referred to as RNA secondary structure prediction or RNA folding, is a nondeterministic polynomial-time (NP)-complete computational problem. The structure of the molecule is strongly predictive of its functions and biochemical properties, and therefore the ability to accurately predict the structure is a crucial tool for biochemists. Many methods have been proposed to efficiently sample possible secondary structure patterns. Classic approaches employ dynamic programming, and recent studies have explored approaches inspired by evolutionary and machine learning algorithms. This work demonstrates leveraging quantum computing hardware to predict the secondary structure of RNA. A Hamiltonian written in the form of a Binary Quadratic Model (BQM) is derived to drive the system toward maximizing the number of consecutive base pairs while jointly maximizing the average length of the stems. A Quantum Annealer (QA) is compared to a Replica Exchange Monte Carlo (REMC) algorithm programmed with the same objective function, with the QA being shown to be highly competitive at rapidly identifying low energy solutions. The method proposed in this study was compared to three algorithms from literature and, despite its simplicity, was found to be competitive on a test set containing known structures with pseudoknots.

PLoS Computational Biology•Apr 11, 2022•37 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 algorithms for electronic structure beyond ground state energies

Emiel Koridon

Quantum chemistry models atoms and molecules using quantum mechanics, with the electronic structure problem at its core. This problem, which determines the energy and properties of electrons in a molecule, is exponentially hard to solve exactly on classical computers. To approximate solutions, effective models introduce layers of simplifications. However, these approximations can fail for strongly correlated systems, necessitating alternative approaches. Quantum computers, capable of processing quantum information natively, offer a promising path to simulate molecular systems beyond classical reach, with potential applications in catalysis, materials science, and photochemistry. Despite rapid advancements in quantum hardware, practical quantum computations remain challenging due to limited resources. This thesis optimizes quantum resource usage in computational chemistry, introducing novel embedding techniques and exploring applications beyond ground-state energies. Chapter 1 establishes the foundation by reviewing quantum chemistry methods, from Hartree-Fock and Density Functional Theory (DFT) to active space approaches. It also provides an introduction to quantum computing for chemistry, focusing on near-term algorithms. The following chapters present novel methods aimed at reducing quantum resource requirements and tackling problems classical methods struggle with. Chapter 2 introduces a technique to reduce the $\lambda$-norm of the electronic structure Hamiltonian, a key measure of quantum resource demand. By transforming molecular orbitals, this method enhances sampling efficiency in Noisy Intermediate-Scale Quantum (NISQ) algorithms and reduces runtime in Fault-Tolerant Quantum Computing (FTQC). Localized orbitals outperform canonical ones, and an orbital-optimization scheme is proposed to minimize the $\lambda$-norm. Benchmarks on hydrogen chains, FeMoco, and Ruthenium complexes demonstrate its effectiveness. Chapter 3 presents the FragPT2 framework for simulating large systems with multiple interacting fragments. This method embeds each fragment in the mean field of others and applies multi-reference perturbation theory to capture inter-fragment correlations such as dispersion and charge transfer efficiently. The approach reduces computational overhead and enables scalable simulations, as shown in applications to \ce{N2} dimers, aromatic dimers, and butadiene. Chapter 4 focuses on photochemical systems, where multiple electronic states must be treated equally. The state-averaged orbital-optimized variational quantum eigensolver (SAOOVQE) is extended with analytical energy gradients and non-adiabatic couplings, enabling geometry optimizations and simulations of non-adiabatic dynamics on quantum hardware. This is demonstrated by locating the conical intersection in formaldimine, highlighting SAOOVQE’s potential for studying photoisomerization in biomolecules. Building on this, Chapter 5 develops a quantum algorithm to detect conical intersections, where the Born-Oppenheimer approximation breaks down. These intersections are characterized by a discrete Berry phase (0 or $\pi$), representing their topological nature. The algorithm extracts this phase as a single bit of information, ensuring resilience to noise. Analytical proof and numerical validation using a toy molecular model illustrate its effectiveness for studying light-perception biochemistry and related photochemical processes. Finally, Chapter 6 explores machine learning density functionals trained on noisy quantum data. While DFT is computationally efficient, its accuracy depends on approximated exchange-correlation functionals. This work proposes a neural network-based approach to learn the exact functional from quantum data, showing that training on noisy outputs from NISQ devices can mitigate sampling errors. Applications to the Fermi-Hubbard model and other systems demonstrate its potential to generalize and provide accurate results under noise. This thesis advances quantum computational chemistry by optimizing quantum resource usage, developing new embedding strategies, and expanding the scope of quantum simulations beyond ground-state properties. These contributions pave the way for practical quantum algorithms that could revolutionize molecular simulations in the near future.

•Apr 4, 2025•0 citations
Biomolecules and their interactions form the material and processual basis underlying all biological phenomena, from photosynthesis to Alzheimer’s disease. Studying these systems is therefore central to the purview of all biological sciences. Computational biomolecular structure prediction (CBSP) supports this effort by leveraging computers to determine, model, and engineer biomolecular structures, properties, and processes—offering a powerful complement to laboratory-based methods. However, many core CBSP problems—such as finding minimum free energy or conformationally-stable structures given sequence information—are computationally challenging. These problems are typically NP-hard in their general form, while their corresponding decision variants are NP-complete. As a result, both formulations are resistant to efficient exact solution at large scales. Quantum computing, a developing computational paradigm leveraging quantum mechanics, offers a potential path forward, given recent evidence suggesting that certain quantum approaches may reduce resource demands for certain NP-hard problem families. Approaches include fully quantum algorithms, quantum-inspired classical heuristics, and hybrid quantum-classical frameworks, all of which may help address long-standing computational bottlenecks in CBSP. This dissertation offers a preliminary investigation of the practical potential of quantum computing for three core CBSP challenges—RNA folding, multi-body molecular docking, and protein design—that, despite their diverse applications, share structural features well suited to exploration by quantum optimization methods. Specifically, we cast each problem as a cost function network (CFN), and develop transformations of these CFNs to quadratic unconstrained binary optimization (QUBO) models in order to render them compatible with current quantum and quantum-inspired hardware. We argue that these transformations not only broaden the range of solvable CFNs across quantum platforms, but in some cases possess intrinsic features which may offer optimization advantages over native CFN formulations. Using a current‑generation superconducting flux‑qubit quantum annealer, we: (a) demonstrate its use for tuning free QUBO parameters against biomolecular structure data, and (b) benchmark solution quality and resource usage against optimized classical Monte Carlo methods, finding comparable performance. Finally, we package these methods into the Masala Quantum Computing Plugins library, an open‑source, modular CBSP platform that supports CFN construction, multiple QUBO encodings (one‑hot, domain‑wall, approximate‑binary, hybrid), and execution on both classical and quantum backends. Our contribution lays the groundwork for extensible, state‑of‑the‑art, quantum-compatible CBSP workflows.
RNAs self-interact through hydrogen-bond base-pairing between nucleotides and fold into specific, stable structures that substantially govern their biochemical behaviour. Experimental characterization of these structures remains difficult, hence the desire to predict them computationally from sequence information. However, correctly predicting even the base pairs involved in the folded structure of an RNA, known as secondary structure, from its sequence using minimum free energy models is understood to be NP-hard. Classical approaches rely on heuristics or avoid considering pseudoknots in order to render this problem more tractable, with the cost of inexactness or excluding an entire class of important RNA structures. Given their prospective and demonstrable advantages in certain domains, including combinatorial optimization, quantum computing approaches by contrast have the potential to compute the full RNA folding problem while remaining more feasible and exact. Herein, we present a physically-motivated QUBO model of the RNA folding problem amenable to both quantum annealers and circuit-model quantum computers and compare the performance of this formulation versus current RNA folding QUBOs after tuning the parameters of all against known RNA structures using an approach we call "variational hybrid quantum annealing".
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.
This paper proposes a novel approach to protein structure prediction leveraging principles from quantum mechanics, specifically entanglement and superposition. Traditional methods for protein folding, reliant on classical computational techniques, frequently struggle with accuracy and efficiency, particularly when dealing with complex protein structures. We posit that protein folding can be modeled as solving the Schrödinger equation, a problem ideally suited for quantum computation. This work outlines a framework where quantum algorithms are utilized to accelerate the solution of the Schrödinger equation for a given protein, significantly reducing the computational burden. Furthermore, we incorporate biological information, such as sequence data and known structural constraints, to refine the quantum solution and enhance predictive accuracy. The core claim is that utilizing quantum mechanical phenomena can lead to a more accurate protein structure prediction method. The mechanism involves transforming the protein folding problem into a quantum mechanical equation solving task, accelerating the process with quantum computation, and optimizing the solution with biological data. We present a conceptual model and discuss the potential benefits and challenges of this approach, highlighting its potential to surpass the limitations of current classical methods.
The 3-dimensional fold of an RNA molecule is largely determined by patterns of intramolecular hydrogen bonds between bases. Predicting the base pairing network from the sequence, also referred to as RNA secondary structure prediction or RNA folding, is a nondeterministic polynomial-time (NP)-complete computational problem. The structure of the molecule is strongly predictive of its functions and biochemical properties, and therefore the ability to accurately predict the structure is a crucial tool for biochemists. Many methods have been proposed to efficiently sample possible secondary structure patterns. Classic approaches employ dynamic programming, and recent studies have explored approaches inspired by evolutionary and machine learning algorithms. This work demonstrates leveraging quantum computing hardware to predict the secondary structure of RNA. A Hamiltonian written in the form of a Binary Quadratic Model (BQM) is derived to drive the system toward maximizing the number of consecutive base pairs while jointly maximizing the average length of the stems. A Quantum Annealer (QA) is compared to a Replica Exchange Monte Carlo (REMC) algorithm programmed with the same objective function, with the QA being shown to be highly competitive at rapidly identifying low energy solutions. The method proposed in this study was compared to three algorithms from literature and, despite its simplicity, was found to be competitive on a test set containing known structures with pseudoknots.
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.
Quantum chemistry models atoms and molecules using quantum mechanics, with the electronic structure problem at its core. This problem, which determines the energy and properties of electrons in a molecule, is exponentially hard to solve exactly on classical computers. To approximate solutions, effective models introduce layers of simplifications. However, these approximations can fail for strongly correlated systems, necessitating alternative approaches. Quantum computers, capable of processing quantum information natively, offer a promising path to simulate molecular systems beyond classical reach, with potential applications in catalysis, materials science, and photochemistry. Despite rapid advancements in quantum hardware, practical quantum computations remain challenging due to limited resources. This thesis optimizes quantum resource usage in computational chemistry, introducing novel embedding techniques and exploring applications beyond ground-state energies. Chapter 1 establishes the foundation by reviewing quantum chemistry methods, from Hartree-Fock and Density Functional Theory (DFT) to active space approaches. It also provides an introduction to quantum computing for chemistry, focusing on near-term algorithms. The following chapters present novel methods aimed at reducing quantum resource requirements and tackling problems classical methods struggle with. Chapter 2 introduces a technique to reduce the λ\lambdaλ-norm of the electronic structure Hamiltonian, a key measure of quantum resource demand. By transforming molecular orbitals, this method enhances sampling efficiency in Noisy Intermediate-Scale Quantum (NISQ) algorithms and reduces runtime in Fault-Tolerant Quantum Computing (FTQC). Localized orbitals outperform canonical ones, and an orbital-optimization scheme is proposed to minimize the λ\lambdaλ-norm. Benchmarks on hydrogen chains, FeMoco, and Ruthenium complexes demonstrate its effectiveness. Chapter 3 presents the FragPT2 framework for simulating large systems with multiple interacting fragments. This method embeds each fragment in the mean field of others and applies multi-reference perturbation theory to capture inter-fragment correlations such as dispersion and charge transfer efficiently. The approach reduces computational overhead and enables scalable simulations, as shown in applications to \ce{N2} dimers, aromatic dimers, and butadiene. Chapter 4 focuses on photochemical systems, where multiple electronic states must be treated equally. The state-averaged orbital-optimized variational quantum eigensolver (SAOOVQE) is extended with analytical energy gradients and non-adiabatic couplings, enabling geometry optimizations and simulations of non-adiabatic dynamics on quantum hardware. This is demonstrated by locating the conical intersection in formaldimine, highlighting SAOOVQE’s potential for studying photoisomerization in biomolecules. Building on this, Chapter 5 develops a quantum algorithm to detect conical intersections, where the Born-Oppenheimer approximation breaks down. These intersections are characterized by a discrete Berry phase (0 or π\piπ), representing their topological nature. The algorithm extracts this phase as a single bit of information, ensuring resilience to noise. Analytical proof and numerical validation using a toy molecular model illustrate its effectiveness for studying light-perception biochemistry and related photochemical processes. Finally, Chapter 6 explores machine learning density functionals trained on noisy quantum data. While DFT is computationally efficient, its accuracy depends on approximated exchange-correlation functionals. This work proposes a neural network-based approach to learn the exact functional from quantum data, showing that training on noisy outputs from NISQ devices can mitigate sampling errors. Applications to the Fermi-Hubbard model and other systems demonstrate its potential to generalize and provide accurate results under noise. This thesis advances quantum computational chemistry by optimizing quantum resource usage, developing new embedding strategies, and expanding the scope of quantum simulations beyond ground-state properties. These contributions pave the way for practical quantum algorithms that could revolutionize molecular simulations in the near future.