
Scott Aaronson: Quantum Computing, Unsolvable Problems, & Artificial Intelligence — #9
Manifold
The Black Box Setting of Quasi-Quantum Computers
Quanum computers can solve n p complete problems in polynomial time. This is the class where a classical computer can at least verify the answer efficiently when given it. People still wonder, while, you know, how great of speed up can quanum computers give for solving n pcomplete problems? Ben: We don't even know whether n p is contained in pp. But we know that if there is a fast quantamalgaritm for n p problems, then it has to look very, very different from any of the quanamalgarithms that we currently know.
00:00
Transcript
Play full episode
Remember Everything You Learn from Podcasts
Save insights instantly, chat with episodes, and build lasting knowledge - all powered by AI.