CSE 599d Lecture Notes 13,14 and 15

Hindsight I taught things a bit out of order. What I should have done was do entanglement after Grover’s algorithm. Then it would have been nice to have a lecture on quantum communication complexity, but seeing as how things are rapidly heading towards the end (four more lectures to go) and I want to get to the threshold for fault-tolerant quantum computing I decided not to keep this. So the next lectures will introduce quantum error correction, deduce the quantum error correcting criteria, discuss classical linear and then CSS codes, discuss stabilizer codes, and then more on to fault-tolerant constructions. We might just make it.
Lecture Notes
Lecture Notes 1: Introduction and Basics of Quantum Theory
Lecture Notes 2: Dirac Notation and Basic Linear Algebra for Quantum Computing
Lecture Notes 3: One Qubit, Two Qubit
Lecture Notes 4: The No-Cloning Theorem, Classical Teleportation and Quantum Teleportation, Superdense Coding
Lecture Notes 5: The Quantum Circuit Model and Universal Quantum Computation
Lecture Notes 6: Reversible Classical Circuits and the Deutsch-Jozsa Algorithm
Lecture Notes 7: The Recursive and Nonrecursive Bernstein-Vazirani Algorithm
Lecture Notes 8: Simon’s Algorithm
Lecture Notes 9: The Quantum Fourier Transform and Jordan’s Algorithm
Lecture Notes 10: Quantum Phase Estimation and Arbitrary Size Quantum Fourier Transforms
Lecture Notes 11: Shor’s Algorithm
Lecture Notes 12: Grover’s Algorithm
Lecture Notes 13: Mixed States and Open Quantum Systems
Lecture Notes 14: Quantum Entanglement and Bell’s Theorem
Lecture Notes 15: When Quantum Computers Fall Apart
Homework 1
Homework 2

2 Replies to “CSE 599d Lecture Notes 13,14 and 15”

  1. Dave, your note on ‘mixed state and open quantum system’ seems missing here, so the 15th note on ‘why qc fall apart’ doesn’t show up in this page.
    from unauthorized far-away on-line student.

Leave a Reply

Your email address will not be published. Required fields are marked *