QC — Quantum Computing Series
This series covers the basic of quantum computing. The first 2 articles introduce the basic concept followed by the most popular approaches on how to build it. Then we dig deeper into the quantum operations (gates) — the instruction sets of quantum computing. We will look into its strength but also the weakness — without that, we will likely overhype the topic without a deeper understanding. Next, we start learning some basic quantum algorithms and close it with the Shor’s algorithm — a showcase for the real-life application.
It is a slight detour from what I mainly do professionally but hopes that it shows you some of the leading research areas in computing beyond buzzwords. Have fun!
Introduction
Realization of a quantum computer
Quantum computing (quantum gates)
Quantum Algorithm
Shor’s Algorithm
Others
Credit and references
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Simulating Physics with Computers
Rapid solutions of problems by quantum computation
Quantum Computation and Quantum Information
USC Introduction to Quantum Information Processing
IBM Q Experience Documentation
An Introduction to Quantum Algorithms
University of Cambridge: Quantum Computing
The Role of Interference and Entanglement in Quantum Computing