log in  |  register  |  feedback?  |  help  |  web accessibility
Comparing classical and quantum complexity
Friday, September 23, 2016, 11:00 am-12:00 pm Calendar
  • You are subscribed to this talk through .
  • You are watching this talk through .
  • You are subscribed to this talk. (unsubscribe, watch)
  • You are watching this talk. (unwatch, subscribe)
  • You are not subscribed to this talk. (watch, subscribe)

Issues of complexity are at the root of almost all theoretical aspects of quantum information science and correspondingly, concepts from theoretical computer science have provided a strikingly novel perspective on the foundations of quantum physics itself. For the theory of algorithms and computing, the formalism of 'classical simulation of quantum circuits' provides a mathematically precise tool for studying the rich relations between classical and quantum complexity. We will give an overview of this subject, indicating some elegant mathematical ingredients and implications for physics. Along the way we will mention some striking results for quantum Clifford circuits and matchgate circuits.

This talk is organized by Adelaide Findlay