COM SCI 238
Quantum Programming
Computer Science · 4 units · Graduate courses (200-299)
(Formerly numbered M238.) 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.
Letter grading.
Requisites
Official UCLA wording
Requisite: Mathematics 115A.
BruinTree reads · Prerequisite
confidence 1.00 · from UCLA’s structured dataRequires
Everything that has to come before this course, not just the courses named in the requisite above.
COM SCI 238
1 direct requisite. Showing 5 courses over 3 levels; the branches marked with a count carry on past it. Every course here opens its own tree.
Unlocks
What this course is a requisite for, and what those courses lead to in turn.
No course in the catalog lists this as a requisite.