Infoptics

User Tools

Site Tools

Trace:
aaronson_course

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
aaronson_course [2013/12/26 14:22] – ernestoaaronson_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: [[http://www.scottaaronson.com/|Scott Aaronson]] (MIT)\\
 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 9: Line 9:
  
 Topics to be addressed:\\ Topics to be addressed:\\
-   *  P versus NP, the Extended Church-Turing Thesis, and Quantum Mechanics.+   * P versus NP, the Extended Church-Turing Thesis, and Quantum Mechanics.
    * Quantum Computing, Counting, Sampling, and Postselection.    * Quantum Computing, Counting, Sampling, and Postselection.
-   * BosonSampling, the Permanent, the KLM Scheme, and the AA Approximate  +   * BosonSampling, the Permanent, the KLM Scheme, and the AA Approximate Hardness Result.
-Hardness Result.+
    * Physical Implementation Issues, Classical Verification of BosonSampling Devices.    * Physical Implementation Issues, Classical Verification of BosonSampling Devices.
-   * Possible extra topics: equivalence of sampling and searching, 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 {{:news:curso_aaronson.pdf|here for a poster about the course}}.
 +
 Informal notes taken by Ernesto and Fernando: Informal notes taken by Ernesto and Fernando:
  
-[[http://quantumrio.wordpress.com/2013/12/18/scott-in-rio/|Lecture 1]] \\ +[[http://quantumrio.wordpress.com/2013/12/18/scott-in-rio/|Lecture 1: The Extended Church-Turing Thesis.]] \\ 
-[[http://quantumrio.wordpress.com/2013/12/18/scott-aaronsons-mini-course-at-uff-2nd-lecture/|Lecture 2]] \\ +[[http://quantumrio.wordpress.com/2013/12/18/scott-aaronsons-mini-course-at-uff-2nd-lecture/|Lecture 2: Classical and Quantum Complexity Theory.]] \\ 
-[[http://quantumrio.wordpress.com/2013/12/19/scott-aaronsons-mini-course-at-uff-3rd-lecture/|Lecture 3]] \\ +[[http://quantumrio.wordpress.com/2013/12/19/scott-aaronsons-mini-course-at-uff-3rd-lecture/|Lecture 3: Linear Optics and Exact BosonSampling.]] \\ 
-[[http://quantumrio.wordpress.com/2013/12/23/scott-aaronsons-mini-course-at-uff-4th-lecture/|Lecture 4]] \\ +[[http://quantumrio.wordpress.com/2013/12/23/scott-aaronsons-mini-course-at-uff-4th-lecture/|Lecture 4: KLM, Post-selection and Approximate BosonSampling.]] \\ 
-[[http://quantumrio.wordpress.com/2013/12/26/scott-aaronsons-mini-course-at-uff-5th-and-final-lecture/|Lecture 5]] \\+[[http://quantumrio.wordpress.com/2013/12/26/scott-aaronsons-mini-course-at-uff-5th-and-final-lecture/|Lecture 5: Scalability and Verification of BosonSampling Devices.]] \\
aaronson_course.1388067745.txt.gz · Last modified: 2018/11/09 20:42 (external edit)