Can AI models break cryptography before quantum computers, according to Arvind Krishna?

Arvind Krishna said no. He argued, following Richard Feynman, that simulating one architecture on another never yields a more efficient result, and quantum computers do not operate in arithmetic the way GPUs do. AI could discover a new quantum algorithm, but running it on classical hardware would be 1,000 to 10,000 times slower. A classical number-theory breakthrough is possible in principle, he said, but taking ten years per key would not be practical.

• The question was prompted by an OpenAI mathematics release that week and a senior AI researcher's claim that AI could get there first.

▸In their words

“You cannot simulate something on a different architecture” Arvind Krishna · at 7:31 — open in the transcript →

Source: our own transcription of the episode. The full conversation is on All-In with Chamath, Jason, Sacks & Friedberg (2026-10-21). Read the whole episode summary →

▸More from this episode