WEBVTT
00:00:11.599 --> 00:00:12.720
144.
00:00:16.480 --> 00:00:18.399
University of Southern California.
00:00:30.160 --> 00:00:37.039
Welcome to Entangled Things, your quantum computing podcast, hosted by Patrick and Cyprian.
00:00:40.399 --> 00:00:42.159
Hey Cyprian, how you doing?
00:00:42.479 --> 00:00:43.359
Hey, Patrick.
00:00:43.520 --> 00:00:44.240
I'm doing great.
00:00:44.399 --> 00:00:47.119
Looking forward for another episode of Entangle Things.
00:00:47.359 --> 00:00:55.359
Oh, well, you're in for a treat because we're we're joined by Todd, who's been here before, but we'll still ask you to introduce yourself to our audience, please, Todd.
00:00:55.840 --> 00:00:57.119
Hi, I'm Todd Brunn.
00:00:57.439 --> 00:01:05.519
I'm a professor of electrical and computer engineering, physics and computer science at the University of Southern California.
00:01:06.400 --> 00:01:08.560
I work on quantum computers.
00:01:09.040 --> 00:01:10.640
And that's why we want to talk to you.
00:01:11.280 --> 00:01:12.879
Also, you're very easy to talk to.
00:01:12.959 --> 00:01:14.879
So we've been on the show before.
00:01:16.159 --> 00:01:18.640
You are very deep into error correction.
00:01:18.879 --> 00:01:23.200
I think just before we started recording, you mentioned that you're going to a conference soon on error correction.
00:01:23.599 --> 00:01:26.239
It's exciting times for that field right now, isn't it?
00:01:26.560 --> 00:01:32.640
Yeah, well, uh we've arrived at a point where it's not just theory anymore.
00:01:32.879 --> 00:01:47.599
Uh we've been working on error correction really since very early days of quantum computing, because uh people realized early on you needed to be able to do it if they were ever going to be achievable.
00:01:47.840 --> 00:01:48.239
Right.
00:01:48.480 --> 00:01:51.599
But for a long time, it was really theoretical.
00:01:51.760 --> 00:01:56.239
We proved a lot of sort of results about scaling and things like that.
00:01:56.480 --> 00:01:59.120
But now people are really building these things.
00:01:59.359 --> 00:02:09.199
And so that means we have to focus on what you can actually do with the machines we have and the machines we're going to have in the next few years.
00:02:09.759 --> 00:02:16.479
Do you do you think we're ending the NISC or entering the NISC period, noisy intermediate quantum computing?
00:02:17.360 --> 00:02:19.039
What excites you about the developments?
00:02:19.199 --> 00:02:27.759
Because I can't when I see a feed, almost every day there's something about you know re fault tolerance and redundancy and error correction.
00:02:27.919 --> 00:02:29.759
It it's it's permeating the news.
00:02:29.840 --> 00:02:30.479
Aaron Powell Yeah.
00:02:30.800 --> 00:02:41.199
Well, we're still in the NISC era, but we're entering uh I think the term that people have kind of converged on is the early fault tolerance era.
00:02:41.840 --> 00:02:49.199
Uh fault tolerance is uh sort of full fault tolerance or scalability is pretty demanding.
00:02:49.439 --> 00:02:57.280
And so the machines that exist right now can only achieve it up to a certain point.
00:02:57.439 --> 00:03:06.240
Sort of all the elements are there, but we're still not quite where we need to be to be able to scale to larger and larger sizes.
00:03:06.479 --> 00:03:30.319
But what we would like to be able to do is use some of the elements of fault tolerance, some error correction or detection, some uh methods for reducing the effects of noise, and apply them to actual programs that can be run that would hopefully do actually useful things.
00:03:30.719 --> 00:03:35.199
Uh so that's where we're just sort of starting to be in that era.
00:03:35.439 --> 00:03:49.759
And the goal there would be to be able to incorporate more and more fault-tolerant elements as the capabilities of the machines improve to the point where we we arrive at fully fault-tolerant quantum computers.
00:03:50.479 --> 00:03:54.879
Are you excited about one or two modalities more than others in this?
00:03:55.039 --> 00:03:57.520
Like, is are any of them running away with the ball?
00:03:58.719 --> 00:04:01.360
I love all my children equally.
00:04:01.599 --> 00:04:05.199
Um We have to say as parents, I know.
00:04:06.319 --> 00:04:19.120
Um It certainly is the case that some of them are further along in some sense than others, but this can change unpredictably.
00:04:19.279 --> 00:04:31.360
So it's still the case that the superconducting modality is the most advanced, that's the one that has the most investment from industry.
00:04:32.399 --> 00:04:38.079
They've built the biggest processors so far and have the most impressive results.
00:04:38.319 --> 00:04:42.639
But other modalities are still very much in the running.
00:04:42.879 --> 00:04:46.160
Ion traps, which have been around since the very early days.
00:04:46.319 --> 00:04:49.600
I think you did a podcast on them not long ago.
00:04:50.240 --> 00:04:51.439
And uh there's some companies.
00:04:51.839 --> 00:04:52.800
Glad to know you're listening.
00:04:53.120 --> 00:04:57.680
Ah some companies working to develop that as well.
00:04:58.000 --> 00:05:07.120
And then uh a third contender has really advanced rapidly in recent years, and that's neutral atoms.
00:05:07.519 --> 00:05:20.000
Uh arrays of neutral atoms held in optical lattices and controlled by what they call optical tweezers, so you can actually move the atoms around and reconfigure them.
00:05:20.399 --> 00:05:26.879
That was sort of nowhere, maybe three, four years ago, or I mean not nowhere, but not really a serious contender.
00:05:26.959 --> 00:05:34.959
And now it's grown to where they have systems with hundreds of atoms in them that they can manipulate with great control.
00:05:35.600 --> 00:05:36.480
So who knows?
00:05:36.639 --> 00:05:38.720
That may overtake everything else.
00:05:39.199 --> 00:05:51.279
Yeah, we we talked to the Harvard team that uh I think it was a year this December last December, a year ago last December, they they created a 48 logical qubit system that made the news.
00:05:51.360 --> 00:05:52.639
Uh and they were using that.
00:05:52.720 --> 00:05:59.439
The the light laser tweezers, I think of little mini lightsabers on a chip um used to move things.
00:05:59.600 --> 00:06:03.920
Isn't it funny that in Star Wars a lightsaber can cut through anything except another laser?
00:06:04.160 --> 00:06:04.560
Yeah.
00:06:04.800 --> 00:06:10.959
I mean they they can invent how it works to make the story good.
00:06:11.439 --> 00:06:11.839
That's true.
00:06:12.000 --> 00:06:12.399
That's true.
00:06:12.560 --> 00:06:13.120
Well, we can't.
00:06:13.279 --> 00:06:13.839
We don't have that.
00:06:13.920 --> 00:06:15.759
We have to actually deal with this thing called physics.
00:06:16.240 --> 00:06:17.519
Sadly, sadly.
00:06:17.759 --> 00:06:18.399
Yeah.
00:06:18.800 --> 00:06:21.199
Um so what should we be watching out for?
00:06:21.920 --> 00:06:29.120
Well, uh, I think the there are two things that are very exciting right now.
00:06:29.360 --> 00:06:33.759
One is this early fault tolerant era.
00:06:34.000 --> 00:06:36.399
So there have been a number of experiments now.
00:06:36.560 --> 00:06:47.920
For a long time, there were no experiments at all that demonstrated any advantage to doing error correction because the hardware was just too noisy for error correction to benefit you.
00:06:48.319 --> 00:07:01.279
And then for a while, there was just one, which is from a group at Yale in the superconducting area, where they actually didn't encode things in the in their qubits at all.
00:07:01.439 --> 00:07:07.279
They encoded things in the microwave cavity that was normally used to control the qubits.
00:07:07.360 --> 00:07:13.040
They were, they turned that around, so the information was in the cavity and they were controlling it using the qubits.
00:07:13.279 --> 00:07:16.240
And they just barely showed an advantage.
00:07:16.480 --> 00:07:20.560
This is against real noise that occurs in the system.
00:07:20.879 --> 00:07:22.560
And for a while that was it.
00:07:22.800 --> 00:07:28.800
And now there are a bunch of experiments that have demonstrated advantage, and they keep getting better.
00:07:29.040 --> 00:07:32.480
Um, but so so we're gonna see more of that.
00:07:32.639 --> 00:07:36.399
Uh, that's continuing, and that's very exciting.
00:07:36.720 --> 00:07:39.759
But of course, error correction is not the point.
00:07:39.920 --> 00:07:41.360
The point is computation.
00:07:41.519 --> 00:07:47.759
So we really want to use error correction to do computations that we couldn't otherwise do.
00:07:47.920 --> 00:07:55.519
So there, we aren't quite there yet, but I think we're going to increasingly see that over the next few years.
00:07:57.680 --> 00:08:08.000
So I I saw some announcements uh in in recent time, right, regarding these types of uh demonstrations, right?
00:08:08.160 --> 00:08:14.480
I think QR had one with the uh uh MIT uh MIT team.
00:08:14.560 --> 00:08:16.000
That was a very interesting one.
00:08:16.160 --> 00:08:25.439
They were, if I'm not mistaken, they were claiming like a two to one ratio um from from physical to to logical.
00:08:25.680 --> 00:08:31.680
What would you say is at the moment, uh like the place where we are?
00:08:31.920 --> 00:08:41.440
Last time we talked, we were just about to cross the boundary where error correction actually yields like a positive outcome.
00:08:42.080 --> 00:08:44.159
Um where do you think we are now?
00:08:44.399 --> 00:08:52.480
Um is are the improvements in error correction mostly coming from better hardware?
00:08:52.799 --> 00:09:00.399
Are we doing some some other kind of improvements in terms of, let's say, novel approaches to do error correction?
00:09:01.360 --> 00:09:07.279
What are like the uh let's say the dimensions of the advancements that we're we're we're seeing?
00:09:07.519 --> 00:09:12.559
I think it would be very interesting for our listeners to kind of like understand some of the driving forces there.
00:09:13.600 --> 00:09:28.639
I think the advances are coming both in the hardware, which is of course absolutely necessary, but also on the theory side in exploring new kinds of codes, new kinds of fault-tolerant techniques.
00:09:28.879 --> 00:09:36.639
Not all of that has been implemented in hardware yet, but some of it has, and and we're getting closer.
00:09:37.200 --> 00:09:39.919
And uh I think you need both.
00:09:40.399 --> 00:09:56.720
In the very early days when there were no experimental systems with more than you know, maybe a couple of qubits, uh, the theory largely was concentrated on what you can do in principle.
00:09:56.879 --> 00:10:05.519
You know, can you, in principle, do computations of an unlimited size provided the noise is sufficiently low?
00:10:05.679 --> 00:10:09.120
So people would prove theorems about this, they're threshold theorems.
00:10:09.360 --> 00:10:17.200
If the noise is below some threshold, then you can scale up your computations to any size you want.
00:10:17.440 --> 00:10:25.840
And the overhead in terms of error correction for doing that scales nicely with the size of the computation.
00:10:26.000 --> 00:10:27.600
So that was the early days.
00:10:28.320 --> 00:10:41.840
And it's good to know that because it meant this wasn't an exercise in futility that that if we could build good enough hardware, then we could actually use these things to do something.
00:10:43.120 --> 00:10:59.840
Now the machines have crossed that threshold in the sense that when you use error correcting codes, you can show that the data that you're storing in these machines is protected from noise.
00:11:00.000 --> 00:11:02.000
It's better than not using codes.
00:11:02.159 --> 00:11:04.240
And they've actually gone further than that.
00:11:04.480 --> 00:11:15.279
They've shown that encoding it in more powerful codes, what we call higher distance codes, protects it more than lower distance codes.
00:11:15.360 --> 00:11:18.399
So when you're below the threshold, that's what you would expect.
00:11:18.639 --> 00:11:26.399
When you're above, though, it actually just makes everything worse because you you increase your overhead, the total amount of noise goes up.
00:11:26.639 --> 00:11:30.720
So it's that trade-off that you need to be on the right side of.
00:11:30.960 --> 00:11:39.200
You when you scale up, you increase the noise, but you also increase the power of the code to correct the noise.
00:11:39.519 --> 00:11:45.360
And if you increase the one more than the other, then you either win or you lose.
00:11:45.679 --> 00:11:48.240
And uh now we're on the winning side.
00:11:48.559 --> 00:12:02.240
But the overhead is such that after you do all the encoding, the the number of logical qubits is is still fairly small because these processors are not that big.
00:12:02.480 --> 00:12:08.720
So they're still small enough that we can simulate everything just with an ordinary classical computer.
00:12:08.960 --> 00:12:35.919
So we haven't quite gone to the next step, which is where the processors are big enough and the noise level is low enough, and the codes are efficient enough that we can do a computation at the logical level using logical encoded qubits that we couldn't simulate uh with a classical supercomputer, for example.
00:12:36.240 --> 00:12:39.279
So we're we're close to the edge of that as well.
00:12:39.519 --> 00:12:47.120
There are some demonstrations that you could say can't be simulated or can't easily be simulated classically.
00:12:47.360 --> 00:12:56.080
They're mostly problems that no one has any interest in solving except as a demonstration that it can be done.
00:12:56.399 --> 00:13:14.720
So the next stage is to get to interesting problems, problems people would actually like to be able to solve, uh, perhaps simulations of chemical reactions or nuclear reactions, quantum field theories.
00:13:15.279 --> 00:13:40.960
And recently there's been some indication that new theoretical ideas and error correction and more efficient encodings may bring Schore's algorithm, which got the whole field running in the beginning, uh, the factoring algorithm that can be used to break public key crypto systems, that that may be breakable in the not too distant future.
00:13:41.120 --> 00:13:49.919
There was a paper from Google and a second one that I should have looked up before I went on this podcast to remember who who wrote that second paper.
00:13:50.159 --> 00:14:03.919
But they both made the argument that if you go to more efficient codes, that you may start being able to break the kinds of crypto systems that people are using now in maybe 10 years.
00:14:04.159 --> 00:14:09.759
And uh that's that's much sooner than many people thought.
00:14:10.240 --> 00:14:12.000
Or were prepared for.
00:14:13.120 --> 00:14:14.080
Or were prepared for.
00:14:14.399 --> 00:14:16.080
I I always thought that was short-sighted.
00:14:16.399 --> 00:14:25.360
Yeah, well, of course, a lot of this kind of public key encryption is used for very short-term things, and uh and people don't care.
00:14:25.440 --> 00:14:33.919
You know, you send your credit card number, uh, that credit card number probably won't be valid anymore in 10 years, um, things like that.
00:14:34.159 --> 00:14:41.279
But uh there is stuff that people don't want to be read even 10 years from now.
00:14:41.519 --> 00:14:41.759
Right.
00:14:41.919 --> 00:14:51.840
And uh nuclear silo locations and designs for weapons and I hope not, but maybe they're not supposed to send that kind of stuff over the internet.
00:14:52.159 --> 00:14:55.279
But you know, mistakes happen.
00:14:55.360 --> 00:15:03.840
And there's lots of, you know, businesses have secret uh stuff and private information.
00:15:04.080 --> 00:15:10.240
And then there's cryptocurrencies, which rely on uh public key encryption, basically.
00:15:10.559 --> 00:15:12.720
So they're vulnerable now.
00:15:13.120 --> 00:15:22.799
I've heard some of the ECCs are particularly vulnerable and there's concern that it they could become catastrophically vulnerable within as as few as two years.
00:15:23.840 --> 00:15:27.039
Uh I don't know if it could be as soon as that.
00:15:27.200 --> 00:15:34.559
It's not really my area, but uh yeah, I mean it's much sooner than than people had been hoping for.
00:15:34.960 --> 00:15:35.600
Yeah.
00:15:37.200 --> 00:15:50.000
We we've recently talked to about um Microsoft's uh endeavors, and they're claiming um that their topology inherently has fault tolerant properties.
00:15:50.080 --> 00:15:51.360
Are you following that at all?
00:15:51.519 --> 00:15:53.840
Is that is that is that one of your children?
00:15:56.080 --> 00:15:58.799
I mean that's sort of a they're all my children.
00:15:59.120 --> 00:16:17.039
They're all my um yeah, the uh but uh there are there are a bunch of different approaches people are pursuing that that look very promising and and uh I don't know which of those will will end up winning in the long run either.
00:16:17.279 --> 00:16:17.440
Yeah.
00:16:17.679 --> 00:16:20.559
I'm pursuing my own personal research topics.
00:16:20.879 --> 00:16:21.279
Oh, nice.
00:16:21.519 --> 00:16:32.879
But but there are you know it would be nice if one of them or some some of the elements of what I'm working on end up being used in in whatever the final results are.
00:16:33.360 --> 00:16:35.360
We we don't believe there'll be one to rule them all.
00:16:35.519 --> 00:16:46.480
We I both both Cyprian and I think that there's going to be room for multiple modalities to solve different states of problems in the future, whether it's sensing or computation or whatever.
00:16:47.120 --> 00:16:48.480
That very likely is true.
00:16:48.639 --> 00:16:53.440
Certainly when you have very different applications like sensing and computation, it would make sense.
00:16:53.600 --> 00:16:55.360
You might use photonics.
00:16:56.480 --> 00:16:59.519
Photonics wings wins the network with ease.
00:16:59.759 --> 00:16:59.919
Right.
00:17:00.240 --> 00:17:01.440
Just because of the nature of it.
00:17:01.840 --> 00:17:09.200
So something that's still uh a bit of a challenge is interconverting between different modalities.
00:17:09.359 --> 00:17:29.279
And this is something now that that has been attracting increasing interest is so-called hybrid systems, where you have some qubits of one physical type and some qubits of another physical type, and you try to leverage the advantages of the different kinds and make them work together.
00:17:29.519 --> 00:17:33.200
But converting from one to another is still technically quite challenging.
00:17:33.279 --> 00:17:35.039
This is called transduction.
00:17:35.759 --> 00:17:40.880
And uh uh there are reasons why that's not easy.
00:17:41.039 --> 00:17:58.319
They they operate on very different timescales, so like atomic and ion qubits may have time scales in the in the megahertz while superconducting or in the gigahertz, so that's a big gap.
00:17:58.559 --> 00:18:11.599
And uh, you know, coupling things that operate using optical photons to things that operate using microwave photons, there's a huge energy gap between those two.
00:18:11.839 --> 00:18:14.319
They operate at different temperatures.
00:18:14.880 --> 00:18:22.400
So not easy, but uh it's a valuable thing to be able to do in principle.
00:18:22.640 --> 00:18:26.319
So people are increasingly also working on that problem.
00:18:28.319 --> 00:18:39.759
Um one of the things that one of the areas where I've also seen some interesting results lately is improvement uh when it comes to error correction, improvement in the decoding latency.
00:18:40.240 --> 00:18:44.480
Um where where where do you think we are with from from that point of view?
00:18:44.640 --> 00:18:53.440
Because I believe that's also extremely important, right, in terms of you could have the the best and the most powerful code ever, right?
00:18:53.759 --> 00:19:03.519
But if it's gonna uh produce like a terrible slowdown of the operations, um it's it's gonna potentially be almost useless.
00:19:04.079 --> 00:19:06.319
Yeah, so that's an excellent point.
00:19:06.559 --> 00:19:10.799
And in fact, that is one of the practical issues.
00:19:11.680 --> 00:19:38.960
When we talk about how good codes are, we're usually talking about their intrinsic properties, like their rate, how many physical qubits per logical qubit, how many errors they can correct, their distance, um sometimes details of what you would need to do to measure what we call the error syndrome that tells you what error had happened.
00:19:39.279 --> 00:19:53.599
But the decoding problem is also very important because in principle there are lots and lots of great codes, but they're useless to us because decoding them is a computationally hard problem.
00:19:53.680 --> 00:19:56.880
And so you couldn't use them in practice.
00:19:57.119 --> 00:20:03.359
So we need codes that are good enough, but that also have efficient decoding algorithms.
00:20:03.680 --> 00:20:06.400
And this latency issue is the reason.
00:20:06.720 --> 00:20:15.920
Right now, all the demonstrations of quantum error correction, pretty much, they encode things, they do their computation, whatever it is.
00:20:16.079 --> 00:20:19.440
Sometimes it's just storing it and protecting it from noise.
00:20:19.599 --> 00:20:23.920
Sometimes they actually try to do some encoded computation.
00:20:24.480 --> 00:20:31.039
And then they measure everything and they they do the decoding in post-processing, right?
00:20:31.200 --> 00:20:32.880
They don't do it in real time.
00:20:33.759 --> 00:20:56.400
But for a practical quantum computer that can run big computations, you need to be able to measure what errors are happening right now, figure out what the appropriate correction is, and apply that back onto the code while the computation is ongoing.
00:20:56.640 --> 00:20:56.960
Right.
00:20:57.519 --> 00:21:02.640
And so the time it takes to run the decoding algorithm is key in that.
00:21:02.799 --> 00:21:05.759
And also just the communication time.
00:21:05.920 --> 00:21:20.319
Do you have to take that information outside of your quantum computer to some classical computer in the outside world, run a program there to figure it out, and then send the information back to the quantum processor about what correction it should do.
00:21:20.559 --> 00:21:25.359
If that takes too long, then you'll fall behind the errors.
00:21:25.440 --> 00:21:32.319
And even if your code in principle should be able to correct all the errors, in practice you can you can't.
00:21:32.720 --> 00:21:33.759
You'll be overwhelmed.
00:21:34.240 --> 00:21:35.680
Yeah, exactly.
00:21:36.240 --> 00:21:40.319
So that's also something that people are working on.
00:21:40.400 --> 00:21:46.400
And that's that's also an area where hardware improvements are key.
00:21:46.720 --> 00:21:59.680
Right now for the first few generations of the quantum processors that like IBM and Google and so forth are building, they didn't have the capability to measure and feedback.
00:22:00.160 --> 00:22:01.920
during the computation really.
00:22:02.400 --> 00:22:04.240
They couldn't do that at all.
00:22:04.480 --> 00:22:09.359
Now they can, so they've made that advance, but it's fairly slow.
00:22:10.000 --> 00:22:25.279
And uh we need to get to the point where they can do that and do it quickly enough that they can uh correct errors as they happen during a computation.
00:22:25.839 --> 00:22:34.559
And it may be that the best code in practice isn't the most powerful code, but the code where we can do that.
00:22:35.279 --> 00:22:43.039
And also as far as decoders, there are there are ideal decoders that sort of find the optimal correction.
00:22:43.599 --> 00:22:57.920
We may be better off with a fast but dirty decoder that works most of the time and uh just build in a little redundancy in other ways to to compensate for its imperfection.
00:22:58.960 --> 00:23:36.400
But there's actually a a great uh precedent in classical computing the development of turbocodes and and low density parity check codes which happened I think mainly in the 1990s once classical computers were fast enough that they could run decoding algorithms uh quickly enough people started using these codes because there were approximate decoding algorithms that theoretically you couldn't guarantee that they would work but it turned out that in practice they do.
00:23:36.960 --> 00:23:38.160
It was just good enough.
00:23:38.720 --> 00:23:46.480
It was good enough and they could use them on this big class of codes that that were very effective.
00:23:46.720 --> 00:24:25.680
And so there was a big leap uh there used to be a joke in coding theory um claude Shannon the the the creator of information theory proved that you could do error correction and uh achieve communication rates he's the one who who discovered the formula for the capacity of a channel that is still the one that everyone uses and he proved it using what are called random codes um which means that if you just randomly generate codes, they're mostly pretty good.
00:24:26.559 --> 00:24:31.119
In principle, but he was proving what you can do in principle.
00:24:31.599 --> 00:24:36.960
But in practice those codes are useless because the decoding problem is too hard.
00:24:37.279 --> 00:24:53.759
So the joke in the field was almost all codes are good codes except for the ones we know and and of course it wasn't so much the ones we know as the ones we know how to decode efficiently.
00:24:54.079 --> 00:24:54.400
Right.
00:24:55.039 --> 00:25:18.000
So in the quantum case uh so that was all mainly for for uh for communication and uh computation just by making the hardware more and more reliable they managed to avoid having to do really onerous coding and decoding in the classical case but in the quantum case we need it.
00:25:18.079 --> 00:25:30.799
So we're we're trying to steal ideas from communication in the classical case and apply them to computation in the quantum case and having fast efficient decoders is absolutely key to that.
00:25:32.240 --> 00:25:37.839
So I'm I I want to take the opportunity and if this is not a valid question that I understand that.
00:25:38.160 --> 00:25:58.160
Is there something that you wish everyone knew about error correction that you have to beat out of your students or or or get them to stop thinking about it a certain way or start thinking it a certain way is there one bad one cardinal bad habit or misconception that you'd like to debunk?
00:25:59.039 --> 00:26:06.000
I try not to beat my students it's frowned on but uh I was in the military so it was it was required.
00:26:06.400 --> 00:26:14.640
Oh I see yeah no I I mean we we could do the whole you know the beatings will continue until morale improves.
00:26:15.279 --> 00:26:16.160
It works for me.
00:26:18.240 --> 00:26:19.839
There was a staple at West Point.
00:26:20.160 --> 00:26:30.480
Ah all right that's where I went I I guess um maybe I'm I'm lucky that I I didn't go to West Point I I'm very delicate.
00:26:31.039 --> 00:26:56.240
Let's uh I mean there are some misconceptions but I think the the most unintuitive thing about quantum coding is that you can figure out what the errors are and correct them without just measuring everything.
00:26:56.559 --> 00:27:23.039
Because classically of course it doesn't matter when you measure things it doesn't hurt they don't change yeah but quantum mechanically they they do change and so you want to you want to design your codes so that you can measure just what you want to know which is what errors happen without sort of going over the line and measuring the data that you're storing.
00:27:23.279 --> 00:27:26.319
And the fact that that's possible at all is not obvious.
00:27:26.480 --> 00:27:34.799
So the the early developers of quantum error correcting codes were very insightful when they realized that that was possible.
00:27:35.440 --> 00:27:44.079
Yeah the analogy I think of is like I'm tracking an animal I'm not allowed to look at like the basilisk or the hot or the Medusa right but I can look at their tracks.
00:27:44.400 --> 00:27:44.960
Yeah.
00:27:45.279 --> 00:27:51.119
And so I'm watching their tracks and I can see the way they've come without turning the stone.
00:27:51.839 --> 00:27:53.200
I don't know if that's a good analogy or not.
00:27:53.519 --> 00:28:30.720
No it's an excellent analogy yeah so you know uh the key to hunting a basilisk well first don't do it at all but second um if you must bring a big big gun and blindfold you know if you if you have a big enough uh blast shotgun yeah yeah but uh yeah you you you need to look but not too closely and uh and that's the same thing with quantum error correcting codes though fortunately you don't turn to stone as far as I know so what are the tracks then in that analogy that I've used?
00:28:30.880 --> 00:28:40.079
Is is it is it their are you looking I I guess I don't are you looking at temperatures are you looking at I I guess it depends on the modality of course.
00:28:40.559 --> 00:28:52.880
Yeah but all the codes work in a somewhat similar way I mean and and actually classical codes work this way too though classically you know this isn't an issue so people didn't really worry about it.
00:28:53.200 --> 00:29:05.599
But in a code you're spreading the information that you're trying to protect redundantly over a larger number of bits or qubits in the quantum case.
00:29:06.480 --> 00:29:17.519
And classically you would just go in and you'd look at all the bits and you'd say oh this isn't a valid codeword so some error must have happened.
00:29:17.839 --> 00:29:23.599
So I will figure out what codeword it most likely you'd look at parity and things like that.
00:29:24.000 --> 00:29:24.240
Right.
00:29:24.400 --> 00:29:42.640
Well that's the thing the parodies are used to define the code so so that's how you know whether it's a valid codeword or not you look at these parodies the you know whether in different subgroups of your bits whether you have an even or an odd number of ones versus zeros.
00:29:43.039 --> 00:30:04.079
So uh but classically you can calculate that just by looking at each of the bits and counting the number of turning to stone and and you don't turn to stone which is which is lucky um given the amount of time everyone stares at their phones, we'd all you know the world would be filled with statues seems like it that might have happened.
00:30:04.400 --> 00:30:20.640
Yeah well a good point um but quantum mechanically one of the key insights was you could measure the parodies of bits without actually knowing the values of the individual bits.
00:30:20.880 --> 00:30:28.319
So for instance if I have two bits uh then we'd say the parity is is even or the parity is zero.
00:30:28.480 --> 00:30:41.279
If both bits are the same, if they're both zero or both one or if I have three bits if I have if two of them are ones or none of them are ones then those would all be even parity.
00:30:42.240 --> 00:30:47.839
So classically you just you look at the bits and you say how many of them are ones and you calculate the parity.
00:30:47.920 --> 00:30:58.799
But quantum mechanically if you do that then you collapse the wave function you've collapsed the wave function you've gone too far you've looked at the state and your computation turns to stone.
00:30:59.519 --> 00:31:04.640
But uh but you don't the the remarkable thing is you don't have to do that.
00:31:04.720 --> 00:31:10.640
You can actually measure the parodies without measuring the values of the individual bits which is not at all obvious.
00:31:10.799 --> 00:31:18.799
So I would call that a very unintuitive thing as well but it's related to the the same one I was saying before.
00:31:19.039 --> 00:31:25.279
So that's what you have to do you have to look but not too closely and that's how you do it.
00:31:25.440 --> 00:31:30.000
You measure these parodies but you don't measure the individual qubits.
00:31:30.480 --> 00:31:48.799
That's fascinating and I and very appreciated because these are the things that you work very hard and it's those epiphanies like I Cyprian shared very early on in our conversations that he was trying to understand quantum and it evaded him which meant he was on the right track.
00:31:49.119 --> 00:31:54.960
It was only when he let go of understanding it in a cognitive sense that it all made sense.
00:31:55.200 --> 00:31:59.839
And you actually use the math you also dove into the math in order to understand it.
00:32:00.319 --> 00:32:26.319
When you act when you resort to math right in the that's right yeah you're in you're either doing on the right track or you're in serious trouble when you resort to math so what one of the things that I wanted to also ask you Todd is uh of course besides the inherent stability of the of the qubits right in the in the hardware like what else can the hardware itself do to help error correction?
00:32:26.559 --> 00:33:27.039
Are there any kind of capabilities that are maybe modality specific that could help or it's just the the quest to get more stable qubits and the rest of it happens essentially at a layer that's that's that's above is there anything else that can be uh can help the the problem of error correction there yeah there there are a lot of things that affect it so the intrinsic error rate of the individual qubits and and also of the the operations the gates that we do on them that's number one of course and uh they all have to have a very low rate of noise but other things are important too if you want to measure these parities without measuring the individual qubits it's very hard to do that if the qubits are physically far apart from each other.
00:33:27.279 --> 00:34:07.920
So these qubits are they they actually have locations in space for for uh superconducting their little devices etched onto a chip for ion traps their individual ions at a particular location in the trap for neutral atoms their atoms at a particular location in the lattice and if the the parity that you're measuring is of qubits that are far apart from each other it's very difficult to measure that without measuring the individual qubits so you can in some cases get around that by physically moving them to be close to each other.
00:34:08.000 --> 00:34:14.239
So ion traps can do that and uh and and neutral atoms can do that.
00:34:14.400 --> 00:34:27.119
But superconducting qubits they're they're etched on the chip the qubits are where they are and and then there's the question of how long range can you connect things together.
00:34:27.440 --> 00:34:45.039
So um with with solid state implementations like superconducting and semiconducting qubits they generally interact with the the qubits around them physically so making things interact that are far apart is more challenging.
00:34:45.199 --> 00:34:48.719
So you have to find ways around that issue.
00:34:48.960 --> 00:35:10.320
So that affects the kinds of codes you can use because different codes have different demands for which subsets of the qubits you need to measure parities of and how local they are, how easily you can lay them out on say a 2D surface or even in three dimensions.
00:35:11.280 --> 00:35:21.519
And so so that affects which codes you can use how easy it is to to do these measurements that you need to do to figure out what the errors are.
00:35:21.920 --> 00:35:45.360
So from that point of view um ion traps and and neutral atoms are are more flexible because you can physically move the qubits they're slow however right so the operations are relatively slow compared to superconducting qubits where the operations are really fast you know 10 nanoseconds or something like that.
00:35:45.840 --> 00:36:36.639
So there's a trade-offs yeah there's a lot of trade-offs and that's why we still don't really have a single uh contender so you make error correcting very fun and much less painful than when I had at school um we we've we've we've been talking for a while i think I suspect we could talk for much longer but but as we start to reel in on time is there anything else you want to let people know anything you're doing that you want to highlight um we really do always appreciate your time well I appreciate that you're making this uh subject accessible to a larger number of people and and so people can appreciate the technical difficulties of what we're doing but also the promise.
00:36:37.679 --> 00:36:56.000
I'll just say I mean I've been working on error correction and fault tolerance I'm one of many people working in this area where we're all trying to come up with ideas to make this problem easier and make the ultimate goal of useful quantum computers closer.
00:36:56.480 --> 00:37:36.559
But there are a lot of other elements to building a quantum computer and of course for the applications we we know some things quantum computers are good for but we also would like to find new ones new new algorithms new applications and so that's a very active area as well that probably should be more active than it is um so it it's become a big enterprise in the very early days so I first learned about quantum computing in the in the early 90s and it wasn't a field at all.
00:37:36.719 --> 00:38:10.400
It was just an idea an idea a few people were kicking around and now I have no idea how many people are working in this field certainly thousands maybe tens of thousands it's extraordinary to have seen that growth and you kind of can sometimes feel a little like a cog in the machine but that's modern technology and it shows that we're a lot closer to quantum computing being a real technology not just an idea.
00:38:10.800 --> 00:38:17.599
I read recently that in Europe in just before the printing press was invented there were only 30,000 books in all of Europe.
00:38:18.320 --> 00:38:22.559
And so I feel like we're the people making the printing press you know in in some way.
00:38:22.960 --> 00:38:28.480
I mean we're reporting on it more than you're making it but uh we do appreciate you know what you're doing.
00:38:29.039 --> 00:38:43.679
Thank you very much and I appreciate that because if you weren't doing that then then uh people would wonder you know where where where this money is going and why why it's an important thing to invest in.
00:38:43.920 --> 00:38:45.360
So I appreciate that.
00:38:45.599 --> 00:39:02.559
And yeah I mean you go from handwritten books where one book costs the same as your house to to now where we're in the information age and there's more information available to everyone than they could read in a hundred lifetimes.
00:39:02.800 --> 00:39:07.199
Right it's extraordinary to be part of it.
00:39:07.679 --> 00:39:11.360
Well we're hoping you'll be back on on continue to be a regular here.
00:39:11.519 --> 00:39:14.239
We really do appreciate your time and and thanks for joining us.
00:39:14.559 --> 00:39:15.360
Thank you so much.
00:39:15.679 --> 00:39:33.199
Thank you it's been a real pleasure all right bye everybody see you next time everyone bye cybercrime is one of the biggest threats to businesses of all sizes and industries with almost half a million open cyber positions the problem is compounded by the lack of available talent in the marketplace.
00:39:33.440 --> 00:39:44.079
At Pulsar Security our elite team of highly credentialed experts collaborate with you to assess your current defenses and develop solutions tailored to your specific needs.
00:39:44.239 --> 00:39:52.800
With services ranging from cybersecurity education to advanced penetration testing and red teaming you can start reducing your risks today.
00:39:52.960 --> 00:39:58.559
Visit pulsarsecurity dot com and let's secure your digital future together
00:00:11.599 --> 00:00:12.720
144.
00:00:16.480 --> 00:00:18.399
University of Southern California.
00:00:30.160 --> 00:00:37.039
Welcome to Entangled Things, your quantum computing podcast, hosted by Patrick and Cyprian.
00:00:40.399 --> 00:00:42.159
Hey Cyprian, how you doing?
00:00:42.479 --> 00:00:43.359
Hey, Patrick.
00:00:43.520 --> 00:00:44.240
I'm doing great.
00:00:44.399 --> 00:00:47.119
Looking forward for another episode of Entangle Things.
00:00:47.359 --> 00:00:55.359
Oh, well, you're in for a treat because we're we're joined by Todd, who's been here before, but we'll still ask you to introduce yourself to our audience, please, Todd.
00:00:55.840 --> 00:00:57.119
Hi, I'm Todd Brunn.
00:00:57.439 --> 00:01:05.519
I'm a professor of electrical and computer engineering, physics and computer science at the University of Southern California.
00:01:06.400 --> 00:01:08.560
I work on quantum computers.
00:01:09.040 --> 00:01:10.640
And that's why we want to talk to you.
00:01:11.280 --> 00:01:12.879
Also, you're very easy to talk to.
00:01:12.959 --> 00:01:14.879
So we've been on the show before.
00:01:16.159 --> 00:01:18.640
You are very deep into error correction.
00:01:18.879 --> 00:01:23.200
I think just before we started recording, you mentioned that you're going to a conference soon on error correction.
00:01:23.599 --> 00:01:26.239
It's exciting times for that field right now, isn't it?
00:01:26.560 --> 00:01:32.640
Yeah, well, uh we've arrived at a point where it's not just theory anymore.
00:01:32.879 --> 00:01:47.599
Uh we've been working on error correction really since very early days of quantum computing, because uh people realized early on you needed to be able to do it if they were ever going to be achievable.
00:01:47.840 --> 00:01:48.239
Right.
00:01:48.480 --> 00:01:51.599
But for a long time, it was really theoretical.
00:01:51.760 --> 00:01:56.239
We proved a lot of sort of results about scaling and things like that.
00:01:56.480 --> 00:01:59.120
But now people are really building these things.
00:01:59.359 --> 00:02:09.199
And so that means we have to focus on what you can actually do with the machines we have and the machines we're going to have in the next few years.
00:02:09.759 --> 00:02:16.479
Do you do you think we're ending the NISC or entering the NISC period, noisy intermediate quantum computing?
00:02:17.360 --> 00:02:19.039
What excites you about the developments?
00:02:19.199 --> 00:02:27.759
Because I can't when I see a feed, almost every day there's something about you know re fault tolerance and redundancy and error correction.
00:02:27.919 --> 00:02:29.759
It it's it's permeating the news.
00:02:29.840 --> 00:02:30.479
Aaron Powell Yeah.
00:02:30.800 --> 00:02:41.199
Well, we're still in the NISC era, but we're entering uh I think the term that people have kind of converged on is the early fault tolerance era.
00:02:41.840 --> 00:02:49.199
Uh fault tolerance is uh sort of full fault tolerance or scalability is pretty demanding.
00:02:49.439 --> 00:02:57.280
And so the machines that exist right now can only achieve it up to a certain point.
00:02:57.439 --> 00:03:06.240
Sort of all the elements are there, but we're still not quite where we need to be to be able to scale to larger and larger sizes.
00:03:06.479 --> 00:03:30.319
But what we would like to be able to do is use some of the elements of fault tolerance, some error correction or detection, some uh methods for reducing the effects of noise, and apply them to actual programs that can be run that would hopefully do actually useful things.
00:03:30.719 --> 00:03:35.199
Uh so that's where we're just sort of starting to be in that era.
00:03:35.439 --> 00:03:49.759
And the goal there would be to be able to incorporate more and more fault-tolerant elements as the capabilities of the machines improve to the point where we we arrive at fully fault-tolerant quantum computers.
00:03:50.479 --> 00:03:54.879
Are you excited about one or two modalities more than others in this?
00:03:55.039 --> 00:03:57.520
Like, is are any of them running away with the ball?
00:03:58.719 --> 00:04:01.360
I love all my children equally.
00:04:01.599 --> 00:04:05.199
Um We have to say as parents, I know.
00:04:06.319 --> 00:04:19.120
Um It certainly is the case that some of them are further along in some sense than others, but this can change unpredictably.
00:04:19.279 --> 00:04:31.360
So it's still the case that the superconducting modality is the most advanced, that's the one that has the most investment from industry.
00:04:32.399 --> 00:04:38.079
They've built the biggest processors so far and have the most impressive results.
00:04:38.319 --> 00:04:42.639
But other modalities are still very much in the running.
00:04:42.879 --> 00:04:46.160
Ion traps, which have been around since the very early days.
00:04:46.319 --> 00:04:49.600
I think you did a podcast on them not long ago.
00:04:50.240 --> 00:04:51.439
And uh there's some companies.
00:04:51.839 --> 00:04:52.800
Glad to know you're listening.
00:04:53.120 --> 00:04:57.680
Ah some companies working to develop that as well.
00:04:58.000 --> 00:05:07.120
And then uh a third contender has really advanced rapidly in recent years, and that's neutral atoms.
00:05:07.519 --> 00:05:20.000
Uh arrays of neutral atoms held in optical lattices and controlled by what they call optical tweezers, so you can actually move the atoms around and reconfigure them.
00:05:20.399 --> 00:05:26.879
That was sort of nowhere, maybe three, four years ago, or I mean not nowhere, but not really a serious contender.
00:05:26.959 --> 00:05:34.959
And now it's grown to where they have systems with hundreds of atoms in them that they can manipulate with great control.
00:05:35.600 --> 00:05:36.480
So who knows?
00:05:36.639 --> 00:05:38.720
That may overtake everything else.
00:05:39.199 --> 00:05:51.279
Yeah, we we talked to the Harvard team that uh I think it was a year this December last December, a year ago last December, they they created a 48 logical qubit system that made the news.
00:05:51.360 --> 00:05:52.639
Uh and they were using that.
00:05:52.720 --> 00:05:59.439
The the light laser tweezers, I think of little mini lightsabers on a chip um used to move things.
00:05:59.600 --> 00:06:03.920
Isn't it funny that in Star Wars a lightsaber can cut through anything except another laser?
00:06:04.160 --> 00:06:04.560
Yeah.
00:06:04.800 --> 00:06:10.959
I mean they they can invent how it works to make the story good.
00:06:11.439 --> 00:06:11.839
That's true.
00:06:12.000 --> 00:06:12.399
That's true.
00:06:12.560 --> 00:06:13.120
Well, we can't.
00:06:13.279 --> 00:06:13.839
We don't have that.
00:06:13.920 --> 00:06:15.759
We have to actually deal with this thing called physics.
00:06:16.240 --> 00:06:17.519
Sadly, sadly.
00:06:17.759 --> 00:06:18.399
Yeah.
00:06:18.800 --> 00:06:21.199
Um so what should we be watching out for?
00:06:21.920 --> 00:06:29.120
Well, uh, I think the there are two things that are very exciting right now.
00:06:29.360 --> 00:06:33.759
One is this early fault tolerant era.
00:06:34.000 --> 00:06:36.399
So there have been a number of experiments now.
00:06:36.560 --> 00:06:47.920
For a long time, there were no experiments at all that demonstrated any advantage to doing error correction because the hardware was just too noisy for error correction to benefit you.
00:06:48.319 --> 00:07:01.279
And then for a while, there was just one, which is from a group at Yale in the superconducting area, where they actually didn't encode things in the in their qubits at all.
00:07:01.439 --> 00:07:07.279
They encoded things in the microwave cavity that was normally used to control the qubits.
00:07:07.360 --> 00:07:13.040
They were, they turned that around, so the information was in the cavity and they were controlling it using the qubits.
00:07:13.279 --> 00:07:16.240
And they just barely showed an advantage.
00:07:16.480 --> 00:07:20.560
This is against real noise that occurs in the system.
00:07:20.879 --> 00:07:22.560
And for a while that was it.
00:07:22.800 --> 00:07:28.800
And now there are a bunch of experiments that have demonstrated advantage, and they keep getting better.
00:07:29.040 --> 00:07:32.480
Um, but so so we're gonna see more of that.
00:07:32.639 --> 00:07:36.399
Uh, that's continuing, and that's very exciting.
00:07:36.720 --> 00:07:39.759
But of course, error correction is not the point.
00:07:39.920 --> 00:07:41.360
The point is computation.
00:07:41.519 --> 00:07:47.759
So we really want to use error correction to do computations that we couldn't otherwise do.
00:07:47.920 --> 00:07:55.519
So there, we aren't quite there yet, but I think we're going to increasingly see that over the next few years.
00:07:57.680 --> 00:08:08.000
So I I saw some announcements uh in in recent time, right, regarding these types of uh demonstrations, right?
00:08:08.160 --> 00:08:14.480
I think QR had one with the uh uh MIT uh MIT team.
00:08:14.560 --> 00:08:16.000
That was a very interesting one.
00:08:16.160 --> 00:08:25.439
They were, if I'm not mistaken, they were claiming like a two to one ratio um from from physical to to logical.
00:08:25.680 --> 00:08:31.680
What would you say is at the moment, uh like the place where we are?
00:08:31.920 --> 00:08:41.440
Last time we talked, we were just about to cross the boundary where error correction actually yields like a positive outcome.
00:08:42.080 --> 00:08:44.159
Um where do you think we are now?
00:08:44.399 --> 00:08:52.480
Um is are the improvements in error correction mostly coming from better hardware?
00:08:52.799 --> 00:09:00.399
Are we doing some some other kind of improvements in terms of, let's say, novel approaches to do error correction?
00:09:01.360 --> 00:09:07.279
What are like the uh let's say the dimensions of the advancements that we're we're we're seeing?
00:09:07.519 --> 00:09:12.559
I think it would be very interesting for our listeners to kind of like understand some of the driving forces there.
00:09:13.600 --> 00:09:28.639
I think the advances are coming both in the hardware, which is of course absolutely necessary, but also on the theory side in exploring new kinds of codes, new kinds of fault-tolerant techniques.
00:09:28.879 --> 00:09:36.639
Not all of that has been implemented in hardware yet, but some of it has, and and we're getting closer.
00:09:37.200 --> 00:09:39.919
And uh I think you need both.
00:09:40.399 --> 00:09:56.720
In the very early days when there were no experimental systems with more than you know, maybe a couple of qubits, uh, the theory largely was concentrated on what you can do in principle.
00:09:56.879 --> 00:10:05.519
You know, can you, in principle, do computations of an unlimited size provided the noise is sufficiently low?
00:10:05.679 --> 00:10:09.120
So people would prove theorems about this, they're threshold theorems.
00:10:09.360 --> 00:10:17.200
If the noise is below some threshold, then you can scale up your computations to any size you want.
00:10:17.440 --> 00:10:25.840
And the overhead in terms of error correction for doing that scales nicely with the size of the computation.
00:10:26.000 --> 00:10:27.600
So that was the early days.
00:10:28.320 --> 00:10:41.840
And it's good to know that because it meant this wasn't an exercise in futility that that if we could build good enough hardware, then we could actually use these things to do something.
00:10:43.120 --> 00:10:59.840
Now the machines have crossed that threshold in the sense that when you use error correcting codes, you can show that the data that you're storing in these machines is protected from noise.
00:11:00.000 --> 00:11:02.000
It's better than not using codes.
00:11:02.159 --> 00:11:04.240
And they've actually gone further than that.
00:11:04.480 --> 00:11:15.279
They've shown that encoding it in more powerful codes, what we call higher distance codes, protects it more than lower distance codes.
00:11:15.360 --> 00:11:18.399
So when you're below the threshold, that's what you would expect.
00:11:18.639 --> 00:11:26.399
When you're above, though, it actually just makes everything worse because you you increase your overhead, the total amount of noise goes up.
00:11:26.639 --> 00:11:30.720
So it's that trade-off that you need to be on the right side of.
00:11:30.960 --> 00:11:39.200
You when you scale up, you increase the noise, but you also increase the power of the code to correct the noise.
00:11:39.519 --> 00:11:45.360
And if you increase the one more than the other, then you either win or you lose.
00:11:45.679 --> 00:11:48.240
And uh now we're on the winning side.
00:11:48.559 --> 00:12:02.240
But the overhead is such that after you do all the encoding, the the number of logical qubits is is still fairly small because these processors are not that big.
00:12:02.480 --> 00:12:08.720
So they're still small enough that we can simulate everything just with an ordinary classical computer.
00:12:08.960 --> 00:12:35.919
So we haven't quite gone to the next step, which is where the processors are big enough and the noise level is low enough, and the codes are efficient enough that we can do a computation at the logical level using logical encoded qubits that we couldn't simulate uh with a classical supercomputer, for example.
00:12:36.240 --> 00:12:39.279
So we're we're close to the edge of that as well.
00:12:39.519 --> 00:12:47.120
There are some demonstrations that you could say can't be simulated or can't easily be simulated classically.
00:12:47.360 --> 00:12:56.080
They're mostly problems that no one has any interest in solving except as a demonstration that it can be done.
00:12:56.399 --> 00:13:14.720
So the next stage is to get to interesting problems, problems people would actually like to be able to solve, uh, perhaps simulations of chemical reactions or nuclear reactions, quantum field theories.
00:13:15.279 --> 00:13:40.960
And recently there's been some indication that new theoretical ideas and error correction and more efficient encodings may bring Schore's algorithm, which got the whole field running in the beginning, uh, the factoring algorithm that can be used to break public key crypto systems, that that may be breakable in the not too distant future.
00:13:41.120 --> 00:13:49.919
There was a paper from Google and a second one that I should have looked up before I went on this podcast to remember who who wrote that second paper.
00:13:50.159 --> 00:14:03.919
But they both made the argument that if you go to more efficient codes, that you may start being able to break the kinds of crypto systems that people are using now in maybe 10 years.
00:14:04.159 --> 00:14:09.759
And uh that's that's much sooner than many people thought.
00:14:10.240 --> 00:14:12.000
Or were prepared for.
00:14:13.120 --> 00:14:14.080
Or were prepared for.
00:14:14.399 --> 00:14:16.080
I I always thought that was short-sighted.
00:14:16.399 --> 00:14:25.360
Yeah, well, of course, a lot of this kind of public key encryption is used for very short-term things, and uh and people don't care.
00:14:25.440 --> 00:14:33.919
You know, you send your credit card number, uh, that credit card number probably won't be valid anymore in 10 years, um, things like that.
00:14:34.159 --> 00:14:41.279
But uh there is stuff that people don't want to be read even 10 years from now.
00:14:41.519 --> 00:14:41.759
Right.
00:14:41.919 --> 00:14:51.840
And uh nuclear silo locations and designs for weapons and I hope not, but maybe they're not supposed to send that kind of stuff over the internet.
00:14:52.159 --> 00:14:55.279
But you know, mistakes happen.
00:14:55.360 --> 00:15:03.840
And there's lots of, you know, businesses have secret uh stuff and private information.
00:15:04.080 --> 00:15:10.240
And then there's cryptocurrencies, which rely on uh public key encryption, basically.
00:15:10.559 --> 00:15:12.720
So they're vulnerable now.
00:15:13.120 --> 00:15:22.799
I've heard some of the ECCs are particularly vulnerable and there's concern that it they could become catastrophically vulnerable within as as few as two years.
00:15:23.840 --> 00:15:27.039
Uh I don't know if it could be as soon as that.
00:15:27.200 --> 00:15:34.559
It's not really my area, but uh yeah, I mean it's much sooner than than people had been hoping for.
00:15:34.960 --> 00:15:35.600
Yeah.
00:15:37.200 --> 00:15:50.000
We we've recently talked to about um Microsoft's uh endeavors, and they're claiming um that their topology inherently has fault tolerant properties.
00:15:50.080 --> 00:15:51.360
Are you following that at all?
00:15:51.519 --> 00:15:53.840
Is that is that is that one of your children?
00:15:56.080 --> 00:15:58.799
I mean that's sort of a they're all my children.
00:15:59.120 --> 00:16:17.039
They're all my um yeah, the uh but uh there are there are a bunch of different approaches people are pursuing that that look very promising and and uh I don't know which of those will will end up winning in the long run either.
00:16:17.279 --> 00:16:17.440
Yeah.
00:16:17.679 --> 00:16:20.559
I'm pursuing my own personal research topics.
00:16:20.879 --> 00:16:21.279
Oh, nice.
00:16:21.519 --> 00:16:32.879
But but there are you know it would be nice if one of them or some some of the elements of what I'm working on end up being used in in whatever the final results are.
00:16:33.360 --> 00:16:35.360
We we don't believe there'll be one to rule them all.
00:16:35.519 --> 00:16:46.480
We I both both Cyprian and I think that there's going to be room for multiple modalities to solve different states of problems in the future, whether it's sensing or computation or whatever.
00:16:47.120 --> 00:16:48.480
That very likely is true.
00:16:48.639 --> 00:16:53.440
Certainly when you have very different applications like sensing and computation, it would make sense.
00:16:53.600 --> 00:16:55.360
You might use photonics.
00:16:56.480 --> 00:16:59.519
Photonics wings wins the network with ease.
00:16:59.759 --> 00:16:59.919
Right.
00:17:00.240 --> 00:17:01.440
Just because of the nature of it.
00:17:01.840 --> 00:17:09.200
So something that's still uh a bit of a challenge is interconverting between different modalities.
00:17:09.359 --> 00:17:29.279
And this is something now that that has been attracting increasing interest is so-called hybrid systems, where you have some qubits of one physical type and some qubits of another physical type, and you try to leverage the advantages of the different kinds and make them work together.
00:17:29.519 --> 00:17:33.200
But converting from one to another is still technically quite challenging.
00:17:33.279 --> 00:17:35.039
This is called transduction.
00:17:35.759 --> 00:17:40.880
And uh uh there are reasons why that's not easy.
00:17:41.039 --> 00:17:58.319
They they operate on very different timescales, so like atomic and ion qubits may have time scales in the in the megahertz while superconducting or in the gigahertz, so that's a big gap.
00:17:58.559 --> 00:18:11.599
And uh, you know, coupling things that operate using optical photons to things that operate using microwave photons, there's a huge energy gap between those two.
00:18:11.839 --> 00:18:14.319
They operate at different temperatures.
00:18:14.880 --> 00:18:22.400
So not easy, but uh it's a valuable thing to be able to do in principle.
00:18:22.640 --> 00:18:26.319
So people are increasingly also working on that problem.
00:18:28.319 --> 00:18:39.759
Um one of the things that one of the areas where I've also seen some interesting results lately is improvement uh when it comes to error correction, improvement in the decoding latency.
00:18:40.240 --> 00:18:44.480
Um where where where do you think we are with from from that point of view?
00:18:44.640 --> 00:18:53.440
Because I believe that's also extremely important, right, in terms of you could have the the best and the most powerful code ever, right?
00:18:53.759 --> 00:19:03.519
But if it's gonna uh produce like a terrible slowdown of the operations, um it's it's gonna potentially be almost useless.
00:19:04.079 --> 00:19:06.319
Yeah, so that's an excellent point.
00:19:06.559 --> 00:19:10.799
And in fact, that is one of the practical issues.
00:19:11.680 --> 00:19:38.960
When we talk about how good codes are, we're usually talking about their intrinsic properties, like their rate, how many physical qubits per logical qubit, how many errors they can correct, their distance, um sometimes details of what you would need to do to measure what we call the error syndrome that tells you what error had happened.
00:19:39.279 --> 00:19:53.599
But the decoding problem is also very important because in principle there are lots and lots of great codes, but they're useless to us because decoding them is a computationally hard problem.
00:19:53.680 --> 00:19:56.880
And so you couldn't use them in practice.
00:19:57.119 --> 00:20:03.359
So we need codes that are good enough, but that also have efficient decoding algorithms.
00:20:03.680 --> 00:20:06.400
And this latency issue is the reason.
00:20:06.720 --> 00:20:15.920
Right now, all the demonstrations of quantum error correction, pretty much, they encode things, they do their computation, whatever it is.
00:20:16.079 --> 00:20:19.440
Sometimes it's just storing it and protecting it from noise.
00:20:19.599 --> 00:20:23.920
Sometimes they actually try to do some encoded computation.
00:20:24.480 --> 00:20:31.039
And then they measure everything and they they do the decoding in post-processing, right?
00:20:31.200 --> 00:20:32.880
They don't do it in real time.
00:20:33.759 --> 00:20:56.400
But for a practical quantum computer that can run big computations, you need to be able to measure what errors are happening right now, figure out what the appropriate correction is, and apply that back onto the code while the computation is ongoing.
00:20:56.640 --> 00:20:56.960
Right.
00:20:57.519 --> 00:21:02.640
And so the time it takes to run the decoding algorithm is key in that.
00:21:02.799 --> 00:21:05.759
And also just the communication time.
00:21:05.920 --> 00:21:20.319
Do you have to take that information outside of your quantum computer to some classical computer in the outside world, run a program there to figure it out, and then send the information back to the quantum processor about what correction it should do.
00:21:20.559 --> 00:21:25.359
If that takes too long, then you'll fall behind the errors.
00:21:25.440 --> 00:21:32.319
And even if your code in principle should be able to correct all the errors, in practice you can you can't.
00:21:32.720 --> 00:21:33.759
You'll be overwhelmed.
00:21:34.240 --> 00:21:35.680
Yeah, exactly.
00:21:36.240 --> 00:21:40.319
So that's also something that people are working on.
00:21:40.400 --> 00:21:46.400
And that's that's also an area where hardware improvements are key.
00:21:46.720 --> 00:21:59.680
Right now for the first few generations of the quantum processors that like IBM and Google and so forth are building, they didn't have the capability to measure and feedback.
00:22:00.160 --> 00:22:01.920
during the computation really.
00:22:02.400 --> 00:22:04.240
They couldn't do that at all.
00:22:04.480 --> 00:22:09.359
Now they can, so they've made that advance, but it's fairly slow.
00:22:10.000 --> 00:22:25.279
And uh we need to get to the point where they can do that and do it quickly enough that they can uh correct errors as they happen during a computation.
00:22:25.839 --> 00:22:34.559
And it may be that the best code in practice isn't the most powerful code, but the code where we can do that.
00:22:35.279 --> 00:22:43.039
And also as far as decoders, there are there are ideal decoders that sort of find the optimal correction.
00:22:43.599 --> 00:22:57.920
We may be better off with a fast but dirty decoder that works most of the time and uh just build in a little redundancy in other ways to to compensate for its imperfection.
00:22:58.960 --> 00:23:36.400
But there's actually a a great uh precedent in classical computing the development of turbocodes and and low density parity check codes which happened I think mainly in the 1990s once classical computers were fast enough that they could run decoding algorithms uh quickly enough people started using these codes because there were approximate decoding algorithms that theoretically you couldn't guarantee that they would work but it turned out that in practice they do.
00:23:36.960 --> 00:23:38.160
It was just good enough.
00:23:38.720 --> 00:23:46.480
It was good enough and they could use them on this big class of codes that that were very effective.
00:23:46.720 --> 00:24:25.680
And so there was a big leap uh there used to be a joke in coding theory um claude Shannon the the the creator of information theory proved that you could do error correction and uh achieve communication rates he's the one who who discovered the formula for the capacity of a channel that is still the one that everyone uses and he proved it using what are called random codes um which means that if you just randomly generate codes, they're mostly pretty good.
00:24:26.559 --> 00:24:31.119
In principle, but he was proving what you can do in principle.
00:24:31.599 --> 00:24:36.960
But in practice those codes are useless because the decoding problem is too hard.
00:24:37.279 --> 00:24:53.759
So the joke in the field was almost all codes are good codes except for the ones we know and and of course it wasn't so much the ones we know as the ones we know how to decode efficiently.
00:24:54.079 --> 00:24:54.400
Right.
00:24:55.039 --> 00:25:18.000
So in the quantum case uh so that was all mainly for for uh for communication and uh computation just by making the hardware more and more reliable they managed to avoid having to do really onerous coding and decoding in the classical case but in the quantum case we need it.
00:25:18.079 --> 00:25:30.799
So we're we're trying to steal ideas from communication in the classical case and apply them to computation in the quantum case and having fast efficient decoders is absolutely key to that.
00:25:32.240 --> 00:25:37.839
So I'm I I want to take the opportunity and if this is not a valid question that I understand that.
00:25:38.160 --> 00:25:58.160
Is there something that you wish everyone knew about error correction that you have to beat out of your students or or or get them to stop thinking about it a certain way or start thinking it a certain way is there one bad one cardinal bad habit or misconception that you'd like to debunk?
00:25:59.039 --> 00:26:06.000
I try not to beat my students it's frowned on but uh I was in the military so it was it was required.
00:26:06.400 --> 00:26:14.640
Oh I see yeah no I I mean we we could do the whole you know the beatings will continue until morale improves.
00:26:15.279 --> 00:26:16.160
It works for me.
00:26:18.240 --> 00:26:19.839
There was a staple at West Point.
00:26:20.160 --> 00:26:30.480
Ah all right that's where I went I I guess um maybe I'm I'm lucky that I I didn't go to West Point I I'm very delicate.
00:26:31.039 --> 00:26:56.240
Let's uh I mean there are some misconceptions but I think the the most unintuitive thing about quantum coding is that you can figure out what the errors are and correct them without just measuring everything.
00:26:56.559 --> 00:27:23.039
Because classically of course it doesn't matter when you measure things it doesn't hurt they don't change yeah but quantum mechanically they they do change and so you want to you want to design your codes so that you can measure just what you want to know which is what errors happen without sort of going over the line and measuring the data that you're storing.
00:27:23.279 --> 00:27:26.319
And the fact that that's possible at all is not obvious.
00:27:26.480 --> 00:27:34.799
So the the early developers of quantum error correcting codes were very insightful when they realized that that was possible.
00:27:35.440 --> 00:27:44.079
Yeah the analogy I think of is like I'm tracking an animal I'm not allowed to look at like the basilisk or the hot or the Medusa right but I can look at their tracks.
00:27:44.400 --> 00:27:44.960
Yeah.
00:27:45.279 --> 00:27:51.119
And so I'm watching their tracks and I can see the way they've come without turning the stone.
00:27:51.839 --> 00:27:53.200
I don't know if that's a good analogy or not.
00:27:53.519 --> 00:28:30.720
No it's an excellent analogy yeah so you know uh the key to hunting a basilisk well first don't do it at all but second um if you must bring a big big gun and blindfold you know if you if you have a big enough uh blast shotgun yeah yeah but uh yeah you you you need to look but not too closely and uh and that's the same thing with quantum error correcting codes though fortunately you don't turn to stone as far as I know so what are the tracks then in that analogy that I've used?
00:28:30.880 --> 00:28:40.079
Is is it is it their are you looking I I guess I don't are you looking at temperatures are you looking at I I guess it depends on the modality of course.
00:28:40.559 --> 00:28:52.880
Yeah but all the codes work in a somewhat similar way I mean and and actually classical codes work this way too though classically you know this isn't an issue so people didn't really worry about it.
00:28:53.200 --> 00:29:05.599
But in a code you're spreading the information that you're trying to protect redundantly over a larger number of bits or qubits in the quantum case.
00:29:06.480 --> 00:29:17.519
And classically you would just go in and you'd look at all the bits and you'd say oh this isn't a valid codeword so some error must have happened.
00:29:17.839 --> 00:29:23.599
So I will figure out what codeword it most likely you'd look at parity and things like that.
00:29:24.000 --> 00:29:24.240
Right.
00:29:24.400 --> 00:29:42.640
Well that's the thing the parodies are used to define the code so so that's how you know whether it's a valid codeword or not you look at these parodies the you know whether in different subgroups of your bits whether you have an even or an odd number of ones versus zeros.
00:29:43.039 --> 00:30:04.079
So uh but classically you can calculate that just by looking at each of the bits and counting the number of turning to stone and and you don't turn to stone which is which is lucky um given the amount of time everyone stares at their phones, we'd all you know the world would be filled with statues seems like it that might have happened.
00:30:04.400 --> 00:30:20.640
Yeah well a good point um but quantum mechanically one of the key insights was you could measure the parodies of bits without actually knowing the values of the individual bits.
00:30:20.880 --> 00:30:28.319
So for instance if I have two bits uh then we'd say the parity is is even or the parity is zero.
00:30:28.480 --> 00:30:41.279
If both bits are the same, if they're both zero or both one or if I have three bits if I have if two of them are ones or none of them are ones then those would all be even parity.
00:30:42.240 --> 00:30:47.839
So classically you just you look at the bits and you say how many of them are ones and you calculate the parity.
00:30:47.920 --> 00:30:58.799
But quantum mechanically if you do that then you collapse the wave function you've collapsed the wave function you've gone too far you've looked at the state and your computation turns to stone.
00:30:59.519 --> 00:31:04.640
But uh but you don't the the remarkable thing is you don't have to do that.
00:31:04.720 --> 00:31:10.640
You can actually measure the parodies without measuring the values of the individual bits which is not at all obvious.
00:31:10.799 --> 00:31:18.799
So I would call that a very unintuitive thing as well but it's related to the the same one I was saying before.
00:31:19.039 --> 00:31:25.279
So that's what you have to do you have to look but not too closely and that's how you do it.
00:31:25.440 --> 00:31:30.000
You measure these parodies but you don't measure the individual qubits.
00:31:30.480 --> 00:31:48.799
That's fascinating and I and very appreciated because these are the things that you work very hard and it's those epiphanies like I Cyprian shared very early on in our conversations that he was trying to understand quantum and it evaded him which meant he was on the right track.
00:31:49.119 --> 00:31:54.960
It was only when he let go of understanding it in a cognitive sense that it all made sense.
00:31:55.200 --> 00:31:59.839
And you actually use the math you also dove into the math in order to understand it.
00:32:00.319 --> 00:32:26.319
When you act when you resort to math right in the that's right yeah you're in you're either doing on the right track or you're in serious trouble when you resort to math so what one of the things that I wanted to also ask you Todd is uh of course besides the inherent stability of the of the qubits right in the in the hardware like what else can the hardware itself do to help error correction?
00:32:26.559 --> 00:33:27.039
Are there any kind of capabilities that are maybe modality specific that could help or it's just the the quest to get more stable qubits and the rest of it happens essentially at a layer that's that's that's above is there anything else that can be uh can help the the problem of error correction there yeah there there are a lot of things that affect it so the intrinsic error rate of the individual qubits and and also of the the operations the gates that we do on them that's number one of course and uh they all have to have a very low rate of noise but other things are important too if you want to measure these parities without measuring the individual qubits it's very hard to do that if the qubits are physically far apart from each other.
00:33:27.279 --> 00:34:07.920
So these qubits are they they actually have locations in space for for uh superconducting their little devices etched onto a chip for ion traps their individual ions at a particular location in the trap for neutral atoms their atoms at a particular location in the lattice and if the the parity that you're measuring is of qubits that are far apart from each other it's very difficult to measure that without measuring the individual qubits so you can in some cases get around that by physically moving them to be close to each other.
00:34:08.000 --> 00:34:14.239
So ion traps can do that and uh and and neutral atoms can do that.
00:34:14.400 --> 00:34:27.119
But superconducting qubits they're they're etched on the chip the qubits are where they are and and then there's the question of how long range can you connect things together.
00:34:27.440 --> 00:34:45.039
So um with with solid state implementations like superconducting and semiconducting qubits they generally interact with the the qubits around them physically so making things interact that are far apart is more challenging.
00:34:45.199 --> 00:34:48.719
So you have to find ways around that issue.
00:34:48.960 --> 00:35:10.320
So that affects the kinds of codes you can use because different codes have different demands for which subsets of the qubits you need to measure parities of and how local they are, how easily you can lay them out on say a 2D surface or even in three dimensions.
00:35:11.280 --> 00:35:21.519
And so so that affects which codes you can use how easy it is to to do these measurements that you need to do to figure out what the errors are.
00:35:21.920 --> 00:35:45.360
So from that point of view um ion traps and and neutral atoms are are more flexible because you can physically move the qubits they're slow however right so the operations are relatively slow compared to superconducting qubits where the operations are really fast you know 10 nanoseconds or something like that.
00:35:45.840 --> 00:36:36.639
So there's a trade-offs yeah there's a lot of trade-offs and that's why we still don't really have a single uh contender so you make error correcting very fun and much less painful than when I had at school um we we've we've we've been talking for a while i think I suspect we could talk for much longer but but as we start to reel in on time is there anything else you want to let people know anything you're doing that you want to highlight um we really do always appreciate your time well I appreciate that you're making this uh subject accessible to a larger number of people and and so people can appreciate the technical difficulties of what we're doing but also the promise.
00:36:37.679 --> 00:36:56.000
I'll just say I mean I've been working on error correction and fault tolerance I'm one of many people working in this area where we're all trying to come up with ideas to make this problem easier and make the ultimate goal of useful quantum computers closer.
00:36:56.480 --> 00:37:36.559
But there are a lot of other elements to building a quantum computer and of course for the applications we we know some things quantum computers are good for but we also would like to find new ones new new algorithms new applications and so that's a very active area as well that probably should be more active than it is um so it it's become a big enterprise in the very early days so I first learned about quantum computing in the in the early 90s and it wasn't a field at all.
00:37:36.719 --> 00:38:10.400
It was just an idea an idea a few people were kicking around and now I have no idea how many people are working in this field certainly thousands maybe tens of thousands it's extraordinary to have seen that growth and you kind of can sometimes feel a little like a cog in the machine but that's modern technology and it shows that we're a lot closer to quantum computing being a real technology not just an idea.
00:38:10.800 --> 00:38:17.599
I read recently that in Europe in just before the printing press was invented there were only 30,000 books in all of Europe.
00:38:18.320 --> 00:38:22.559
And so I feel like we're the people making the printing press you know in in some way.
00:38:22.960 --> 00:38:28.480
I mean we're reporting on it more than you're making it but uh we do appreciate you know what you're doing.
00:38:29.039 --> 00:38:43.679
Thank you very much and I appreciate that because if you weren't doing that then then uh people would wonder you know where where where this money is going and why why it's an important thing to invest in.
00:38:43.920 --> 00:38:45.360
So I appreciate that.
00:38:45.599 --> 00:39:02.559
And yeah I mean you go from handwritten books where one book costs the same as your house to to now where we're in the information age and there's more information available to everyone than they could read in a hundred lifetimes.
00:39:02.800 --> 00:39:07.199
Right it's extraordinary to be part of it.
00:39:07.679 --> 00:39:11.360
Well we're hoping you'll be back on on continue to be a regular here.
00:39:11.519 --> 00:39:14.239
We really do appreciate your time and and thanks for joining us.
00:39:14.559 --> 00:39:15.360
Thank you so much.
00:39:15.679 --> 00:39:33.199
Thank you it's been a real pleasure all right bye everybody see you next time everyone bye cybercrime is one of the biggest threats to businesses of all sizes and industries with almost half a million open cyber positions the problem is compounded by the lack of available talent in the marketplace.
00:39:33.440 --> 00:39:44.079
At Pulsar Security our elite team of highly credentialed experts collaborate with you to assess your current defenses and develop solutions tailored to your specific needs.
00:39:44.239 --> 00:39:52.800
With services ranging from cybersecurity education to advanced penetration testing and red teaming you can start reducing your risks today.
00:39:52.960 --> 00:39:58.559
Visit pulsarsecurity dot com and let's secure your digital future together
