Completed
⌨️ 1.6 The Hadamard Gate and +, -, i, -i States
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Quantum Computing: From Basics to Advanced Algorithms
Automatically move to the next video in the Classroom when playback concludes
- 1 ⌨️ Introduction
- 2 ⌨️ 0.1 Introduction to Complex Numbers
- 3 ⌨️ 0.2 Complex Numbers on the Number Plane
- 4 ⌨️ 0.3 Introduction to Matrices
- 5 ⌨️ 0.4 Matrix Multiplication to Transform a Vector
- 6 ⌨️ 0.5 Unitary and Hermitian Matrices
- 7 ⌨️ 0.6 Eigenvectors and Eigenvalues
- 8 ⌨️ 1.1 Introduction to Qubit and Superposition
- 9 ⌨️ 1.2 Introduction to Dirac Notation
- 10 ⌨️ 1.3 Representing a Qubit on the Bloch Sphere
- 11 ⌨️ 1.4 Manipulating a Qubit with Single Qubit Gates
- 12 ⌨️ 1.5 Introduction to Phase
- 13 ⌨️ 1.6 The Hadamard Gate and +, -, i, -i States
- 14 ⌨️ 1.7 The Phase Gates S and T Gates
- 15 ⌨️ 2.1 Representing Multiple Qubits Mathematically
- 16 ⌨️ 2.2 Quantum Circuits
- 17 ⌨️ 2.3 Multi-Qubit Gates
- 18 ⌨️ 2.4 Measuring Singular Qubits
- 19 ⌨️ 2.5 Quantum Entanglement and the Bell States
- 20 ⌨️ 2.6 Phase Kickback
- 21 ⌨️ 3.1 Superdense Coding
- 22 ⌨️ 3.2.A Classical Operations Prerequisites
- 23 ⌨️ 3.2.B Functions on Quantum Computers
- 24 ⌨️ 3.3 Deutsch's Algorithm
- 25 ⌨️ 3.4 Deutch-Jozsa Algorithm
- 26 ⌨️ 3.5 Berstein-Vazarani Algorithm
- 27 ⌨️ 3.6 Quantum Fourier Transform QFT
- 28 ⌨️ 3.7 Quantum Phase Estimation
- 29 ⌨️ 3.8 Shor's Algorithm
