aaronson_course
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| aaronson_course [2013/12/26 14:23] – ernesto | aaronson_course [2018/11/09 20:42] (current) – external edit 127.0.0.1 | ||
|---|---|---|---|
| Line 3: | Line 3: | ||
| Course title: Complexity theory and quantum optics\\ | Course title: Complexity theory and quantum optics\\ | ||
| - | Speaker: Scott Aaronson (MIT)\\ | + | Speaker: |
| Summary: \\ | Summary: \\ | ||
| This mini-course will start with the fundamentals of classical and quantum computational complexity theory. It will then progress to an exciting area where computational complexity is now interacting with quantum information science and even experimental quantum optics: | This mini-course will start with the fundamentals of classical and quantum computational complexity theory. It will then progress to an exciting area where computational complexity is now interacting with quantum information science and even experimental quantum optics: | ||
| Line 15: | Line 15: | ||
| * BQP versus the polynomial hierarchy, linear-optical proof that the permanent is #P-hard. | * BQP versus the polynomial hierarchy, linear-optical proof that the permanent is #P-hard. | ||
| \\ | \\ | ||
| + | Click {{: | ||
| + | |||
| Informal notes taken by Ernesto and Fernando: | Informal notes taken by Ernesto and Fernando: | ||
| - | [[http:// | + | [[http:// |
| - | [[http:// | + | [[http:// |
| - | [[http:// | + | [[http:// |
| - | [[http:// | + | [[http:// |
| - | [[http:// | + | [[http:// |
aaronson_course.1388067818.txt.gz · Last modified: 2018/11/09 20:42 (external edit)