Skip to content

All-In Interview: Arvind Krishna & Nikesh Arora – Quantum Threat (Transcript)

IBM CEO Arvind Krishna and Palo Alto Networks CEO Nikesh Arora join David Friedberg and Chamath Palihapitiya on All-In to discuss the quantum threat to today’s cryptography, why the shift to post-quantum cryptography must start now, and how AI models like Mythos are reshaping cybersecurity. The conversation also covers open weight vs. frontier models, the AI arms race and regulation, vertical integration from the IBM mainframe to Nvidia, and the coming wave of software consolidation and SaaS disruption. Read the full transcript of this interview which was premiered on October 22, 2026 below:

The Quantum Threat to Today’s Cryptography

DAVID FRIEDBERG: (00:00:00 – 00:00:36): I know that you guys have been using the T-word a lot the last day or two in your conversations, the tokens, but maybe we could kind of pivot a little bit away from AI. I guess it’s a little bit rooted in AI, but there’s been this big conversation set in the last couple days about cryptography and some of the risks to cryptography.

I think it took root after the OpenAI math drop, but there’s more conversations now about this big quantum initiative and how that might kind of take us into an era where we need to kind of start to think about adopting quantum cryptography. But Arvind, maybe we could start and talk a little bit about where things stand today from your view.

ARVIND KRISHNA: (00:00:37 – 00:01:50): Sure. So a little bit of what David just touched on is DARPA has been running a competition called QBI, or Quantum Benchmarking Initiative. A couple of hundred companies joined it a couple of years ago. I think it’s down to maybe 13 are left. So that tells you kind of what’s maybe real. I’m calling it maybe not quite real. Some of it is real. And so their goal is who can build a quantum computer that works? Let’s sort of put the technology side out of it.

And the debates are, is it 2028, 2029, 2033? And sort of if you pick the middle point, let’s call it 2030. Well, it will break today’s cryptography. That’s not a supposition. That’s just a reality. And if that’s going to happen, then what’s the cryptography that you got to use to protect yourself against that? Unfortunately for some of you, what’s even worse, if you have an encrypted hard disk today that gets stolen, somebody could keep it for 5 years and break it at that point.

The good news is post-quantum cryptography is understood. It’s well known. The code is written, but people have been too lazy to get to it. But I think the wake-up moment is now.

CHAMATH PALIHAPITIYA: (00:01:50 – 00:02:00): Are the solutions that we understand quantum-proof or quantum-resistant? Because it’s sort of based on our basic understanding today of what quantum probably looks like.

ARVIND KRISHNA: (00:02:00 – 00:02:28): Yeah, no, it is based on understanding at a theoretical level of what quantum could do. So they are quantum-proof in the same level of rigor that today’s cryptography cannot be broken by today’s classical computers. That’s actually not a theorem proof level answer. It’s more based on complexity theory in computer science, which is grounded at the end on some assumptions, not on—

Milestones on the Road to a Working Quantum Computer

CHAMATH PALIHAPITIYA: (00:02:29 – 00:02:41): So if you look at where we are today and that 2030 midpoint, can you just walk us through the evolutionary moments that you need to see where we all have to start paying attention and say, “Okay, how do we move?”

ARVIND KRISHNA: (00:02:41 – 00:03:24): Yes. So today you got toy quantum computers. I’ll call them toys because they can do certain problems, but they’re rife with errors. They have no way to scale fully yet. So question one will be, who’s the first one who can demonstrate not a simulation, not on the side, but some level of error correction or mitigation on a running quantum computer? Step one.

And so I’ll predict you’ll see somebody make claims by next year. Then you should get third parties to evaluate, are those claims real? You’ll find one or two will make progress by 2027. Error correction, not at scale, but error correction.

NIKESH ARORA: (00:03:25 – 00:03:25): Yeah.

ARVIND KRISHNA: (00:03:25 – 00:03:48): Question 2 will be, can you run these things at some level of scale? Not yet complete scale, I call it gate computations for the lack of a better word. Today, most people are somewhere around 10,000, which if you think of a normal computer is not very much when your iPhone does a couple of billion per minute.

DAVID FRIEDBERG: (00:03:48 – 00:03:48): Yeah.

ARVIND KRISHNA: (00:03:49 – 00:04:10): So gate computations, is somebody scaling from 10,000? Are they adding a zero each year? That’s the second milestone I would put. You put those 2 steps together. And now if you put a zero per year, that means you could be at 10 million by 2029. That’s remarkable. That can do some things that’ll surprise the hell out of everybody.

DAVID FRIEDBERG: (00:04:11 – 00:04:24): Does this reference kind of this notion of a logical qubit being kind of an error-corrected operating qubit? Is that— it’s about— is that a term you’ve adopted, logical qubits, and that everyone kind of has the same milestone, the same metric?

ARVIND KRISHNA: (00:04:25 – 00:05:04): I don’t love the term, but I think it’s a fair term to just explain to people to say, “Hey, if I say I’m building a computer that’s got 10,000 qubits,” and they say, “Yeah, but they’re all noisy.” You’re right. So if I begin to error correct, it in some sense decreases the effective capacity of the machine. So a logical then says, okay, what’s the effective capacity of this machine is I think a reasonable way to look at it.

So that’s a term that I, while I don’t love, because it’s not like I’ve taken these 4 things and it’s like a DRAM cell and that’s it.