Quantum gates as matrices
Represent qubits and the Hadamard, Pauli and CNOT gates as matrices and check their properties in NumPy.
Physicists or computer scientists drawn to quantum computing.
Linear algebra, engineering mathematics, modern physics and quantum mechanics, then advanced algorithms up to quantum algorithms.
Skill labels as listed on Coursera.
Stated prerequisites: Basic algebra (no calculus)
| Course | Level | Length | Rating (reviews) |
|---|---|---|---|
| Linear Algebra: Linear Systems and Matrix Equations | Beginner | 10 h | 4.7 (183) |
| Linear Algebra: Matrix Algebra, Determinants, & Eigenvectors | — | 15 h | 4.8 (79) |
| Linear Algebra: Orthogonality and Diagonalization | Intermediate | 9 h | 4.8 (56) |
Stated prerequisites: Single variable calculus and some computer programming ability
| Course | Level | Length | Rating (reviews) |
|---|---|---|---|
| Matrix Algebra for Engineers | Beginner | 20 h | 4.9 (4,726) |
| Differential Equations for Engineers | Beginner | 27 h | 4.9 (2,251) |
| Vector Calculus for Engineers | Beginner | 30 h | 4.8 (1,425) |
| Numerical Methods for Engineers | Intermediate | 40 h | 4.8 (451) |
| Mathematics for Engineers: The Capstone Course | Intermediate | 10 h | 5.0 (45) |
Stated prerequisites: Basic classical physics and calculus (highly recommended)
| Course | Level | Length | Rating (reviews) |
|---|---|---|---|
| Understanding Modern Physics I: Relativity and Cosmology | Beginner | 11 h | 4.6 (174) |
| Understanding Modern Physics II: Quantum Mechanics and Atoms | Beginner | 11 h | 4.6 (71) |
| Understanding Modern Physics III: Simplicity and Complexity | Beginner | 7 h | 4.8 (34) |
Stated prerequisites: Undergraduate calculus, differential equations and linear algebra
| Course | Level | Length | Rating (reviews) |
|---|---|---|---|
| Foundations of Quantum Mechanics | Intermediate | 27 h | 4.5 (94) |
| Theory of Angular Momentum | Intermediate | 13 h | 4.0 (20) |
| Approximation Methods | Intermediate | 14 h | 4.4 (14) |
Stated prerequisites: Some background in calculus, probability theory and Python programming
| Course | Level | Length | Rating (reviews) |
|---|---|---|---|
| Algorithms for Searching, Sorting, and Indexing | Intermediate | 36 h | 4.7 (544) |
| Trees and Graphs: Basics | Advanced | 34 h | 4.6 (194) |
| Dynamic Programming, Greedy Algorithms | Advanced | 38 h | 4.7 (282) |
| Approximation Algorithms and Linear Programming | Advanced | 46 h | 4.8 (67) |
| Advanced Data Structures, RSA and Quantum Algorithms | Advanced | 45 h | 4.6 (70) |
This path takes 443 hours, about 10 months at 10 hours a week. A Coursera Plus subscription gives access to most of its courses during that time.
Represent qubits and the Hadamard, Pauli and CNOT gates as matrices and check their properties in NumPy.
Write a small two- or three-qubit circuit simulator and prepare an entangled state.
Implement Grover’s search on the simulator and compare the number of iterations with a classical search.