REVIEW 7 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
Signed reviews
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.
Forward citations
Cited by 7 Pith papers
-
Advanced Scheduling Strategies for Distributed Quantum Computing Jobs
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.
-
Simulating Quantum Algorithms Using Fidelity and Coherence Time as Principle Models for Error
The simulated breakpoints for 90 percent average success are about 99 to 99.9 percent gate fidelity for short circuits and above 99.99 percent for Grover, with coherence times of 50 to 500 microseconds.
-
Knapsack Problem variants of QAOA for battery revenue optimisation
A QAOA variant with a linear penalty for knapsack-style battery scheduling achieves roughly 95 percent of optimal revenue at shallow circuit depth in small simulated instances.
-
Quantum Mini-Apps for Engineering Applications: A Case Study
A modular variational quantum Poisson solver case study finds that the Sato et al. cost function does not converge reliably, even on noise-free simulators.
-
A Software Simulator for Noisy Quantum Circuits
A new Qiskit backend simulates noisy quantum circuits using density matrices in the Pauli basis with user-selected error models.
-
Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing
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.
-
A Cost-Effective Quantum Boolean-Phase SWAP Gate with Only Two CNOT Gates
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.
Discussion (0). Continue with ORCID to comment.