CSCI-GA 3033: Quantum Cryptography

(Fall 2026)

Course Information

Instructor: Fermi Ma
TA:
Time: Monday 2:45-4:45 PM (Bobst Library, Room LL150)
Office hours: by appointment

Course Description

Quantum computers will profoundly change the landscape of modern cryptography. Most famously, Shor’s algorithm will enable quantum computers to break much of the cryptography that currently secures the internet. But the impact of quantum computers on cryptography goes far beyond breaking existing cryptosystems. Quantum computers will also open the door to new kinds of cryptographic protocols that leverage quantum phenomena. In recent years, there has been an explosion of activity in this area. Not only has there been a flurry of new quantum cryptographic protocols, but surprisingly, studying these protocols has yielded deep insights into computational complexity and even fundamental physics.

The goal of this course will be to survey recent developments at the intersection of quantum computing and cryptography, with an emphasis on basic concepts and techniques. Since this is a rapidly evolving area, this course will also highlight key open questions and encourage students to formulate their own research problems.

Prerequisites

This class will assume significant mathematical maturity (i.e., comfort with proof-based mathematics) and familiarity with linear algebra. Background in quantum computing and cryptography will be helpful, but are not explicitly necessary. However, please be prepared to spend time outside of class catching up on background knowledge. Links to helpful materials will be provided.

Grading

50% in-class participation
25% final project presentation
25% final project report

Final Project

For the final project, you have two options:

A reading project: read 3-6 papers on a topic that was not explicitly covered in class, and write a report (up to 10 pages) motivating the topic and explaining the key ideas in your own words.
A research project: conduct original research on any quantum cryptography topic.

The last class meeting (December 14) will be reserved for student presentations.

LLM Policy. You are welcome (and even encouraged) to use LLMs to supplement your understanding of the lectures. You are free to use LLMs to assist you with the final project. The only restriction is that you must write the final project report in your own words.

(Tentative) Schedule

Date	Topic	Materials
9/14/26	Class Introduction: Overview of quantum cryptography Quantum bootcamp + Shor's algorithm (part 1)
9/21/26	Quantum bootcamp + Shor's algorithm (part 2)
9/28/26	Learning with errors Regev's reduction
10/5/26	Proofs of quantumness
10/14/26 (Wed, Monday schedule)	Why post-quantum assumptions aren't enough Collapse-binding commitments How to build collapse-binding commitments from LWE
10/19/26	Post-quantum zero knowledge Jordan's lemma
10/26/26	Post-quantum succinct arguments
11/2/26	Quantum Bit Commitments: Candidate constructions of quantum bit commitments Connections to quantum complexity theory
11/9/26	The unitary synthesis problem
11/16/26	Quantum Pseudorandomness 1: Pseudorandom states Compressed oracles The purification trick
11/23/26	Quantum Pseudorandomness 2: Pseudorandom unitaries
11/30/26	Uncloneable cryptography (guest lecture by Eli Goldin)
12/7/26
12/14/26	Student presentations

Additional Resources

Quantum:

Scott Aaronson’s lecture notes

Cryptography:

Quantum Cryptography: