Quantum algorithms: an overview

TL;DR

This paper provides a broad overview of quantum algorithms, highlighting their applications in cryptography, search, simulation, and linear algebra, along with recent developments and near-term uses.

Contribution

It offers a comprehensive survey of known quantum algorithms and discusses recent advances and practical applications in the field.

Findings

Quantum algorithms can outperform classical counterparts in various domains.

Recent developments enable near-term quantum applications.

Quantum algorithms are versatile across multiple fields.

Abstract

Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems, and solving large systems of linear equations. Here we briefly survey some known quantum algorithms, with an emphasis on a broad overview of their applications rather than their technical details. We include a discussion of recent developments and near-term applications of quantum algorithms.