This quantum computing course from freeCodeCamp.org provides a solid foundation in quantum computing, from the basics to an understanding of how popular quantum algorithms work. Quantum computing leverages the principles of quantum mechanics to process information at incredible speeds.

[embedded content]

🔗 Problem Sets: https://drive.google.com/drive/folders/1A-RHTQFRY_pipVfItQBxMU-xEexRESQj

Contents

• ⌨️ (0:00:00) Introduction
• ⌨️ (0:02:03) 0.1 Introduction to Complex Numbers
• ⌨️ (0:04:41) 0.2 Complex Numbers on the Number Plane
• ⌨️ (0:07:18) 0.3 Introduction to Matrices
• ⌨️ (0:08:36) 0.4 Matrix Multiplication to Transform a Vector
• ⌨️ (0:12:02) 0.5 Unitary and Hermitian Matrices
• ⌨️ (0:14:05) 0.6 Eigenvectors and Eigenvalues
• ⌨️ (0:14:57) 1.1 Introduction to Qubit and Superposition
• ⌨️ (0:20:06) 1.2 Introduction to Dirac Notation
• ⌨️ (0:21:28) 1.3 Representing a Qubit on the Bloch Sphere
• ⌨️ (0:23:06) 1.4 Manipulating a Qubit with Single Qubit Gates
• ⌨️ (0:27:29) 1.5 Introduction to Phase
• ⌨️ (0:31:44) 1.6 The Hadamard Gate and +, -, i, -i States
• ⌨️ (0:34:10) 1.7 The Phase Gates (S and T Gates)
• ⌨️ (0:35:15) 2.1 Representing Multiple Qubits Mathematically
• ⌨️ (0:36:54) 2.2 Quantum Circuits
• ⌨️ (0:38:43) 2.3 Multi-Qubit Gates
• ⌨️ (0:40:54) 2.4 Measuring Singular Qubits
• ⌨️ (0:43:06) 2.5 Quantum Entanglement and the Bell States
• ⌨️ (0:46:18) 2.6 Phase Kickback
• ⌨️ (0:47:55) 3.1 Superdense Coding
• ⌨️ (0:50:06) 3.2.A Classical Operations Prerequisites
• ⌨️ (0:53:20) 3.2.B Functions on Quantum Computers
• ⌨️ (0:57:27) 3.3 Deutsch’s Algorithm
• ⌨️ (1:03:06) 3.4 Deutch-Jozsa Algorithm
• ⌨️ (1:12:08) 3.5 Berstein-Vazarani Algorithm
• ⌨️ (1:16:26) 3.6 Quantum Fourier Transform (QFT)
• ⌨️ (1:22:41) 3.7 Quantum Phase Estimation
• ⌨️ (1:26:42) 3.8 Shor’s Algorithm