Peptide conformational sampling using the Quantum Approximate Optimization Algorithm

• URL: http://arxiv.org/abs/2204.01821v1
• Date: Mon, 4 Apr 2022 20:09:50 GMT
• Title: Peptide conformational sampling using the Quantum Approximate Optimization Algorithm
• Authors: Sami Boulebnane, Xavier Lucas, Agnes Meyder, Stanislaw Adaszewski, Ashley Montanaro
• Abstract summary: 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.
• Score: 0.03499870393443267
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Protein folding -- the problem of predicting the spatial structure of a protein given its sequence of amino-acids -- has attracted considerable research effort in biochemistry in recent decades. In this work, we explore the potential of quantum computing to solve a simplified version of protein folding. More precisely, we numerically investigate the performance of a variational quantum algorithm, the Quantum Approximate Optimization Algorithm (QAOA), in sampling low-energy conformations of short peptides. We start by benchmarking the algorithm on an even simpler problem: sampling self-avoiding walks, which is a necessary condition for a valid protein conformation. Motivated by promising results achieved by QAOA on this problem, we then apply the algorithm to a more complete version of protein folding, including a simplified physical potential. In this case, based on numerical simulations on 20 qubits, we find less promising results: deep quantum circuits are required to achieve accurate results, and the performance of QAOA can be matched by random sampling up to a small overhead. Overall, these results cast serious doubt on the ability of QAOA to address the protein folding problem in the near term, even in an extremely simplified setting. We believe that the approach and conclusions presented in this work could offer valuable methodological insights on how to systematically evaluate variational quantum optimization algorithms on real-world problems beyond protein folding.

Related papers

• Fast Expectation Value Calculation Speedup of Quantum Approximate Optimization Algorithm: HoLCUs QAOA [55.2480439325792]
  We present a new method for calculating expectation values of operators that can be expressed as a linear combination of unitary (LCU) operators. This method is general for any quantum algorithm and is of particular interest in the acceleration of variational quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-03T17:15:23Z)
• 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)
• A Novel P-bit-based Probabilistic Computing Approach for Solving the 3-D Protein Folding Problem [4.410469529030158]
  This study marks the first work to apply probabilistic computing to tackle protein folding. We 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.
  arXiv  Detail & Related papers  (2025-02-27T12:46:25Z)
• Solving the Perfect Domination Problem by Quantum Approximate Optimization Algorithm with Small Layers [1.345977710890196]
  The Perfect Domination Problem ( PDP) has significant applications in real-world scenarios, such as wireless and social networks. With the recent advancements in quantum computing, there has been a surge in the development of quantum algorithms aimed at addressing NP-complete problems. This study represents a pioneering effort to apply quantum algorithms to the PDP, as well as their efficacy in solving it.
  arXiv  Detail & Related papers  (2024-11-19T16:12:36Z)
• Benchmarking Variational Quantum Algorithms for Combinatorial Optimization in Practice [0.0]
  Variational quantum algorithms and, in particular, variants of the varational quantum eigensolver have been proposed to address optimization (CO) problems. We numerically investigate what this scaling result means in practice for solving CO problems using Max-Cut as a benchmark.
  arXiv  Detail & Related papers  (2024-08-06T09:57:34Z)
• 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)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Multi-sequence alignment using the Quantum Approximate Optimization Algorithm [0.0]
  We present a Hamiltonian formulation and implementation of the Multiple Sequence Alignment problem with the variational Quantum Approximate Optimization Algorithm (QAOA) We consider a small instance of our QAOA-MSA algorithm in both a quantum simulator and its performance on an actual quantum computer. While the ideal solution to the instance of MSA investigated is shown to be the most probable state sampled for a shallow p5 quantum circuit, the level of noise in current devices is still a formidable challenge.
  arXiv  Detail & Related papers  (2023-08-23T12:46:24Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• 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)
• Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
  We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves. We find both methods provide good estimates of the energy and ground state. gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
  arXiv  Detail & Related papers  (2020-11-02T19:52:04Z)
• Investigating the potential for a limited quantum speedup on protein lattice problems [0.0]
  Protein folding is a central challenge in computational biology, with important applications in molecular biology, drug discovery and catalyst design. quantum algorithms may well offer improvements for problems in the protein folding and structure prediction realm.
  arXiv  Detail & Related papers  (2020-04-02T16:40:41Z)

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.