Stanford Root

Schedule

Stanford Root

Schedule

CS 359E

Quantum Complexity Theory

UNITS:3
GRADING:Letter or Credit/No Credit
LEVEL:Graduate
GER:—

Introduction to quantum complexity theory. Topics include: the class BQP and its relation to other complexity classes; quantum query and communication complexity; quantum proof systems, Hamiltonian complexity, and the quantum PCP conjecture; the complexity & verification of quantum sampling experiments; and quantum cryptography.Prerequisites: background in quantum computing and computational complexity theory

Syllabus for selected term:
View Spring 2027 Syllabus

Sections

1 Term
Lecture 1Open
ID: 26175
0 / 999 enrolled
DAYS:TBD
TIME:TBD
LOCATION:TBD
3units

CS 359E: Quantum Complexity Theory

3 units · Letter or Credit/No Credit

Introduction to quantum complexity theory. Topics include: the class BQP and its relation to other complexity classes; quantum query and communication complexity; quantum proof systems, Hamiltonian complexity, and the quantum PCP conjecture; the complexity & verification of quantum sampling experiments; and quantum cryptography.Prerequisites: background in quantum computing and computational complexity theory

Offered in Spring 2027 at Stanford University.

Spring 2027 sections

  • Lecture — TBA TBA (Graduate)

More CS courses

  • CS 353: Seminar on Logic & Formal Philosophy (PHIL 391)
  • CS 354: Topics in Intractability: Unfulfilled Algorithmic Fantasies
  • CS 355: Advanced Topics in Cryptography
  • CS 356: Topics in Computer and Network Security
  • CS 357S: Formal Methods for Computer Systems
  • CS 359D: Quantum Complexity Theory
  • CS 360: Simplicity and Complexity in Economic Theory (ECON 284)
  • CS 361: Engineering Design Optimization (AA 222, CME 222)
  • CS 372: Artificial General Intelligence for Reasoning, Planning, and Decision Making
  • CS 375: Large-Scale Neural Network Modeling for Neuroscience (PSYCH 249)
  • CS 377G: Designing Serious Games
  • CS 377P: Read, Write, Play

All CS courses · All departments