A Novel P-bit-based Probabilistic Computing Approach for Solving the 3-D Protein Folding Problem

• URL: http://arxiv.org/abs/2502.20050v1
• Date: Thu, 27 Feb 2025 12:46:25 GMT
• Title: A Novel P-bit-based Probabilistic Computing Approach for Solving the 3-D Protein Folding Problem
• Authors: Chao Fang, Yihan He, Xiao Gong, Gengchiau Liang,
• Abstract summary: This study marks the first work to apply probabilistic computing to tackle protein folding.<n>We introduce a novel many-body interaction-based encoding method to map the problem onto an Ising model.<n>Our simulations show that this approach significantly simplifies the energy landscape for short peptide sequences of six amino acids.
• Score: 4.410469529030158
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In the post-Moore era, the need for efficient solutions to non-deterministic polynomial-time (NP) problems is becoming more pressing. In this context, the Ising model implemented by the probabilistic computing systems with probabilistic bits (p-bits) has attracted attention due to the widespread availability of p-bits and support for large-scale simulations. This study marks the first work to apply probabilistic computing to tackle protein folding, a significant NP-complete problem challenge in biology. We represent proteins as sequences of hydrophobic (H) and polar (P) beads within a three-dimensional (3-D) grid and introduce a novel many-body interaction-based encoding method to map the problem onto an Ising model. Our simulations show that this approach significantly simplifies the energy landscape for short peptide sequences of six amino acids, halving the number of energy levels. Furthermore, the proposed mapping method achieves approximately 100 times acceleration for sequences consisting of ten amino acids in identifying the correct folding configuration. We predicted the optimal folding configuration for a peptide sequence of 36 amino acids by identifying the ground state. These findings highlight the unique potential of the proposed encoding method for solving protein folding and, importantly, provide new tools for solving similar NP-complete problems in biology by probabilistic computing approach.

Related papers

• Lattice Protein Folding with Variational Annealing [2.164205569823082]
  We introduce a novel training scheme that employs masking to identify the lowest-energy folds in two-dimensional Hydrophobic-Polar (HP) lattice protein folding. Our findings emphasize the potential of advanced machine learning techniques in tackling complex protein folding problems.
  arXiv  Detail & Related papers  (2025-02-28T01:30:15Z)
• Quadratic unconstrained binary optimization and constraint programming approaches for lattice-based cyclic peptide docking [0.0]
  The peptide-protein docking problem is an important problem in structural biology that facilitates rational and efficient drug design.<n>Our work extends recent efforts by incorporating the objectives and constraints associated with peptide cyclization and peptide-protein docking in the two-particle model on a tetrahedral lattice.<n>We implement an end-to-end framework that enables the evaluation of our methods on instances from the Protein Data Bank (PDB)
  arXiv  Detail & Related papers  (2024-12-13T16:30:17Z)
• Protein Conformation Generation via Force-Guided SE(3) Diffusion Models [48.48934625235448]
  Deep generative modeling techniques have been employed to generate novel protein conformations. We propose a force-guided SE(3) diffusion model, ConfDiff, for protein conformation generation.
  arXiv  Detail & Related papers  (2024-03-21T02:44:08Z)
• An approach to solve the coarse-grained Protein folding problem in a Quantum Computer [0.0]
  Understanding protein structures and enzymes plays a critical role in target based drug designing, elucidating protein-related disease mechanisms, and innovating novel enzymes. Recent advancements in AI based protein structure prediction methods have solved the protein folding problem to an extent, but their precision in determining the structure of the protein with low sequence similarity is limited. In this work we developed a novel turn based encoding algorithm that can be run on a gate based quantum computer for predicting the structure of smaller protein sequences.
  arXiv  Detail & Related papers  (2023-11-23T18:20:05Z)
• Efficient Prediction of Peptide Self-assembly through Sequential and Graphical Encoding [57.89530563948755]
  This work provides a benchmark analysis of peptide encoding with advanced deep learning models. It serves as a guide for a wide range of peptide-related predictions such as isoelectric points, hydration free energy, etc.
  arXiv  Detail & Related papers  (2023-07-17T00:43:33Z)
• D4FT: A Deep Learning Approach to Kohn-Sham Density Functional Theory [79.50644650795012]
  We propose a deep learning approach to solve Kohn-Sham Density Functional Theory (KS-DFT) We prove that such an approach has the same expressivity as the SCF method, yet reduces the computational complexity. In addition, we show that our approach enables us to explore more complex neural-based wave functions.
  arXiv  Detail & Related papers  (2023-03-01T10:38:10Z)
• Optimal Algorithms for the Inhomogeneous Spiked Wigner Model [89.1371983413931]
  We derive an approximate message-passing algorithm (AMP) for the inhomogeneous problem. We identify in particular the existence of a statistical-to-computational gap where known algorithms require a signal-to-noise ratio bigger than the information-theoretic threshold to perform better than random.
  arXiv  Detail & Related papers  (2023-02-13T19:57:17Z)
• State-specific protein-ligand complex structure prediction with a multi-scale deep generative model [68.28309982199902]
  We present NeuralPLexer, a computational approach that can directly predict protein-ligand complex structures. Our study suggests that a data-driven approach can capture the structural cooperativity between proteins and small molecules, showing promise in accelerating the design of enzymes, drug molecules, and beyond.
  arXiv  Detail & Related papers  (2022-09-30T01:46:38Z)
• MAS2HP: A Multi Agent System to predict protein structure in 2D HP model [0.0]
  We propose a new approach for protein structure prediction by using agent-based modeling (ABM) in two dimensional hydrophobic-hydrophilic model. We have tested this algorithm on several benchmark sequences ranging from 20 to 50-mers in two dimensional Hydrophobic-Hydrophilic lattice models.
  arXiv  Detail & Related papers  (2022-05-11T05:17:47Z)
• 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)
• Polynomial unconstrained binary optimisation inspired by optical simulation [52.11703556419582]
  We propose an algorithm inspired by optical coherent Ising machines to solve the problem of unconstrained binary optimization. We benchmark the proposed algorithm against existing PUBO algorithms, and observe its superior performance. The application of our algorithm to protein folding and quantum chemistry problems sheds light on the shortcomings of approxing the electronic structure problem by a PUBO problem.
  arXiv  Detail & Related papers  (2021-06-24T16:39:31Z)
• 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)
• Lattice protein design using Bayesian learning [0.0]
  Protein design is the inverse approach of the three-dimensional (3D) structure prediction for elucidating the relationship between the 3D structures and amino acid sequences. Here, we propose a novel statistical mechanical design method using Bayesian learning, which can design lattice proteins without the exhaustive conformational search. We find a strong linearity between the chemical potential of water and the number of surface residues, thereby revealing the relationship between protein structure and the effect of water molecules.
  arXiv  Detail & Related papers  (2020-03-14T10:27:40Z)

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.