632nm cover image

Quantum Complexity: Scott Aaronson on P vs NP and the Future

632nm

00:00

Quantum Computing and NP-Hard Challenges

This chapter explores the intricate relationship between NP-hard problems and quantum computing, focusing on sharp P hardness and the complexities of the permanent function. It also discusses boson sampling, its implications for computational complexity, and the potential challenges posed by noise in experimental settings.

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