269 - Scott Aaronson: What Is Quantum Computing?

1 Feb 2026 · 1 h 25 min · 28 chapters

Ask about this episode

Ask anything about it. ChatGPT or Claude reads this page and answers with the times it was said.

Connect VO and ask about every podcast you hear, including the moments you saved. Add to ChatGPT · Add to Claude

In short

Podcast Notes: Robinson's Podcast Episode 269 - Scott Aaronson: What Is Quantum Computing?

Overview In this episode of Robinson's Podcast, Robinson Erhardt engages with Scott Aaronson, a leading figure in quantum computing and complexity theory. They discuss the fundamental concepts of quantum computing, the limitations and potentials of quantum computers, as well as the interplay between quantum mechanics and computer science.

Key Themes and Discussions

  1. Introduction to Quantum Computing
  2. Scott's Background: Scott Aaronson's initial interest in quantum computing began in the 1990s after becoming intrigued by Shor's algorithm.
  3. Conceptual Understanding: Scott emphasizes that understanding quantum algorithms primarily involves linear algebra rather than deep physics knowledge.
  1. Distinction Between Physics and Computer Science
  2. Quantum Computation vs. Quantum Physics: Scott clarifies that while building a quantum computer requires knowledge of physics, understanding quantum algorithms can be approached from a computer science perspective.
  3. Abstracting Complexity: Just as software engineers do not need to know the physics of transistors, quantum computing can be understood at a higher level without requiring in-depth physics knowledge.
  1. Core Concepts of Quantum Mechanics
  2. Amplitudes and Probability: Quantum mechanics uses amplitudes instead of direct probabilities. This leads to phenomena such as interference, which is crucial for quantum computing.
  3. Qubits: The fundamental unit of quantum computing, a qubit can exist in a superposition of states, leading to exponential growth in computational power with multiple qubits.
  1. Major Quantum Algorithms
  2. Shor's Algorithm: Efficiently factors large numbers, posing a potential threat to current cryptographic systems.
  3. Grover's Algorithm: Provides a quadratic speedup for searching through unstructured databases.
  1. Myths Surrounding Quantum Computing
  2. Parallel Processing Misconceptions: A common myth is that quantum computers can try every solution in parallel. Instead, they rely on interference effects to amplify correct answers.
  3. Exponential Bit Storage Misconception: It's often claimed that N qubits can store 2^N bits. However, this is misleading as measurements yield classical bits, not the amplitudes.
  1. Practical Challenges in Quantum Computing
  2. Building Scalable Quantum Computers: Scott outlines the ongoing engineering challenges, emphasizing that skepticism about the feasibility of quantum computers often stems from engineering rather than theoretical physics.
  3. Error Correction: To achieve reliable quantum computing, error correction codes have been developed, allowing manageable error rates in operations.
  1. Future Prospects
  2. Applications Beyond Theory: While quantum computers show promise for specific applications like simulating quantum systems and factoring, broad applicability remains uncertain.
  3. Post-Quantum Cryptography: As quantum computing evolves, there is a significant push towards developing cryptographic methods resistant to quantum attacks.
  1. Interpretations of Quantum Mechanics
  2. Debates on Quantum Reality: Scott discusses various interpretations of quantum mechanics (Copenhagen, Many-Worlds, Bohmian), highlighting that they all predict the same outcomes for quantum computations.
  1. Overall Skepticism
  2. Investor Perspective: While Scott remains optimistic about the potential of quantum computing, he acknowledges that many applications have been oversold and that practical utility remains a significant question.

Conclusion Scott Aaronson provides a comprehensive introduction to the concepts and challenges of quantum computing, emphasizing the mathematical foundations that underpin its algorithms and the skepticism surrounding its future applications. The discussion highlights the intersection of computer science and physics, showcasing both the theoretical promises and practical obstacles in realizing the full potential of quantum computing.

---

Key Takeaways

  • Quantum computing is less about parallel processing and more about leveraging the principles of quantum mechanics.
  • Understanding quantum algorithms primarily requires knowledge of linear algebra and probability.
  • The future of quantum computing involves addressing significant engineering challenges, particularly in error correction and scalability.
  • The debate around quantum mechanics interpretations, while fascinating, ultimately does not affect the predictions of quantum computing capabilities.

For further exploration of Scott Aaronson's work, visit [Scott's Blog](https://scottaaronson.blog/). For more episodes, check [Robinson's Website](http://robinsonerhardt.com).

Written by AI. May contain mistakes. Listen to the episode to check what was said.

Chapters

Tap a time to open that second in VO

Scott Aaronson's Journey into Quantum Computing

0:45 to 6:40

Scott shares his background, initial skepticism, and eventual fascination with quantum computing.

“But I first heard about quantum computing when I was a teenager in the mid-1990s.”

Understanding Quantum Algorithms

6:40 to 13:32

Discussion on how quantum algorithms operate using linear algebra and the distinction from physical implementation.

“And, you know, you might notice what I didn't mention is sort of the practical prospect of solving, you know, problems faster, you know, which has never been the main motivation for me.”

Teaching Quantum Concepts

13:32 to 14:02

Scott explains how to teach quantum computing concepts to students without extensive physics knowledge.

“all kinds of other famous things in quantum mechanics, and then all the basic algorithms for quantum computers, like Shor's algorithm, Grover's algorithm, how does quantum error correction work.”

Introduction to Quantum Computing

14:02 to 15:10

Learn how to present quantum computing concepts to beginners.

“Okay, so I really feel strongly that this is sort of, this is the order of explaining things that makes this comprehensible to a much larger set of people than before.”

Understanding Probabilities in Quantum Mechanics

15:10 to 20:06

Discover how quantum mechanics alters traditional probability calculations.

“But I don't think that that's going to happen here.”

Explaining Qubits and Their Functionality

20:06 to 24:20

Understand the role of qubits and superposition in quantum computing.

“that we're not just dealing with some fiddly little detail of particle behavior.”

The Potential of Quantum Computing

24:20 to 27:21

Explore the potential applications and challenges of quantum computers.

“Could we use that for computational benefit?”

The Wave Function and Its Complexity

27:21 to 28:00

Learn about the wave function and the challenges of simulating quantum systems.

“Or, you know, what is the rate of this chemical reaction?”

Understanding the Wave Function

28:00 to 29:50

Learn about the exponential growth of the wave function in quantum mechanics.

“This is what the chemists and physicists would call the wave function.”

Shor's Algorithm and Its Impact

29:50 to 31:50

Discover how Shor's algorithm revolutionized quantum computing and its implications.

“that is not itself about quantum mechanics.”
Show all 28 chapters

The Role of Quantum Computing in Cryptography

31:50 to 33:50

Explore how quantum computers could break modern cryptography and its significance.

“But that's that that's not how it works.”

Applications Beyond Simulation and Cryptography

33:50 to 35:30

Learn about the broader applications of quantum computing in various fields.

“And, you know, since then, we've been working to broaden the applications of a quantum computer, you know, beyond just those two two big things, which are simulating quantum mechanics itself.”

Grover's Algorithm Explained

35:30 to 37:40

Understand Grover's algorithm and its importance in searching solutions.

“finance, you know, we know how to get some benefit from a quantum computer.”

The Reality of Quantum Computing Investment

37:40 to 39:55

Discuss the transition of quantum computing from academia to the investment world.

“It just, you know, whatever problem you have, machine learning, oil and gas exploration, you know, a financial portfolio optimization.”

The Philosophical Debate on Quantum Mechanics

39:55 to 42:00

Examine the philosophical interpretations of quantum mechanics and their implications.

“I have a couple of more tangential questions at the beginning of your response.”

Skepticism in Quantum Computing

42:00 to 49:26

Explore the skepticism surrounding the feasibility of scalable quantum computers.

“And, you know, even to this day, there are some skeptics who say, you know, you will never be able to build to a scalable quantum computer, right?”

Interpretations of Quantum Mechanics

49:26 to 56:01

Discuss various interpretations of quantum mechanics and their implications.

“They would say that particles, in addition to having these wave functions, they also have these actual positions in three-dimensional space that are then just sort of jostled around by the wave function.”

Understanding Quantum Computers and Factoring

56:01 to 57:07

Learn how quantum computers tackle problems differently than expected.

“what is actually going on you know ontologically you know under the hood in nature itself or they would say we simply don't.”

Post-Quantum Cryptography and Its Importance

57:08 to 58:28

Discover the need for post-quantum encryption methods in cryptography.

“But the truth is that Shor's algorithm is very, very specific to factoring and to a few other problems in number theory that have some very, very special structure that they take advantage of.”

The Challenges of Transitioning to New Encryption Standards

58:29 to 1:01:01

Explore the difficulties in moving to new encryption systems in the digital era.

“That's the kind where you don't have to agree in advance on a secret key, right?”

Myths Surrounding Quantum Computing

1:01:02 to 1:03:06

Examine common misconceptions about quantum computing capabilities.

“using, for example, these lattice problems.”

Entanglement and Communication Myths

1:03:07 to 1:07:26

Understand the implications of quantum entanglement and its limitations on communication.

“that could be safe against the quantum computer?”

Einstein's Quest for Classical Explanations

1:07:27 to 1:10:00

Learn about Einstein's views on quantum mechanics and hidden variables.

“And if anyone measures one of the qubits and they see a one, then they know that the other qubit will also be a one.”

Understanding Bell's Theorem and Quantum Entanglement

1:10:00 to 1:13:50

Explore Bell's theorem and the implications of quantum entanglement on communication and correlations.

“But then in the 1960s, John Bell proved this very famous theorem, you know, the Bell inequality.”

Skepticism Surrounding Quantum Computing

1:13:50 to 1:16:40

Discuss the skepticism about building scalable quantum computers and the concerns behind it.

“Only those for which I can arrange this interference pattern.”

The Progress in Quantum Error Correction

1:16:40 to 1:20:20

Learn about advancements in quantum error correction and its significance for reliable quantum computing.

“You don't need perfectly reliable operations.”

Future Prospects of Quantum Computing

1:20:20 to 1:24:03

Examine the future possibilities of quantum computing and its potential applications.

“Which means, you know, this has been reduced to merely an engineering problem.”

Skepticism About Quantum Computing Applications

1:24:03 to 1:25:17

Explore the skepticism surrounding the practical applications of quantum computing.

“You know, if I could predict how many years that would take, I wouldn't be a professor.”
Hear the part that matters, and keep it.Open this episode in VO. Double tap your headphones to save a moment as you listen.
Get VO free

Transcript

Automatic transcript. May contain errors.

0:09quantum computing is a somehow a very new subject for my show after 270 plus episodes but Before we get into the field itself, I'm wondering what originally drew you to it as a research area. Was it the physics or the computer science side or the conceptual weirdness? Yeah. So, I mean, my background is in computer science and math. It's not at all physics. You know, the physics that I've learned, I've sort of picked up on the streets, so to speak. But I first heard about quantum computing when I was a teenager in the mid-1990s. So, you know, Shor's algorithm for factoring, I think, had just recently been discovered.

1:05And I read a popular article about it. It said, you know, well, that this this mathematician has shown that a quantum computer could factor huge numbers by just trying every possible divisor in a different parallel universe. Right. And I remember my reaction at the time, which is, you know, this sounds like garbage. This sounds like, you know, the physicists just do not understand what they're up against. Right. You know, like it can't work that way. right uh uh yeah that would be too good to be true and and and if that was true then you know why would you even uh need to work hard to figure that out you know that you know then then that just seems all right and so then but then you know i i had to uh uh read read more about it to be sure So I'm over a summer that I spent at Bell Labs in, I think, 1998.

2:08I did, my boss was nice enough to say, you know, are you sure I spend a month to just, you know, read up on quantum computing and, you know, do a report about it. And, you know, there were already then websites explaining it. And I remember just being amazed that, you know, when you actually learn what quantum computing is, you know, it's just linear algebra, right? It's just vectors. It's just, you know, you don't even need to know just about anything about physics, right? You need to know, you need to understand this certain generalization of the rules of probability themselves that involves complex numbers.

2:56And, you know, once you learn that, then you can understand how the basic quantum algorithms work. So I learned about Shor's algorithm. I learned about Grover's algorithm for searching giant databases, which had also recently been discovered. You know, and then I realized that Lav Grover worked in the same building as me, that he was the discoverer of Grover's algorithm. And so I went to talk to him and I had ideas for how to improve Grover's algorithm that were just complete nonsense. They just didn't work at all. But Grover was very, very nice. And he said, well, why don't you do an internship with me next summer?

3:37So I did that. And that was where I met students of Umesh Vazirani at Berkeley, who were then kind of at the forefront of figuring out what quantum computers could or couldn't do, you know, not just for one or two specific problems, but for like, you know, whole classes of problems. And I really wanted to learn whatever these people knew. Right. I wasn't sure that I could do anything original in quantum computing. And at the time, I was also very interested in AI. So I wasn't sure what I would go into. And actually, when I applied to grad school, I did get into Berkeley, but it was the AI people who recruited me there.

4:26And so I went there thinking that maybe I would do AI. Maybe I would combine AI with quantum computing somehow. And then it was only after my first year at Berkeley that I really fell in with the quantum computing people. And that was 25 years ago. But I mean, what attracted me was, first of all, that this was relatively new. There was this low-hanging fruit. You know, there were like very, very basic questions that still weren't answered that I thought, you know, maybe I could answer. And secondly, that, you know, you could actually answer these questions using math. Right. We had, you know, a very well-defined model of what a quantum computer is.

5:12I mean, you know, this was decades ahead of, you know, the experiment catching up. But, you know, now it's the today, you know, the experiments finally are catching up to the theory. But in some sense, they are merely, you know, confirming the theory in every particular. Right. Right. They're not, you know, you know, we haven't had any surprises about the basic physics of it. Right. And so so, you know, because we knew the mathematical model of what a quantum computer is, you know, we could prove theorems, you know, you don't you know about what quantum computers would and wouldn't be able to do.

5:53And so that was appealing to me. And then also just the fact that the most basic questions of computer science, like what are the limitations of efficient algorithms, does P equal NP, things like that, were somehow coming together with some of the most basic questions in physics. You know, what is quantum mechanics actually saying about reality? Right. And, you know, and it seemed like, wow, something interesting has to come out from that from that intersection. So, you know, those were the things that drew me to it, you know, more than 25 years ago. I think those are the things that, you know, are still appealing to me about it today.

6:40And, you know, you might notice what I didn't mention is sort of the practical prospect of solving, you know, problems faster, you know, which has never been the main motivation for me. If we do manage to get quantum computers that we can use for practical applications, I mean, to me, that's just icing on the cake. I might be jumping ahead here since we haven't really discussed what exactly quantum computing is. But you said that you can actually understand how quantum algorithms work with only linear algebra. And I just wanted to clarify that this is distinct, though, from understanding either the concepts, the quantum concepts of quantum computing or how to physically implement them, which I'm guessing requires a lot more than just linear.

7:32Well, OK, so if you want to actually build a quantum computer, then, of course, you need to learn about, you know, all kinds of physics, you know, different physics, you know, depending on which physical architecture it is, whether it's superconducting qubits or trapped ion qubits or neutral atom qubits. But, you know, you would have to learn the physics of that system, you know, about how to use lasers, for example, to manipulate ions and move them around. Or if it's superconducting, how to use Josephson junctions to get different superconducting currents to interfere with each other or to interact with each other.

8:22but if you just want to understand at the algorithmic level, right, it's kind of like, you know, if someone wants to become this amazing classical, you know, programmer, software engineer, they don't necessarily need to know how a transistor works, right? They don't need to know, you know, I mean, at some point, they might want to learn something about, you know, the organization of the chip, right? But, you know, they can do an enormous amount just operating at a higher level of abstraction. Okay. You know, this is, in some sense, the whole point of computer science or of software engineering is that we separate out these levels of abstraction.

9:05Right. And we have, you know, we present an interface like, you know, Python programs, you know, that doesn't require, you know, knowing all the physics of what's going on inside the machine. Okay. And with quantum computing, it's actually pretty similar to that. The thing you really have to learn is how quantum mechanics generalizes the rules of probability. So you have to learn about these numbers called amplitudes, which are the basic numbers in quantum mechanics, which we use to calculate the probability that things will happen, but which are not themselves probabilities. OK, and in fact, which can be positive or negative or complex numbers.

9:52OK, and then you learn about how to manipulate these vectors of amplitudes, these vectors of complex numbers. You know, I do linear transformations to them and then make measurements on them. Measurement is the one place where probability enters the picture. OK, so so so you see you learn all of that. But then at some level, it's just another model of computation. It's just another model from a computer science standpoint with these specific rules of what you're allowed to do and not allowed to do. And then, you know, you're already, you know, and this is what I do every year in my undergraduate class.

10:35You know, I explain those rules. And, you know, we don't go through the whole history from 1900 to 1925 of how those rules were discovered. Right. Which would involve, you know, learning an immense amount of, you know, first classical physics and Maxwell's equations and thermodynamics, dynamics, you know, differential equations. We don't do all of that. You know, we just make a few comments about it. OK. But, you know, really, we just teach the rules. Right. And the truth is, you know, if you were a mathematician in the 1800s and someone said, you know, I want you to invent something that looks like probability theory, but it should be based on complex numbers instead of real numbers, and the squares of these complex numbers should be giving you probabilities, the squared absolute values, you would basically be forced at that point to invent quantum mechanics.

11:42Now, that's not how it happened, of course. You know, that thought was... And mathematicians have had some very weird thoughts over the centuries, but that thought was a little bit too weird for any mathematician in our history to have had it, you know, until experiments just shoved it down our throats. Right. And and and, you know, so that's a but but with hindsight, we can say, yeah, this is actually mathematically. It's a very in some ways natural generalization of the rules of probability. You know, we should have thought of it. Right. And and so then, you know, I feel like, you know, in science, often the best experiments are the ones that like after you've done them, you get so much insight.

12:36that you realize why you shouldn't have needed to do the experiment in the first place, right? You, you know, you now understand something that, like, should have been obvious to you from the beginning, right? And, you know, so I don't think that, you know, the truth of quantum mechanics should have been obvious to us from the beginning, or at least I don't know why it should have been, but it at least should have been on the table as one of the possibilities for how to build a world. And so I think this is what I can teach, do teach every year to computer science students, math students who may not have taken any physics.

13:23And then they can then learn how does quantum teleportation work, how does quantum cryptography work, the Bell inequality, all kinds of other famous things in quantum mechanics, and then all the basic algorithms for quantum computers, like Shor's algorithm, Grover's algorithm, how does quantum error correction work. You can explain all of that. And then I feel like those students are then in this much, much better position if they then want to go and learn the physics of it, learn how does the hydrogen atom work, for example, how do photons work. Okay, so I really feel strongly that this is sort of, this is the order of explaining things that makes this comprehensible to a much larger set of people than before.

14:45When I first started the show in the first few episodes, I had a physicist on. And as soon as the interview started, I asked him, what is physics? which I think is a very good question, but he just was like a deer in headlights and didn't know how to answer the question, and we had to cut that out, and I had to ask something completely different. But I don't think that that's going to happen here. But for our listeners who have only heard the name quantum computing but don't know anything about it conceptually, I'm wondering how you would introduce it to them, preferably without getting too much into the the mathematics or the actual mathematical physics of it yeah yeah i mean i mean i mean the uh the trouble is you know like like you know every week i'm talking to journalists who say like can you explain what quantum computing is in one sentence something right and and i'm like well you know if i could do that or can you analogize it to something that, you know, people already know, right?

15:56And like, it wouldn't be so interesting if it were easy to do that, right? Basically, you know, quantum computing, you know, is a proposal for, you know, a new type of computation that is rooted in the laws of quantum mechanics. So you can't understand it without knowing something about what quantum mechanics says about the world, right? You know, it is inherently tied to that, okay? And, you know, what quantum mechanics says about the world, you know, what it says since it was discovered 100 years ago is that, you know, the way that we calculate the probability that something happens, you know, in our everyday life is not the way that nature uses.

16:46You know, nature uses a different way to calculate probabilities. You know, I think that's the most neutral, the most, you know, interpretation free way that I that I can say it right. Like in ordinary life, you know, a probability is a number from zero to one. OK, so, you know, you might have, you know, a 30 percent chance of rain or, you know, you would never have a negative 30 percent chance. Right. That would just be nonsense. OK. Much less would you have a complex number chance. OK. But then beyond that, you know, if I if something could happen multiple ways like, you know, this this candidate could win win an election by, you know, just running a really good campaign or by their their opponent, you know, having a scandal or dropping out or something or, you know, you know, I have to I may have to add up the probabilities of all the different ways that an event could happen to get the total probability that it happens.

17:49But I'm never sort of subtracting as I consider the different ways that something could happen. So in quantum mechanics, each possible way that something could happen gets attached to it a number called an amplitude. Now, as I said before, amplitudes can be positive or negative numbers. In fact, they can even be complex numbers involving square root of minus one. And now the rule is that if I want to know how likely is something to happen, so for example, how likely is it that if I look at this spot on a screen, I will see a photon there, right? Then I have to add up the amplitudes for all the different ways that the photon could have reached that spot.

18:42each one contributes to the total and then I take the squared absolute value of the result and that gives me the probability that it happens but let me tell you very concretely what this means it means that if I have some event like my photon hitting a certain spot and it had one path to reach that spot that had a positive amplitude and it had a different path to reach that spot that had a negative amplitude, then those two contributions can cancel each other out. They can interfere destructively. And now the total amplitude is zero, which means that that event never happens at all. Whereas if I blocked one of the two paths, then now I have only a positive contribution or only a negative contribution, and now that event can happen.

19:38Okay, so just to say that again, I can decrease the number of paths that a particle could take to reach a certain spot and thereby increase the chance that it gets to that spot. Okay, so this is what happens in the famous two-slit experiment, right, which Richard Feynman used to say that all of quantum mechanics was contained in that one experiment. Okay, and this is sort of what most clearly shows us that we're not just dealing with some fiddly little detail of particle behavior. We're dealing with a change to the rules of probability themselves. And to me, that is the core of quantum mechanics, that you have to calculate probabilities that things happen using these other numbers, these amplitudes that we don't directly see, but which are complex numbers, and which being complex numbers have not only a magnitude, but also a direction.

20:40They can point in different directions in the complex plane, and so then if different ways something could happen have amplitudes that are pointing in different directions, then they can cancel each other out. Okay, so now the basic building block of a quantum computer is what we call a qubit. A quantum bit. Okay. A qubit is just a bit that has an amplitude for being zero and an amplitude for being one. So as we say, it's in a superposition of the zero state and the one state. Okay. While it's, you know, or at least it maintains that state, you know, while it's isolated, while we're not measuring it.

21:31Okay. And, you know, now if you look, if you look at the qubit to see, you know, which is it, you know, it will always tell you one or the other. It will, in fact, you know, you're looking will force it to collapse to one of the two states, either zero or one. And quantum mechanics tells you exactly how to get from the amplitudes to the probabilities that you'll see each outcome. OK, but then once once you see an outcome, then it sticks with it. Like if you measure a qubit and you get the answer zero, then now it just is zero. Right. Now, you know, the OK, but so that that's that's already kind of interesting.

22:12But, you know, where it gets even more interesting is what happens if you have many qubits. So if you have two qubits, let's say so, you know, which could just be two, you know, electrons that have, you know, different spins. you know, different like internal states, could be photons, could be atomic nuclei, right? I don't really care what they are, right? Again, for me as a computer scientist, they're just qubits, okay? They're just, you know, something that can be in a superposition of a zero and a one, okay? But now if I have two of them, then now there are four possible things I could see when I measured them.

22:55I could see that they're both zero, you know, so zero, zero, or I could see zero, one, I could see one, zero, I could see one, one. Okay. And each of those four possibilities needs its own amplitude. Right. If I have three qubits, now I need eight amplitudes, right. For, you know, all the possible settings of three bits. Okay. If I have a thousand qubits, which is not actually that many, right. We're just talking about a thousand particles, you know physically uh now i need two to the thousand power amplitudes okay so nature you know is sort of uh uh behind the scenes you know this is what we're saying has to maintain some scratch paper with two to the thousand parameters on it just to keep track of what a thousand particles are doing okay it has to keep track of this monstrous list of amplitudes right two to the thousand, to be clear, is more than the number of atoms in the whole visible universe.

23:56Okay. And, you know, whenever something is done to the particles, then nature has to cross off that gargantuan list of parameters and replace them with new parameters. Okay. So that is an immense amount of work for nature to be going to, just to keep track of the state of a thousand particles. And it immediately raises the question, well, you know, could we use that, right? Could we use that for computational benefit? Now, the tough part is that, you know, we never directly see these parameters, these amplitudes, right? The only role that the amplitudes ever play for observation is that we need them to calculate the probabilities of the various outcomes that we do see you know and in some sense that's that's the only way that we we we know that they were ever there in the first place you know that that without them we could not account for the probabilities of the different outcomes that we see okay uh but now uh now i can tell you what the idea is with a quantum computer, right?

25:13The idea is always to sort of choreograph a pattern of interference where, you know, we would like to solve some hard computational problem, and we want to try to arrange things so that for each wrong answer to our problem, each answer that we don't want, some of the contributions to its amplitude are positive and others are negative. So on the whole, they cancel each other out, right? And we get a total amplitude on that wrong answer that's zero or close to zero. Whereas for the right answer, the answer we want to see, we want all the different contributions to its amplitude to be pointing in the same way, okay?

25:56And so that they all add up constructively. Now, if we can arrange that, then when we measure, we're going to see the right answer with a high probability, right? The tricky part is that we have to arrange this, even though we ourselves don't know in advance, you know, which answer is the right one, right? If we already knew, what would be the point, okay? And, you know, of course, for this to be useful, we also have to do it faster than the fastest classical algorithm, you know, algorithm running on a conventional computer, I mean, could do the same thing, okay? So it's not it's really not obvious, like what what this would be good for, you know, even supposing that we could build it.

26:41Right. So, you know, the idea of a quantum computer was first raised about, you know, 45 years ago by a couple of physicists, most famously by Richard Feynman and by David Deutsch. and at the time, if you ask them, what is this good for? I think the main thing that they would have told you is, well, it's good for simulating quantum mechanics itself. Now, that may sound silly, but I think even 45 years later, that is still the economically most important application of a quantum computer that we know. OK, so so, you know, the the the context here, right, is that for generations, chemists and physicists have been trying to use quantum mechanics to calculate, you know, interesting things like will this material superconduct or not?

27:38Or, you know, what is the rate of this chemical reaction? Will this protein, you know, bind to this, you know, in this way? Right. But when you have many interacting particles, often many, many interacting electrons, then you need an enormous list of amplitudes to keep track of what they are doing. This is what the chemists and physicists would call the wave function. Wave function just means the list of all the amplitudes. OK, you know, the size of this wave function grows exponentially with the number of particles that you're trying to keep track of. And so they've known that for a long time as a practical problem.

28:26Right. That, you know, trying to, you know, even if even though in principle we've known the basic laws of quantum mechanics for a century, you know, actually applying them, you know, involves this exponential blow up in computation. that, you know, pushes, you know, can push supercomputers even today, you know, to the limit of what they're capable of. And certainly in the 50s and 60s was, you know, well beyond what people could handle. And so a lot of what the chemists and physicists have done, you know, over generations, they've invented heuristics, approximation methods, you know, for getting a pretty good answer, you know, often enough, you know, using a classical computer.

29:16Okay, but those methods don't always work. So you could say, you know, the first thing that a quantum computer is good for is for solving this problem that quantum mechanics itself has imposed on us, right? of this exponentiality of the wave function that arises in sort of making predictions.

29:40And it was only in the 1990s that people really showed that a quantum computer could give an advantage for any practical problem that is not itself about quantum mechanics. So that was this Shor's algorithm, which was discovered in 1994. You know, that was the thing that really suddenly brought quantum computing to the wider world's attention. You know, that was what I then read a popular article about when I was a teenager. Right. And and said this, this, this, this sounds like it can't possibly be true. Right. But what does what does Shor's what did Shor's algorithm do? So what Peter Shore showed 31 years ago is that if you built a quantum computer with, let's say, thousands or millions of qubits, you know, that would operate perfectly, you know, maintain their quantum state, you know, maintain their superposition state for as long as you needed them to.

30:41and then did a bunch of operations, you could do millions of operations on, let's say, pairs of these qubits, then you could quickly find the prime factors of gigantic numbers. Now, so you could solve this factorization problem. You could factor a 2 ,000-digit number, for example, into its prime factors. Now, why do we care about that? Well, it so happens that we have based the whole modern Internet, you know, on the unproven belief that that problem is hard or that a few closely related problems in number theory are hard. And these just so happen to be problems that a quantum computer could solve.

31:29Now, it doesn't do that by just trying every possible factor in parallel. Right. That's the that's the popular description that, like, you know, today, just like 30 years ago, you know, people like default to and they repeat because it because it sounds good. Right. But that's that that's not how it works. The way that it works is, again, by exploiting this this interference. So what Schur showed was that the problem of factoring has this very, very specific structure coming from number theory and group theory that lets you set up sort of a giant interference experiment, if you like, where for each wrong answer, each answer that's not the factor that you want, you get a destructive interference.

32:25Right. You get all the different contributions to the amplitude pointing in random directions and canceling each other out. Whereas only for the number that reveals the prime factor, you get a bunch of contributions that are all in phase and pointing the same way. OK, this was like a very, very special thing, you know, almost like a little miracle. OK. And it just, you know, it was either quantum computing's fortune or cryptography's misfortune, you know, that we just, you know, it so happens that this problem is massively important for the security of the modern Internet. Every time you visit a website and you see HTTPS, that means that your data is being encrypted or authenticated with cryptographic codes that could be broken by a quantum computer.

33:27Likewise, Bitcoin and most other cryptocurrencies, as they exist today, would also be broken by this. OK, so so so suddenly this was of interest not just to to physicists and chemists, but to, you know, the NSA to write to to to to intelligence people, you know, military people. OK. And, you know, since then, we've been working to broaden the applications of a quantum computer, you know, beyond just those two two big things, which are simulating quantum mechanics itself. You know, that I think of as like the big workhorse for, you know, economic value. Like, you know, you could use you could use a quantum simulator for designing new material, helping to design new materials, you know, new for for photovoltaics, for building better batteries, for high temperature superconductors, you know, chemical reactions to make fertilizer, you know, all kinds of things like that.

34:39that involve many body quantum mechanics, you know, and then there's this application to breaking current cryptography, which is not obviously a good thing for humanity. But, you know, it's good for whatever intelligence agency or criminal syndicate were to get that ability first, especially if no one else knows that they have it. Right. And so then, you know, for 30 years, I would say, you know, a huge question, you know, for quantum algorithms research has been, well, what are the applications of a quantum computer beyond those two things? And, you know, and we've been trying, right? And I think, you know, for a whole bunch of other areas like optimization, machine learning, finance, you know, we know how to get some benefit from a quantum computer.

Read the full transcript

35:34A lot of that is based on something that I mentioned earlier, which was Grover's algorithm for search, right? So there's, besides Shor's algorithm, maybe the second most important quantum algorithm is called Grover's, discovered in 1996. Grover's algorithm lets you take a list as sort of any problem that involves searching a list of n possible solutions, where you just know how to check each one. By the way, I enjoy that you have a cat behind you. Running around the whole time. Hopefully not a Schrodinger cat. You know, nothing that... I'd like to keep her safe in the podcast. Brutal, brutal. We'll get done to it.

36:17But yeah. But so Grover's algorithm involves searching. Let's you sort of take any problem that involves searching through a list of n possible solutions. And it lets you solve it in about the square root of n steps. So that's enormously broader in application than Shor's algorithm. Like almost anything in computer science, if you open an algorithms textbook, has some loop in it where you're just checking a list of possibilities. And where that loop could then be groverized, could be sped up by the square root. The disadvantage is that, unlike Shor's algorithm for factoring, the speed up from Grover's algorithm is much more modest.

37:09It's not an exponential speed up. It's a quadratic speed up. It's a square root speed up. OK, so and and and we don't know for the most part, you know, whether we can get advantages for these other problems that is better than the Grover advantage. But, you know, and the Grover advantage, it will probably take quite a long time before it becomes a win in practice. But, you know, we're we're working on it. We're trying to figure out what advantages quantum computers might be able to give beyond those two application areas. Now, unfortunately, once quantum computing moved from an academic subject to an investment and startup type of field, which happened, I would say, around 15 years ago, then you know people needed a narrative of why quantum computers are going to just you know speed up everything just be the next faster kind of computer right and so depressingly often you know their their solution to that to that problem was to just lie about it right and to just say well well look you know quantum computing is confusing so don't worry about the details, just, you know, you know, just trust it's going to speed up everything.

38:36Right. It just, you know, whatever problem you have, machine learning, oil and gas exploration, you know, a financial portfolio optimization. Yeah, that's what it's going to help for. Right. And and and, you know, and and and and in some sense, like this was remarkably successful, like people would throw money at things like having, you know, that were just wildly disconnected from any of the quantum algorithms that we actually know about. Okay. But, you know, what I'm trying to explain is that underneath all of it, yeah, there is a real advantage, right, that really is, I mean, one of the most dramatic things that we've ever found in computer science.

39:20You know, it is a miracle that it ever works. It seems to mostly help for problems with very specific structure, Like factoring numbers or like simulating quantum systems seems to help, you know, only more modestly as you as you move away from that kind of structure. So that's, you know, I've been trying to explain this stuff for, you know, a quarter century, I guess. And that's about as far as I can compress it. I haven't managed to compress it to five minutes yet. Well, that was an excellent compression, no matter how long it was. It was exactly what I was hoping for. Thank you. I have a couple of more tangential questions at the beginning of your response.

40:11You said that you can't understand quantum computing without understanding a bit about what quantum mechanics says about the world. Yes. the thing is that i know that many physicists think quantum mechanics says very different things about the world yes they all of course follow the same sort of formalism at least as it's been developed to this point but some think that there are i mean well you know the various interpretations yeah yeah there are the many worlders the bowmians the copenhagenists yes And amazingly, they all make exactly the same prediction for what happens when you do such and such experiment.

40:55Right. And so you could say, you know, as long as they're, you know, as their argument is at the level of metaphysics or, you know, at the level of like what is a scientific theory supposed to be telling us, you know, supposed to be doing for us or telling us about, you know, the reality of the world, let's say. but they all make the same predictions for all the experiments then in particular they're all making the same predictions for what the quantum computer will do when you build it right and so so for that reason like you know it's you know the the the bizarre truth is that like this this whole debate sort of doesn't doesn't really matter you know if if the question is will quantum computers work and what will quantum computers be able to do, right?

41:48Then, you know, then sort of everyone who agrees with quantum mechanics is making the same predictions there. You know, what would matter would be if quantum mechanics was just empirically false, right? And, you know, even to this day, there are some skeptics who say, you know, you will never be able to build to a scalable quantum computer, right? And, you know, this is just science fiction. This is too ridiculous. You'll never be able to control qubits to this degree. And, you know, what I've always said to those people is like, I hope you're right. You know, if you're right, then that is a revolution in physics, right?

42:31You know, I mean, like the idea that a quantum computer will work, right? That's just the conservative prediction. That's just what happens if quantum mechanics works exactly the way that it's supposed to work in all of the textbooks. For quantum computing to not be possible, something would really have to change empirically, and that would be the biggest development in physics for 100 years. OK, so but but now if if there's no empirical problem with quantum mechanics, then, you know, then we're all making the same predictions for what, you know, what it would take to build a quantum computer, what a quantum computer would do.

43:21And the debate is at the level of metaphysics, where very roughly the many worlders would say that this giant vector of amplitudes that I was talking about before, that is the most fundamental reality that there is. And so really what there is is just this giant list of amplitudes. OK. And, you know, all of our experience, all of our experience, the whole everyday world has to be sort of reconstructed out of that. And so one famous way of putting this is that when you measure a quantum system that is in superposition, like let's say it has an amplitude to be zero, an amplitude to be one, the many worlders would say there's nothing really special about measurement.

44:24Right. This is just another ordinary physical interaction that just happens to involve the atoms of your body, you know, of your brain and and so forth. And you but you become entangled with the system that you measure. Right. So now if we were keeping track of all the the the the the wave function of the universe, we would see like one branch where this qubit is in the state zero and you have perceived it being in the state zero. Like, you know, your brain, you know, also, you know, your measuring apparatus has all recorded it as being zero. But there's another branch where the qubit is one and where you're, you know, all your measuring apparatus and your brain and so forth have recorded the qubit as being one.

45:18OK. And and so, you know, you could say that like the thing that people argue about in in interpretation of quantum mechanics is that like that, like that, that is what the equations want to have happen. Right. That just, you know, you you know, you become entangled with a system when you measure it. And now there are just these two branches. And the trouble is, how do you reconcile that with our experience, which is that, you know, we just perceive one outcome, right? You know, we perceive this, you know, we don't perceive this giant vector of amplitudes, right? We perceive a single world. uh and so the many worlders would say uh no you know actually all of those branches continue to exist right you just perceive one of them okay like like each each one of them you know is is is another you know locus of of perception right and so this is this is you know why you know they have this imagery that you know the world keeps splitting right into you know these these parallel copies that remain equally real.

46:28And, you know, and it just, you know, within each branch, there is a perception that corresponding to that branch, but the other ones have exactly the same status. And so then, you know, many worlders would have no problem saying, well, a quantum computer is just an application of this, right? The reason why it's getting all this power is that all these different parallel universes or what would have been parallel universes or if we had let them branch off are all collaborating to solve our problem. Now, it's true that we can't sort of take the results from all these parallel universes and then just combine them in arbitrary ways, right?

47:20The only way that we were ever sensitive to this at all is via the interference of the amplitics, right? So, you know, the only way that we get all these parallel worlds to collaborate to solve our problem, if we're going to use that kind of language, is by choreographing a pattern of interference where for each wrong answer, we get some worlds contributing positively and others negatively. So they cancel out, whereas for the right answer, we get all the worlds, you know, contributing in the same way. So now the the the the the Bohmians, you know, which is which is a second camp in interpretation, they would tell kind of the same story as the many worlders.

48:11Well, they they would be very offended if they hear me describe it that way. Right. Because they they don't want to describe it that way. OK, but they want to say, yes, you still have this whole wave function of the universe. You have this giant vector of amplitudes. But there is one world that is, you know, there is one branch that is the actually real branch, right? That is the one that is sort of actually experienced, you know, and all the other branches are just kind of ghost towns. You know, they're there in the equations. You know, they have to be there. They get the right results, but there's sort of nobody home in them.

48:50They're just sort of mathematical abstractions that sort of have the function of guiding the evolution of the one actually real branch. Okay, so that's, you know, that's a story that's been specifically constructed to give exactly the same empirical predictions as, you know, as standard quantum mechanics, right? So there's no experiment that tells it apart, right? But, you know, it just tells a different story about, okay, that it would say, you know, there is this one, you know, unique history, right? They would say that particles, in addition to having these wave functions, they also have these actual positions in three-dimensional space that are then just sort of jostled around by the wave function.

49:50You know, like sort of corks bobbing on top of an ocean, sort of, right? And they're sort of pushed around by the wave function in a way that would exactly match the predictions of the usual quantum algorithm for calculating the probabilities that things happen. OK, so so so so they would say, you know, in a quantum computer, yes, there is this exponentially large wave function. But then there is also inside of the quantum computer this sort of one path that the qubits are following that is sort of more real than all the other paths. OK, but again, that doesn't change my predictions. Right. And then, you know, and then there were the Copenhagen people.

50:37Copenhagen was sort of the original view of quantum mechanics, of Niels Bohr and Heisenberg and their circle. And basically, they just want to tell everyone to stop asking these questions. Okay. So I've described the Copenhagen interpretation as just shut up and calculate, except that you never shut up about it. Okay. So, you know, so they have sort of a whole philosophy, which was very, very influenced by positivism, you know, in the early 20th century that says like, you know, look, you know, what, what, you know, we, we clearly, you know, we live in a more or less classical world. We communicate our experiences by, you know, writing papers about them or by giving talks.

51:33You know, these are, you know, by in other words, by conveying classical information. All that we could reasonably demand of the laws of physics is that, you know, of a physical theory is that it tell us what are the probabilities of the different experiences that we have. And, you know, if we demand more from physics than that, then we should just get over ourselves, right? Like, you know, we have to sort of meditate about it or sort of until we adopt a more enlightened view where we realize that, like, we had no right to demand, you know, to know what is actually going on with this, you know, quantum system before we measured it, right?

52:18Of course, we can use these wave functions. We can use them as mental abstractions for us to keep track of what is going on. But we have no right to say that that is what nature is doing.

52:35The co-panogonists are constantly making this move. We don't get to talk about that. We don't get to ask this question. So once again, they make the same prediction for what the quantum computer will do. But they just don't want to talk about the reality of what is going on inside the quantum computer. They just want to say, you know, we have no right to discuss that. You know, except that mathematically, you know, if we want to describe it, then we should use wave functions. You know, the same as all the other camps are going to do. So as far as quantum computing is concerned, the various theories all make the same predictions.

53:14They just have different stories for what's going on in the background, but that's just not relevant for the application. Exactly. I mean, we could say if one of them made a different prediction, then it wouldn't be an interpretation of quantum mechanics. It would be a rival physical theory. And the next thing that I wanted to ask you about that is somewhat tangential is I liked this image that you sort of conveyed of nature's scratch paper. Yeah. I think I got that from from Mesh Vazirani, who was my advisor at Berkeley. I found that a very striking image. Yeah. And I was wondering if there's anything really deeper to this or if it's just an analogy.

54:07I mean, what came to mind immediately was holography and how information might be stored in a certain way. Yeah, well, well, look, I mean, I mean, I mean, in some sense, you know, what the interpretations, you know, disagree about so much is what is the nature of this scratch paper? Right. You know, the many worlders would say, you know, the the what I was calling the scratch paper just is the most fundamental ontological reality of the world. You know, we should just bite the bullet. We should, you know, accept what the math seems to be telling us that the, you know, the, you know, this this this gigantic list of amplitudes kind of is the most fundamental, you know, physical reality that there is.

54:56And if that leads to, you know, the view that our experience is constantly splitting, that we ourselves are just one little branch in this gigantic superposition, well then so be it. You know, they'll just accept that consequence. For the Bohmians, the giant scratch paper also has a kind of existence, but its existence is just sort of as a guiding field for this sort of single world that has a trajectory that moves around in a way that matches the same predictions. the predictions of quantum mechanics but there's one world that is sort of elevated above the others and then for the Copenhagenists the scratch paper is just a mental device it's just something for us to keep track of what nature is doing and they wouldn't you know they would just disallow you from even asking you know who what is what is actually going on you know ontologically you know under the hood in nature itself or they would say we simply don't.

56:12Either it's meaningless to ask or else we don't know. All right, moving on in my list of any questions based on that response. You said that a quantum computer does not solve the prime factorization problem by simultaneously trying every possible factor, which is definitely what I had heard many, many times. Yeah, that's like still today, like the popularization of it has not moved beyond this, which is sad in a way, right? Because if the point is that if that were how it worked, then that would be good for way, way more than just prime factorization, right? That could be like just about any problem that you might want that you might want to solve that involves like searching through a huge list of possible solutions.

57:06Right. Like if you could do that, then you could solve all of those problems. But the truth is that Shor's algorithm is very, very specific to factoring and to a few other problems in number theory that have some very, very special structure that they take advantage of. And even within cryptography, and this is a very, very important thing to know, even just for practical purposes, we have other cryptographic codes that seem to resist attack, even by quantum computers. OK, so there is a big push right now to migrate to what are called post-quantum or quantum resistant encryption methods. So, for example, to migrate the web, HTTPS, to using quantum-resistant encryption, migrate Bitcoin and Ethereum and other cryptocurrencies to using these other cryptographic codes.

58:17Okay, maybe the most important one we know is based on problems in high-dimensional lattices, okay? And so we know how to get, like, almost all of the cool stuff that people want from modern cryptography, you know, including, like, public key encryption. That's the kind where you don't have to agree in advance on a secret key, right? And digital signatures and, you know, all kinds of other things. You know, we now know how to base that on problems that, well, you know, there's no proof here. But at least, you know, for 25 years, people have failed to find a quantum algorithm for solving these problems, these lattice problems, right?

59:10Because they have not been able to generalize Shor's algorithm to the kind of mathematical structure that there is in these other problems. OK, so so, you know, to me that that that underscores that, yeah, Shor's algorithm only worked because of very, very special structure in the factoring problem. Right. And it was just, you know, it was a little bit unlucky that we based, you know, modern encryption on on these problems that just have this kind of structure. Although, you know, there was there was a reason for it. Right. The structure is kind of a double edged sword. Like the more special mathematical properties your problem has, you know, the more you can actually exploit those properties, you know, to build useful cryptographic protocols.

1:00:05Right. That's what people have been doing since the 1970s. Right. They just sort of like to get public key encryption. They took advantage of very special properties of factoring, you know, discrete logarithms, you know, these serve problems in number theory. But in that same structure that makes those problems so useful for encryption is also what then enables a quantum algorithm to come in and solve the problems. OK, and break the cryptosystems. systems. So you kind of have to calibrate, you know, how much mathematical structure there is in your problem, right, to have like just enough that it's useful for all the cryptographic protocols that you want, but not enough that a quantum computer can leverage that structure to solve the problem.

1:01:00Okay. And we think that we know how to get to that point now, using, for example, these lattice problems. And so NIST, the federal agency, had a competition that ended in 2022 to agree on standards for this post-quantum encryption. And now the challenge is to just get everyone to switch to these new systems, which is a massive headache when you've built the internet on one basis. to switch it to a different basis. I mean, it's like, you know, it's, it's, it's a little bit like the Y2K issue for, for, for people who remember that. But, you know, this, this is actually much, much bigger than that.

1:01:49There's actually, you know, there, there's, there's a, there's a, there's a bigger change that has to happen here. And of course with the, the other difference is that with Y2K, we knew exactly what the deadline was, right? The deadline was, you know, 11.59 p.m., you know, December 31st, you know, 1999. Right. With with switching to post quantum encryption, we don't know one knows exactly when the deadline is. Right. People have gotten close to. you know i mean i mean you know they've made incredible progress uh toward you know building building the kinds of qubits that that you would need for a scalable quantum computer uh we're not there yet but you know we don't know how many more years it will be until um someone has uh quantum computers that are that are relevant for breaking cryptography so um Um, so, so, so yeah, so, so, um, uh, uh, but you know, but, but, but like no one would be able to understand any of this, right?

1:02:58If they just thought that a quantum computer just tries all the possible solutions in parallel and then magically picks the best one, right? If that's what they thought, then it would be like, well, how could you have any cryptography that could be safe against the quantum computer? Right. So I think, you know, you like, you know, as as as as as much as people, you know, sometimes, you know, dislike taking this like 15 minute detour to explain about amplitudes and interference. You know, you kind of need it to, you know, to even have, you know, say anything about this like strange profile of problems that a quantum computer helps you for and doesn't help you for.

1:03:42where i was heading with my question was i'm wondering if there are also if there are if there are more really prominent myths about quantum quantum computing that you encounter all the time that discussing might be used um another of the the big myths about quantum computing is that, well, you know, if you have 100 qubits, then this just is like having two to the hundred power classical bits, right? If you have a thousand qubits, this just is like having two to the thousand power classical bits and so forth, you know, which would make quantum computers like incredible for information storage, right?

1:04:30The trouble with this is, once again, that, yes, there are 2 to the 100 amplitudes that we need to keep track of what 100 qubits are doing, but we never get to directly see the amplitudes. When we measure, if you measure 100 qubits, then you're just going to see 100 bits. And the only role that the amplitudes will play is in calculating the probability that you're going to see one string of 100 bits versus a different string. So this sort of prevents us from using, let's say, n qubits to store 2 to the n classical bits in a way that's directly useful. I mean, like, yes, in a sense, you could do that, but but then you don't get to read out, you know, the classical bits of your choice.

1:05:34Right. You know, almost all of them disappear as soon as you make a measurement. OK, and so so so so so so once again, I think the the the again and again with with with with quantum mechanics, what you see is like you get something that in a classical world, you know, if the world were classical, then quantum mechanics would take these ridiculous resources to simulate. Right. But that doesn't imply that quantum mechanics itself gives us all of those ridiculous powers. Right. You know, it gives us some additional power. Right. But but the all the extra power that we get from quantum mechanics is is limited by by what we actually see when we make a measurement.

1:06:22Right. You know, there's sort of yet another example of the same phenomenon is, you know, which even predates quantum computing is like when you have two entangled particles. Right. So this is the situation that Einstein, you know, famously described as spooky action at a distance. Right. Where like if I have two qubits, let's say, which are in a superposition of the state zero zero and the state one one. OK, and then, you know, there is no distance limit. Right. These qubits could be, you know, on different planets in different galaxies or whatever. But if I've maintained them in this entangled state, this sort of superposition of 0, 0, and 1, 1, then I know that if anyone measured one of the qubits and they see the outcome 0, then immediately they know that the other qubit will also be a 0 if it's measured the same way.

1:07:26Right. And if anyone measures one of the qubits and they see a one, then they know that the other qubit will also be a one. Right. So this sort of collapse, you know, happens instantaneously, you know, regardless of how far away the qubits are. Right. And so. So so so for generations, you know, this has led to a myth that, you know, quantum mechanics just enables faster than light communication. right uh that you know you could just uh have have one entangled qubit on earth have the other one in the andromeda galaxy and then just sort of instantaneously send the message to andromeda right which of course would would violate uh relativity right and in in in special relativity if you can send a message faster than light then you can also send messages backward in time Those are basically the same thing.

1:08:24And so this would sort of completely break the structure of physics, as we know it. And so the answer is, once again, that something more subtle is going on here.

1:08:40So the issue is that when you measure a qubit, you don't get to control what is the outcome of that measurement. Right. So so like I can measure this qubit and, you know, either see a zero, in which case my friend will also get zero or else I'll see a one, in which case my friend will also see one. But I don't get to choose whether it's a zero or a one. Right. That's that's what I would need in order to send a message to my friend. Right. And, you know, so you might say, well, if this is just a matter of just I'm correlated with my friend, well, then even in just ordinary classical physics, right?

1:09:25Like, you know, if my friend and I had two sealed envelopes, you know, with the same letter in them, right, and we took them to different planets and then I open my envelope, I read what's in it. Well, then immediately I know what my friend will say when they open the same, you know, when they open their envelope. Right. But no one would call that instantaneous communication. Right. That's that that's simply a matter of correlated random variables, as we would say. Okay, and so then there was, you know, the thing that Einstein seems to have wanted was some way of explaining quantum mechanics just in terms of local classical hidden variables, right?

1:10:16where where uh like like for example whenever two entangled particles would get created you know they would just un unseen by us they would be exchanging a little message that would say listen if anyone asks let's both be zero okay and then they would just they would just remember that they would they would you know and then they would remember that however far separated they were and And this way, you wouldn't need any spookiness, you know. But then in the 1960s, John Bell proved this very famous theorem, you know, the Bell inequality. Right. And this was, you know, an important forerunner of quantum information and quantum computing.

1:11:00Right. But what Bell proved was that there was no explanation of the type that Einstein wanted that can possibly explain all the correlation. that you get by if you and your friend were to measure the two entangled particles in a bunch of different ways. OK, so there are different measurements that you can make. And yes, while you can tell the story about correlation for one of them, it can't simultaneously work for all of them. OK, and so you're led to this this really, you know, weird picture. You know, once again, I think a picture that is sort of more subtle than any science fiction writer would have had the imagination to invent.

1:11:43Where, like, yes, if you wanted to simulate, you know, entanglement in a universe that was that was actually classical, you know, then you would need faster than light communication in order to, like, keep track of all the correlations. That is what Bell's theorem tells us. Right. And yet we cannot use entanglement to send the message faster than light. That's another important fact. You can prove that within quantum mechanics. It's called the no communication theorem. So in between the possibility of just the ordinary classical world and the world with the instantaneous communication, there is this third possibility.

1:12:33There is this intermediate zone, right, that quantum mechanics, you know, then fills, even though before quantum mechanics, we might it might not even have occurred to us as a logical possibility. Right. That like you could produce these. Beyond classical correlations, but then you can't use them to send the message faster than light. OK, likewise, with information storage. Right. Like, you know, between, you know, having, you know, N particles storing N bits and N particles storing two to the N bits. there is this intermediate possibility, which quantum mechanics comes along and fills, that yes, you can do, for certain specific tasks, you can do things that classically would have taken you two to the n bits, but you don't get the full power of that because you have to measure the qubits and then you only see n of them.

1:13:35Okay, likewise with quantum computation, you know, between just, you know, in T time steps, I get to do T classical computation and versus in T time steps, I get to do two to the T classical computation. quantum mechanics comes along and is this intermediate possibility that I get to do certain specific things that classically would take me exponential time, but I don't get to do every, I don't get to speed up every exponentially hard classical computation, right? Only those for which I can arrange this interference pattern. Okay, so, you know, what is that telling us about the world you know i don't know but it seems like an important clue to something before we finish today i want to make sure that we at least talk a little bit about the physical implementation of a quantum computer you mentioned that skeptics there are skeptics who think that building a scalable quantum computer will not be possible um and you did speak a bit about this earlier but i was wondering if most of these sort of complaints are um oriented around engineering concerns rather than concerns with theoretical physics yeah so there's a whole spectrum of concerns i mean from the people who think that who who will just explicitly say you know this this uh can't be done because quantum mechanics is wrong you know and how do we know it's wrong because you know because it would let you do quantum computing which is an obvious absurdity right um you know and then and then we say well look you know uh we hope you're right you know but we're we're betting on the more boring outcome that you know quantum computing is merely possible right and then there are people who say okay you know i I don't find, you know, I'm not disputing quantum physics, but there must be some new principle on top of quantum physics that somehow screens off or sensors quantum computation.

1:15:52OK, so there's a mathematician named named Gil Kalai who who who was in that camp, for example. And then, you know, we say to them, well, then, you know, what is that new principle? You know, what can you tell us about it? Right. And what predictions do you make? When will we start seeing the efforts toward quantum computing fail? And what exactly are those failures going to look like? And there are some smart people who have thought about that, but I don't think that they've been able to come up with some alternative picture of the world that coheres, that really makes sense to me. uh and and certainly i think given the experimental results that we've seen just within the last year or two you know those people are in a much much tighter spot that they were before right they um i mean because i feel like if there were some you know some deep new new physical principle that that made this uh impossible like we should have seen it by now right we now have uh um Within the last year, what we've seen with superconducting qubits, with trapped ion qubits, and we're starting to see with neutral atom qubits also, is we can do programmable two qubit operations that are about 99.9 % accurate.

1:17:28okay uh you know when i entered the field uh 25 years ago you know it would have been amazing to do like 50 accurate you know two qubit operations right and then you know that's just like uh uh way way you know uh um you know it's sort of not even close to where you need to be to get a scalable, reliable quantum computation. There is this technology of quantum error correction, something we haven't really talked about, but this was also a big discovery in the mid-1990s that said that if you want to build a reliable quantum computer that can scale up to any number of qubits, any number of operations on them.

1:18:21You don't need perfectly reliable operations. But you just need operations that are reliable enough that error-correcting codes can then get you the rest of the way. So something similar was true about classical computing that was discovered by John von Neumann in the 1950s. uh you know and then and then eventually we we we we almost didn't even need that because transistors were just so reliable that they you know uh you know that they failed you know like like in and your laptop there are like maybe a few hardware uh a few failure physical failures of the chip every year like when a cosmic ray passes through or something like that right and And normally you wouldn't even notice that, you know, it was someone operating a data center at the scale of Google or Amazon does notice that, you know, and does not to use error correction to deal with that.

1:19:25It was not obvious to people that that error correction would work for quantum computing. Right. There were all kinds of technical problems that made, you know, skeptics in the in the in the 90s say, no, you know, that that shouldn't work. But then a really, really beautiful theory of quantum error correction was discovered that says, no, it does work, you know, if you can get your physical qubits to be accurate enough. And at that time, they were estimating that you would, you know, maybe this would work if you had two qubit operations that were, let's say, 99.9999 % accurate. Okay, so six nines of accuracy, right?

1:20:09And that's, you know, and this was at a time when we didn't even have one nine. Right. And so, OK, but, you know, to a theorist like me, you could say, OK, OK, you know, it's just it's just some constant. Right. Which means, you know, this has been reduced to merely an engineering problem. Right. And and indeed, you know, what we've seen over the past 30 years is sort of. tremendous progress on two fronts. First of all, the accuracies that the experimentalists can achieve in the lab, you know, have improved tremendously, right? You know, the 50 % accuracy of two-cubit gate became 90%. At some point, that became 95%, 99%.

1:20:57And now, as I said, within the last year, the new standard is 99.9%, right? And at the same time, people also develop better and better error correcting codes. And so instead of six nines of accuracy, you know, we actually now know codes that work with three nines of accuracy. So basically, like the two numbers that have to meet have basically met each other at this point, right? We're basically at what's called the fault tolerance threshold. And now what remains is merely the sort of staggering problem that you have to build a system with millions and millions of physical qubits being shuttled around to where they need to be, interacting with each other in a way that maintains this 99.9 % or better, 99.99 % accuracy.

1:21:57and then with all of this error correction layered on top. Okay, so, but again, you know, I don't know of any sort of fleshed out proposal for how the physical world could be that would sort of be compatible with the experimental results that we've already seen, you know, many of them just within the last year, and that would not allow, you know, full, full scalable quantum computation, right? So this is why I say that the skeptics are now in a tight spot. Now, you know, there are many different things that you could mean by skeptic, right? So besides the people who just reject quantum mechanics outright, or the people like Gil Kalai, who think that, you know, there must be some new physical principle on top of quantum mechanics that sensors quantum computing.

1:22:58There are also people who just say, no, as an engineering matter, this is just going to be too hard. You know, this is just, you know, the funding is going to run out or this is not going to happen in any foreseeable future. You know, but like at that point, we're just arguing about, you know, how many, like, how hard is this as an engineering problem? How many years does this take? Right. And like people care about this enormously because what they want to know is, you know should i invest in this quantum computing company or should i not invest in them right or like what you know what is going to make money in the next five years that's not that you know i i feel liberated from having to you know worry too much about that kind of thing right that's just not the the thing that that that most interests me um um you know i i i do think that, you know, given the experimental progress that we've seen over the last couple of years in superconducting qubits, in trapped ions, in neutral atoms, like, it would surprise me a lot if we don't have, you know, if we don't start to see at least useful special purpose quantum computation within the next decade, you know, and at some point, Yes, I do expect that I will live to see, you know, quantum computers running Shor's algorithm to factor enormous numbers.

1:24:27You know, if I could predict how many years that would take, I wouldn't be a professor. I would be an investor. Right.

1:24:39But. So, so, you know, but then, you know, they're they're they're sort of yet a fourth thing that people mean by by skeptic, which is they say, well, yeah, maybe all of this works and it leads, you know, it lets you do this quantum simulation and factoring. But the applications of quantum computers have been massively oversold to the public. And and it's not you know, we we don't really know if it's useful for that much beyond these very, very specialized things. I would say that I myself am a skeptic in that fourth sense.

1:25:17right well scott this has been yeah exactly the introduction i was hoping for of course we didn't get into a lot of cutting edge and more granular questions but that's to be expected and we also didn't get to talk about ai so hopefully sometime down the road we'll we'll meet again and and talk more about these subjects thank you so much sure no problem yeah good talk good to talk to you Thank you.

From the publisher

Scott Aaronson is the Schlumberger Centennial Chair of Computer Science at The University of Texas at Austin, and director of its Quantum Information Center. He researches the capabilities and limits of quantum computers, and computational complexity theory more generally. For the 2022-2023 and 2023-2024 academic years, he was on leave to work at OpenAI on the theoretical foundations of AI safety. In this episode of Robinson’s Podcast, Scott answers a host of questions about the basics of quantum computing. He and Robinson discuss the physics- and computer science elements of the field, how it connects to the foundations of quantum mechanics, the biggest myths about quantum computing, and whether quantum computers will every actually be built.


Scott’s Blog: https://scottaaronson.blog


OUTLINE

00:00 Scott’s Interest in Quantum Computing

07:10 Distinguishing the Physics from the Computer Science

14:43 What Is Quantum Computation?

39:41 The Interpretations of Quantum Mechanics

53:31 Quantum Information

55:54 Prime Factorization

01:03:19 The Biggest Myths About Quantum Computing

01:14:06 Can Quantum Computers Actually Be Built?


Robinson’s Website: http://robinsonerhardt.com


Robinson Erhardt researches symbolic logic and the foundations of mathematics at Stanford University, where he is also a JD candidate in the Law School.

More from Robinson's Podcast

All 41 episodes
269 - Scott Aaronson: What Is Quantum Computing?Robinson's Podcast · 1 h 25 min
Listen in VO