Scott Aaronson Explains Computational Complexity & Quantum Computing πŸš€

Discover insights from Scott Aaronson, a leading expert in computer science, as he explores the fascinating world of computational complexity theory and the future of quantum computers. Perfect for tech enthusiasts and learners alike!

Scott Aaronson Explains Computational Complexity & Quantum Computing πŸš€
Y Combinator
29.7K views β€’ Jun 29, 2018
Scott Aaronson Explains Computational Complexity & Quantum Computing πŸš€

About this video

Scott Aaronson - https://www.scottaaronson.com/ - is the David J. Bruton Centennial Professor of Computer Science at The University of Texas at Austin, and director of its Quantum Information Center. Before teaching at UT, he taught Electrical Engineering and Computer Science at MIT. His research interests center around the capabilities and limits of quantum computers, and computational complexity theory more generally.

If you’ve listened to our other episodes about quantum computers and are curious to learn more, check out Scott’s book Quantum Computing Since Democritus - https://www.amazon.com/Quantum-Computing-since-Democritus-Aaronson/dp/0521199565

And if you want to read Scott’s blog you can find that at - https://www.scottaaronson.com/blog/

Read the transcript on our blog - https://blog.ycombinator.com/scott-aaronson-on-computational-complexity-theory-and-quantum-computers

The YC podcast is hosted by Craig Cannon - https://twitter.com/craigcannon

Tags and Topics

Browse our collection to discover more content in these categories.

Video Information

Views

29.7K

Likes

701

Duration

01:14:27

Published

Jun 29, 2018

User Reviews

4.6
(5)
Rate:

Related Trending Topics

LIVE TRENDS

Related trending topics. Click any trend to explore more videos.

Trending Now