Pith. sign in

REVIEW 3 cited by

Quantum Algorithm Implementations for Beginners

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1804.03719 v3 pith:BSB3436A submitted 2018-04-10 cs.ET quant-ph

classification cs.ETquant-ph
keywords quantumalgorithmscomputerhardwareavailableclassicalcomputerscomputing
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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 to explain 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Advanced Scheduling Strategies for Distributed Quantum Computing Jobs

    quant-ph 2026-02 conditional novelty 5.0 of 10

    Link-aware scheduling rules for distributed quantum computing jobs cut simulated batch makespan by about half versus FIFO/LIST, but the best-performing rule is a simple heuristic, not the trained RL agent.

  2. Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing

    quant-ph 2025-08 unverdicted novelty 3.0 of 10

    A vision paper arguing procedural content generation is a promising early application of fault-tolerant quantum computing, illustrated by a game concept that uses a quantum algorithm for the Jones polynomial.

  3. A Cost-Effective Quantum Boolean-Phase SWAP Gate with Only Two CNOT Gates

    quant-ph 2025-07 reject novelty 3.0 of 10

    A two-CNOT swap-like gate is introduced whose transpiled version has lower gate count and depth than the standard three-CNOT SWAP, at the cost of user-selected phase distortions.

Pith tools