Quantum Computation
CS 5914 - Spring 2023
Quick info
This is a hybrid course offered to students in Blacksburg and Northern Virginia.
Antirequisite: CS 4134 Quantum Computing and Information Processing.
There is no coding in this course. Also no Physics or Quantum Mechanics background is needed.
Lectures
Instructor: Jamie Sikora
Office hours also available by appointment (virtual or in-person).
GTA: Akshay Bansal
Office hours also available by appointment (virtual or in-person).
When: Tuesdays and Thursdays @ 9:30am - 10:45am.
Where: Torgersen 1050 in Blacksburg. NVC 219 in Northern Virginia.
Recorded lectures: Lectures will be recorded and available on Canvas.
Going to miss a lecture? Contact the instructor ahead of time to get a Zoom link.
***Update: Piazza is now available via Canvas***
Assignments and project details
(and other important things)
***Final project details***
- The project consists of an 8-10 page written report. There is no presentation. This is not a group project.
- If you do not wish to use latex, please discuss with the instructor as soon as possible. If you are new to latex, you may wish to play around with the sample latex file before the last minute.
- Due the last day of classes (May 3rd) (small extensions may be available upon instructor approval and for a valid reason)
Lecture materials
Recorded lectures from Spring 2021 can be found here. These are not meant as a substitute for coming to class, but you may find them useful.
The slides are partially based on and/or inspired by the reading materials mentioned. They will almost surely be updated closer to that particular lecture as I review them in detail.
Quantum computing basics
Reading material Lecture notes (pages 1-14)
Topic 1.1 - Why quantum computing? Slides
Topic 1.2 - Random bits Slides
Topic 1.3 - Qubits Slides
Topic 1.4 - Basic measurements Slides
Topic 1.5 - Multiple qubits Slides
Topic 1.6 - Partial measurements Slides
Topic 1.7 - The no-cloning theorem Slides
Topic 1.8 - Superdense coding Slides
Topic 1.9 - Teleportation Slides
Topic 1.10 - The quantum Zeno effect and bomb-testing Slides
Quantum algorithms
Reading material Lecture notes (pages 24-38, 70-80)
Topic 2.1 - Quantum gates and circuits Slides
Topic 2.2 - Superdense coding, teleportation, and no-cloning revisited as circuits Slides
Topic 2.3 - Gate sets Slides
Topic 2.4 - Deutsch's algorithm Slides
Topic 2.5 - The Deutsch-Jozsa algorithm Slides
Topic 2.6 - Simon's algorithm Slides
Topic 2.7 - A simple searching algorithm Slides
Topic 2.8 - Grover's search algorithm Slides
Topic 2.9 - The quantum Fourier transform and its inverse Slides
Topic 2.10 - Phase estimation Slides
Topic 2.11 - Computational number theory Slides
Topic 2.12 - Shor's algorithm for order finding and factoring Slides
Demo: Quantum Flytrap Website
Demo: IBM Quantum Experience Website
Computational complexity theory
Reading material Lecture notes (pages 133-139) Lecture notes (pages 207-220)
Quantum information
Reading material Lecture notes (pages 81-93)
Topic 4.1 - Density operators Slides
Topic 4.2 - General measurements Slides
Topic 4.3 - Distinguishability and the trace norm Slides
Topic 4.4 - Similarity and the fidelity function Slides
Topic 4.5 - Quantum channels Slides
Topic 4.6 - The partial trace, purifications, and monogamy of entanglement Slides