COM SCI 238: Quantum Programming
History of quantum computing; the notion of a qubit; the four postulates that provide an interface to quantum mechanics; the concepts of a quantum circuit and a universal gate set; quantum teleportation; superdense coding; the no-cloning theorem; a suite of fundamental quantum algorithms including Shor's algorithm, Grover's algorithm, and the quantum approximate optimization algorithm; several quantum programming languages and how they compare; quantum simulators; quantum compilers; quantum error correction; quantum advantage. Students implement several quantum algorithms in multiple languages and run them on both simulators and a quantum computer.
4 units, lecture, discussion
Loading...
| JENS PALSBERG | Fall 2025 | 48 | 45.8% (22) |
|---|
A-range % and grade counts cover only each instructor’s latest recorded term, shown in the "Latest Data From" column, combining all sections for the course. A-range % is the share of recorded letter grades (A+ through F) that are A+, A, or A−. Parentheses show the A-range count over the total letter-grade count. P/NP and incompletes are excluded. Records may be incomplete.
- Available Academic Terms
- Winter 2022 · Fall 2025