This course is an introduction to quantum computational complexity theory. The objective of this course is to bring students to the research frontier. This course also emphasizes the study of the fundamental capabilities and limitations of quantum computers. Topics include complexity classes, lower bounds and communication complexity. Along with these it also teaches proofs, advice, and interactive proof systems in the quantum world.
This course does not involve any written exams. Students need to answer 5 assignment questions to complete the course, the answers will be in the form of written work in pdf or word. Students can write the answers in their own time. Each answer need to be 200 words (1 Page). Once the answers are submitted, the tutor will check and assess the work.
Edukite courses are free to study. To successfully complete a course you must submit all the assignment of the course as part of assessment. Upon successful completion of a course, you can choose to make your achievement formal by obtaining your Certificate at a cost of £49.
Having an Official Edukite Certification is a great way to celebrate and share your success. You can:
- Add the certificate to your CV or resume and brighten up your career
- Show it to prove your success
Course Credit: MIT
|More quantum basics||00:20:00|
|BQP and classical friends||00:10:00|
|Quantum algorithms Deutsch-Jozsa||00:15:00|
|Quantum algorithms Simon’s algorithm||00:15:00|
|Shor’s algorithm and the hidden subgroup problem||00:15:00|
|Hidden subgroup problem and Grover’s algorithm||00:20:00|
|Grover’s algorithm and BBBV||00:20:00|
|Quantum query complexity lower bounds||00:10:00|
|More quantum query complexity||00:15:00|
|Query complexity and the collision problem||00:20:00|
|The collision problem||00:20:00|
|BQP vs. PH and QMA||00:15:00|
|QMA and variants||00:20:00|
|Closed timelike curves||00:10:00|
|Quantum communication complexity||00:20:00|
|More quantum communication complexity||00:20:00|
|Submit Your Assignment||00:00:00|
No Reviews found for this course.