Quantum Computation: From a Programmer’s Perspective

Sergey Sergeevich Andreev, Svetlana Alekseevna Dbar, Yuri Andreevich Klimov +2 more

Robert Hundt

This book is an introduction to quantum computing from the perspective of a classical programmer. Most concepts are explained with code, based on the insight that much of the complicated-looking math typically found in quantum computing may look quite simple in code. For many programmers, reading code is faster than reading complex math notation. Coding also allows experimentation, which helps with building intuition and understanding of the fundamental mechanisms of quantum computing. This introductory chapter details the methodology used in this book and provides an overview of the major chapters. It suggests two alternative paths through the text, one with a focus on algorithms, the other focusing on infrastructure and simulation.

Craig S. Lent

Amr Sabry

The paper develops a model of quantum computing from the perspective of functional programming. The model explains the fundamental ideas of quantum computing at a level of abstraction that is familiar to functional programmers. The model also illustrates some of the inherent difficulties in interpreting quantum mechanics and highlights the differences between quantum computing and traditional (functional or otherwise) computing models.

Adriano Barenco

M M Hassan Mahmud, Goldsmith, Daniel

In this article, we present an introduction to quantum computing (QC) tailored for computing professionals such as programmers, machine learning engineers, and data scientists. Our approach abstracts away the physics underlying QC, which can be challenging to grasp, and frames it as a model of computation similar to, for instance, Turing machines. This helps readers grasp the fundamental principles of QC from a purely logical perspective. We begin by defining quantum states and qubits, establishing their mathematical representation and role in computation. We introduce fundamental concepts such as basis states, quantum gates, and tensor products, illustrating how these form the building blocks of quantum computation. Then we present the Deutsch-Josza algorithm, one of the simplest quantum algorithms that demonstrate how quantum computers can outperform classical computers. Finally, we provide guidance for further study, recommending resources for those interested in exploring quantum algorithms, implementations, and industry applications.