Quantum computing
Graduate · CS / Programming
Syllabus focus
Standard syllabus · Theoretical / proof-based
Pricing
Graduate-level rates are set on consultation. See the pricing page for K–12 and undergraduate rates.
Topics typically covered
Standard syllabus
Quantum basics
- Linear algebra review: complex vectors and unitary matrices
- Qubits, superposition, and measurement
- Single-qubit and multi-qubit gates
- Entanglement and Bell states
- Density matrices (intro)
Algorithms
- Deutsch–Jozsa and Bernstein–Vazirani
- Grover search algorithm
- Quantum Fourier transform and phase estimation (intro)
- Shor's factoring algorithm (outline)
- Variational quantum eigensolver (survey)
Theoretical / proof-based
Complexity and error correction
- BQP complexity class and relations to P/NP
- Quantum error correction: stabilizer codes (intro)
- Threshold theorem overview
- Adiabatic quantum computing (intro)
- Oracle separations and query complexity (intro)
Foundations
- No-cloning theorem and quantum information limits
- Quantum key distribution protocols
- Hidden subgroup problem framework (intro)
- Fault-tolerant gate sets (intro)
- Open problems in quantum algorithms research
Notes
Cross-listed with physics at some universities. Programming labs may use Qiskit, Cirq, or Braket.