CS 259Q
Quantum Computing
This course introduces the basics of quantum computing. Topics include: qubits, entanglement, and non-local correlations; quantum gates, circuits, and compilation algorithms; basic quantum algorithms such as Simon's algorithm and Grover's algorithm; Shor's factoring algorithm and the hidden subgroup problem; Hamiltonian simulation; stabilizer circuits, the Gottesman-Knill theorem, and the basics of quantum error correction. Prerequisites: Knowledge of linear algebra & discrete probability, and knowledge of algorithms OR quantum mechanics (or both)
Topics
- qubits
- entanglement
- and non-local correlations
- quantum gates
- circuits
- and compilation algorithms
- basic quantum algorithms such as Simon's algorithm and Grover's algorithm
- Shor's factoring algorithm and the hidden subgroup problem
- Hamiltonian simulation
- stabilizer circuits
- the Gottesman-Knill theorem
- and the basics of quantum error correction
Topics explicitly listed in official catalogue description
Sources
- Course catalogue ↗2026-2027