Quantum Complexity Theory Reading Group (Fall 2025)

Course Details

This reading group is dedicated to exploring both foundational and recent research in quantum complexity theory. Over the course of 11 weeks, we will study key papers and results covering topics such as quantum computational complexity, Hamiltonian complexity, and quantum circuit complexity. The sessions will combine short theoretical lectures with student-led presentations and discussions of selected papers.

Prerequisites: Participants are expected to have a solid background in theoretical computer science and quantum information. Familiarity with computational complexity theory (e.g., P, NP, BQP, QMA) and basic quantum computing concepts (quantum states, unitaries, and measurements) will be assumed. Prior exposure to quantum algorithms or quantum complexity theory is helpful but not strictly required; motivated students with strong mathematical preparation are welcome.

Instructor

Course Policies

  • The reading group will be conducted primarily via Zoom. In-person sessions may be organized when necessary.
  • All participants are required to attend every session, regardless of whether it is their presentation day. To ensure active discussion, cameras must remain on during class.
  • Each student is expected to give at least one paper review presentation during the course.
  • Presentation slides must be submitted to the instructor no later than the day before the presentation. Students who are not presenting are expected to read the paper in advance and prepare questions.

Announcements

  • (Sep 25) The paper list has been released. Students will select their presentation topics on a first-come, first-served basis.

Lectures

Week Topic Speaker Readings
1 Foundational Concepts Junseo Lee
2 Complexity Theory for NISQ Devices Sung-Bin Lee [Slides]
3 Complexity Theory, Unitary Designs, and Randomness Seonggeun Park [Slides]
4 Understanding BQP Jaehun Han [Slides]
5 Quantum State Property Testing and Complexity JungMo Lee
6 Quantum Interactive Proof Systems (I) Hyuntaek Shin
7 Quantum Interactive Proof Systems (II) Hyungmin Lim
8 NLTS Hamiltonians Eunsoo Eun
9 Quantum PCPs Gyuhyun Kim
10 Hamiltonian Complexity and Fault Tolerance Jeongbin Jo
11 Quantum Complexity and Cryptography InHee Yun
12 Computational Power of QAC0 Wonjun Baek