IQIS Lecture 1.7 — Complexity classes
IQIS Lecture 2.7 — The square root of NOT
IQIS Lecture 1.4 — Ramsey interferometry via matrices and circuit diagrams
IQIS Lecture 3.8 — Entanglement, interference, and visibility
IQIS Lecture 2.8 — Approximating unitaries
IQIS Lecture 1.6 — Deterministic, probabilistic, and quantum computation
Quantum Computing Course: 1.7 The Phase Gates (S and T gates)
IQIS Lecture 2.2 — Why qubits?
IQIS Lecture 1.5 — Circuit diagrams and matrix multiplication
IQIS Lecture 5.2 — Classical one-time pads
IQIS Lecture 3.9 — Universal sets of gates (for multiple qubits)
IQIS Lecture 2.4 — Pauli gates, Clifford gates, and the T-gate
Qalgo 5.2: Grover's algorithm with a unique marked element
IQIS Lecture 2.10 — Universal sets of gates (for a single qubit)
NL-completeness and NL = coNL (Immerman-Szelepcsényi Theorem)
L9-5 Lamor Precession and Construction of Phase Shift Gate
Quantum Complexity Theory: Lecture 2 - Quantum computation review (UPB 2020)
Proof Complexity and Meta-Complexity Tutorial (1)
The Polynomial Time Hierarchy: Graduate Complexity Lecture 7 at CMU
Quantum Transport 2021. Lecture #2. Quantum Interference
