Course Description:
An Introductory course in Quantum Computing. We will introduce qubits, gates, and quantum algorithms while exploring foundational topics in quantum information theory. Furthermore, we will teach students the state of the art and latest developments in the field.

Facilitators: Debayan Bandyopadhyay (debayanband@berkeley.edu), Glenn LeBlanc (gleblanc@berkeley.edu), Ethan Yeh (ethan.yc.yeh@berkeley.edu)
Time & Location: Monday, Wednesday 6:30 to 8pm, 310 Soda Hall
Starts: September 9th, 2019

Learning Goals: Students taking this course will learn the fundamentals of quantum computing and be equipped for further study in the field and for research and industry. Students should demonstrate proficiency in going through the mechanics of state evolution in the circuit model, measurement, and various foundational subroutines in quantum algorithms. In addition, they should possess an intuition for these procedures that goes beyond the formalism.

Prerequisites: Linear algebra background (Math 54 or equivalent)
Preferred: CS61A, CS70, Physics 7C (or their respective equivalents)
Beneficial for a deeper understanding: Physics 137A, CS 170

Textbooks: Course Slides/Lecture Notes, EdX course, Vazirani lecture notes
Supplementary texts: Nielsen, Chuang; Rieffel, Polak

Primary Methods of Instruction: Lecture style sections (2 hours/week), Discussion style sections (1 hour/week), Weekly homeworks

Grades: 25% midterm, 40% HW, Final Project 30%, 5% participation

Passing: 60% and no more than 2 unexcused absences.

Final Project:
Will allow students to demonstrate that they achieved the learning goal of being able to study new ideas in quantum computing on their own. Students will be required to survey a topic of interest from a selection of topics and prepare the following: a short paper, a coding segment, and a brief presentation.

Midterm:
One midterm during the middle of the semester. Will test that students have a strong understanding of the fundamentals before proceeding to more advanced quantum algorithms.

Homework:
Will reinforce and test ideas from lecture as students learn new concepts. Will consist of a mix of coding and written exercises. Will be graded on completion, with the caveat that relevant work for a reasonable attempt at a solution is shown for every problem. If we determine that an answer does not demonstrate a good-faith effort to understand the problem, we will not give points.

Participation:
Ask questions and interact in class. For students not comfortable asking questions in class, participation points can be achieved by attending office hours, attending events, scheduling meetings with instructors, or extra credit projects.

Attendance: Students will only be allowed two unexcused absences in order to pass the course.

There will be an application. The application will be judged primarily on possessing the prerequisite for the course and being able to make the lecture times, and then on a first come, first serve basis.