Quantum Complexity Theory: Lecture 1 - Classical complexity theory review (UPB 2020)

preview_player
Показать описание
This lecture series is a video recording of the Winter 2020 Masters Level Computer Science course on Quantum Complexity Theory at Paderborn University, Germany.

Course website:

Research group webpage:

Twitter:
@sevag_gharibian
Рекомендации по теме
Комментарии
Автор

Thank you very much Dr. Gharibian for sharing these amazing courses with us.

zeroone
Автор

long awaited lecture...Thank you, Dr. Gharibian for uploading this.

rifatulislamhimel
Автор

I saw on your website that there is going to be a course on quantum algorithms in future. Please do consider posting them to youtube. It would really be a great. Your lectures are really very helpful.

bibek
Автор

Thanks a lot for your lectures. Would it be possible to have the solutions to the assignments?

JacopoRizzo-bvho
Автор

If a TM takes an infinite amount of time in deciding a language, then is that language decidable? Because I think then we should say that if inifinite amount of time is being taken by TM then it is not efficient rather than saying that the problem(Language) is undecidable, right? at 49:33

ramanchaudhary