Course curriculum
-
1
Welcome!
-
Introduction
-
-
2
Introducing Computing
-
What is Classical Computing?
-
Problem Solving with Computers: A Brief Overview of Linear Equations
-
Classical Logic in a Nutshell
-
Classical Logic Demonstration
-
How is Information Stored?
-
Binary Numbers Demonstration
-
-
3
Classical Computing In-Depth
-
Introduction
-
Overview of Induction
-
Recursive Algorithm Example: What is Binary Search?
-
Introduction to Asymptotic Notation
-
Runtime Analysis of Binary Search
-
-
4
Linear Algebra Crash Course
-
Why Linear Algebra?
-
What Are Vectors and Matrices?
-
Vector Addition and Scalar Multiplication
-
Vector and Matrix Multiplication
-
Calculating the Lengths of Vectors
-
Practice: Basic Vector Operations
-
-
5
Advanced Linear Algebra Concepts
-
Introduction
-
Introducing Orthogonality
-
Equivalent State Vectors
-
Transposing Matrices
-
Matrix Operations: Finding Orthonormal Basis
-
Linear Algebra for Quantum Computing in a Nutshell
-
-
6
Introducing Quantum Computing
-
What is Quantum Computing?
-
Stern-Gerlach Experiment
-
Segway: Major Concepts in Quantum Computing
-
-
7
Major Concepts in Quantum Computing
-
Introduction
-
What is Spin?
-
The Dilemma of Measurements on the Quantum Level
-
The Mathematics of Quantum Spin
-
Interpreting Linear Algebra for Quantum Computing
-
What is Superposition?
-
What, Truly, Are Qubits?
-
(Optional) Considering Interference and Probability Amplitudes
-
-
8
Applications of Quantum Computing
-
Where Can We Take Quantum Computing?
-
What is Quantum Cryptography?
-
Introducing Alice, Bob, and Eve
-
Sending and Receiving Messages
-
The Race for Supremacy
-
-
9
Gateway to Advanced Quantum Computing
-
Introduction
-
What is Quantum Entanglement?
-
Representing Multi-Qubit Systems
-
Entanglement Calculations
-
Explaining the Standard Basis for Tensor Products
-
What are Computer Gates?
-
What is the CNOT Gate?
-
What are Pauli Transformations?
-
What are Hadamard Gates?
-
-
10
Conclusion
-
Congratulations!
-