Description: Lecture, four hours; discussion, two hours; outside study, six hours. Requisite: Mathematics 115A. History of quantum computing; notion of qubit; four postulates that provide interface to quantum mechanics; concepts of quantum circuit and universal gate set; quantum teleportation; superdense coding; no-cloning theorem; suite of fundamental quantum algorithms including Shor's algorithm, Grover's algorithm, and 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 quantum computer. Letter grading.
Bruinwalk is an entirely Daily Bruin-run service brought to you for free. We hate
annoying ads just as much as you do,
but they help keep our lights on. We promise to keep our ads as relevant for you as possible, so
please consider disabling your ad-blocking
software while using this site.