References: Various books will be
referenced for the different chapters of the
class. Two recommended texts are “Quantum Computing" by J. Gruska,
and "Quantum Computation and Quantum Information" by M. Nielsen and I.
Chuang (advanced).
Learning outcomes: Be able to
describe the differences between quantum computing and the classical
approach to computation. Be able to verify the way basic quantum
information processing and computation algorithms work. Be able
to describe noise in quantum circuits, and the way quantum
error-correcting codes reduce the errors due to noise. Be able to
summarize some practical implementations of quantum computers.
Content: This course will
introduce the fundamental principles of quantum
mechanics and their applications to the area of quantum computing. We
will emphasize both developing a conceptual understanding of, as well
as a
practical calculational facility for dealing with quantum circuits.
Tentative syllabus:
1. A brief history of quantum computing (week 1)
2. Classical versus quantum bits: examples (weeks 1-2)
3. Review of Linear Algebra (week 2-3)
4. Basic rules of quantum mechanics (week 3)
5. Classical computing: Irreversible versus reversible approaches (week
4)
6: Qubits and simple quantum gates (weeks 4-5)
7. Examples of quantum circuits: No-cloning theorem, quantum
encryption, teleportation, Deutsch and Grover algorithms (weeks 6-7)
8: Quantum Fourier transform, RSA cryptography, Shor's algorithm (weeks
8-9)
9: Noise and error correction (weeks 10-12)
10: Topological quantum computing (weeks 13-14)
Problem sets: About a half-dozen
problem sets (linked in the schedule below). Problem sets can be worked
on collaboratively, but should be written up individually;
see the paragraph below about the course (and university)
policies on academic misconduct (ie, cheating or enabling cheating).
Note on collaborating: I
strongly encourage collaboration, an essential skill in science and
engineering. Find partners and work together: you will learn a lot, and
it will save you time. But limit yourself
to verbal help: do not take written information from others
and do
not take written notes when you talk to others. Think things through
independently after you get help.
Grades:Problem sets
will count for about 50% of your grade. Each problem in a problem set
is worth one point unless otherwise indicated. In general, no credit
will be given for a correct answer, unless accompanied by a complete
and correct derivation. A midterm exam and a final project will
count for the remainder of the course grade. We will assign course
grades
according to the percentage of the course material mastered as follows:
A+ = 95% - 100% (stellar), A = 90% - 95% (excellent), A- = 85% - 90%
(very good), B's = 70% - 85% (good), C's = 60% - 70% (fair), D's = 50%
- 60% (poor), F = 0% - 50% (fail).
Disabilities
If you have a, perhaps non-visible, disability for which you would like
accomodation, please let us know early in the semester (within the
first two weeks) so that your academic needs may be appropriately met.
Policy on academic misconduct
Each problem set or exam will be given a grade of 0 points
if it is determined that some or all of the work on the problem set or
exam
is the result of academic misconduct. You should be clear on what
constitutes academic misconduct: see the definitions here.
Note, for example, that if you allow a fellow student to borrow your
problem set solutions and he or she then copies a problem solution from
it, then you have engaged in academic misconduct.
Whether or not academic misconduct has
occurred will be determined following the university procedures
described here.
In particular, this means that I will officially report all
instances of academic misconduct. While the
investigation into whether or not a student has engaged in academic
misconduct is underway, the student's course grade will be recorded as
"incomplete".
The college hearing panel may decide to impose further disciplinary
sanctions, up to and including dismissal from the university, as
detailed in the
university procedures linked above.
Schedule of reading assignments (weeks 8-14):
Reading assignments refer to the course lecture notes linked below.
3/08/21: Review chapters 0-2, if necessary, and read
chapter 3
3/15/21: Read chapter 4 and sections 5.1 and 5.2
3/22/21: Read chapter 6 and section 7.1
3/29/21: Read sections 7.2 and 7.3
4/05/21: Read sections 8.1 and 8.2
4/12/21: Read section 8.3 and chapter 9
4/19/21: Read section 8.4 and chapter 10
Schedule of problem sets (weeks 8-14):
Problems refer to the exercises in the course lecture notes linked
below.
Due by midnight Wednesday 3/31/21, problem set 6:
Exercises 1.12, 1.13, 1.14, 1.15, 2.1, 3.2, and 4.2 from the
lecture notes. Each problem will be worth 1 point. (solutions)
Due by midnight Sunday 4/11/21, problem set 7:
Exercises 7.6, 7.7, 7.8, 7.9, and 7.10 from the
lecture notes. Each problem will be worth 2 points.
(solutions)
Due by midnight Sunday 4/18/21, problem set 8:
Exercises 7.14, 8.2, 8.4, and 8.5 from the
lecture notes. Each problem will be worth 2 points.
(solutions)
Lecture notes:
This is a pdf of notes for Argyres' lectures from March 8 to the end of
the semester.