CSE 493Q: "Intro to Quantum Computation"

(Spring 2023)

Course Information

Instructor: Andrea Coladangelo

TAs: Xun Cao, Logan Milandin, Michael Whitmeyer

Time & location: Tuesdays and Thursdays 10-11.20am, CSE2 G10

Class Q&A: Ed Discussion

Office hours:

Andrea: Friday 4-5.30pm (CSE2 212)

Xun: Wednesday 4.30-5.30pm (CSE2 150), Thursday 4.30-5.30pm (CSE2 153)

Logan: Monday 2-3pm (Allen 5th floor breakout space), Wednesday 2.30-3.30pm (CSE2 151)

Michael: Tuesday 4-6pm (CSE2 151)

Course Description

The goal of the course is to rigorously understand the basics of the theory of quantum computation, and to explore as many fascinating applications and phenomena in quantum information as possible.

Prerequisites: students should have taken at least one linear algebra and one probability class (the more familiarity the better, but we will review what is strictly necessary at the start), and preferably also one discrete math class.

Tentative Schedule

03/28: Course overview; the double-slit experiment; complex numbers (slides, notes)

03/30: Linear algebra review; probability review; single-qubit states and measurements (notes)

04/04: Single-qubit measurements (continued); measurements in a different basis; uncertainty principle; global and relative phases (notes)

04/06: Quantum gates; Elitzur-Vaidman tester (notes, slides)

04/11: Quantum key distribution, states of many qubits (notes, slides)

04/13: States of many qubits (continued), measurements and gates (notes)

04/18: Partial measurements, Magic Square game (notes, slides)

04/20: CHSH game (notes)

04/25: No class (take home midterm)

04/27: Mid-term review

05/02: CHSH game (continued); Quantum teleportation (notes)

05/04: Basics of quantum computation (notes)

05/09: Deutsch's algorithm; Simon's algorithm (slides)

05/11: Simon's algorithm (continued); Programming quantum algorithms (notes)

05/16: Grover's algorithm (notes)

05/18: Grover's algorithm (continued); Shor's algorithm and period-finding (notes)

05/23: Shor's algorithm and period-finding (continued) (notes)

05/25: Shor's algorithm and period-finding (continued) (notes)

05/30: Final (in class)

06/01: Final review

Homeworks & Exams

Homework 1 (due Wednesday 04/05 at 11.59pm): pdf, tex

Homework 2 (due Wednesday 04/12 at 11.59pm): pdf , tex

Homework 3 (due Wednesday 04/19 at 11.59pm): pdf, tex

Midterm (due Wednesday 04/26 at 10am): pdf, tex

Homework 4 (due Wednesday 05/10 at 11.59pm): pdf, tex

Grading

60% homeworks, 20% mid-term, 20% final