IQC Math and CS seminar featuring Gregory Rosenthal

 "Fully quantum" complexity theory

by Gregory Rosenthal | University of Cambridge and University of Warwick

Traditionally quantum complexity theorists have studied the complexity of problems where the input and output are Boolean strings. However, quantum computing involves many natural problems where the input and/or output may be more general quantum states. I will discuss this "fully quantum" complexity theory, focusing on my results in circuit complexity, interactive proofs, property testing, and relation to the quantum complexity of Boolean functions.

Location

• QNC 3206

• Online on Zoom

  • Meeting ID: 916 9176 8093

  • Passcode: 364607