Quantum Complexity Theory: BQP vs. the Polynomial Hierarchy Explained π
Dive into Lecture 10 of the Winter 2020 Quantum Complexity Theory course at Paderborn University. Explore the differences between BQP and the Polynomial Hierarchy in this comprehensive video.

Sevag Gharibian
895 views β’ Jan 18, 2021

About this video
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:
http://groups.uni-paderborn.de/fg-qi/courses/UPB_QCOMPLEXITY/2020/UPB_QCOMPLEXITY.html
Research group webpage:
http://groups.uni-paderborn.de/fg-qi/index.html
Twitter:
@sevag_gharibian
Course website:
http://groups.uni-paderborn.de/fg-qi/courses/UPB_QCOMPLEXITY/2020/UPB_QCOMPLEXITY.html
Research group webpage:
http://groups.uni-paderborn.de/fg-qi/index.html
Twitter:
@sevag_gharibian
Video Information
Views
895
Likes
12
Duration
02:34:22
Published
Jan 18, 2021