Scott Aaronson Explores the Fundamental Limits of Quantum Computing π
Discover insights from MIT researcher Scott Aaronson on the challenges and potential of quantum computing and computational complexity theory. A must-watch for tech enthusiasts!

Institute for Quantum Computing
8.1K views β’ Dec 3, 2013

About this video
Scott Aaronson, a former IQC postdoctoral fellow, talks about his research interests at MIT - quantum computing and computational complexity theory. He's working to discover the limits of the quantum computer, citing np complete problems as an example.
Find out more about IQC!
Website - https://uwaterloo.ca/institute-for-quantum-computing/
Facebook - https://www.facebook.com/QuantumIQC
Twitter - https://twitter.com/QuantumIQC
Find out more about IQC!
Website - https://uwaterloo.ca/institute-for-quantum-computing/
Facebook - https://www.facebook.com/QuantumIQC
Twitter - https://twitter.com/QuantumIQC
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
8.1K
Likes
102
Duration
2:29
Published
Dec 3, 2013
User Reviews
4.4
(1)