2018/04/10 by J. Abhijith, Abhijith J., Adetokunbo Adedoyin +41 · 1 voice · 135 citations
Computer Science · #Algorithm #Blueprint #Computability, Logic, AI Algorithms #Computer engineering #Computer science #IBM #Implementation #Physics #Programming language #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum algorithm #Quantum computer #Quantum mechanics #Quantum network #Quantum sort #Qubit #Theoretical computer science
paper · pdf · doi:10.1145/3517340
published in ACM Transactions on Quantum Computing 3(4), 1-92 (Association for Computing Machinery)
openalex publication_date 2022/03/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
As quantum computers become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classical computer programs for most of their careers. While currently available quantum computers have less than 100 qubits, quantum computing hardware is widely expected to grow in terms of qubit count, quality, and connectivity. This review aims at explaining the principles of quantum programming, which are quite different from classical programming, with straightforward algebra that makes understanding of the underlying fascinating quantum mechanical principles optional. We give an introduction to quantum computing algorithms and their implementation on real quantum hardware. We survey 20 different quantum algorithms, attempting to describe each in a succinct and self-contained fashion. We show how these algorithms can be implemented on IBM’s quantum computer, and in each case, we discuss the results of the implementation with respect to differences between the simulator and the actual hardware runs. This article introduces computer scientists, physicists, and engineers to quantum algorithms and provides a blueprint for their implementations.