Computational Complexity And Quantum Supremacy
Everyone
- 14 videos | 52m 54s
- Includes Assessment
Learn about computational complexity and consider what it means to demonstrate quantum computational advantage over classical computers.
WHAT YOU WILL LEARN
-
Understand the basics of complexity theoryUnderstand what promise problems areUnderstand circuit models of computingUnderstand more quantum modelsUnderstand what complexity classes areUnderstand more behind complexity classesUnderstand np
-
Understand bpp and bqpUnderstand a bqp complete problemUnderstand the difference between quantum vs classical complexityUnderstand that what have you learned leads to quantum supremacyUnderstand how to go beyond npUnderstand approximate and exact counting for going beyond npUnderstand the modern argument of quantum supremacy
IN THIS COURSE
-
5m 15sGet a basic understanding of complexity theory FREE ACCESS
-
2m 50sLearn about promise problems FREE ACCESS
-
8m 45sLearn about circuit models of computing FREE ACCESS
-
4m 42sLearn about more quantum models FREE ACCESS
-
1m 24sLearn how to put all topics from previous videos together FREE ACCESS
-
3m 18sLearn more about complexity classes FREE ACCESS
-
3m 48sLearn what NP is and why its important FREE ACCESS
-
2m 27sLearn about the BPP and BQP classes FREE ACCESS
-
5m 38sLearn about a BQP-Complete problem FREE ACCESS
-
2m 33sLearn about the difference between quantum and classical complexity FREE ACCESS
-
41sLearn how the topics in this course lead to quantum supremacy FREE ACCESS
-
3m 33sLearn about going beyond NP FREE ACCESS
-
4m 56sLearn about approximate and exact counting FREE ACCESS
-
3m 4sLearn about the modern argument of quantum supremacy FREE ACCESS