CS 190/CS 264
Quantum Computation
Fall 2018
Instructor
Sandy Irani
4042 Bren Hall
irani@ics.uci.edu
Office hours: Tues 1:00-1:50PM
Teaching Assistant
Pedro Matias
pmatias@uci.edu
Please email Pedro if you have questions about homework grading.
Class Times and Place
MWF 2:00PM-2:50PM, DBH 1300
Course Overview
This course will provide an introduction to the field of quantum computation. We will start with a basic introduction to quantum mechanics from the perspective of quantum information. We will then develop computational models based on quantum mechanical principles and discuss applications such as quantum algorithms and quantum cryptography.
Prerequisites
Student should have had a course in linear algebra. At UCI, that would be ICS 6N or Math 3A. Some exposure to computational complexity (such as CS 162) is also recommended. Students with a strong background in either theoretical computer science, mathematics, or physics are welcome to attend. The course will be taught at an advanced undergraduate/early graduate level.
Course Requirements
There will be a total of eight problem sets, due in lecture on Wednesday of weeks 2 through 10, except week 6.
Each problem set will be posted in the table below by the end of the day on Wednesday, the week before it is due.
There will be a midterm in class on Wednesday of week 6,
and a final exam on Friday December 14 1:30-3:30PM.
Homework Policies:
I encourage you to work in small groups, but you must note your
collaborators on the homework you turn in. In addition, you must
write up your own solutions without any collaboration.
You may elect to take a two-day extension (until Friday 5PM) on one of the homework assignments. Other assignments turned in late (but before Friday 5PM)
will receive half credit.
You are also encouraged to put your solutions into LaTeX.
Here is a template that you can use:
Homework Template
.
Evaluation and Grades:
The midterm is worth 15% and the final is worth 25% of your final grade. Each of the Homework
assignments is worth 7.5% of your final grade.
Lecture Topics and Homework
The list of topics is tentative for now.
Reading List
There is no required text for the course. I will post lecture notes after every class on the material covered. The following is a list of books and course notes that may be useful. At the beginning of each lecture, I will point to recommended references for the material to be presented.
- Yonofsky and Mannucci, Quantum Computing for Computer Scientists
- Nielsen and Chuang, Quantum Computation and Quantum Information
- Kitaev, Shen and Vyalyi, Classical and Quantum Computation
- Mermin, Quantum Computer Science
- Umesh Vazirani's Course Notes on Quantum Computation: link
- John Preskill's Course Notes on Quantum Computation: link
- Scott Aaronson's Course Notes on Quantum Complexity Theory:link
- Scott Aaronson's Course Notes on Quantum Computing Since Democritus: link
- Qubits, Quantum Mechanics and Computers: Course Notes: link
- Andrew Child's course on Quantum Algorithms: link