Dive into the fascinating world of quantum computing with this comprehensive 1-hour 36-minute course. Explore the fundamentals of quantum mechanics and their application to information processing. Begin with an introduction to complex numbers, matrices, and essential mathematical concepts. Progress through qubit manipulation, quantum gates, and circuit design. Delve into advanced topics such as quantum entanglement, phase kickback, and popular quantum algorithms including Deutsch's, Deutsch-Jozsa, and Shor's. Gain hands-on experience with problem sets available through a provided link. Suitable for learners seeking a solid foundation in quantum computing principles and their practical applications.
Overview
Syllabus
⌨️ Introduction
⌨️ 0.1 Introduction to Complex Numbers
⌨️ 0.2 Complex Numbers on the Number Plane
⌨️ 0.3 Introduction to Matrices
⌨️ 0.4 Matrix Multiplication to Transform a Vector
⌨️ 0.5 Unitary and Hermitian Matrices
⌨️ 0.6 Eigenvectors and Eigenvalues
⌨️ 1.1 Introduction to 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 +, -, i, -i States
⌨️ 1.7 The Phase Gates S and T Gates
⌨️ 2.1 Representing Multiple Qubits Mathematically
⌨️ 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.1 Superdense Coding
⌨️ 3.2.A Classical Operations Prerequisites
⌨️ 3.2.B Functions on Quantum Computers
⌨️ 3.3 Deutsch's Algorithm
⌨️ 3.4 Deutch-Jozsa Algorithm
⌨️ 3.5 Berstein-Vazarani Algorithm
⌨️ 3.6 Quantum Fourier Transform QFT
⌨️ 3.7 Quantum Phase Estimation
⌨️ 3.8 Shor's Algorithm
Taught by
freeCodeCamp.org
