• No products in the cart.

(

ratings

)

2

students

Created by:

Profile Photo

Last updated:

October 10, 2022

Duration:

Unlimited Duration

FREE

This course includes:

Unlimited Duration

Badge on Completion

Certificate of completion

Unlimited Duration

Description

This course is an introduction to quantum computational complexity theory

the study of the fundamental capabilities and limitations of quantum computers. Topics include complexity classes, lower bounds, communication complexity, proofs, advice, and interactive proof systems in the quantum world. The objective is to bring students to the research frontier.

Course Curriculum

  • Quantum basics Unlimited
  • More quantum basics Unlimited
  • Quantum circuits Unlimited
  • BQP and classical friends Unlimited
  • Quantum algorithms: Deutsch-Jozsa Unlimited
  • Quantum algorithms: Simon’s algorithm Unlimited
  • Shor’s algorithm and the hidden subgroup problem Unlimited
  • Hidden subgroup problem and Grover’s algorithm Unlimited
  • Grover’s algorithm and BBBV Unlimited
  • Quantum query complexity lower bounds Unlimited
  • More quantum query complexity Unlimited
  • Query complexity and the collision problem Unlimited
  • The collision problem Unlimited
  • BQP vs. PH and QMA Unlimited
  • QMA Unlimited
  • QMA and variants Unlimited
  • QIP Unlimited
  • PostBQP Unlimited
  • Closed timelike curves Unlimited
  • BQP/qpoly Unlimited
  • Quantum communication complexity Unlimited
  • More quantum communication complexity Unlimited
  • Classical simulation Unlimited
  • Grab bag Unlimited

About the instructor

0

Instructor Rating

0

Reviews

1106

Courses

1440

Students

Profile Photo
Massachusetts Institute of Technology
Copyright © 2022 OpenCoursa, All Rights Reserved