Instructor: Jamie Sikora 

(Virtual) Office hours: 

• 9:30am-10:30am Mondays

• 10:30am-11:30am Wednesdays

• Immediately after lectures

• Other times available upon request

Teaching Assistants

Akshay Bansal (GTA), (hybrid) office hours: 1pm-3pm Wednesdays in Torgersen 2160Y and via Zoom

🧑‍🏫  Lectures: Tuesdays and Thursdays @ 9:30am - 10:45am in Torgersen Hall 1050 in Blacksburg and in NVC 219 in Northern Virginia 

🎥  Recorded lectures are available on Canvas

📑  The rest of the course information can be found in syllabus.pdf

🍕 Piazza is available via Canvas

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 below are partially based on and/or inspired by the reading materials mentioned.

Quantum computing basics

📖   Reading material   Lecture notes (pages 1-14)

Why quantum computing?   Slides

Random bits   Slides

Qubits   Slides

Basic measurements   Slides

Multiple qubits   Slides

Partial measurements   Slides

The no-cloning theorem   Slides

Superdense coding   Slides

Teleportation   Slides

The quantum Zeno effect and bomb-testing   Slides

Quantum algorithms

📖   Reading material   Lecture notes (pages 24-38, 70-80)

Quantum gates and circuits   Slides

Superdense coding, teleportation, and no-cloning revisited as circuits   Slides

Gate sets   Slides

Deutsch's algorithm   Slides

The Deutsch-Jozsa algorithm   Slides

Simon's algorithm   Slides

A simple searching algorithm   Slides

Grover's search algorithm   Slides

The quantum Fourier transform and its inverse   Slides

Phase estimation   Slides

Computational number theory   Slides

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)

Classical computational complexity theory   Slides

Quantum computational complexity theory   Slides

Complete problems   Slides

Quantum information

📖   Reading material   Lecture notes (pages 81-93)

Density operators   Slides

General measurements   Slides

Distinguishability and the trace norm   Slides

Similarity and the fidelity function   Slides

Quantum channels   Slides

The partial trace, purifications, and monogamy of entanglement   Slides

Quantum cryptography

Quantum key distribution   Slides

Impossibility of quantum bit commitment   Slides

Possibility of quantum money   Slides

Nonlocal games

Nonlocal games   Slides

My favourite nonlocal games   Slides

Entanglement theory

Pure state entanglement and von Neumann entropy   Slides

Mixed state entanglement and the PPT Test   Slides