aaronson_course
Differences
This shows you the differences between two versions of the page.
| Next revision | Previous revision | ||
| aaronson_course [2013/12/26 13:53] – created ernesto | aaronson_course [2018/11/09 20:42] (current) – external edit 127.0.0.1 | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ===== Scott Aaronson' | ===== Scott Aaronson' | ||
| - | Between Dec. 16th and Dec. 20th, 2013, Scott Aaronson (MIT) delivered a 5-lecture mini-course at the Physics Institute of Universidade Federal Fluminense. This was part of an academic visit to our Quantum Optics and Quantum Information group. The visit was organized by Ernesto Galvão and Thiago de Oliveira, and Ernesto and Fernando Melo took some notes about the course, which are available below. | + | Between Dec. 16th and Dec. 20th, 2013, [[http:// |
| - | 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: | ||
| namely, the quest to understand the computational power of beamsplitter networks, and to build a device capable of solving the so-called BosonSampling problem exponentially faster than a classical computer. | namely, the quest to understand the computational power of beamsplitter networks, and to build a device capable of solving the so-called BosonSampling problem exponentially faster than a classical computer. | ||
| - | Topics to be addressed: | + | Topics to be addressed:\\ |
| - | | + | * P versus NP, the Extended Church-Turing Thesis, and Quantum Mechanics. |
| * Quantum Computing, Counting, Sampling, and Postselection. | * Quantum Computing, Counting, Sampling, and Postselection. | ||
| - | * BosonSampling, | + | * BosonSampling, |
| - | Hardness Result. | + | * Physical Implementation Issues, Classical Verification of BosonSampling Devices. |
| - | * Physical Implementation Issues, Classical Verification of BosonSampling Devices, | + | * BQP versus the polynomial hierarchy, linear-optical proof that the permanent is #P-hard. |
| - | and FermionSampling. | + | \\ |
| - | | + | Click {{: |
| - | proof that the permanent is #P-hard. | + | |
| Informal notes taken by Ernesto and Fernando: | Informal notes taken by Ernesto and Fernando: | ||
| - | Lecture 1 // | + | [[http:// |
| - | Lecture 2 // | + | [[http://quantumrio.wordpress.com/ |
| - | + | [[http://quantumrio.wordpress.com/ | |
| + | [[http:// | ||
| + | [[http:// | ||
aaronson_course.1388066033.txt.gz · Last modified: 2018/11/09 20:42 (external edit)