Journey into the world of Quantum Computing: From Zero to Shor’s Algorithm

What you will learn

### Understand common quantum algorithms, including the most popular quantum algorithm: Shor’s Algorithm

Description

When people first start researching quantum computers, they are usually bombarded with pop-science analogies that just end up confusing them further. Like “quantum computers use qubits that can be both 0 and 1 at the same time”.  Most people upon hearing this think that quantum computers are too complex and give up on their search in understanding them.

Quantum computing is actually very straight forward if you dive into the mathematics behind it. The analogies will only get you so far, if you want to truly understand how a quantum computer actually works you must understand the maths. And don’t worry this isn’t boring, repetitive maths like you did in high school, the maths you need in order to understand most of the popular quantum algorithms (like Shor’s Algorithm) is pretty simple.

This course aims to give you a solid foundation in Quantum Computing, taking you from nothing to understanding how the popular quantum algorithms work. This will highlight why quantum computers are so powerful. All the maths you need for the course is in the first section, then after that we dive straight into understanding Quantum Computers.

Get Instant Notification of New Courses on our Telegram channel.

Thank you for choosing us to be your first introduction to the world of Quantum Computing,

Quantum Soar

English
language

Content

### Welcome!

Welcome to the Course!

### 0 Mathematical Prerequisites

0.1 Introduction to Imaginary and Complex Numbers
0.2 Complex Numbers on the Number Plane
0.3 Introduction to Matricies
0.4 Matrix Multiplication to Transform a Vector
0.5 Unitary and Hermitian Matrices
0.6 Eigenvectors and Eigenvalues

### 1 Working with a Single Qubit

1.1 Introduction to the Qubit and Superposition
1.2 Introduction to Dirac Notation
1.3 Representing a Qubit on the Bloch Sphere
1.4 Manipulating a Qubit with Single Qubit Gates
1.5 Introduction to Phase
1.6 The Hadamard Gate and the +, -, i and -i states
1.7 The Phase Gates (S and T gates)

### 2 Multiple Qubits

2.1 Mathematical Representation of Multiple Qubits
2.2 Quantum Circuits
2.3 Multi-Qubit Gates
2.4 Measuring Singular Qubits
2.5 Quantum Entanglement and the Bell States
2.6 Phase Kickback

### 3 Quantum Algorithms

3.1 Superdense Coding
3.2.A Classical Operations Prerequisites
3.2.B Functions on Quantum Computers
3.3 Deutsch’s Algorithm
3.4 Deutsch-Jozsa Algorithm
3.5 Bernstein-Vazirani Algorithm
3.6 Quantum Fourier Transform (QFT)
3.7 Quantum Phase Estimation
3.8 Shor’s Algorithm