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:2609.31077

Quantum Approximate Optimisation Algorithm for Protein Sidechain Packing

Sebastian O. M. Stewart, Nick Chancellor, Jonte R Hance, Ittoop Vergheese Puthoor

quant-phSubmitted Sep 25, 2026• Announced Sep 28, 2026• 0 citations
arXivHTMLPDF

Abstract

Sidechain packing is a critical stage in protein folding, with direct implications for structure-based drug discovery. Google DeepMind's tool, AlphaFold2, predicts protein backbone reliably but sidechain positioning less accurately. Recovering the lowest-energy rotamer assignment over a fixed backbone is NP-hard. We present a hybrid quantum-classical pipeline that repacks sidechains on the AlphaFold backbone using the Quantum Approximate Optimisation Algorithm (QAOA), encoding the one- and two-body energies as a quadratic unconstrained binary optimisation (QUBO) problem. We introduce a constraint-preserving ansatz, pairing a W-state initialisation with a cyclic XY ring mixer, that enforces one-hot rotamer validity without penalty terms while keeping two-qubit gate scaling linear in the rotamer count. We also define an asymptotic shot-scaling metric, measured against the experimentally resolved conformation, that fixes optimiser quality independently of the baseline; its fitted growth stays below the classical exhaustive-search rate at moderate rotamer flexibility. Evaluated on bovine pancreatic trypsin inhibitor (5PTI) across high- and moderate AlphaFold-confidence regions, the pipeline lowers conformational energy against the AlphaFold baseline.

AI Summary

The paper studies fixed-backbone protein sidechain packing with QAOA: selecting one rotamer per residue to minimise a pairwise conformational-energy model. A hybrid pipeline uses PyRosetta to generate and prune rotamers, maps their energies to a one-hot QUBO, and optimises a constraint-preserving circuit. Each residue register starts in a W state; an XY ring mixer preserves one-hot validity without penalties. The mixer uses $O(MN)$ two-qubit gates, versus $O(MN^2)$ for complete-graph mixing, for $M$ residues and $N$ rotamers per residue. State-vector simulations examine subsections of bovine pancreatic trypsin inhibitor (5PTI), using 30 seeds and depths up to $p=12$, with registers up to 22 qubits. Exhaustive enumeration on experimentally resolved-backbone instances defines success as energy within $1.5$ kcal/mol of the discrete minimum. Success probabilities determine the shots needed for $99.99\%$ recovery. An exponential fit grows as $e^{0.31Q}$ in qubit count $Q$ and remains below 500 shots through 22 qubits, although instance-dependent budgets vary substantially. Repacking AlphaFold-backbone regions at 5–14 qubits beats the baseline by more than $1.5$ kcal/mol in $15.6\%$ of high-confidence runs and $54\%$ of moderate-confidence runs; mean improvements among wins are $1.864$ and $8.114$ kcal/mol, respectively. High-confidence wins disappear at 22 qubits. The study is limited to one protein and noiseless simulation. Generalisation of the fitted sampling budget remains open, hardware deployment requires explicit W-state preparation and noise evaluation, and energy improvements are not validated against binding affinity or structural stability. Larger gains against moderate-confidence predictions are attributed to weaker baselines, not stronger quantum optimisation.

Some signs of AI-generated textOverclaimsSmall numerics onlyMissing comparisonUnclear novelty

Central claim may not hold: Success probabilities calibrated on experimental-backbone Hamiltonians do not guarantee optimal selection on AlphaFold-backbone Hamiltonians or exclude solver failure there. Small-instance shot-budget fits do not establish asymptotic scaling, their success event includes near-optimal assignments rather than only the GMEC, and one-hot encoding does not reduce the feasible state-space dimension relative to classical assignments. The claimed conservative shot-budget bound is already exceeded by a reported 22-qubit subsection requiring approximately 732.88 shots on average, versus a fitted budget below 500. The claimed scaling advantage for heterogeneous rotamer counts does not follow from their average, as equal numbers of one- and five-rotamer residues give an exhaustive-search exponent approximately 0.268 below the fitted shot exponent 0.31. The claimed two-round ring-mixer depth excludes odd rings, and partitioned XY edge gates do not generally implement the exact exponential of the stated summed mixer Hamiltonian.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
6 pages, 3 figures

Related papers

Quantum Algorithm for Protein Side-Chain Optimisation: Comparing Quantum to Classical Methods

Anastasia Agathangelou, Dilhan Manawadu, Ivano Tavernelli

Modelling and predicting protein configurations is crucial for advancing drug discovery, enabling the design of treatments for life-threatening diseases. A critical aspect of this challenge is rotamer optimisation - the determination of optimal side-chain conformations given a fixed protein backbone. This problem, involving the internal degrees of freedom of amino acid side-chains, significantly influences the protein's overall structure and function. In this work, we develop a resource-efficient optimisation algorithm to compute the ground state energy of protein structures, with a focus on side-chain configuration. We formulate the rotamer optimisation problem as a Quadratic Unconstrained Binary Optimisation problem and map it to an Ising model, enabling efficient quantum encoding. Building on this formulation, we propose a quantum algorithm based on the Quantum Approximate Optimisation Algorithm to explore the conformational space and identify low-energy configurations. To benchmark our approach, we conduct a classical study using custom-built libraries tailored for structural characterisation and energy optimisation. Our quantum method demonstrates a reduction in computational cost compared to classical simulated annealing techniques, offering a scalable and promising framework for protein structure optimisation in the quantum era.

arXiv:2507.19383•Jul 25, 2025•7 citations

Penalty-free quantum optimization applied to lattice protein folding

Leif Gellersen, Anders Irbäck, Lucas Knuthson +1 more

Identifying minimum-energy structures of lattice proteins is a challenging discrete optimization problem. Quantum approaches such as analog quantum annealing and the gate-based quantum approximate optimization algorithm (QAOA) can address this problem after mapping it to a binary representation, which typically involves introducing penalty terms to enforce valid chain configurations. However, in this and many related problems, the use of quadratic penalty terms can be avoided by restricting the search space to independent sets in a conflict graph and using a QAOA mixer designed for the maximum independent set problem. In this work, we implement and explore this QAOA variant for lattice protein folding. Here, the objective function consists solely of the protein energy together with a simple linear bias term, without quadratic penalties. We validate this approach through classical simulations of the quantum circuits for lattice proteins of lengths $N=4$ and $N=6$. To explore larger systems, we further introduce a heuristic iterative local-search scheme, with which we successfully fold lattice proteins with lengths up to $N=14$ using local subgraphs with at most 26 qubits.

quant-pharXiv:2606.02104•Jun 2, 2026•1 citation

Quantum Assisted Protein Structure Optimization with Variational Circuit Based First Principles Conformation Search

Yalla Jnan Devi Satya Prasad, Devi Satya Prasad

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.

•Feb 2, 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,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

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

Toward Quantum Combinatorial Optimization

Yunpyo Hong, Jaejoon Gill, Daeyeun Kim +3 more

The Quantum Approximate Optimization Algorithm (QAOA) has emerged as one of the most prominent hybrid quantum–classical algorithms for combinatorial optimization on noisy intermediate-scale quantum (NISQ) hardware. QAOA maps real-world problems into Ising or quadratic unconstrained binary optimization (QUBO) forms and alternates cost and mixer operators in a shallow parameterized circuit whose angles are tuned by a classical optimizer. This article introduces QAOA from fundamentals to practice, emphasizing why it aligns with industrial optimization through binary decision modeling and the presence of severe scaling challenges in classical optimization. We review research trends that improve expressivity and trainability, including ansatz engineering, parameter initialization, and hybrid training strategies, drawing parallels to developments in artificial intelligence. After that, we survey representative applications in emerging domains such as drug discovery, materials design, semiconductor design, logistics, and finance highlighting practical encodings and constraint-preserving formulations that keep quantum evolution within feasible subspaces beyond penalty-based methods. Finally, we present QAOA as a rapidly maturing framework with credible pathways toward near-term utility in real industrial workflows.

IEEE Nanotechnology Magazine•Jan 1, 2026•0 citations
Sidechain packing is a critical stage in protein folding, with direct implications for structure-based drug discovery. Google DeepMind's tool, AlphaFold2, predicts protein backbone reliably but sidechain positioning less accurately. Recovering the lowest-energy rotamer assignment over a fixed backbone is NP-hard. We present a hybrid quantum-classical pipeline that repacks sidechains on the AlphaFold backbone using the Quantum Approximate Optimisation Algorithm (QAOA), encoding the one- and two-body energies as a quadratic unconstrained binary optimisation (QUBO) problem. We introduce a constraint-preserving ansatz, pairing a W-state initialisation with a cyclic XY ring mixer, that enforces one-hot rotamer validity without penalty terms while keeping two-qubit gate scaling linear in the rotamer count. We also define an asymptotic shot-scaling metric, measured against the experimentally resolved conformation, that fixes optimiser quality independently of the baseline; its fitted growth stays below the classical exhaustive-search rate at moderate rotamer flexibility. Evaluated on bovine pancreatic trypsin inhibitor (5PTI) across high- and moderate AlphaFold-confidence regions, the pipeline lowers conformational energy against the AlphaFold baseline.
The paper studies fixed-backbone protein sidechain packing with QAOA: selecting one rotamer per residue to minimise a pairwise conformational-energy model. A hybrid pipeline uses PyRosetta to generate and prune rotamers, maps their energies to a one-hot QUBO, and optimises a constraint-preserving circuit. Each residue register starts in a W state; an XY ring mixer preserves one-hot validity without penalties. The mixer uses O(MN)O(MN)O(MN) two-qubit gates, versus O(MN2)O(MN^2)O(MN2) for complete-graph mixing, for MMM residues and NNN rotamers per residue.
State-vector simulations examine subsections of bovine pancreatic trypsin inhibitor (5PTI), using 30 seeds and depths up to p=12p=12p=12, with registers up to 22 qubits. Exhaustive enumeration on experimentally resolved-backbone instances defines success as energy within 1.51.51.5 kcal/mol of the discrete minimum. Success probabilities determine the shots needed for 99.99%99.99\%99.99% recovery. An exponential fit grows as e0.31Qe^{0.31Q}e0.31Q in qubit count QQQ and remains below 500 shots through 22 qubits, although instance-dependent budgets vary substantially.
Repacking AlphaFold-backbone regions at 5–14 qubits beats the baseline by more than 1.51.51.5 kcal/mol in 15.6%15.6\%15.6% of high-confidence runs and 54%54\%54% of moderate-confidence runs; mean improvements among wins are 1.8641.8641.864 and 8.1148.1148.114 kcal/mol, respectively. High-confidence wins disappear at 22 qubits.
The study is limited to one protein and noiseless simulation. Generalisation of the fitted sampling budget remains open, hardware deployment requires explicit W-state preparation and noise evaluation, and energy improvements are not validated against binding affinity or structural stability. Larger gains against moderate-confidence predictions are attributed to weaker baselines, not stronger quantum optimisation.
Modelling and predicting protein configurations is crucial for advancing drug discovery, enabling the design of treatments for life-threatening diseases. A critical aspect of this challenge is rotamer optimisation - the determination of optimal side-chain conformations given a fixed protein backbone. This problem, involving the internal degrees of freedom of amino acid side-chains, significantly influences the protein's overall structure and function. In this work, we develop a resource-efficient optimisation algorithm to compute the ground state energy of protein structures, with a focus on side-chain configuration. We formulate the rotamer optimisation problem as a Quadratic Unconstrained Binary Optimisation problem and map it to an Ising model, enabling efficient quantum encoding. Building on this formulation, we propose a quantum algorithm based on the Quantum Approximate Optimisation Algorithm to explore the conformational space and identify low-energy configurations. To benchmark our approach, we conduct a classical study using custom-built libraries tailored for structural characterisation and energy optimisation. Our quantum method demonstrates a reduction in computational cost compared to classical simulated annealing techniques, offering a scalable and promising framework for protein structure optimisation in the quantum era.
Identifying minimum-energy structures of lattice proteins is a challenging discrete optimization problem. Quantum approaches such as analog quantum annealing and the gate-based quantum approximate optimization algorithm (QAOA) can address this problem after mapping it to a binary representation, which typically involves introducing penalty terms to enforce valid chain configurations. However, in this and many related problems, the use of quadratic penalty terms can be avoided by restricting the search space to independent sets in a conflict graph and using a QAOA mixer designed for the maximum independent set problem. In this work, we implement and explore this QAOA variant for lattice protein folding. Here, the objective function consists solely of the protein energy together with a simple linear bias term, without quadratic penalties. We validate this approach through classical simulations of the quantum circuits for lattice proteins of lengths N=4N=4N=4 and N=6N=6N=6. To explore larger systems, we further introduce a heuristic iterative local-search scheme, with which we successfully fold lattice proteins with lengths up to N=14N=14N=14 using local subgraphs with at most 26 qubits.
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.
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.
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.
The Quantum Approximate Optimization Algorithm (QAOA) has emerged as one of the most prominent hybrid quantum–classical algorithms for combinatorial optimization on noisy intermediate-scale quantum (NISQ) hardware. QAOA maps real-world problems into Ising or quadratic unconstrained binary optimization (QUBO) forms and alternates cost and mixer operators in a shallow parameterized circuit whose angles are tuned by a classical optimizer. This article introduces QAOA from fundamentals to practice, emphasizing why it aligns with industrial optimization through binary decision modeling and the presence of severe scaling challenges in classical optimization. We review research trends that improve expressivity and trainability, including ansatz engineering, parameter initialization, and hybrid training strategies, drawing parallels to developments in artificial intelligence. After that, we survey representative applications in emerging domains such as drug discovery, materials design, semiconductor design, logistics, and finance highlighting practical encodings and constraint-preserving formulations that keep quantum evolution within feasible subspaces beyond penalty-based methods. Finally, we present QAOA as a rapidly maturing framework with credible pathways toward near-term utility in real industrial workflows.