Scott Aaronson: Quantum Computing | Lex Fridman Podcast #72

Defining Supremacy

Quantum supremacy marks a pivotal moment in computing history, where quantum computers outperform classical ones on specific tasks. Scott Aaronson explains that this concept, coined by John Preskill, doesn't necessarily involve useful tasks but focuses on well-defined problems that quantum computers solve faster than classical counterparts 1. This speed advantage is due to quantum computers' ability to handle exponentially larger data sets efficiently. Aaronson emphasizes that quantum supremacy challenges skeptics who doubted quantum computers' potential to outperform classical systems 2.

Quantum supremacy is already enough by itself to refute the skeptics who said a quantum computer will never outperform a classical computer for anything.

--- Scott Aaronson

He notes that while classical computers can eventually perform the same tasks, they do so much slower, highlighting the efficiency of quantum systems.

   

Supremacy Achievements

Google's announcement of achieving quantum supremacy is a significant milestone, yet it comes with challenges in verification. Scott Aaronson notes that while quantum computers can solve problems faster, verifying these results with classical computers is complex, especially as qubit numbers increase 3. This complexity raises questions about the authenticity of quantum supremacy claims. Aaronson warns of exaggerated claims in the field, likening it to the hype seen in cryptocurrency and deep learning 4.

There is a core of something that is genuinely revolutionary and exciting and because of that core, it attracts this sort of vast penumbra of people making just utterly ridiculous claims.

--- Scott Aaronson

He stresses the importance of scrutinizing whether quantum computers truly offer a speed advantage over classical systems in practical applications.