The prospects of quantum computing in computational molecular biology

  title={The prospects of quantum computing in computational molecular biology},
  author={Carlos Outeiral and Martin Strahm and Jiye Shi and Garrett M. Morris and Simon C. Benjamin and Charlotte M. Deane},
  journal={Wiley Interdisciplinary Reviews: Computational Molecular Science},
  • C. Outeiral, M. Strahm, C. Deane
  • Published 22 May 2020
  • Computer Science
  • Wiley Interdisciplinary Reviews: Computational Molecular Science
Quantum computers can in principle solve certain problems exponentially more quickly than their classical counterparts. We have not yet reached the advent of useful quantum computation, but when we do, it will affect nearly all scientific disciplines. In this review, we examine how current quantum algorithms could revolutionize computational biology and bioinformatics. There are potential benefits across the entire field, from the ability to process vast amounts of information and run machine… 

How will quantum computers provide an industrially relevant computational advantage in quantum chemistry

This work reviews the current status of quantum hardware and algorithm theory and examines whether popular claims about quantum advantage are really going to be transformative, and goes over subtle complications of quantum chemical research that tend to be overlooked in discussions involving quantum computers.

Towards practical applications in quantum computational biology

The applicability and promising directions of quantum computing in computational biology, genetics and bioinformatics is evaluated and discussed and attempts to indicate promising directions for further research in the emerging area of quantum computational biology.

Biology and medicine in the landscape of quantum advantages

The concept of a quantum advantage is distill into a simple framework that is applied to a wide variety of computational problems relevant to these domains in an effort to assess the potential of quantum advantages in specific application areas and identify gaps that may be addressed with novel quantum approaches.

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

It is proposed that even naïve 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.

The Prospects of Monte Carlo Antibody Loop Modelling on a Fault-Tolerant Quantum Computer

Quantum computing for the biological sciences is an area of rapidly growing interest, but specific industrial applications remain elusive. Quantum Markov chain Monte Carlo has been proposed as a

Prospects of quantum computing for molecular sciences

Molecular science is governed by the dynamics of electrons and atomic nuclei, and by their interactions with electromagnetic fields. A faithful physicochemical understanding of these processes is

Variational Quantum Algorithms

An overview of the field of Variational Quantum Algorithms is presented and strategies to overcome their challenges as well as the exciting prospects for using them as a means to obtain quantum advantage are discussed.

Quantum DevOps: Towards Reliable and Applicable NISQ Quantum Computing

The need for the novel concept of Quantum DevOps is described and motivated, which entails regular checking of the reliability of NISQ Quantum Computing (QC) instances, to select the best matching (cloud) QC instance and having it integrated directly with the processes of development, testing and finally the operations of quantum based algorithms and systems enables the Quantum Dev Ops concept.

Quantum gene regulatory networks

This work introduces a parameterized quantum circuit modeling method for constructing gene regulatory networks (GRNs) using data from single-cell RNA sequencing (scRNA-seq), based on the idea of using qubit-qubit entanglement to simulate interactions between genes.



Potential of quantum computing for drug discovery

This work highlights how hybrid quantum-classical approaches to quantum simulation and quantum machine learning could yield substantial progress using noisy-intermediate scale quantum devices, whereas fault-tolerant, error-corrected quantum computers are still in their development phase.

Quantum Chemistry in the Age of Quantum Computing.

This Review provides an overview of the algorithms and results that are relevant for quantum chemistry and aims to help quantum chemists who seek to learn more about quantum computing and quantum computing researchers who would like to explore applications in quantum chemistry.

Quantum Algorithms for Quantum Chemistry and Quantum Materials Science.

In this review, a detailed snapshot of current progress in quantum algorithms for ground-state, dynamics, and thermal-state simulation is taken and their strengths and weaknesses for future developments are analyzed.

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

It is proposed that even naïve 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.

Elucidating reaction mechanisms on quantum computers

This work shows how quantum computers can be used to elucidate the reaction mechanism for biological nitrogen fixation in nitrogenase, by augmenting classical calculation of reaction mechanisms with reliable estimates for relative and activation energies that are beyond the reach of traditional methods.

Relativistic quantum chemistry on quantum computers

The past few years have witnessed a remarkable interest in the application of quantum computing for solving problems in quantum chemistry more efficiently than classical computers allow. Very

Resource-efficient quantum algorithm for protein folding

A model Hamiltonian with O ( N 4 ) scaling and a corresponding quantum variational algorithm for the folding of a polymer chain with N monomers on a lattice is presented, reflecting many physico-chemical properties of the protein, reducing the gap between coarse-grained representations and mere lattice models.

Exploiting Locality in Quantum Computation for Quantum Chemistry.

It is shown that the utilization of spatial locality combined with the Bravyi-Kitaev transformation offers an improvement in the scaling of known quantum algorithms for quantum chemistry and provides numerical examples to help illustrate this point.

Simulating quantum chemistry in the restricted Hartree-Fock space on a qubit-based quantum computing device

It is shown that using the quantum resources freed up by means of the restricted approximation for increasing the basis set can lead to more accurate results and reductions in the necessary number of quantum computing runs (shots) by several orders of magnitude, already for a simple system such as lithium hydride.

Simulation of electronic structure Hamiltonians using quantum computers

Over the last century, a large number of physical and mathematical developments paired with rapidly advancing technology have allowed the field of quantum chemistry to advance dramatically. However,