Manifold cover image

Scott Aaronson: Quantum Computing, Unsolvable Problems, & Artificial Intelligence — #9

Manifold

00:00

The Hardness of Bozon Samples for a Classical Computer

Bozon sampling is a problem because it can be extremely hard for the classiccomputer. Weso: Yet again, it's going to depend on some unproved ctures. On almost every hardness statement that you can ever care about in theoretical computer science depends on some unProved conjecture. The theory still doesn't quite answer maybe the physically relevant question of whether or not noisy versions of bozon sampling are as hard too.

Transcript
Play full episode

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app