The goal of this post is to make you understand fundamentals of quantum computing more specifically by referencing the real physics in a very small scale, but without any complicated formula or proofs (with only entry level of physics and mathematics).

For the last post of my quantum programming series, I show you the most famous quantum algorithm, Shor’s algorithm, with Q# programming.
You can also solve integer factorization with polynomial time computation (in the input’s bit size) using this quantum algorithm, though classical one needs exponential time.

In this post, I show you several arithmetic implementation (circuit), such as addition, subtraction, multiplication, and exponentiation, using Quantum Fourier Transform (QFT).

In this post I explain the outline of Quantum Fourier Transform and Quantum Phase Estimation algorithm and see the programming example with Q#.
Q# provides high level operator for both Quantum Fourier Transform and Phase Estimation, but in this post, we implement these algorithms with primitive operators for the purpose of your learning.

In this post I explain the outline of Grover’s quantum search algorithm and see the programming example with Q#.
You could find it’s effective algorithm compared with classical brute-force search.

In order to solve the real problem with quantum computing, it’s also important to understand algorithms as well as quantum logic gates.
Here I show primitive programming sample to solve some problem for your very beginning and introductions.