Investigating the potential for a limited quantum speedup on protein lattice problems

• URL: http://arxiv.org/abs/2004.01118v2
• Date: Tue, 18 May 2021 14:42:15 GMT
• Title: Investigating the potential for a limited quantum speedup on protein lattice problems
• Authors: Carlos Outeiral, Garrett M. Morris, Jiye Shi, Martin Strahm, Simon C. Benjamin and Charlotte M. Deane
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Protein folding is a central challenge in computational biology, with important applications in molecular biology, drug discovery and catalyst design. As a hard combinatorial optimisation problem, it has been studied as a potential target problem for quantum annealing. Although several experimental implementations have been discussed in the literature, the computational scaling of these approaches has not been elucidated. In this article, we present a numerical study of quantum annealing applied to a large number of small peptide folding problems, aiming to infer useful insights for near-term applications. We present two conclusions: that even naive quantum annealing, when applied to protein lattice folding, has the potential to outperform classical approaches, and that careful engineering of the Hamiltonians and schedules involved can deliver notable relative improvements for this problem. Overall, our results suggest that quantum algorithms may well offer improvements for problems in the protein folding and structure prediction realm.

Related papers

• Leveraging Pre-Trained Neural Networks to Enhance Machine Learning with Variational Quantum Circuits [48.33631905972908]
  We introduce an innovative approach that utilizes pre-trained neural networks to enhance Variational Quantum Circuits (VQC) This technique effectively separates approximation error from qubit count and removes the need for restrictive conditions. Our results extend to applications such as human genome analysis, demonstrating the broad applicability of our approach.
  arXiv  Detail & Related papers  (2024-11-13T12:03:39Z)
• Quantum Tunneling: From Theory to Error-Mitigated Quantum Simulation [49.1574468325115]
  This study presents the theoretical background and the hardware aware circuit implementation of a quantum tunneling simulation. We use error mitigation techniques (ZNE and REM) and multiprogramming of the quantum chip for solving the hardware under-utilization problem.
  arXiv  Detail & Related papers  (2024-04-10T14:27:07Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• A perspective on protein structure prediction using quantum computers [0.4397520291340696]
  We create a framework for selecting protein structure prediction problems amenable to quantum advantage. We estimate quantum resources for such problems on a utility-scale quantum computer. As a proof-of-concept, we validate our problem selection framework by accurately predicting the structure of a catalytic loop of the Zika Virus NS3 Helicase.
  arXiv  Detail & Related papers  (2023-12-01T19:04:02Z)
• Resource analysis of quantum algorithms for coarse-grained protein folding models [0.0]
  We analyze the resource requirements for simulating protein folding on a quantum computer. We calculate the minimum number of qubits, interactions, and two-qubit gates necessary to build a quantum algorithm.
  arXiv  Detail & Related papers  (2023-11-07T18:27:44Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Effect of alternating layered ansatzes on trainability of projected quantum kernel [0.0]
  We analytically and numerically investigate the vanishing similarity issue in projected quantum kernels with alternating layered ansatzes. We find that variance depends on circuit depth, size of local unitary blocks and initial state, indicating the issue is avoidable if shallow alternating layered ansatzes are used.
  arXiv  Detail & Related papers  (2023-09-30T12:32:39Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• 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)
• Vacancies in graphene: an application of adiabatic quantum optimization [0.0]
  Quantum annealers have grown in complexity to the point that quantum computations involving few thousands of qubits are now possible. In this paper, we used a simple model, compatible with the capability of current quantum annealers, to study the relative stability of graphene vacancy defects. Our approach exploits textcolorblackthe ground state as well the excited states found by the quantum annealer to extract all the possible arrangements of multiple defects on the graphene sheet together with their relative formation energies.
  arXiv  Detail & Related papers  (2020-10-12T15:59:39Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)

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.