(Formerly numbered M238.) Lecture, four hours; discussion, two hours; outside study, six hours. Requisite: Mathematics 115A. 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.