Semidefinite Programming & Quantum Information
CS 6604 - Fall 2026
This seminar course introduces semidefinite programs, a powerful class of optimization problems with important applications in quantum information. The first part of the course covers the foundations of semidefinite programming, the second part focuses on applications in quantum information, and the final part consists of student presentations on related topics.
No previous knowledge of quantum theory or optimization is required.
This course does not require any coding, unless a student chooses to incorporate it into a course presentation.
Office hours: Immediately after lectures (other times and Zoom options available upon request)
Lectures: 11:15am-12:05pm on Mondays, Wednesdays, and Fridays in Whittemore 257
For CS students: This course falls under Area 6: Data and Information
AI policy and academic integrity
You can use AI however you wish except during your presentation to answer questions.
You cannot simply get slides from an external source, but you can help create them with AI. You are responsible for knowing the content on your slides.
Lecture notes can be found here. These will be updated throughout the course. All comments are welcome!
Canvas-approved accessible notes can be found here.
A special thanks to Alice Zheng for putting these notes together!
2.5 A simpler way to take the dual
2.6 Optimality conditions: Slater's theorem
2.7 Clark's theorem and ascent directions
3.1 Quantum states and measurements
3.2 Distinguishing between two states
3.3 Distinguishing between many states
3.4 Duality of Uhlmann's and Alberti's theorems
3.5 Channel norms and fidelity properties
3.6 Operator geometric means
3.7 Quantum entropy functions