The prospects of quantum computing in computational molecular biology

@article{Outeiral2020ThePO,
  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},
  year={2020},
  volume={11},
  url={https://api.semanticscholar.org/CorpusID:218889377}
}
  • C. OuteiralM. Strahm C. Deane
  • Published in WIREs Computational Molecular… 22 May 2020
  • Computer Science, Biology
  • Wiley Interdisciplinary Reviews: Computational Molecular Science
The aim of this review is to introduce the promise and limitations of emerging quantum computing technologies in the areas of computational molecular biology and bioinformatics.
View on Wiley
[PDF] Semantic Reader
195 Citations
Highly Influential Citations
2
Background Citations
59
Methods Citations
6

195 Citations

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.

Quantum Computing in the Next-Generation Computational Biology Landscape: From Protein Folding to Molecular Dynamics

The present review discusses quantum computing technology and its status in solving molecular biology problems, especially in the next-generation computational biology scenario.

Biology and medicine in the landscape of quantum advantages

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

Quantum computing for genomics: conceptual challenges and practical perspectives

This work advocates for a balanced perspective on quantum computing in genomics, guiding future research toward targeted applications and robust validation through rigorous empirical validation through runtime scaling analysis to avoid misleading claims of quantum advantage.

Quantum Computing for Molecular Biology **

This work discusses how quantum computation may advance the practical usefulness of the quantum foundations of molecular biology by offering computational advantages for simulations of biomolecules and considers the dominating classical problems as well as data‐driven approaches of bioinformatics and the degree to which they might become amenable to quantum simulation and quantum computation.

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.

Quantum computing algorithms: getting closer to critical problems in computational biology

Here, a review and comment on recently developed QC algorithms for biocomputing are reviewed and commented on, with a particular focus on multi-scale modelling and genomic analyses.

Comparisons of Conventional Computing and Quantum Computing Approaches

The aim is to promote interest in quantum computing by introducing their supremacy in modern encryption and biological science by examining and analyzing the various quantum algorithms.

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

The first detailed analysis of the resources required to solve a problem of industrial size and relevance is given and it is found that, though the time and space requirements of using a quantum computer in this way are considerable, continued technological improvements could bring the required resources within reach in the future.
...

217 References

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

It is shown how to efficiently solve the eigenproblem of the Dirac-Coulomb Hamiltonian on a quantum computer and the functionality of the proposed procedure is demonstrated by numerical simulations of computations of the spin-orbit splitting in the SbH molecule.

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

It is reported, in detail, how a set of pre-computed molecular integrals can be used to explicitly create a quantum circuit, i.e. a sequence of elementary quantum operations, that, when run on a quantum computer, obtains the energy of a molecular system with fixed nuclear geometry using the quantum phase estimation algorithm.

How powerful is adiabatic quantum computation?

It is argued that the adiabatic approach may be thought of as a kind of 'quantum local search', and a family of minimization problems that is hard for such local search heuristics are designed, and an exponential lower bound is established for the ad iabatic algorithm for these problems.
...