Efficient Quantum Protein Structure Prediction with Problem-Agnostic Ansatzes

• URL: http://arxiv.org/abs/2509.18263v1
• Date: Mon, 22 Sep 2025 18:00:07 GMT
• Title: Efficient Quantum Protein Structure Prediction with Problem-Agnostic Ansatzes
• Authors: Hanna Linn, Rui-Hao Li, Alexander Holden, Abdullah Ash Saki, Frank DiFilippo, Tomas Radivoyevitch, Daniel Blankenberg, Laura García-Álvarez, Göran Johansson,
• Abstract summary: We introduce a more efficient quantum protein structure prediction workflow by employing a problem-agnostic ansatz.<n>The ansatz is trained to minimize an energy-based cost function that can be efficiently computed on classical computers.<n>We validate our method by benchmarking a hardware-efficient ansatz on a large set of proteins with up to 26 amino acids.
• Score: 31.766020245733714
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Accurately predicting protein structures from amino acid sequences remains a fundamental challenge in computational biology, with profound implications for understanding biological functions and enabling structure-based drug discovery. Quantum computing approaches based on coarse-grained lattice models combined with variational algorithms have been proposed as an initial step towards predicting protein structures using quantum computers. In this work, we introduce a more efficient quantum protein structure prediction workflow that bypasses the need for explicit Hamiltonian construction by employing a problem-agnostic ansatz. The ansatz is trained to minimize an energy-based cost function that can be efficiently computed on classical computers, eliminating the need for ancillary qubits and reducing circuit depth compared to previous Hamiltonian-based methods. This enables a more scalable approach for larger proteins and facilitates the inclusion of higher-order interactions, previously hard to achieve in quantum approaches. We validate our method by benchmarking a hardware-efficient ansatz on a large set of proteins with up to 26 amino acids, modeled on the tetrahedral, body-centered cubic, and face-centered cubic lattices, incorporating up to second-nearest-neighbor interactions. We assess the performance on both a noise-free simulator and the ibm_kingston quantum computer using a set of distinct metrics to probe different aspects of the prediction quality. These experiments push the boundaries of quantum methods for protein structure prediction, targeting sequences that are longer than those typically addressed in prior studies. Overall, the results highlight the scalability and versatility of our approach, while also identifying key areas for improvement to inform future algorithm development and hardware advancements.

Related papers

• Capturing Protein Free Energy Landscape using Efficient Quantum Encoding [0.0]
  This work presents a novel turn based encoding optimization algorithm for predicting the folded structures of peptides and small proteins.<n>We constructed a Hamiltonian from the defined objective function that encodes the folding process on a three dimensional face centered cubic lattice.<n>To identify the lowest-energy folded configurations, we utilize the Variational Quantum Eigensolver implemented on IBM 133 qubit hardware.
  arXiv  Detail & Related papers  (2025-10-17T05:06:43Z)
• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• RinQ: Towards predicting central sites in proteins on current quantum computers [0.0]
  We introduce RinQ, a hybrid quantum-classical framework for identifying functionally critical residues in proteins.<n>Protein structures are modeled as residue interaction networks (RINs), and the QUBO formulations are solved using D-Wave's simulated annealing.
  arXiv  Detail & Related papers  (2025-08-02T21:53:09Z)
• Quantum Algorithm for Protein Side-Chain Optimisation: Comparing Quantum to Classical Methods [0.0]
  We develop a resource-efficient optimisation algorithm to compute the ground state energy of protein structures.<n>We propose a quantum algorithm based on the Quantum Approximate optimisation algorithm to explore the conformational space and identify low-energy configurations.
  arXiv  Detail & Related papers  (2025-07-25T15:37:04Z)
• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• De Novo Design of Protein-Binding Peptides by Quantum Computing [44.99833362998488]
  We introduce a multi-scale framework that integrates classical and quantum computing for atomically resolved predictions.<n>The D-Wave quantum annealer rapidly generates a chemically diverse set of binders with primary structures and binding poses that correlate well with experiments.
  arXiv  Detail & Related papers  (2025-03-07T14:31:14Z)
• Efficient Protein Ground State Energy Computation via Fragmentation and Reassembly [0.0]
  We propose a novel strategy to enable quantum simulation using existing quantum algorithms.<n>Our approach involves fragmenting proteins into their corresponding amino acids, simulating them independently, and then reassembling them post-simulation while applying chemical corrections.<n>This methodology demonstrates its accuracy by calculating the ground state energy of relatively small peptides through reassembling, achieving a mean relative error of only $0.00469 pm 0.01071%$.<n>Future directions include investigating, with larger quantum computers, whether this approach remains valid for larger proteins.
  arXiv  Detail & Related papers  (2025-01-07T13:10:49Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Protein Design by Integrating Machine Learning with Quantum Annealing and Quantum-inspired Optimization [0.0]
  The protein design problem involves finding polypeptide sequences folding into a given threedimensional structure. Recent machine learning breakthroughs have enabled accurate and rapid structure predictions. We introduce a general protein design scheme where algorithmic and technological advancements in machine learning and quantum-inspired algorithms can be integrated.
  arXiv  Detail & Related papers  (2024-07-09T18:42:45Z)
• Analyzing Prospects for Quantum Advantage in Topological Data Analysis [35.423446067065576]
  We analyze and optimize an improved quantum algorithm for topological data analysis. We show that super-quadratic quantum speedups are only possible when targeting a multiplicative error approximation. We argue that quantum circuits with tens of billions of Toffoli can solve seemingly classically intractable instances.
  arXiv  Detail & Related papers  (2022-09-27T17:56:15Z)
• Peptide conformational sampling using the Quantum Approximate Optimization Algorithm [0.03499870393443267]
  We numerically investigate the performance of a variational quantum algorithm in sampling low-energy conformations of short peptides. Results cast serious doubt on the ability of QAOA to address the protein folding problem in the near term.
  arXiv  Detail & Related papers  (2022-04-04T20:09:50Z)
• EBM-Fold: Fully-Differentiable Protein Folding Powered by Energy-based Models [53.17320541056843]
  We propose a fully-differentiable approach for protein structure optimization, guided by a data-driven generative network. Our EBM-Fold approach can efficiently produce high-quality decoys, compared against traditional Rosetta-based structure optimization routines.
  arXiv  Detail & Related papers  (2021-05-11T03:40:29Z)
• Transfer Learning for Protein Structure Classification at Low Resolution [124.5573289131546]
  We show that it is possible to make accurate ($geq$80%) predictions of protein class and architecture from structures determined at low ($leq$3A) resolution. We provide proof of concept for high-speed, low-cost protein structure classification at low resolution, and a basis for extension to prediction of function.
  arXiv  Detail & Related papers  (2020-08-11T15:01:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.