Latest / From First Principles / How Quantum Computing Actually Works (Part 1) (EP 54)

Transcript

How Quantum Computing Actually Works (Part 1) (EP 54) · From First Principles

• 0:00
  There's a common phrase that's used, quantum computing tries every solution in parallel, and it finds the right answer.
• 0:07
  And I mean, like, kinda, but like, honestly, not really.
• 0:11
  Because if that were actually true, then every single problem ever could just be done
• 0:15
  on a quantum computer in parallel.
• 0:17
  This is a big argument when people talk about encryption.
• 0:20
  And encryption is maybe the only thing where it's true.
• 0:24
  Where it's actually true.
• 0:25
  Everything else, though, maybe not.
• 0:27
  What ends up happening is there's only very specific types of questions where you can exploit the properties of quantum mechanics.
• 0:33
  Hello, Internet.
• 0:34
  This is your captain speaking, Lester Nare, joined as always by my co-host and our resident PhD, Krishna Chowdhury.
• 0:43
  We are excited to start part one of what will be a two-part deep dive on quantum computing, covering the recent cover story in Nature, Volume 655, Issue 8125, released on July 30th, 2026, featuring our resident physicist Krishna as a co-author on the cover paper of Nature.
• 1:12
  We are very excited about this.
• 1:15
  This is going to be right in the wheelhouse of the show.
• 1:18
  And there was so much to talk about.
• 1:20
  We're going to spread it over two episodes.
• 1:23
  As always, we are going to talk about the science from the ground up today because this is from First Principles.
• 1:45
  Those of you who keep up with us on Instagram and watch our stories there will know that I am co-author on a paper that was recently published in Nature.
• 1:55
  And not only was it published, it was featured on the cover.
• 1:59
  And I have to say, when I was a PhD student at UCLA and I was in the intersection of neuroscience and physics, I definitely dream...
• 2:08
  about this day, right?
• 2:10
  Every PhD student dreams about the day that maybe one of their papers is going to be featured on the cover of Nature, Science, Cell, things like that.
• 2:19
  I wouldn't have guessed that it would have been a quantum computing story, though.
• 2:24
  And I think if you ask a PhD Krishna
• 2:27
  About it.
• 2:28
  He'd be like, wait, what happened to the original plot of the movie?
• 2:32
  You know?
• 2:33
  And also, why are you in a podcast studio?
• 2:37
  Anyway, so here's the paper itself.
• 2:40
  It's called A Digitally Controlled Silicon Quantum Processing Unit.
• 2:46
  There are a lot of authors.
• 2:47
  The official author that's like under the tagline there is...
• 2:51
  members of the HRL quantum team and collaborators.
• 2:55
  HRL labs is my former workplace and something like 250 authors are on this thing.
• 3:01
  And right there on the list in the blue, that's, that's me highlighted.
• 3:05
  It's an alphabetical order.
• 3:07
  So, you know, Chowdhury CH comes up maybe 20% down.
• 3:11
  If they actually did it in order of importance, I think I'd be somewhere in the bottom line there.
• 3:17
  Nobody has to know.
• 3:18
  You know, yeah, it still counts.
• 3:20
  It still counts.
• 3:21
  And there's a good reason why there are so many authors, because I think what we accomplished required a lot of manpower and a lot of resources.
• 3:32
  Yeah.
• 3:34
  We've covered stories before that have a lot of big groups.
• 3:38
  So this isn't like totally out of the ordinary or physics papers.
• 3:43
  For example, we've covered the Brookhaven's star collaboration when they were doing like some weird quark physics.
• 3:50
  Or the Event Horizon Telescope.
• 3:52
  That thing has 300 authors in all of its papers.
• 3:55
  That's the collaboration that images the black hole of M87.
• 4:00
  Even when you did the interview with Dr. Michael Blanton at Carnegie, he had mentioned this transition from individual name papers to sort of this idea of big science.
• 4:11
  Exactly.
• 4:11
  And he kind of lived through that transition.
• 4:13
  Yes, exactly.
• 4:14
  And to build a quantum computer, it requires big science.
• 4:19
  Now, I was planning to cover that paper, and then as I was cramming everything and doing all of my background research, I started realizing that in order to talk about...
• 4:31
  that paper and put it into context, a single episode is going to leave me unsatisfied.
• 4:36
  And more importantly, it's going to leave our audience unsatisfied because we have spoiled our audience with the history of the thing and then the contextualizing of the thing and then what the paper is and putting it in context with the broader world and blah, blah, blah.
• 4:54
  There's a lot
• 4:55
  That goes on in the quantum computing world, right?
• 4:58
  It's a whole new paradigm of computing.
• 5:00
  So you can imagine there's a theoretical side, there's a software side, and there's a hardware side.
• 5:06
  The paper that I'm co-author on is mostly a hardware paper.
• 5:11
  But in order to really understand why it's such a big deal...
• 5:16
  And why it's on the cover of nature.
• 5:18
  I think, you know, we need to put it into the context of this larger quantum computing ecosystem.
• 5:24
  I mean, there's so many competing technologies that are out there.
• 5:27
  There's trapped ions.
• 5:29
  There's neutral atoms.
• 5:31
  There's superconducting qubits.
• 5:32
  There's spins.
• 5:33
  That's the one that we're going to talk about.
• 5:36
  There's...
• 5:38
  Majorana modes there's from Microsoft I don't know why that's on there to be honest but we'll get into that a little bit later so there's all these storylines and to really appreciate it you need a lot of context first you need the context about what quantum computing is in general and why people should care.
• 5:56
  I hear about quantum.
• 5:59
  You know, there's Marvel movies that use the word quantum.
• 6:02
  Yeah.
• 6:03
  It was one of the worst Marvel movies, I think.
• 6:05
  The Ant-Man one, quantum something.
• 6:07
  Literally one of the worst.
• 6:09
  It's used as this rhetorical device for a lot of...
• 6:12
  different ideas that are totally unrelated to the actual scientific study.
• 6:19
  And so I think this was going to be really interesting.
• 6:22
  I see the quantum supremacy stuff from Google.
• 6:24
  All these headlines all the time.
• 6:26
  I don't know how to parse.
• 6:28
  I didn't even know that there were different types.
• 6:30
  I thought it was just all the same quantum.
• 6:32
  Yeah, yeah, yeah.
• 6:33
  And so this is, I think, is going to be interesting in helping to really distill down, like, what are we actually talking about?
• 6:37
  Exactly, yeah.
• 6:38
  And so that's what today's episode is about.
• 6:40
  We're going to talk about...
• 6:42
  The history of the field from a theory perspective.
• 6:45
  The next episode that's going to happen next week is when we're going to go into the hardware modalities and talk about how to actually build a working, scalable quantum computer.
• 6:56
  So the paper...
• 6:58
  is actually going to be next episode.
• 7:00
  This episode is the theoretical foundations and the setup for why we would even want to build something like this.
• 7:07
  If it's so hard, there better be a good reason for why we're building it, right?
• 7:11
  So the questions that we're going to answer here are things like, what is a qubit?
• 7:17
  What is a quantum algorithm?
• 7:19
  And I want to contrast today's multi-billion dollar technologies.
• 7:24
  I think now it's like in the trillions, to be honest, against the humble beginnings of this field.
• 7:32
  it's like countercultural beginnings in the 1960s, 70s, and 80s.
• 7:36
  We're going to focus a lot on some of the human stories behind it.
• 7:42
  Because at the time, people were thinking about quantum computing in their spare time.
• 7:46
  There was no research program when this thing started about quantum computing.
• 7:50
  Now there's like entire half of a department of physics that will just be doing quantum computing at certain universities.
• 7:57
  Right.
• 7:57
  So from humble beginnings to where we are now, it's a, it's a, it's an incredible story.
• 8:01
  I want to give our audience a sense of why everyone is so obsessed with building one.
• 8:07
  And, um, I want to dismantle the hype is another big thing that I want to do here because we, we hear a lot of hype about quantum.
• 8:16
  As you mentioned, it's an every Marvel movie, whenever they need some gimmick to like time travel or like teleport.
• 8:27
  Yeah, like Erase Memories, the new Spider-Man movie.
• 8:30
  I haven't watched it yet.
• 8:31
  I want to, but there's probably some quantum nonsense in there.
• 8:36
  So if you're not careful, you can get it wrong, right?
• 8:39
  The hype is definitely real, and it's definitely there.
• 8:42
  There's a common phrase that's used that quantum computing tries every solution in parallel, and it finds the right answer.
• 8:51
  And I mean, like, kind of, but honestly, not really.
• 8:56
  Because if that were actually true, if quantum computing was just like doing all of the solutions in parallel, then every single problem ever could just be done on a quantum computer in parallel.
• 9:08
  Every problem has a myriad of possible solutions.
• 9:12
  Okay, just try all of them in parallel, and then what?
• 9:15
  You just solve everything?
• 9:16
  So what, p doesn't equal np equals constant np?
• 9:19
  Right?
• 9:20
  Just constant time.
• 9:20
  You press it on a quantum computer, you're done.
• 9:23
  This is a big argument when people talk about encryption specifically.
• 9:27
  Yeah.
• 9:28
  And it's like, oh, what would take a trillion years can be run in parallel on a quantum computer and can be done in...
• 9:35
  Yeah.
• 9:35
  Seconds.
• 9:36
  And encryption is maybe the only thing.
• 9:39
  Where it's true.
• 9:39
  Where it's actually true.
• 9:41
  Everything else, though, maybe not, right?
• 9:43
  So that's kind of what I'm trying to get into.
• 9:46
  What ends up happening is there's only very specific types of questions where you can exploit the properties of quantum mechanics.
• 9:51
  Okay.
• 9:52
  Okay?
• 9:53
  And in this episode, we're going to explore one of the famous algorithms called the Deutsch-Joseph algorithm.
• 10:00
  It's probably the simplest algorithm to understand.
• 10:03
  I don't think it's very useful.
• 10:05
  except as a teaching tool to understand how quantum algorithms actually work.
• 10:10
  Okay.
• 10:11
  It's simple enough that I think I could do a good job on this podcast to explain at least some of the magic behind, um, why what's actually happening.
• 10:21
  And we will talk about Shor's algorithm.
• 10:22
  Don't worry about it, but, um, we're not going to like go into detail because that's going to require another full deep dive.
• 10:28
  I just have to say Deutsch, Deutsch, Josa sounds like a starter for Liverpool.
• 10:35
  Yeah.
• 10:37
  So that's the preview.
• 10:38
  Yep.
• 10:39
  All right.
• 10:39
  And now let's get into it.
• 10:40
  We begin in 1964 with the formulation of Bell's theorem.
• 10:46
  This is a photo of our America 250 timeline that we had prepared for the celebration of America's 250th birthday.
• 10:56
  We had done a giant timeline of some 400
• 11:00
  accomplishments that America was responsible for.
• 11:03
  A lot of people think that John Bell was mostly at CERN, but actually he took a one-year sabbatical and he came to the United States in 1964.
• 11:12
  He visited Stanford University and the University of Wisconsin.
• 11:15
  And during that sabbatical is when he wrote the seminal paper that he is most well-known for.
• 11:20
  It showed definitively that local hidden variables cannot account for the richness of the observed phenomenon that we see in quantum mechanics.
• 11:30
  So I want to dive a little bit into that because I think that is going to be the foundation for understanding why Feynman got into it.
• 11:38
  A lot of people just start with Feynman.
• 11:40
  There's a lot of stuff that happened before Feynman, okay?
• 11:43
  And I don't want to be a podcast that is the cult of Feynman.
• 11:45
  There's plenty out there.
• 11:47
  Feynman is a great man, as we will see in the talk that he gives.
• 11:52
  But there was a lot of stuff that happened before then that enabled him to think about those problems.
• 11:56
  And for anyone who actually is interested in checking out that America 250, you can go to ffppod.com backslash America 250.
• 12:05
  It's an interactive timeline that covers some of the stuff you just mentioned.
• 12:09
  That's pre-Findman, as well as many of the other great discoveries in our history.
• 12:13
  And it's, I think, a really humbling experience to go through it in that format.
• 12:17
  Yeah.
• 12:18
  And Feynman is mentioned a lot on that timeline because he did a lot of really cool things.
• 12:23
  So let's start with our entanglement experiment that everyone gets to know.
• 12:32
  Alice and Bob.
• 12:33
  Okay.
• 12:34
  They always use Alice and Bob.
• 12:36
  I don't know why.
• 12:36
  I think it's because A and B.
• 12:39
  Maybe if somebody has an idea of historically why we always use Alice and Bob in these entanglement thought experiments, please let us know.
• 12:48
  So here's the idea.
• 12:49
  Suppose I create two particles with spin, and they're entangled.
• 12:53
  So, I don't know, maybe like a photon goes through a crystal, and then it splits into two.
• 12:58
  So then the two photons that were created were created from the same quantum state, so they're going to have an entangled quantum state.
• 13:06
  Now, by conservation of angular momentum, if Alice gets one of these particles and Bob gets another one of these particles, and Alice observes her particle spinning one way, then by conservation of angular momentum,
• 13:18
  Bob should see his particle spinning the other direction, right?
• 13:23
  Because then the two spins cancel out.
• 13:26
  But according to quantum mechanics, there's a probability that Alice is going to see the spin going one way and the other way.
• 13:34
  And then a probability that Bob is going to see it going the other way.
• 13:37
  It's just that the two probabilities are correlated and that they always have to be opposite.
• 13:41
  Now, that begs the question, is there a spin to begin with?
• 13:45
  Right.
• 13:45
  Okay.
• 13:46
  That was like made in the entanglement state and then got split up.
• 13:50
  Okay.
• 13:50
  Or the alternative being, or is it only existent once it's been quote observed?
• 13:55
  Exactly.
• 13:55
  And that's Niels Bohr.
• 13:57
  Which is a complex.
• 13:58
  What is it?
• 13:58
  Yeah.
• 13:59
  What does that even mean?
• 14:00
  Right.
• 14:00
  So Niels Bohr is like, no, that second thing.
• 14:03
  No, that's it.
• 14:04
  Right.
• 14:05
  There's no well-defined spin.
• 14:06
  And then only when you observe it, the wave function collapses and,
• 14:10
  And then you get one direction or the other.
• 14:13
  Right?
• 14:13
  And Einstein's like, this is nonsense.
• 14:16
  This doesn't make any sense.
• 14:17
  He insisted on something called local realism because, one, he liked local because local means that nothing travels faster than speed of light, which makes sense.
• 14:27
  And the physical objects possess definite properties that are independent of observation.
• 14:34
  Okay?
• 14:34
  So that's like the realism part.
• 14:36
  And they can't propagate faster than the speed of light.
• 14:38
  There's no communication.
• 14:39
  Okay.
• 14:40
  So effectively, if you've seen the Denzel Washington movie, Deja Vu, he's effectively Denzel Washington.
• 14:49
  Okay.
• 14:50
  There's that really funny scene where like he's looking through a wormhole or something and he's asking if the person is alive.
• 14:56
  And one of the scientists is like, well, time is not a local variable.
• 15:00
  And then he's like, it's so funny.
• 15:02
  He's like, let me say it slow.
• 15:05
  Okay.
• 15:06
  So you PhDs can understand.
• 15:08
  Right.
• 15:09
  And then he takes a chair and destroys a monitor.
• 15:12
  And he's like, this monitor is now dead.
• 15:14
  It is not in a superposition of different entropy.
• 15:19
  And that's Einstein.
• 15:21
  It's such a classic scene.
• 15:23
  And it's a great movie.
• 15:24
  It is really good.
• 15:25
  And it touches on some of these subjects, maybe in some ways great, in some ways not so great.
• 15:30
  Yeah.
• 15:30
  But it quite, it quite.
• 15:32
  gives a real lived human experience to these theoretical questions in a way that you could try to kind of visualize.
• 15:40
  Yeah.
• 15:41
  And honestly, I was Denzel Washington before I just sort of succumbed to my fate and was like, okay, just shut up and calculate.
• 15:49
  But when you're first learning it, everyone is Denzel Washington.
• 15:52
  What are you talking about?
• 15:53
  Right.
• 15:54
  Right.
• 15:54
  So –
• 15:56
  Effectively, under local realism, any correlation that's observed between Alice and Bob have to do with some kind of hidden variable.
• 16:04
  This is the famous EPR Einstein-Pedolsky-Rosen paper that Einstein published in 1935.
• 16:11
  And he showed that if you have some kind of local hidden variable, then you can perhaps account for the...
• 16:20
  It could kind of make sense, right?
• 16:22
  And for the longest time, it was like, okay, fine, whatever.
• 16:25
  The local hidden variable takes place of the wave function collapsing during observation.
• 16:30
  Yeah, yeah.
• 16:31
  It's like there's something that's saved.
• 16:32
  There's like a saved attribute in the two particles that then we observe on either side.
• 16:38
  Now, crucially, when we only observe the spin in one direction, both the classical interpretation and the quantum interpretation are the same.
• 16:47
  Fine.
• 16:48
  Right?
• 16:48
  Because we're going to observe them in the opposite directions.
• 16:51
  And so for the longest time, it was like, oh, this is just like a philosophical argument.
• 16:54
  There's no way to prove it one way or the other.
• 16:56
  Who cares?
• 16:58
  Along comes John Graham Bell.
• 17:00
  Okay?
• 17:01
  John Graham Bell has the crucial insight in...
• 17:04
  this particular paper, I mean, it's literally called On the Einstein-Podolsky-Rosen Paradox.
• 17:10
  And crucially, the affiliation there is University of Wisconsin-Madison.
• 17:14
  So this is the paper for Bell's inequality, and it's in America.
• 17:19
  And that's why it's on our America 250, you know?
• 17:22
  It's like, hey, that one year, that one year was everything.
• 17:27
  So he realizes that we can actually expand the Alice and Bob experiment
• 17:33
  To give Alice and Bob a choice.
• 17:36
  instead of them only observing a single direction, we can maybe have a filter where they can observe the spin in the Z direction, up and down, or in the X direction, sideways.
• 17:50
  So when the light particle comes in, I can adjust my filter, my polarizer or whatever, to say, okay, what is the spin in the X direction?
• 17:59
  What is the spin in the Z direction?
• 18:02
  Now I've got two choices.
• 18:03
  Alice has the same choice and Bob has the same choice.
• 18:06
  And Alice is going to observe up and down in Z if she chose Z, or up and down in X if she chose X.
• 18:12
  And similarly, Bob has two choices as well.
• 18:15
  Now we sort of have this matrix of options.
• 18:17
  Exactly.
• 18:18
  Based on...
• 18:19
  Yes, now we have a matrix of options, and now we can actually disentangle.
• 18:24
  Is there a hidden variable, or is the quantum mechanics doing crazy nonsense?
• 18:29
  Okay?
• 18:30
  Bell shows that in the local realism world, Einstein's world,
• 18:36
  the joint conditional probability distributions of all of these outcomes, like the probability distribution of Alice observing this way, given that, and Bob observing this way, given his choice, it can factor out into two independent components that are local.
• 18:53
  Okay.
• 18:54
  If there's a hidden variable, I can factor it out into like this particle in Bob and that particle in Alice.
• 19:01
  Okay.
• 19:02
  On the other hand,
• 19:04
  Quantum mechanics predicts that there is going to be certain settings where the correlation is going to exceed that bound.
• 19:12
  If you could factor, the correlation can only go up a certain amount.
• 19:16
  But for certain angles, the correlation is actually going to exceed.
• 19:19
  So now you've got a way to prove one way or the other.
• 19:25
  is there a hidden variable or not?
• 19:27
  John Klauser very famously did this at Berkeley, another one in our America 250 timeline.
• 19:33
  And he showed that, in fact...
• 19:36
  There is a violation.
• 19:37
  Right.
• 19:37
  There is a violation of Bell's inequality.
• 19:39
  And you cannot factor this probability distribution.
• 19:43
  Okay.
• 19:43
  There's no separate components.
• 19:45
  You have to consider the entire thing in this giant, no matter how far apart Alice and Bob are.
• 19:51
  Okay.
• 19:51
  John Klauser did this in the – he won the 2022 Nobel Prize in Physics along with Alain Aspect and Anton Zeilinger.
• 20:00
  Mm-hmm.
• 20:01
  These guys were instrumental at taking Bell's inequality to the absolute limit.
• 20:06
  John Klauser was the first guy to do it.
• 20:08
  And these other two started considering very, very like, you know, whenever, whenever, whenever John Klauser did that, there's there's people that'll come up and be like, well, maybe the hidden variable is like in the lab.
• 20:21
  In the giant room that John Klauser is in.
• 20:24
  Because he's making these particles and then making it go to one end of the lab and the other end of the lab.
• 20:29
  His experiment was still kind of local.
• 20:32
  And then he's making choices that are local to him.
• 20:36
  He's choosing when to...
• 20:39
  put the polarizers in one direction or the other is the argument basically like the scope of what you're accounting for is is like still kind of local right right it's still kind of when is when does it not become yeah yeah so then alan aspect alan aspect i think one of his one of his amazing experiments he did actually i believe it was at tenerife in the observatories there tenerife has these amazing observatories um
• 21:03
  optical telescopes that are across the mountain, right?
• 21:07
  So now what you can do, the main problem with John Klauser's experiment was that he was kind of choosing, even with a random number generator, he was kind of choosing himself which way to set the polarizers, what choice to make for his Alice and his Bob.
• 21:23
  Alan Aspect said, okay, I'm going to point telescopes in opposite directions of the universe, right?
• 21:29
  One is going to point at a quasar that's like billions of light years this way, and one is going to point at a quasar a billion light years that way.
• 21:37
  And depending on the light from the quasars, the quasars are going to make the choice on which direction my polarizing filter is going to be.
• 21:45
  Bell's inequality is still violated.
• 21:48
  So that means that whatever local variable has to be like the size of the universe.
• 21:53
  At that point, it's like, what is local, right?
• 21:56
  And so just to say this back to you, the idea is like, who decides the position of the filter?
• 22:02
  initially was not considered sufficient to say that the hidden variable is not a thing.
• 22:08
  Yeah.
• 22:08
  Because the idea was the decider of that was still too local to the system of observation.
• 22:14
  Yeah.
• 22:14
  And so now when we utilize these distant celestial objects as the variable that decides what direction the filter is in, in this matrix of options...
• 22:26
  Now our experimental design is billions of light years across versus just whatever, a couple tens of yards or whatever.
• 22:32
  And so you're – and then the argument that this hidden variable can exist in this billion light years across experimental apparatus can no longer be considered reasonable.
• 22:43
  Yeah.
• 22:44
  And now we are able to – we still violate Bell's theorem.
• 22:48
  And so we – the realists – sorry.
• 22:52
  Yeah.
• 22:53
  Yeah, sorry.
• 22:53
  I mean, unless you're really like doubling down and you're saying there's just a universe wide local variable or something, you know, it's getting it's getting tenuous now.
• 23:03
  Right.
• 23:03
  Because now we're arguing over the definition of local.
• 23:05
  Yeah, yeah, yeah, exactly.
• 23:06
  Right.
• 23:07
  So the key thing here that I want you to take away.
• 23:09
  OK. Is that factoring capability.
• 23:12
  OK. OK.
• 23:13
  It means that you cannot factor the physics into separate components, one for Alice and her particle and one for Bob and his particle.
• 23:22
  Okay, that's the key thing that establishes that quantum mechanics is very, very weird.
• 23:28
  And that's the insight that Feynman uses in his 1981 talk.
• 23:33
  Can you maybe phrase it in a slightly different way?
• 23:36
  Because I think I understand what you're saying.
• 23:38
  When you say you can't factor it independently for both, are you trying to say that there's a rule set above when either of them observe or act in a system that is not independent of each other?
• 23:51
  So there's like –
• 23:54
  In order to really try and understand what is happening in this experiment, we have to consider the entire system at once.
• 24:03
  We cannot consider the systems separate.
• 24:06
  The particles cannot be considered in any mathematical form to be separate from one another.
• 24:10
  I see.
• 24:11
  They are connected by a single wave function is one way of putting it, right?
• 24:16
  Like the mathematics is inherently tied.
• 24:18
  It is one block.
• 24:19
  Yes.
• 24:19
  Yes.
• 24:19
  Right.
• 24:20
  It is a singular Lego block.
• 24:21
  You can't break it down into subsequent smaller Lego blocks.
• 24:25
  No.
• 24:25
  The whole system that you're observing at whatever scale.
• 24:28
  Yeah.
• 24:29
  Has to be considered a singular Lego block.
• 24:32
  Yes.
• 24:32
  In this analogy.
• 24:33
  Yeah.
• 24:33
  Yeah.
• 24:34
  In order to really capture all of the quantum mechanics that is happening.
• 24:36
  Okay.
• 24:36
  Okay.
• 24:37
  There's no way to be like there's a hidden variable.
• 24:39
  And so, you know, this guy has this thing saved.
• 24:41
  That guy has that thing saved.
• 24:42
  And so.
• 24:44
  Okay.
• 24:44
  You know what I mean?
• 24:44
  Yeah.
• 24:45
  Yeah.
• 24:45
  Okay.
• 24:45
  So that's the key insight that Feynman is going to use later in 1981.
• 24:48
  Okay.
• 24:48
  Okay.
• 24:49
  Now, this is in the 1960s, and we've got a long way to go before 1981, okay?
• 24:52
  Because there's a lot more stuff that happens.
• 24:55
  In parallel, people are working on computation and trying to understand computation, right?
• 25:01
  In the early decades of the digital revolution, where you've got these vacuum tubes and you're trying to understand, like, mathematical abstraction, computation is simply that.
• 25:09
  It's just a mathematical abstraction, okay?
• 25:11
  It's divorced from, like, physical substrates.
• 25:19
  is the same as entropy, but it's still this mathematical abstraction, okay?
• 25:24
  Rolf Landauer, he's actually at IBM Research, which we might hear a lot more about in this episode and in the next episode.
• 25:32
  More on that later.
• 25:33
  But Rolf Landauer, in 1961...
• 25:37
  he establishes that information is actually inherently physical.
• 25:42
  And he demonstrates this by saying that any logically irreversible operation, meaning something that destroys information, is going to cost you heat.
• 25:54
  Okay, here's what I mean by that.
• 25:56
  Like, there's a fundamental minimum amount of thermal energy that needs to be dissipated into an environment.
• 26:04
  And the amount of energy for erasing a bit, and I'll tell you what that means.
• 26:08
  Like, what does erasing a bit mean?
• 26:10
  But in any case, the fundamental amount of energy that you need to erase a bit and to let go of that heat is the temperature multiplied by Boltzmann constant multiplied by log of two.
• 26:21
  The KBT is like the amount of jiggle that you have
• 26:23
  for everything that can jiggle, every degree of freedom.
• 26:26
  And the log 2 is like, it reminds you of like entropy is the log of the number of microstates.
• 26:32
  In this case, the number of microstates is 2 because it's a 0 or a 1.
• 26:37
  So that's the amount of heat that you have to put out.
• 26:39
  Now, for normal computers, that's fine because we actually use reversible gates in our logic all the time.
• 26:44
  Our computers, the algorithms in our phones, everything uses...
• 26:48
  like AND gates, OR gates, things like that.
• 26:50
  If we just look at an AND gate, for example, let me show you how this thing erases information.
• 26:55
  An AND gate takes your inputs.
• 26:57
  There's two inputs that are either 0 or 1.
• 27:00
  And only if they're both 1 does the output become 1.
• 27:04
  Now, what that means is there's four different possibilities, 0, 0, 0, 1, 1, 0, 1, 1.
• 27:09
  But they get mapped to only 2.
• 27:12
  The first three get mapped to zero because at least one of them is zero.
• 27:16
  And only the last one, the 1, 1, gets mapped to a 1.
• 27:19
  Now, this is irreversible because if I were to give you the output, the table in C, you could not tell me the input, the A and B, right?
• 27:28
  Because there's redundancy.
• 27:30
  Like if I gave you the output as 1, then of course you could tell me it's 1, 1.
• 27:34
  But if the output is zero, then you couldn't tell me which of the three it came from.
• 27:38
  So that's an erasure of information because you lost a bit of information.
• 27:42
  Before you had two bits.
• 27:43
  Now you've only got one bit.
• 27:45
  Okay?
• 27:45
  So whenever you implement an AND gate, Landauer's principle comes in.
• 27:50
  And you're going to have to release some amount of heat.
• 27:53
  And the ability to go back is what's being released in the heat.
• 27:57
  Yes.
• 27:57
  The degradation of understanding what your previous state was.
• 28:01
  Exactly.
• 28:01
  It's kind of like an arrow of time argument that you're making.
• 28:04
  The TVA from Loki season one.
• 28:07
  Yeah.
• 28:07
  And this is totally okay for classical computing.
• 28:10
  We use so many N gates and OR gates in our... Fine.
• 28:15
  In our classical laptops, right?
• 28:17
  Fine.
• 28:17
  In quantum mechanics, this is not okay.
• 28:20
  Okay?
• 28:20
  There's two reasons.
• 28:21
  The first one is kind of simple, right?
• 28:23
  If we want to use quantum mechanics to do computation, we want to work with the quantum magic that happens with the entangling, that stuff that I was talking about with Bell's theorem.
• 28:32
  And, like, you know, these two states are entangled.
• 28:35
  Now, in order to keep the quantum state sort of happy...
• 28:40
  You better not heat it up.
• 28:42
  You better not let random other crap go in.
• 28:45
  But if you're dissipating heat in the middle of your computation, that is going to destroy all of the quantum mechanics of your system.
• 28:52
  Right?
• 28:53
  Because your quantum system almost has to maintain this single Lego block state.
• 28:59
  And it can't be messed around with.
• 29:02
  Because then that fundamentally changes the quantum magic of the system.
• 29:06
  Exactly, yeah.
• 29:07
  It's like the only part, and this is the next fundamental thing, the only part of quantum mechanics that is irreversible, meaning you can't go backwards, is the opening of the box or the measurement, the observation.
• 29:19
  The observation.
• 29:20
  Right?
• 29:21
  The observation is the thing where you can't go back.
• 29:23
  Before observing...
• 29:25
  Quantum mechanics is like kind of deterministic because Schrodinger's equation just like tells you how the quantum states are going to evolve.
• 29:31
  It's only when you open the box and find out if the cat is dead or alive, is the cat dead or alive.
• 29:36
  Otherwise, there's like, you know, states where the cat is dead and the cat is alive and there's a complex amplitude that is attached to both and they both...
• 29:44
  go forward like Schrodinger's equations.
• 29:47
  This means that quantum mechanics has unitary evolution.
• 29:51
  And so if I want to do computation with quantum mechanics, I cannot have reversible logic.
• 29:59
  which is kind of key.
• 30:00
  Okay.
• 30:01
  You cannot have reversible logic.
• 30:03
  Yeah.
• 30:03
  Wait, did I say that right?
• 30:04
  No, you can only have reversible logic.
• 30:07
  Yeah.
• 30:07
  Good, good, good.
• 30:08
  Yes.
• 30:08
  Right.
• 30:09
  Because the point is the system has to basically continuously maintain like, like basically until the point of observation, which you want to be able to decide when that happens.
• 30:18
  Yeah.
• 30:19
  You want to just be able to have this system operate in this state, which means it needs to be able to traverse between.
• 30:26
  Yeah.
• 30:28
  all of the quantum yeah and i need to be able to save like all of my progress in some sense okay no okay yeah i i i get the point that you're saying which is like the benefit of a quantum system is that um you don't mess with it until the end right everything is reversible yeah yeah like that you know yeah all of the quantum magic stays quantum magic and you're like messing with the quantum magic but now you have to do it in a
• 30:51
  irreversible way right right you have to obey the laws of schrodinger's equations and like unitary dynamics yes and like poke it in a very specific way that you're not like destroying the thing that is giving you all the magic we have a little poached egg we don't want to poke the yolk yes while it's cooking yeah
• 31:10
  Right.
• 31:10
  And then ruin our poached egg or souffle or any other kind of cooking analogy.
• 31:15
  I think that's a really interesting point, though, because now we're sort of helping to define the fundamentals differences between a classical and quantum systems such that we are going to build to this reason of why quantum systems give us these interesting other things we can do.
• 31:33
  Yeah.
• 31:33
  That fundamentally, because classical systems are irreversible.
• 31:38
  Mm hmm.
• 31:39
  You cannot get out of a classical system no matter how much power, compute, how well you dissipate the heat.
• 31:46
  None of that matters.
• 31:47
  Yeah, none of that matters.
• 31:48
  In order to work with the quantum magic, you got to work in the constraints of quantum mechanics and Schrodinger's equations.
• 31:54
  Very interesting.
• 31:55
  Or Heisenberg if you're in that camp, right?
• 31:57
  So it's unclear whether this is even possible, though.
• 32:00
  Right.
• 32:00
  Like, can you compute with reversible logic?
• 32:06
  Right.
• 32:07
  Right?
• 32:07
  Because we're used to AND gates and OR gates.
• 32:10
  And we got algorithms galore for days for that kind of stuff, right?
• 32:15
  1973, Charles Bennett demonstrates that you can actually use universal reversible computation.
• 32:22
  And along with him, Edward Fredkin and Tommaso Toffoli, who's over here, Tommaso Toffoli invents something called a Toffoli gate, which is a controlled-controlled-not gate.
• 32:34
  I don't want to get into all of that, but it's effectively a logic gate that is reversible, meaning I can always go backwards.
• 32:43
  The truth table is unique because my three inputs give me three outputs.
• 32:49
  So from those three outputs, I can always reconstruct my three inputs.
• 32:53
  But crucially, this gate is something that I can use for universal computation.
• 32:58
  I can build any other gate from these gates.
• 33:03
  It's possible.
• 33:04
  There's a chance.
• 33:06
  This makes sense.
• 33:06
  Unlike our previous AND gate, where three out of the four outputs, you could not go back from.
• 33:12
  Because it went two to one, right?
• 33:14
  So it's like, yeah, you lost some.
• 33:16
  Here, it's three to three.
• 33:17
  Three to three.
• 33:17
  So you basically retain all the degrees of information necessary.
• 33:20
  Yes.
• 33:21
  to go backwards um and that's a fundamental building block to now be able to potentially do the type of computation that you would you have uh the an enabling layer to potentially now think about the idea of quantum computing yes uh yes you've got like a substrate that i can start building an algorithm maybe maybe right maybe maybe
• 33:43
  And Toffoli, for those that are well-versed in quantum computing or just starting to learn about it, you'll hear a lot about Toffoli gates.
• 33:51
  That's who it's named after, right?
• 33:54
  And it's because it's this first idea of a gate that can make up universal...
• 34:00
  logic in some sense.
• 34:01
  So following this, Paul Benioff at the Argonne National Lab, he creates a quantum mechanics version of the state transitions in Turing machines.
• 34:09
  Alan Turing and Church, who we talked about again on our America 250, I keep pitching this thing, but they demonstrated at Princeton that any computable algorithm can be computed on a Turing machine using these state transitions and very simple logic
• 34:28
  He showed that, you know, there's a version of that that I can do in quantum mechanics, okay?
• 34:32
  Side note, Charles Bennett, who's the guy who demonstrated that first reversible computation, he was involved in the early days of quantum cryptography.
• 34:41
  So his undergrad friend, Stephen Wissner, at...
• 34:46
  at Columbia, they had an idea to use Heisenberg's uncertainty principle to create unforgeable money.
• 34:52
  So this is before Bitcoin was a thing before the blockchain was a thing.
• 34:57
  They were trying to use quantum mechanics to create money that you couldn't fake.
• 35:01
  Right.
• 35:02
  There's a funny story where Bennett attended the IEEE conference on foundations of computer science in Puerto Rico.
• 35:09
  And on one of these afternoons, this cryptographer,
• 35:13
  Jill is brassard.
• 35:15
  He was swimming out in the beachfront hotel in San Juan and he,
• 35:20
  Bennett just swims up to him in the ocean and just starts ranting at him about this idea of quantum money.
• 35:29
  And the quote we have from Brassard is, like, I was trapped, so I listened politely.
• 35:33
  Because they're in the middle of the ocean.
• 35:35
  Brassard's just trying to have a good time before his talk about cryptography.
• 35:39
  In Puerto Rico, he's not trying to have a good time.
• 35:41
  Yeah, he's trying to have a good time, and Bennett just swims up to him and is like, yo.
• 35:46
  Quantum money.
• 35:48
  I got this idea.
• 35:49
  I got this idea.
• 35:49
  It's going to make us rich.
• 35:51
  Probably.
• 35:52
  I don't know what he said, right?
• 35:53
  But soon as he's listening to this thing, it's like doubt turns into fascination.
• 35:57
  And he realizes, like, this could actually be some serious science.
• 36:02
  And the two of them form a collaboration together.
• 36:04
  that starts a whole new field of quantum information science.
• 36:08
  They win the Turing Prize together.
• 36:11
  And there's this discovery of a fundamental connection between physics and information, quantum teleportation, if you've ever heard of.
• 36:18
  That's these guys.
• 36:19
  So they won the Turing Prize together, but all from a serendipitous meeting in Puerto Rico, in the ocean, right, where Bennett just like...
• 36:30
  accosted this guy this the only context i have recently of this idea of quantum teleportation was a news story maybe from a year or two ago where the the chinese apparently were able to that they had the maximum distance from
• 36:46
  of quantum teleportation of information they had like a satellite oh dude i heard about that something on the ground and when i heard that i'm in because like the idea is like it is you cannot hack that information transfer yeah in the way you would with normal signals intelligence yeah that's like getting into quantum cryptography and stuff like that again this is the stuff that these guys are doing wait so yeah it starts here on a beach in puerto rico yeah yeah and now it's in orbit yeah but that's it we're gonna get there i think in terms of being able to better understand yeah
• 37:14
  what that means.
• 37:15
  But this is what we talk about when we say that there are all these stories and headlines and tech blogs and whatever.
• 37:21
  Oh, yeah.
• 37:22
  Quantum teleportation, everything is going to be whatever.
• 37:26
  Yeah, but it starts with these small meetings between human beings, right?
• 37:30
  At conferences, crucially.
• 37:32
  Yes.
• 37:32
  So when people say that they don't want to fund conferences, conferences is where ideas come together.
• 37:37
  Osmosis.
• 37:38
  You know, like it's very important to bring human beings together.
• 37:42
  So this is the status in the early 1980s, okay?
• 37:45
  We've got some indication that quantum computing could work.
• 37:49
  Right?
• 37:49
  Like Landau's principle is not a no-go that we thought.
• 37:52
  There's ways to get around heat dissipation.
• 37:55
  There's also this fundamental advantage that Bell gives you with quantum mechanics, where he says that quantum mechanics is certainly very different from classical mechanics.
• 38:05
  Right?
• 38:05
  And there is some magic there.
• 38:07
  Feynman comes in over here.
• 38:11
  Okay?
• 38:11
  So this is where Feynman enters the fray.
• 38:13
  Okay.
• 38:15
  He visits his old alma mater, MIT.
• 38:18
  We make fun of MIT a lot on this podcast.
• 38:22
  In this one, I'll have to give him credit.
• 38:24
  MIT and IBM, in May 1981, they sponsored the Physics of Computation Conference at MIT's Endicott House.
• 38:32
  It's kind of like their Camp David show.
• 38:35
  for like conferences.
• 38:36
  It's like out in the outskirts of Boston, surrounded by the woods, this old, old like mansion out in the woods.
• 38:44
  Princeton has something similar, like with Prospect House, you know, in the middle of, but ours is on campus, in the middle of campus.
• 38:50
  UCLA has something that's similar.
• 38:53
  out in Lake Arrowhead, actually.
• 38:55
  That's nice.
• 38:56
  I had the pleasure of attending like a neuroscience workshop there.
• 38:59
  It's really nice.
• 39:00
  That's really nice.
• 39:00
  So, you know, universities have these like retreats and MIT sponsored this at Endicott House.
• 39:06
  And this conference was attended by a who's who.
• 39:09
  of quantum computing people, or just computing people in general.
• 39:12
  This is a photo that was taken by Charles Bennett, the guy who went into the ocean and tried to pitch this quantum money thing.
• 39:20
  So Charles Bennett was there.
• 39:22
  Along with, you've got Freeman Dyson on the left, Paul Benioff, Paul Benioff's the Turing machine guy.
• 39:28
  You've got Rolf Landauer, that's the Landauer limit thing.
• 39:33
  John Wheeler, Wheeler's just there.
• 39:35
  Wheeler's everywhere.
• 39:37
  Yeah.
• 39:37
  He's like a Nick Fury in Marvel.
• 39:39
  Yeah, dude.
• 39:40
  Oh, my God.
• 39:41
  That's such a good analogy.
• 39:43
  Yeah.
• 39:44
  Wheeler is the Nick Fury of 20th century physics.
• 39:47
  Yeah.
• 39:47
  And then, of course, Richard Feynman and Tom Toffoli.
• 39:52
  So all of the guys that we just talked about, they're at this conference, right?
• 39:56
  Feynman gives the keynote address.
• 39:58
  It's titled Simulating Physics with Computers.
• 40:01
  It's published in 1982 in the International Journal of Theoretical Physics.
• 40:05
  This is the paper that came out of it.
• 40:07
  And this is where he reframes quantum properties from the computational obstacles into fundamental assets.
• 40:15
  And here's what I mean by that.
• 40:16
  Prior to this talk,
• 40:20
  Everyone thought of quantum mechanics as a nuisance.
• 40:22
  Because when you're trying to make semiconductors into chips, quantum mechanics is a nuisance.
• 40:28
  Stuff is moving around, right?
• 40:30
  There's like, you got to worry about the band structure.
• 40:32
  But if your growth is not great, then the electrons are going to hop everywhere.
• 40:37
  There's all sorts of noise.
• 40:38
  And quantum mechanics is primarily that source of noise, right?
• 40:41
  You got quantum tunneling, the thermal fluctuations.
• 40:45
  It limits how small you can make your transistors, things like that.
• 40:48
  Feynman inverted this perspective.
• 40:51
  And he analyzed, what if you could create computational complexity by simulating quantum mechanics using a quantum computer, a computer that uses quantum mechanics?
• 41:03
  Now, why would we want to do that?
• 41:04
  Well, literally, reality is an interacting quantum system system.
• 41:09
  of particles, right?
• 41:10
  Like quantum mechanics is the reality.
• 41:14
  And even if you talk about the 10 to the 80 atoms in the universe or like water having the 10 interacting electrons, it's still quantum mechanical.
• 41:24
  So it certainly makes sense.
• 41:25
  So here's what Feynman said.
• 41:27
  He said, suppose I want to simulate the physics of these interacting particles, right?
• 41:32
  How much stuff would I need to store in my classical computer?
• 41:36
  Mm-hmm.
• 41:37
  This is where Bell's theorem came in.
• 41:38
  Mm-hmm.
• 41:39
  Okay?
• 41:39
  Mm-hmm.
• 41:40
  Remember, I was harping on earlier this idea that the physics of two particles cannot be factored into two independent mathematical probabilities.
• 41:49
  We have to look at it as one Lego block.
• 41:51
  Yes.
• 41:51
  Not two smaller Lego blocks that make up this bigger Lego block.
• 41:54
  Yeah, yeah.
• 41:54
  You can't say that this is what the stuff on the left with Alice is doing and this is what the stuff on the right with Bob is doing, right?
• 42:01
  Instead, there's no way to combine them later on, right?
• 42:05
  If you could, then simulating an n-particle quantum system…
• 42:10
  where the classical computer would be pretty straightforward.
• 42:12
  You just create some kind of software program that assigns like N independent data tables or subroutines for all of the N independent particles.
• 42:20
  You look them up.
• 42:20
  Each is tracking some kind of isolated local state.
• 42:24
  And then your memory and processing time scales linearly, like the order of N, like however many particles you have, that's about...
• 42:31
  how it's going to scale.
• 42:32
  The point being, it just becomes a compute and power.
• 42:35
  Yeah, and you just make a bigger computer, and it's fine.
• 42:39
  You could scale up to some upper bound that then covers all the types of simulations you're trying to do.
• 42:46
  And you just have one subroutine for each particle, and you're fine.
• 42:49
  And you're fine.
• 42:50
  Right?
• 42:51
  But quantum probability distributions do not factor.
• 42:54
  That's what Bell showed.
• 42:55
  Right.
• 42:56
  Right?
• 42:56
  If you want to talk about reality...
• 43:00
  The experiments show this, right?
• 43:01
  This is no longer in our head, right?
• 43:04
  For an n-particle system, you can't decompose it into n different things.
• 43:11
  Instead, you have to worry about all of them combined.
• 43:14
  It depends globally on the fully entangled configuration of
• 43:18
  of your particles, right?
• 43:20
  So even if you imagine like a two-state particle, like the one that we talked about with Alice and Bob, right?
• 43:25
  You've got a two-state particle of spins that can be like, you know, spin up or spin down.
• 43:32
  A classical computer would be forced to store and update a joint probability, like vector, tensor, or like set of numbers to...
• 43:45
  Across all two to the n computational states.
• 43:49
  For Alice and Bob, for example, right?
• 43:52
  You could have up, up.
• 43:54
  You could have down, down.
• 43:55
  You could have up, down, or down, up.
• 43:58
  And those are different.
• 43:59
  Across both the z and the x?
• 44:01
  Well, here I'm just saying like...
• 44:03
  Even if you keep it that simple.
• 44:06
  Yeah, even if we just keep it that simple, right?
• 44:08
  Okay.
• 44:09
  Right.
• 44:09
  Which, like, the point being it's not... Yeah.
• 44:12
  Anyway.
• 44:13
  Yeah, the Z and the X comes in, like, a bit later, and I'll have to get in, you know... Let's not go there.
• 44:17
  Because, like, they're all, like, yeah, whatever.
• 44:19
  In any case, like, let's just say two particle states, right?
• 44:22
  Okay.
• 44:23
  Two state systems, right?
• 44:24
  Those two states can actually go...
• 44:25
  in z and x is the point that i was trying to make but but um what you need to do is for alice and bob you need to keep track of four possibilities the up up the down down the down up and the and the and the up down really you got to take take um take care of like the sum of this and the difference of this because like you know what does it mean to be like the the the
• 44:46
  Electron 1 is up and electron 2 is down.
• 44:49
  There's no sticker on an electron saying this is 1 and 2.
• 44:52
  They're indistinguishable particles.
• 44:53
  So you have to worry about, like, you know, combining linear combinations of them.
• 44:57
  But in any case, it's always 2 to the n is the idea.
• 45:01
  Now...
• 45:02
  This becomes insurmountable very, very quickly.
• 45:05
  Very, very quickly.
• 45:06
  Okay, if you want 50 entangled two-state particles, that's 2 to the 50 complex numbers that you have to take care of, right?
• 45:15
  2 to the 50, hack for students that are listening.
• 45:19
  2 to the 10 is like 10 to the 3 because 2 to the 10 is 1024, which is 10 to the 3.
• 45:23
  So if you ever want to go into base 10...
• 45:26
  2 to the 50 is like 10 to the 3 to the 5, which is 10 to the 15.
• 45:30
  So you got to take care of 10 to the 15 complex numbers.
• 45:32
  If you're trying to simulate 300 two-state particles, which like any...
• 45:37
  There's so many compounds where there's 300 electrons that are moving around, proteins, for example.
• 45:43
  That's going to be 2 to the 300, which is...
• 45:47
  2 to the 10 to the 30, which is 10 to the 3 to the 30, which is 10 to the 90 numbers.
• 45:54
  That exceeds the number of elementary particles in our observable universe.
• 45:58
  There's estimates out there that there are only 10 to the 80 atoms, right?
• 46:02
  So just to simulate 300 two-state particles, I need 10 to the 90 numbers, right?
• 46:10
  It's kind of crazy.
• 46:12
  Part of the point you're bringing up here is that it is just wholly inefficient because the type of systems we would be able to simulate are exceedingly small, effectively a protein.
• 46:23
  Yeah.
• 46:23
  That only had two states, which is not real.
• 46:26
  Yeah.
• 46:26
  It's not practical in real life.
• 46:28
  Yeah.
• 46:28
  Yeah.
• 46:28
  No, I'm saying a protein would be crazy.
• 46:30
  I mean, maybe you could simulate, if you had all the time in the universe, like a water molecule with 10 electrons, right?
• 46:38
  There's no amount of brute force around compute and scaling up that would make it even tenable because the amount of variables when we have to account for the entire system as a whole...
• 46:54
  Because you can't factor it.
• 46:57
  It means that the amount of variables and interactions you're tracking continuously is just insane.
• 47:08
  It's just... Yeah, and also as an aside, I think it's kind of cool to think about that somehow the universe is keeping track of what?
• 47:17
  So there's 10 to the 80...
• 47:19
  particles, right?
• 47:20
  Even if all those particles are two-state systems, there's two to the 10 to the 80 complex amplitudes that the universe is keeping track.
• 47:29
  I don't even know how big that number is, right?
• 47:31
  That might be, I don't know if that's the big, no, I'm sure there's mathematicians that have come up with bigger numbers than two to the 10 to the 80.
• 47:38
  But I'm just saying, like, it's kind of crazy that the universe is keeping track of
• 47:42
  all of those complex amplitudes to give us the world.
• 47:46
  Is that how it works, really?
• 47:47
  Is that really how it works?
• 47:49
  Sometimes I'm thinking about this stuff, and I'm like, mate, is this really how it works?
• 47:54
  Because it's hard to even...
• 47:56
  And like where anyway, yeah, but that's, that's an aside about like, just like the nature of reality.
• 48:02
  Totally, totally, totally.
• 48:03
  Why quantum mechanics is weird.
• 48:04
  But in any case, right, this is what Feynman is talking about.
• 48:07
  And he says, instead of classical bits where we'd have to, we'd have to create 10 to the 90 bits to keep track of 300 thingies.
• 48:18
  Instead, what if we use a quantum version of a bit, right?
• 48:22
  What if we create a computer and,
• 48:24
  Where the bit is a two-state quantum system.
• 48:27
  And then we bake into the computer the interaction that we're trying to study, right?
• 48:33
  Then the quantum mechanics inside the computer is going to take care of all of the superposition, entanglement, and all of the blow-up of complex numbers, right?
• 48:44
  Because we're just harnessing the quantum mechanics that we're trying to study.
• 48:48
  At the foundational layer of where the compute happens.
• 48:50
  Yeah, hardware is king.
• 48:52
  Versus after the fact at the software level or at the systems level.
• 48:55
  Yes, exactly.
• 48:55
  And so he ends his talk with a very famous line that rings across a lot of...
• 49:03
  quantum computing literature and a lot of quantum computing deep dives.
• 49:07
  He says, nature isn't classical, damn it.
• 49:10
  And if you want to take a simulation of nature, you'd better make it quantum mechanical.
• 49:13
  And by golly, it's a wonderful problem because it doesn't look so easy.
• 49:18
  No, it certainly doesn't.
• 49:21
  It certainly does not look so easy.
• 49:23
  46 years later, we're still trying to make one.
• 49:27
  I think this is a really great starting point because what we've done so far is we've sort of created this understanding of the difference between classical systems versus quantum mechanical systems at a theoretical level.
• 49:44
  How that informed the early countercultural era of computing in general.
• 49:51
  How this idea then moved to this point of computing.
• 49:55
  There is actually quantum computing as a competing way to solve certain types of problems as opposed to classical computing because there are fundamental limitations because we've found violations of Bell's theorem that mean that the hidden variable thing and the realists, sorry.
• 50:15
  And if we really want to create simulations that are true to our lived theory
• 50:21
  four dimensional time space.
• 50:23
  Yeah.
• 50:23
  Whatever.
• 50:24
  Yeah.
• 50:25
  Right.
• 50:25
  This magical thingy.
• 50:27
  Um,
• 50:28
  we're going to need the compute layer to reflect the same quantum mechanical attributes that our theoretical frameworks currently suggest exist.
• 50:40
  Yes, exactly.
• 50:41
  Is that a fair summary?
• 50:41
  That's exactly right.
• 50:42
  And that talk happened in 1981, and he mentions all of the priors that I've been talking about.
• 50:50
  He mentions Bell's theorem.
• 50:51
  He mentions Toffoli and Benioff and all these people who said –
• 50:55
  Hey, quantum computing is a possibility, right?
• 50:58
  We have reversible logic.
• 51:00
  Right.
• 51:00
  We have a paradigm where we can manipulate a quantum state, right, even theoretically.
• 51:06
  And Bell shows that there's this rich underlying layer that we can actually exploit if we want to, right?
• 51:12
  Mm-hmm.
• 51:14
  Feynman's argument about fundamental science and like, you know, this becomes something that is a polynomial time simulation tool for chemistry, condensed matter physics, material science, everything.
• 51:24
  But that's really not the reason why quantum computing is a trillion dollar industry.
• 51:29
  I don't think a trillion dollars would have gone into quantum computing if all it was doing was trying to find the next room temperature superconductor.
• 51:38
  Okay.
• 51:38
  Okay?
• 51:39
  The reason it is a trillion dollar computing industry is because of the stuff that we are getting into after our break.
• 51:46
  Namely…
• 51:48
  Shores algorithm and Bitcoin going to zero.
• 51:55
  And so with that, let's do some housekeeping.
• 51:57
  So for those of you watching us on YouTube or Spotify, welcome.
• 52:03
  As always, watching the pod is one of the best ways to capture all of the overlays and graphics we talk about.
• 52:10
  Be sure to like it.
• 52:11
  share, comment, and subscribe.
• 52:13
  It helps us in our battle against the billionaire algorithm.
• 52:17
  For those listening on Apple Podcasts, it is out of our hands, but we are awaiting the announcement for Spotify creator videos to be available as video on Apple Podcasts.
• 52:29
  Allegedly, Apple and Spotify are collaborating on this launching late 2026, so keep an eye out for that.
• 52:38
  For those who catch our clips today,
• 52:39
  on TikTok and Instagram on a regular basis.
• 52:42
  Put them in those group DMs.
• 52:44
  Share the best science show on the planet with your friends, coworkers.
• 52:48
  Bring it to Journal Club.
• 52:49
  If you are watching this full episode for the first time from our clips, welcome.
• 52:55
  Every episode is like this.
• 52:57
  And so we are super excited to continue to have you all today.
• 53:00
  A couple of announcements or housekeeping notes.
• 53:05
  For our merch giveaway, we are going to be sending out the emails to the winners over the next week here.
• 53:13
  So keep an eye out on your email.
• 53:15
  Thank you for everyone for submitting for our one-year anniversary.
• 53:18
  You may have noticed behind us there are gold balloons representing 250.
• 53:25
  And while we talked a lot about America 250, the gold balloons are not necessarily here to celebrate our America 250 episode.
• 53:33
  But they are here thanks to the loving wives, Anna and Joni, who have provided us a way to celebrate our 250 Instagram followers, which is already now at 267.
• 53:45
  So we are just growing unbelievably fast.
• 53:48
  We want to thank the upcoming cast of The Real Housewives of FFP for supporting us so greatly.
• 53:56
  We love you both so much.
• 53:58
  And I'm just going to hit one last note before we get here.
• 54:02
  into some quick headlines as a palate cleanser before we dive back into our quantum episodes.
• 54:08
  If you would like to support the show, five-star reviews, like, comment, share, subscribe.
• 54:13
  If you would like to donate to the show, you can head to ffppod.com backslash donate.
• 54:19
  Again, we are on all platforms.
• 54:21
  Our website has a great way to watch the videos, chapters, full transcripts.
• 54:26
  Links to all the research papers we talk about are all available there.
• 54:31
  But now we want to quickly just get into some of the top news stories from the week just to give you an idea of what's going on out there in the world of science.
• 54:43
  Our first story came out breaking today.
• 54:46
  It's been all over the news related to pharmaceutical giants Moderna and Merck saying, I
• 54:53
  today, Wednesday, which will be likely a day before you all watch this podcast, that an experimental vaccine treatment has shown signs of preventing cancer from returning or spreading in a study of high-risk melanoma patients.
• 55:08
  This was a combination of Moderna bringing their mRNA vaccine structure and Merck bringing their Keytruda.
• 55:16
  And the idea is they
• 55:17
  You know, we've talked about the immune system in the past on the pod.
• 55:21
  And part of the tough part about cancer cells is our immune system is not really able to identify them.
• 55:25
  Yeah.
• 55:25
  So it's like our police, our immune system is looking for the criminals and the criminals are kind of invisible.
• 55:30
  Apparently, the combination of these two things makes it able, the immune system able to identify what was previously not visible to them.
• 55:39
  However, they've not published their results in a peer-reviewed journal or released the new data, saying instead they will be presented at an upcoming medical meeting and shared with regulators.
• 55:51
  Oh, okay.
• 55:51
  However, there does seem to be –
• 55:54
  Some real – there does seem to be a there there.
• 55:57
  Okay.
• 55:59
  And so according to their news release, the mRNA-based vaccine was tested in a late-stage trial involving people who had had surgery to remove a melanoma, one of the deadliest forms of skin cancer.
• 56:09
  Apparently, this same methodology is also being applied to a few other types of cancer, and there's potential that it generalizes.
• 56:16
  Interesting.
• 56:17
  So their stock price –
• 56:19
  Both of them went through the roof.
• 56:21
  Oh, I bet.
• 56:22
  Around that.
• 56:22
  So we'll see.
• 56:23
  A cancer vaccine?
• 56:24
  The data.
• 56:25
  We'll see when the data comes in and we'll keep an eye on that.
• 56:28
  Sounds pretty good.
• 56:28
  But that's an interesting first story from us that's out today.
• 56:31
  Our second story in the news headlines that was interesting.
• 56:35
  This is from UC Berkeley.
• 56:38
  This idea of a new technique called trace that pinpoints human DNA inherited from gutters.
• 56:45
  Ghost ancestors.
• 56:48
  There have been a lot of videos and hype things about, oh, the missing link to humanity's ancestry.
• 56:54
  So the idea here is that, and we've talked about some of these stories before previously as well, Neanderthals and Denisovans interbred with modern history.
• 57:03
  Human ancestors leaving behind a telltale DNA in our genomes.
• 57:07
  And so if you do 23andMe or Ancestry.com, you can kind of know and see where those trace ancestry is from.
• 57:16
  But now the researchers at UC Berkeley have found out that we may actually have evidence for modern human interbreeding with two much older ones.
• 57:26
  Unknown ancestors that have not yet been recorded in any of the genomic records specifically.
• 57:32
  Wow.
• 57:32
  And the time period in which the interbreeding started was prior to the sort of the migration out of Africa, which I believe was about 800,000 years ago.
• 57:43
  And so this is a very big, it would be a very big deal in terms of the.
• 57:48
  Yeah.
• 57:49
  Yeah.
• 57:49
  If it happens before the out of Africa event.
• 57:51
  Yes.
• 57:52
  Yes.
• 57:53
  Then it's much more widespread, right?
• 57:55
  Yes.
• 57:55
  Yeah.
• 57:56
  Then it's like literally everyone who's not in Africa and maybe some in Africa.
• 58:00
  It appears that I believe the data point was 0.5 to 1%.
• 58:04
  They found traces of these two ancestral lines across every – the Eurasian, the Denisovan, Neanderthal.
• 58:14
  It's present –
• 58:15
  across everybody oh okay and so now there's obviously going to be follow-up around this but is it it is an interesting and the thing is it started uh there was this break off it started prior and then there was apparently a reconnection right before uh the rise of homo sapien and so there there seems to be some interesting there's some interesting genetic history of
• 58:38
  to come out of that story.
• 58:39
  So interesting, fascinating.
• 58:41
  If you would like us to cover that in more detail, let us know.
• 58:44
  Our last quick story reference point here, we are always going to talk about funding.
• 58:49
  Yesterday, the NSF announced $1.5 billion of the foundational research.
• 58:55
  This is the idea that every year, a couple of different times, they will have their new notices for funding opportunities.
• 59:02
  which define what they're funding under what dynamics and the requirements to submit your proposals.
• 59:09
  There's a lot of kerfuffle right now around funding because there's significant cuts that the current Trump administration is trying to make around funding generally, as well as changes to how grants are actually –
• 59:22
  And how grants are awarded themselves, which currently has expert review panels.
• 59:28
  They want to move it into being more aligned with whatever the agenda of the administration, the political administration of the time is.
• 59:36
  Which we covered in a previous episode about how politics is now getting intertwined into –
• 59:42
  Yeah, the peer review panel of experts and scientists no longer have final say.
• 59:48
  It's just an opinion.
• 59:50
  Which, again, we can talk about iterating on the process, but I think this is a hammer approach to something that requires a scalpel.
• 59:59
  The $1.5 billion new proposals that were announced –
• 1:00:04
  across all of the fundamental hard sciences.
• 1:00:07
  Okay.
• 1:00:07
  So this is not the social sciences per se.
• 1:00:09
  We're talking about things like biological science, expeditions and computing, electrical communications, bioengineering, manufacturing.
• 1:00:18
  One new area that I think was allocated about $30 million was emerging frontiers in wave-based computing, which has maybe some kind of tangential relationship to what we're talking about.
• 1:00:29
  Yeah, I wonder what that means.
• 1:00:31
  One of the issues people have about this is a lot of this is being framed around the golden age of X that is the overarching political narrative that is trying to be applied to a lot of research and development and the emphasis on the technological boundaries.
• 1:00:47
  You know, bolstering from a geopolitical perspective, obviously, we want to be able to do fundamental research, as we've talked about a lot, that does not necessarily have a direct through line to a practical commercial application, because some of the biggest things we have discovered in the US that have had the biggest financial impact are,
• 1:01:06
  were not decided at the point of research it was figured out after the fact and if you are curious about learning more about the history of funding in general in the u.s we have an incredible interactive explorer for funding over the last 60 years in the united states you can understand how research and development funding uh has been allocated across agencies
• 1:01:31
  even including last year's FY2026 and this year's still ongoing FY2027 funding debate.
• 1:01:40
  Looks like instead of just talking about things without knowing the information, we've given a very easy way to look at what money has actually been allocated to science and where.
• 1:01:51
  And big shout out to AAAS, who've provided the historical data sets that we've been able to build that off of.
• 1:01:58
  Now, last quick note in our break before we return to our quantum fantasticness.
• 1:02:03
  What is the – I can't remember the Marvel movie.
• 1:02:05
  Quantum – Quantumania.
• 1:02:07
  There it is.
• 1:02:08
  That's the one that I didn't see.
• 1:02:09
  Quantumania, and it was apparently terrible.
• 1:02:12
  So we don't care about that.
• 1:02:13
  But we have one correction from our previous episode, which was on the Riemann Hypothesis.
• 1:02:18
  Yes.
• 1:02:19
  So the previous episode, a lot of you saw it, and most of it I'm very proud of.
• 1:02:27
  There's one segment where I think I could have done better, and it was when we were discussing some of Claude's results, and specifically this particular graphic came up.
• 1:02:39
  As background, Claude made some progress in a related problem to the Riemann hypothesis, where the Riemann hypothesis is where are the zeros of the Riemann zeta function?
• 1:02:51
  Are they all on the critical line where the real part of the zeros is one half?
• 1:02:57
  Now, Claude showed...
• 1:03:00
  that the previous bound of something like 44% had gone up to 67%, which means that 67% of all of the non-trivial zeros are on that line.
• 1:03:14
  Critical line.
• 1:03:15
  And I mistakenly said that if we get to 100%, that's going to be the Riemann hypothesis.
• 1:03:20
  And it's because that graphic...
• 1:03:22
  showed 100% line over there, and it said Riemann hypothesis, and I just wasn't really thinking.
• 1:03:28
  It's a lot richer than that, because this is a statistical argument, right?
• 1:03:33
  And you actually brought it up earlier when you said that, you know, with infinities, it's hard to talk about percentages.
• 1:03:41
  Like, when we say that 67%, or let's say two-thirds, let's say two-thirds of all zeros are on the critical line,
• 1:03:51
  G.H.
• 1:03:52
  Hardy had already proved that there are an infinite number of zeros on the critical line.
• 1:03:55
  So what does it mean for the infinite number of zeros to only at least be two-thirds?
• 1:04:00
  Well, what that means is two out of three in that infinite set are on the line.
• 1:04:05
  That's what Claude is saying, right?
• 1:04:07
  There's an infinite set, and just like how one out of two of the infinite set of natural numbers are even numbers, one can say—
• 1:04:16
  or 2 out of 3 of all of the numbers are not multiples of 3.
• 1:04:21
  That's another way of saying it.
• 1:04:22
  That's another way of saying, like, in the infinite set, 2 out of 3 of all of the elements are going to be on that line, right?
• 1:04:30
  And then I mistakenly said that if we get to 100, that'll mean the Riemann hypothesis is true.
• 1:04:34
  That's not the case, right?
• 1:04:36
  Because of infinities.
• 1:04:37
  So you could have, for example, an infinite number of zeros on the critical line,
• 1:04:45
  somewhere else that would still give you a hundred percent on the critical line but the reman hypothesis would still be false because not every zero is on the critical line statistically we can reach a hundred and you still haven't proven the reman hypothesis that's the point and so ai you're still you're still not there there's a song if i find it i'll play it in the next episode because now there's like counterculture rap music about like wanting data centers in your neighborhood
• 1:05:14
  No way.
• 1:05:14
  But it's like they don't really want a data center in the neighborhood.
• 1:05:17
  But some people will know what I'm talking about.
• 1:05:19
  It's like, I want a data center in my neighborhood.
• 1:05:22
  I need a data center in my neighborhood.
• 1:05:25
  I want a data center in my town.
• 1:05:27
  Please put a data center in my neighborhood.
• 1:05:30
  That way, my ramp might actually go down.
• 1:05:33
  I don't care if I lose my hearing.
• 1:05:35
  Like, I don't care if my water, like, you know, and it's like, obviously, yeah, it's like satire, satire around it.
• 1:05:40
  But, um, it's funny how culture and these issues related to AI are so intertwined.
• 1:05:47
  But we, after we're,
• 1:05:49
  quite a fun break.
• 1:05:51
  Again, the best show in science.
• 1:05:54
  Not only do you get a deep dive, you get some background context on the latest happenings at the Frontier.
• 1:06:01
  No other show provides you the best Frontier breaking news science experience with a depth of understanding where you're going to walk away not only learning something, but understanding the context
• 1:06:14
  in which these discoveries were made.
• 1:06:16
  And so we're going to jump back now into our breakdown of quantum computing in our part one of our two-part deep dive.
• 1:06:25
  So we left off with Feynman's keynote address at that conference.
• 1:06:29
  And as I said, you know, Feynman's keynote address was amazing, but that's not really why we have a trillion-dollar ecosystem now.
• 1:06:39
  He approached quantum computing from this physical modeling perspective.
• 1:06:43
  At the same time, David Deutsch in England, he formalized the mathematics of quantum computational complexity in a 1985 paper, Quantum Theory and the Church-Turing Principle and the Universal Quantum Computer.
• 1:07:00
  If you notice...
• 1:07:01
  It is communicated by Roger Penrose, fellow of the Royal Society, to the proceedings of the Royal Society.
• 1:07:07
  So Roger Penrose is also in this story, the great mathematician and physicist who won the Nobel Prize for his proof that black holes are definitely a reality.
• 1:07:19
  So he shows, David Deutsch, in this paper, he defines the universal quantum Turing machine.
• 1:07:29
  And that establishes the kind of quantum circuit model that we see today.
• 1:07:33
  When we look at quantum algorithms and you have these blocks, we're going to see some of these later on.
• 1:07:39
  The logic operations are now represented by unitary matrices, the kinds of Toffoli gates and things like that that we were talking about earlier.
• 1:07:47
  These are reversible logic gates.
• 1:07:50
  And...
• 1:07:52
  They can act on a register of quantum bits or qubits.
• 1:07:56
  So this is where he's establishing, you know, I've got a bit.
• 1:07:59
  The computer is made out of a bunch of quantum bits.
• 1:08:02
  I act on these bits with unitary matrices, unitary transformations, and I can start computing things.
• 1:08:09
  Is this the first building the bridge from this theory and the software of the algorithm to now how that interacts with the substrate of a hardware?
• 1:08:17
  Yeah.
• 1:08:18
  Yeah, in some sense, it's more like it's taking the building blocks that people had made earlier with the gates and things like that.
• 1:08:25
  And Feynman saying that, you know, you've got these two state systems.
• 1:08:29
  He's like, I can now build a Turing machine that'll do stuff for me.
• 1:08:34
  The framework of how you would be able to make this actually productive.
• 1:08:37
  Yes, exactly.
• 1:08:38
  These concepts of productive systems.
• 1:08:39
  Yeah, yeah, exactly.
• 1:08:40
  And side note, Deutsche's academic pursuit is driven by a commitment to the many worlds interpretation of quantum mechanics.
• 1:08:49
  He is fanatical about this interpretation.
• 1:08:51
  He thinks this is the only way to go.
• 1:08:53
  And, you know...
• 1:08:54
  There's a lot of people that are very smart out there that are saying this is the only way to go.
• 1:08:58
  During his Oxford studies as a graduate student, he met Bryce DeWitt, who's a very famous theoretical physicist who was a collaborator of John Wheeler at Princeton.
• 1:09:09
  I think DeWitt was actually at the Institute for Advanced Studies, so he was not at Princeton at the time.
• 1:09:14
  But he and Wheeler used to talk a lot.
• 1:09:15
  And Wheeler was the Ph.D. advisor of Hugh Everett, who's the guy behind the Everett theory.
• 1:09:23
  hypothesis of many worlds, right?
• 1:09:26
  Everett went on to do RAND and national security apparatus type stuff because he got basically shot down by Niels Bohr when he went and visited Copenhagen.
• 1:09:39
  But
• 1:09:40
  Wheeler kept the idea alive of Everettian mechanics.
• 1:09:45
  Bryce DeWitt did a few things with Wheeler about that many worlds interpretation.
• 1:09:51
  And they met at a pizza parlor in London, Deutsch and DeWitt.
• 1:09:56
  And that's when Deutsch got into this many worlds interpretation.
• 1:09:59
  And he got really into it.
• 1:10:01
  And in Deutsch's view, when a quantum computer processes
• 1:10:04
  like these computational states simultaneously, what it's actually doing, this is Deutsch's interpretation, is that the calculations are executed across all of the different branches of your many worlds wave function
• 1:10:21
  In this like multiverse.
• 1:10:23
  And then they recombine with quantum interference when we like make an observation.
• 1:10:27
  It's a form of interdimensional travel.
• 1:10:30
  Yeah.
• 1:10:30
  Effectively.
• 1:10:31
  Effectively in some sense.
• 1:10:32
  And using the cinematic parlance that people think about.
• 1:10:36
  It's we're going.
• 1:10:38
  Yeah, we're like computing in multiple universes and then we're bringing it all together.
• 1:10:42
  All together.
• 1:10:43
  Yeah.
• 1:10:43
  And we're using the extra compute of these other universes or extra whatever.
• 1:10:47
  Yeah.
• 1:10:48
  Whatever.
• 1:10:48
  Yeah, yeah, yeah.
• 1:10:49
  That's what he thinks.
• 1:10:49
  And then, you know, that's how we can do it where it seems like, ah, it's so funny because this is like, obviously, Evredian ideology, as I like to call it, is one of the abuses –
• 1:11:09
  in uh entertainment yeah that is where quantum and then multi many worlds excuse me get kind of conflated and then spins out of control yeah yeah because with many worlds like i mean you could just say anything right if you're if you're in hollywood you just yeah uh multiverse right
• 1:11:29
  And this is Marvel has got themselves in a problem right now because, because of all the stuff that they've done and they've basically said, well, no, Iron Man only died in this universe, but not in the many other universes.
• 1:11:42
  Dude, Robert Downey Jr.
• 1:11:43
  I think you made enough money, right?
• 1:11:46
  Anyways, the reason why I bring this up is because Hartmut Nevin, who is at Google quantum AI, I think he's one of the heads there.
• 1:11:53
  He, he,
• 1:11:55
  wrote a blog post about Google's Willow Chip.
• 1:11:58
  Google's Willow Chip is this latest of Google's quantum computing platforms where the performance there...
• 1:12:07
  on this benchmark was astonishing, right?
• 1:12:09
  And so what Hartman Nevin wrote is that it performed a computation in under five minutes that would take today's supercomputers 10 septillion years.
• 1:12:20
  Okay, if you want to write it out, that's 10 with, I don't know, I'm not going to count however many zeros there are, right?
• 1:12:26
  But crucially, he said, this mind-boggling number exceeds known timescales in physics and vastly exceeds the age of the universe—
• 1:12:34
  It lends credence to the notion that quantum computation occurs in many parallel universes in line with the idea that we live in a multiverse, a prediction first made by David Deutsch.
• 1:12:43
  And if you go back to that overlay, the media took over, right?
• 1:12:49
  And they're like, Google says it appears to have accessed quantum.
• 1:12:52
  parallel universes i remember when this came out and people were texting me because i'm like you know they're the only physicist you're the quantum guy yeah yeah yeah and they're like they're like dude we live in a multiverse i'm like no no we don't okay i mean maybe shit i don't know but
• 1:13:09
  I don't think this proves that we live in a multiverse.
• 1:13:13
  It's just funny that one of the heads of Google Quantum AI is also on this hype train, right?
• 1:13:18
  So he said that this is proof of that.
• 1:13:21
  I don't think so.
• 1:13:22
  There's a lot of people out there that don't think so.
• 1:13:24
  The Copenhagen interpretation could be just as valid.
• 1:13:27
  I mean, it's all just like philosophy at this point, right?
• 1:13:30
  About which one is...
• 1:13:31
  I don't know if there's a way to tell if we're in a multiverse or if we're just... Copenhagen is just the way it is and the universe just...
• 1:13:39
  is weird unless the aliens come from the other universe and they figure out a way yeah yeah and then they come and tell us and they like if an alien came and told us that i i'm from the other okay all right i'm from timeline two yeah it's like okay yeah like i'm from earth but like we look different it's okay cool i'm just saying you know like so all right so david deutsch
• 1:14:02
  He wants to prove that a quantum computer could perform tasks faster than any classical machine.
• 1:14:08
  Because so far, Feynman has said this in his talk.
• 1:14:14
  He said, I mean, clearly, we can't store this many states.
• 1:14:19
  But Deutsch wants to design a quantum algorithm that really shows this.
• 1:14:23
  And he designs the first quantum algorithm in 1985, and it's expanded alongside with Richard Joza in 1992.
• 1:14:29
  Okay.
• 1:14:31
  This is the paper that comes out.
• 1:14:33
  Again, Proceedings of Royal Society.
• 1:14:36
  It's a simple enough problem that I think I could describe it in enough detail on this podcast and not lose some of the essence of what's going on in the quantum solution.
• 1:14:46
  Okay?
• 1:14:46
  And I'm going to go ahead and give you the punchline.
• 1:14:48
  Okay.
• 1:14:48
  It's a toy problem, but it's one where a classical computer would take...
• 1:14:53
  exponentially an amount of time to get to an answer with respect to the size of the input, but a quantum computer can one shot it.
• 1:15:02
  Okay.
• 1:15:03
  So we're going from exponential to one shot.
• 1:15:05
  One shot.
• 1:15:06
  Okay.
• 1:15:06
  Using a quantum algorithm.
• 1:15:08
  Here's the problem.
• 1:15:09
  Okay.
• 1:15:10
  So you're given a black box function and this black box function is going to take inputs of N digit binary numbers.
• 1:15:20
  Okay.
• 1:15:21
  and give back a single digit, either a zero or a one.
• 1:15:25
  So if n is like two, it can give, it takes in as input, you know, either zero zero zero one one zero one one, and it spits out either a zero or a one.
• 1:15:35
  Now in essence, this could be any n digit binary number.
• 1:15:37
  n could be very large.
• 1:15:38
  So n could be like that giant matrix of zeros and ones that goes into this black box function.
• 1:15:43
  I don't know how this black box function works.
• 1:15:46
  Okay, it's a black box.
• 1:15:48
  I stick an input and I get an output of either 0 or 1.
• 1:15:51
  This is similar to the AND gate we talked about at the beginning in terms of you have two, then you only have one input on the other side.
• 1:15:58
  So it's not reversible.
• 1:16:00
  Yes.
• 1:16:00
  Yeah, this is not reversible.
• 1:16:01
  Yes, very good.
• 1:16:02
  And an AND gate would be like 0, 0 goes to 0, 0, 1 goes to 0, 0, 1.
• 1:16:07
  But this is even worse because it only goes to one answer.
• 1:16:09
  Yeah, it only goes to one answer.
• 1:16:11
  And no matter how big the thing is.
• 1:16:14
  And I don't know if it's an AND gate.
• 1:16:16
  Right.
• 1:16:17
  It's a black box.
• 1:16:18
  I don't know what it's doing in there.
• 1:16:20
  That's the point.
• 1:16:21
  The black box replaces this concept of an and gate in terms of being able to be well defined.
• 1:16:26
  Yeah.
• 1:16:26
  And gate, I know exactly what the truth table is.
• 1:16:28
  Here, I don't know what the truth table is.
• 1:16:30
  Right?
• 1:16:31
  So I want to make it simple.
• 1:16:33
  So let's just consider n equals 2.
• 1:16:35
  Okay.
• 1:16:35
  As I was saying, right?
• 1:16:36
  Yep.
• 1:16:36
  So in n equals 2.
• 1:16:38
  We'll go to the next overlay.
• 1:16:40
  So at n equals 2, there's four different numbers that I can feed in.
• 1:16:43
  I can either feed in 00, 01, 10, or 11.
• 1:16:48
  Those are going to go in one at a time into this black box, and that black box is going to make an output, and it's going to tell me, hey, if you give me this input, the output is either 0 or 1, depending on whatever I gave as input.
• 1:17:01
  I'm given another promise.
• 1:17:03
  I'm given a promise that this function is either constant or it's balanced.
• 1:17:08
  What do I mean by that?
• 1:17:09
  So it's either a constant function in the sense that no matter what the input is, my output is always going to be 0 or it's always going to be 1.
• 1:17:19
  There's only two such functions, right?
• 1:17:20
  It's either all 1s, so no matter what my input is, it's going to give out a 1.
• 1:17:25
  No matter what my input is, it's going to give out a 0, right?
• 1:17:28
  It's one of these two.
• 1:17:30
  Or it is balanced.
• 1:17:32
  A balanced function means that exactly half of the inputs map to zero and exactly half of the inputs map to one.
• 1:17:39
  There's several, not several, there's only six examples for a two-bit input.
• 1:17:47
  Because, you know, it's four choose two is going to give you six.
• 1:17:51
  Two of these I've described over here.
• 1:17:52
  The first one I think is like first bit only.
• 1:17:55
  Basically, whatever the first bit is,
• 1:17:58
  That's what it's going to output.
• 1:17:59
  So for 0, 0, the first bit is 0.
• 1:18:02
  This black box is going to output 0.
• 1:18:04
  For 0, 1, it's going to output 0.
• 1:18:05
  For 1, 0, the first bit is now 1.
• 1:18:07
  So it's going to output 1.
• 1:18:09
  For 1, 1, it's going to output 1.
• 1:18:11
  Notice there's two 0s that come out and there's two 1s that come out out of the 4.
• 1:18:15
  Because the first input...
• 1:18:17
  is whatever the thing is.
• 1:18:18
  And the function doesn't even look at what the second input is.
• 1:18:21
  It's just like, oh, the first one is zero.
• 1:18:22
  I'm just going to spit that out.
• 1:18:24
  So that's one version of a balanced function.
• 1:18:26
  Another version of a balanced function is an XOR, exclusive OR, meaning the bits are different.
• 1:18:32
  So if the bits are different, I'm going to output a 1.
• 1:18:34
  If the bits are the same, I'm going to output a 0.
• 1:18:36
  Notice if it's 0, 0, I output a 0 because they're the same.
• 1:18:40
  If it's 1, 1, I output a 0 because they're the same.
• 1:18:43
  If it's 0, 1 or 1, 0, I output a 1.
• 1:18:45
  Okay?
• 1:18:45
  So again, this is balanced because there's two 0s and two 1s.
• 1:18:48
  There's six such functions.
• 1:18:50
  I've only shown you two.
• 1:18:51
  Got it.
• 1:18:52
  Okay.
• 1:18:52
  So these are two examples.
• 1:18:53
  These are two examples.
• 1:18:54
  And here there's like a systematic rule, but imagine for like N digits, you don't need a systematic rule.
• 1:19:00
  There could just be whoever designed the black box chose half of the inputs at random and be like these guys mapped to zero and half of the inputs these guys mapped to one.
• 1:19:08
  Okay.
• 1:19:09
  And it has its own basically mapping key that is whatever.
• 1:19:12
  Yes, there's a map.
• 1:19:13
  Exactly.
• 1:19:13
  There's a mapping key that we don't know.
• 1:19:15
  Okay.
• 1:19:16
  That's the point.
• 1:19:17
  Your job is to figure out who am I?
• 1:19:21
  Am I balanced or am I constant?
• 1:19:23
  I gave you two choices, right?
• 1:19:25
  I'm either balanced or I'm constant.
• 1:19:28
  And I give you this black box to play with where all you can do is put in stuff and you get out an answer.
• 1:19:35
  The question is how many queries, how many times do I need to press play on the black box with whatever input I give it to determine if it's balanced or constant?
• 1:19:45
  That's the idea.
• 1:19:46
  That's the problem.
• 1:19:47
  So how would I do it classically?
• 1:19:49
  Yep.
• 1:19:50
  If I want to do it classically, it's actually...
• 1:19:53
  I mean, there's only one choice that I have, right?
• 1:19:56
  It's like I feed in a number, I get an output, I use my logical brain to figure out what it is.
• 1:20:04
  Classically, what I do first is I just test 0, 0, and suppose I get a 0.
• 1:20:10
  And I test 0, 1, and suppose I get a 0.
• 1:20:13
  I cannot claim that it's balanced or constant because it could be both, right?
• 1:20:18
  It could be that the first two go to 0 and the next two go to 1, and I've only checked the first two.
• 1:20:24
  Or it could be that all of them go to 0.
• 1:20:26
  So I need to check that third one.
• 1:20:30
  At this point after two, there are arguments that it could be constant or it could be balanced.
• 1:20:37
  Because you've not yet had enough data to rule out one or the other.
• 1:20:43
  Exactly.
• 1:20:43
  So I need to do that third query to check.
• 1:20:47
  I need to check one zero.
• 1:20:49
  And if one zero comes out as zero, then I know that it's constant, right?
• 1:20:54
  Because I only have those two choices.
• 1:20:56
  And I've already queried three, and they're all the same, so it has to be constant.
• 1:20:59
  On the other hand, if the third one comes out to be one, then I know that it's balanced, because I know that the other guy is also going to be one.
• 1:21:06
  I don't need to check the other guy, right?
• 1:21:08
  Now, you could say, well, what if...
• 1:21:10
  You know, in the case that it's balanced and the first and the third inputs go to zero and the second and the fourth go to one, right?
• 1:21:20
  Worst case scenario, what if I randomly picked the other stuff and I could choose, right?
• 1:21:26
  Well...
• 1:21:27
  In the worst case scenario, the guy who's designing the black box knows exactly how you're going to check the first few inputs, right?
• 1:21:36
  And so if you're trying to just get – like the best case scenario is I just pick two and I get lucky.
• 1:21:44
  One of them is zero and one of them is one.
• 1:21:46
  And then I'm like, oh, it has to be balanced because it's definitely not constant, right?
• 1:21:50
  And so I'm done.
• 1:21:51
  But the guy who's building the black box could know exactly your schema of which bits, which bit string you're going to test.
• 1:21:58
  To make it maximally difficult for you to find the answer.
• 1:22:01
  Yeah.
• 1:22:01
  So worst case scenario, you always have to do exactly half plus one.
• 1:22:06
  Yeah.
• 1:22:06
  Right?
• 1:22:07
  Yeah.
• 1:22:07
  Okay.
• 1:22:07
  I get what you're saying.
• 1:22:08
  Okay.
• 1:22:08
  So I have to do three in this case where there's four bit strings.
• 1:22:15
  Okay.
• 1:22:15
  How would I do this with quantum mechanics?
• 1:22:20
  With quantum mechanics, what Deutsch-Joseph came up with is they said, actually, we could pass a superposition of all four versions.
• 1:22:29
  Remember, in Bell's theorem, right, all four versions are not together, right?
• 1:22:34
  Like, or sorry, cannot be separated.
• 1:22:37
  So I could create a superposition of all of the four states.
• 1:22:40
  I could create a superposition of 0, 0, 0, 1, 1, 0, and 1, 1.
• 1:22:46
  And I pass that.
• 1:22:48
  entire thing through the black box.
• 1:22:51
  Now, I can't separate these out, and the black box is going to have to interact with the whole thing, right?
• 1:22:56
  And now, this black box function, what is it going to do to the superposition?
• 1:23:00
  It is going to act on it with that black box function.
• 1:23:03
  There's going to be some quantum version of the black box function.
• 1:23:07
  That's, again, this is a theory gimmick where it's like, oh, there's a way to just make it quantum mechanical, right?
• 1:23:13
  It's like an oracle is what they call it.
• 1:23:17
  So when we do that, what I'm going to do is implement this black box function in such a way that whenever...
• 1:23:24
  the input goes to 0, I'm going to leave it alone.
• 1:23:29
  But if the input goes to 1, I am going to introduce a negative sign in front of that qubit.
• 1:23:36
  Like I'm going to attach a negative 1 as the amplitude in front of that qubit.
• 1:23:42
  So what happens here?
• 1:23:45
  If it is balanced, all of them are going to have the same sign.
• 1:23:53
  Right?
• 1:23:54
  And maybe we go to the next... Because that'll show it.
• 1:23:58
  Yes.
• 1:23:58
  So if it's constant, everything is going to be the same.
• 1:24:01
  Right?
• 1:24:01
  Because it's going to be plus, plus, plus, plus, and minus, minus, minus, minus, depending on whether it's a zero or a one that it gets mapped to.
• 1:24:07
  If it's balanced...
• 1:24:08
  This is going to be... Then two are going to be plus and two are going to be minus.
• 1:24:11
  Yeah.
• 1:24:11
  And they're going to interfere with each other.
• 1:24:13
  And this is where the interference comes in.
• 1:24:15
  Right?
• 1:24:16
  So if it's constant, I'm going to get constructive interference.
• 1:24:20
  Yeah.
• 1:24:20
  Yeah.
• 1:24:21
  And if it is balanced, I'm going to get destructive interference.
• 1:24:24
  Because they cancel out.
• 1:24:25
  Yeah.
• 1:24:25
  Because they're different.
• 1:24:28
  And this is the key to almost every single, actually every single quantum algorithm.
• 1:24:34
  Every single quantum algorithm uses this idea of constructive and destructive interference to do the computation.
• 1:24:41
  So now you've one-shotted it.
• 1:24:44
  This is basically your 0 or 1 now.
• 1:24:46
  Yeah.
• 1:24:47
  And if you get constructive interference, I know that it's balanced.
• 1:24:52
  And if I get destructive interference, no, if I get constructive interference, I know that it's constant.
• 1:24:58
  And if I get destructive interference, I know that it's balanced because everything interfered.
• 1:25:05
  And so is the idea that, you know, because effectively what we're saying is the black box is a quantum system.
• 1:25:11
  Because we can't really know.
• 1:25:13
  Yeah, the black box is us implementing the function as a quantum algorithm.
• 1:25:18
  Right.
• 1:25:18
  Okay.
• 1:25:19
  And we ultimately want to make...
• 1:25:22
  the black box, which we may not really know what's happening inside it, but we still need to have some level of deterministic output from it to make it functional as a computing system.
• 1:25:34
  Yeah, and the point here is because we know this constraint of it's either balanced or constant.
• 1:25:41
  Yes.
• 1:25:41
  Yes.
• 1:25:42
  We can now implement this black box and say that it's only going to flip the phase.
• 1:25:47
  This is called phase flipping of those places where the output is one.
• 1:25:51
  And that's why we're going to get that constructive and destructive interference.
• 1:25:55
  Now, I want to connect this to a physical reality.
• 1:25:57
  Okay.
• 1:25:57
  Okay.
• 1:25:58
  Because it's a bit weird, right?
• 1:26:01
  So let's just talk about to really understand why the quantum mechanics lets us do this.
• 1:26:06
  Let's consider just a quantum interference experiment, okay?
• 1:26:09
  And I want to take the double-slit experiment, which we've discussed a lot in this podcast, and I want to try to create a version of the double-slit experiment that computes my Deutsch-Joseph problem, okay?
• 1:26:25
  Now, to introduce the double-slit experiment, you've got a laser with coherent light.
• 1:26:31
  That light falls on two slits,
• 1:26:34
  that two slits meaning there's like a wall with two holes in it the light goes through it interferes with the wall so the wall doesn't let it through except for those two holes and those two holes then let the light through the light from one hole is going to interfere with the light in the other hole and if i were to cover up just one of the holes then i would get
• 1:26:55
  a lump of P1 or P2, that's the first sort of two Gaussians that I see.
• 1:27:00
  But if I don't cover either one and I let the light go through both, then I get this interference pattern, right?
• 1:27:08
  Where in the middle, you're going to get a really bright spot because the light from one hole and the light from the other hole are sort of constructively interfering.
• 1:27:17
  And right around there, I'm going to get destructive interference because the light from one hole is coinciding with the trough of the wave of another hole.
• 1:27:25
  And I'm going to get destructive interference.
• 1:27:27
  Which is at the boundary of the dark pink and the light pink.
• 1:27:29
  Yeah.
• 1:27:30
  In this visual here.
• 1:27:31
  Yeah, yeah, yeah.
• 1:27:31
  Yeah.
• 1:27:32
  Okay.
• 1:27:32
  Yeah.
• 1:27:33
  So this is how the double slit experiment works for like light waves and things like that.
• 1:27:38
  Now, crucially, it's been shown that single particles also do this, right?
• 1:27:42
  I can make the light dim down to the point when only a single photon is going through, and the single photon, the wave function goes through both, and it interferes with itself to create single photon-like interference on my detector, right?
• 1:27:57
  So, Feynman took a look at this, and he had a different way of explaining it.
• 1:28:04
  Feynman had this idea of...
• 1:28:07
  the path formulation, sum over all paths of quantum mechanics.
• 1:28:12
  And he explained all of quantum mechanics using the sum over paths.
• 1:28:16
  He didn't like the wave function analogy.
• 1:28:18
  He came up with his own.
• 1:28:20
  And it turns out that it's really good because it has applications to quantum field theory.
• 1:28:25
  And if you know about Feynman diagrams, that's all the sum over paths stuff.
• 1:28:29
  Okay, so here's how he explained it.
• 1:28:31
  This is directly from one of his Feynman lectures of physics.
• 1:28:36
  I've added the red lines and things like that.
• 1:28:39
  So on the left, I've got an electron gun.
• 1:28:42
  Again, I've got those two holes, and I've got a detector on that side.
• 1:28:46
  Here's what he says.
• 1:28:47
  He says, if I've got an electron gun, right, that's spitting out electrons, even if it's a single electron at a time, the electron is going to go... And suppose I put my detector at that bottom spot over there, okay?
• 1:29:01
  The only thing I can do is calculate the probability that the detector is going to register an electron there.
• 1:29:07
  And what I want to do is calculate what is that probability.
• 1:29:10
  What's the probability that I'm going to see an electron here or here or here or anywhere else?
• 1:29:14
  He said the electron is going to go through all of the paths.
• 1:29:19
  And the way we're going to keep track of what the electron is doing is I'm going to assign...
• 1:29:25
  I'm going to assign an arrow to that electron.
• 1:29:28
  Okay?
• 1:29:28
  The electron is going to start out from the gun with the arrow pointing to the right.
• 1:29:33
  And as it moves along in the universe, the arrow is going to spin around like a clock.
• 1:29:39
  And the frequency of that spinning has to do with the frequency of the electron's wave function.
• 1:29:43
  For example, if this was a particle of light, the frequency would literally be the frequency of the light.
• 1:29:49
  Okay?
• 1:29:50
  But now imagine, I've got this electron that starts out with an arrow pointed to the right, and it's spinning and it's spinning.
• 1:29:57
  It goes to the first slit at the top, slit number one, and it goes down to where the detector is at the bottom.
• 1:30:03
  Okay?
• 1:30:04
  As it's spinning, it's going to end up at the detector and the clock is going to be at a certain location on the 0 to 12.
• 1:30:14
  It's going to be pointing in a certain direction.
• 1:30:16
  And it spins.
• 1:30:17
  Yeah, and it spins because it traveled for some amount of time.
• 1:30:20
  And during that time, it made some amount of rotations based on its frequency.
• 1:30:25
  Okay.
• 1:30:26
  Now what about the second path?
• 1:30:28
  The electron is going to go through every single path.
• 1:30:30
  So if we look at what's going to happen at the second path, there's another path that the electron can take, let's say the blue path.
• 1:30:39
  And the electron is going to spin again.
• 1:30:40
  It's going to start out at the same part.
• 1:30:42
  It's going to spin, and it's going to get to...
• 1:30:45
  That same point, but it's going to be pointing in a different direction because the path length is different, which means the time is going to be different, which means the amount of time that it's been spinning is different.
• 1:30:54
  So it's going to end up pointing in a different direction.
• 1:30:58
  So he said, if we were to now calculate what is the probability of finding...
• 1:31:04
  an electron there.
• 1:31:05
  All I have to do is add up the two arrows.
• 1:31:08
  So I add up the blue arrow and the red arrow, these two vectors.
• 1:31:11
  I get a resultant arrow, which is the black thing.
• 1:31:14
  And then I take the, the, the area of the circle that, that black arrow creates.
• 1:31:19
  Um,
• 1:31:20
  This is his version of Born's rule, which is that the square of the amplitude of the wave function tells you the probability.
• 1:31:27
  He's saying, oh, just take an area of a circle.
• 1:31:30
  He was a wizard with like creating mental models.
• 1:31:33
  And this was his way of doing it.
• 1:31:35
  So the area of that circle tells you the probability.
• 1:31:37
  Right.
• 1:31:37
  Okay?
• 1:31:38
  Yes.
• 1:31:38
  And that's the probability for that spot down there.
• 1:31:41
  Mm-hmm.
• 1:31:42
  And you could do this same thing for every spot along the detector.
• 1:31:46
  Very good.
• 1:31:46
  So now let's talk about what is the probability in the very middle?
• 1:31:51
  Where in the very middle, the two paths are exactly equal.
• 1:31:55
  And so the arrows for the two paths are going to point in the same direction, which is why the area of the circle is going to be way bigger.
• 1:32:05
  And so now if you go to the next slide, you'll actually see that this corresponds to that interference pattern that we saw.
• 1:32:12
  Right.
• 1:32:12
  Right?
• 1:32:13
  Right.
• 1:32:13
  Where in the middle you have constructive interference because the two arrows are pointing in the same direction.
• 1:32:19
  Having a larger area of probability.
• 1:32:20
  Yeah.
• 1:32:21
  But where the troughs are, where there's zero probability, that's because the timing there is just right where the arrows are opposite.
• 1:32:30
  Mm-hmm.
• 1:32:32
  Right?
• 1:32:33
  The angles of their rotation at that particular spot happen to be effectively in opposite direction.
• 1:32:39
  In opposite direction.
• 1:32:39
  Which creates that thin line of demarcation where it's destructive.
• 1:32:44
  Exactly.
• 1:32:45
  And normally with undergrad physics, we think about like it's half a wavelength away.
• 1:32:50
  But half a wavelength means that the clock has turned exactly 180 degrees and not 360 degrees.
• 1:32:55
  And so this is his way of saying half a wavelength is really my arrow is pointing in the opposite direction.
• 1:33:01
  That's interesting.
• 1:33:02
  It's a different visual metaphor to explain the same idea.
• 1:33:06
  Yes, but it's the same math, right?
• 1:33:08
  And crucially here, what I want to point out is it doesn't matter which way the arrows point at the end.
• 1:33:15
  Okay.
• 1:33:16
  How do you mean?
• 1:33:16
  What I mean is even if the top arrow, both of the arrows pointed in the opposite direction, the area of the circle would be the same.
• 1:33:23
  The probability would still be the same.
• 1:33:25
  You're saying so currently we're looking at both of the arrows pointing slightly, let's say, like northwest.
• 1:33:29
  Sorry, excuse me, northeast.
• 1:33:30
  If we flipped both of them 180 degrees, it doesn't impact the probability.
• 1:33:36
  Yes, exactly.
• 1:33:37
  It's the exact same.
• 1:33:37
  What only matters is the relative between the angle between the two arrows.
• 1:33:42
  As long as the two add up, the circle remains the same.
• 1:33:48
  That's a little bit of a key here.
• 1:33:50
  The probability space is the same independent of the direction of spin in this construction.
• 1:33:57
  Yeah.
• 1:33:58
  Yeah.
• 1:33:59
  And independent of the direction of like which way the phase ends up.
• 1:34:03
  Right, right, right.
• 1:34:04
  Which way the phase ends up.
• 1:34:05
  The spin is a loaded word.
• 1:34:07
  It's a loaded word.
• 1:34:08
  Okay, no, that's fair.
• 1:34:09
  I want to be which way the phase ends up.
• 1:34:11
  Yeah, understood.
• 1:34:11
  Yeah.
• 1:34:12
  Okay, so...
• 1:34:15
  Yeah, that's the crucial thing to realize is the direction of the arrows don't matter.
• 1:34:18
  It's only the relative directions relative to one another.
• 1:34:21
  And so part of this is we started this conversation here because we were talking about this algorithm –
• 1:34:31
  Where we were putting in the 0010111, right?
• 1:34:36
  And we talked about this idea that it's a superposition state.
• 1:34:42
  And so we have to put it – when we're talking about it as a quantum Turing machine, a quantum algorithm, we can't factor it like we would in a classical system.
• 1:34:52
  And so we are able to basically have it either be balanced –
• 1:34:56
  or constant, which gives us effectively this ability to have a zero or one in a quantum system.
• 1:35:02
  That's what we talked about previously, just from a basic, from a math perspective.
• 1:35:09
  The reason we brought up the double slit and this Feynman diagram concept is it's representing the same concept.
• 1:35:18
  It is.
• 1:35:19
  Go ahead.
• 1:35:20
  In the sense that those arrows...
• 1:35:22
  Yes.
• 1:35:22
  Yes.
• 1:35:24
  Those arrows represent the complex number that is in front of those states.
• 1:35:30
  Right.
• 1:35:30
  You know when I said like the 0, 0, the 0, 1, and like I put a minus 1?
• 1:35:35
  That's what it represents.
• 1:35:36
  So let's actually make a... Oh, sorry.
• 1:35:38
  Go ahead.
• 1:35:38
  No, go ahead.
• 1:35:39
  Actually, yeah, no.
• 1:35:40
  So I'm actually going to make a direct...
• 1:35:43
  Okay.
• 1:35:43
  Comparison between our Deutsch-Joseph algorithm and that quantum experiment.
• 1:35:47
  Perfect.
• 1:35:47
  And I think you'll see the reason why I sort of did that.
• 1:35:51
  So actually, let's go.
• 1:35:52
  So yeah, this is, yeah.
• 1:35:53
  So if we want to review, this is the Deutsch-Joseph algorithm, right?
• 1:35:56
  Yes.
• 1:35:56
  You've got the 0, 0, 0, 0, 1, 1, 0, 1, 1, right?
• 1:36:00
  It starts out with just a 1 in front of everything.
• 1:36:03
  So it starts out with the arrows pointing to the right.
• 1:36:06
  Okay?
• 1:36:06
  And now it's going to go through the quantum apparatus and...
• 1:36:09
  And the amplitudes are going to start rotating.
• 1:36:13
  And what we want to do is have them interfere at the end.
• 1:36:15
  So now, let's consider instead of two slits, four slits.
• 1:36:22
  You see where this is going?
• 1:36:24
  Yeah?
• 1:36:25
  Our slits are the function in some sense, right?
• 1:36:29
  And we've created a superposition.
• 1:36:32
  Each of the superpositions is represented by the four holes, okay?
• 1:36:36
  And I've got an electron gun.
• 1:36:38
  This is, I think, how Feynman might have, like, if he was around to do science communication now, maybe this is how he would have done it, right?
• 1:36:47
  So...
• 1:36:48
  I've got my four holes, and those four holes represent the four binary digits that can go through.
• 1:36:55
  Okay?
• 1:36:56
  Now, let's see what happens.
• 1:36:58
  The function itself is going to be implemented by some kind of crystal that I'm going to put in those holes.
• 1:37:05
  Okay?
• 1:37:05
  Okay.
• 1:37:08
  And depending on where the crystals are, that's going to tell me which output goes to 1 and which output goes to 0.
• 1:37:14
  It's the idea that the crystal refracts the light.
• 1:37:16
  Yeah, yeah.
• 1:37:17
  No, what it's going to do is flip.
• 1:37:18
  Flip.
• 1:37:19
  Got it.
• 1:37:19
  Okay?
• 1:37:19
  Whatever direction the arrow came in into that hole, it's just going to add a pi pulse.
• 1:37:26
  It's going to add 180 degrees.
• 1:37:27
  So in this case, this particular function, this iteration of the function, maps the first and the last function.
• 1:37:34
  0, 0, and 1, 1 into 0, and 0, 1, and 1, 0 into 1.
• 1:37:40
  So this is the XOR function that I'm looking at right now.
• 1:37:43
  Got it.
• 1:37:43
  The XOR function would have the two crystals that are doing the, I don't know, whatever type of crystal it is, but the two crystals are going to be in the second and the third slits because those are the ones that are getting mapped to 1, okay?
• 1:37:54
  In this case, this is a balanced function, right?
• 1:37:57
  And so that's where I would, but the point is,
• 1:38:00
  Somebody put the slits there with the holes and put, we don't know where the holes are.
• 1:38:04
  In this case, we do, right?
• 1:38:06
  But now let's go to the next one.
• 1:38:09
  Now, suppose that it is a constant, meaning either there's no crystals in either of the folds or there's crystals in all four of them.
• 1:38:20
  Right.
• 1:38:20
  Okay?
• 1:38:21
  In that case, what would happen?
• 1:38:22
  If there's nothing, then they would all take the red line and all four of the arrows would point in the same direction.
• 1:38:30
  Mm-hmm.
• 1:38:31
  because they're all constructively interfering.
• 1:38:33
  This would be four pluses.
• 1:38:34
  Yeah, this would be four pluses, and the resulting arrow would be really long.
• 1:38:38
  On the other hand, if there's four crystals, then I'm going to add a 180, and so no matter where I ended up before, I have the 180 added by the crystal, and so they're all going to be pointing in the opposite direction.
• 1:38:52
  The phase is going to be pointing in the opposite direction, but the circle that I make is going to be the same.
• 1:38:57
  The area of probability is going to be the same.
• 1:38:59
  Right?
• 1:38:59
  So I will still detect a particle.
• 1:39:02
  This is fascinating.
• 1:39:03
  Again, in this constant function, whether either no crystals or all four crystals, our arrow length…
• 1:39:14
  is the same but in opposite directions.
• 1:39:16
  Yes.
• 1:39:16
  But it doesn't matter in the context of the probabilities.
• 1:39:19
  Yes.
• 1:39:20
  Because in the Feynman construction, the area of the circle will be identical.
• 1:39:27
  The phase direction is irrelevant in that context.
• 1:39:30
  Yes, because the detector only cares about what is the area of the circle.
• 1:39:33
  Yeah.
• 1:39:34
  Right?
• 1:39:34
  Yeah, yeah, yeah.
• 1:39:34
  And so the detector is still going to register a bunch of electrons coming through.
• 1:39:38
  Mm-hmm.
• 1:39:38
  or a bunch of photons or whatever the thing and the idea is that because when it's constructive which is that center point which is a higher probability constructive interference that's why the area is so large and then when you get further to the
• 1:39:56
  past the other side of these there's like a line of deconstructive interference yeah and then well i mean if i were to move the detector somewhere or the other then one of the path lengths will be different from the others right and so some of the arrows will be pointing this way but the other one that came here and traveled farther is going to like travel more and start like pointing in the other direction here in this case it's like it's like those two traveled at exactly the right amount to be
• 1:40:22
  to be pointed in the same direction, right?
• 1:40:24
  Now, so this is for a constant function.
• 1:40:26
  Now let's look at what a balanced function would do.
• 1:40:28
  Like the XOR.
• 1:40:30
  In the XOR, the top two are going to have arrows pointing in one direction, but because the middle two have the crystals, they're going to add a phase factor, and so they're going to have arrows pointing in the opposite direction.
• 1:40:42
  And so I'm going to get destructive interference in the middle, where I once had constructive, if there was all crystals or no crystals.
• 1:40:48
  Yes.
• 1:40:49
  Right?
• 1:40:50
  So if I put a detector in the middle there,
• 1:40:54
  And all I do is have a one-shot.
• 1:40:56
  I do a one-shot, and I see, do I see a particle or not?
• 1:41:02
  Right?
• 1:41:04
  That'll tell me exactly what the crystal can, like, what type of filter...
• 1:41:10
  the person is put is it a balanced filter with only two or is it a or is it a um a constant crucially it doesn't matter where i put these crystals as long as there's two yeah right as long as there's two two of the green arrows are gonna two of the arrows are gonna be pointing in the opposite direction because i've made that sign flip because the phase again doesn't matter
• 1:41:34
  Yeah.
• 1:41:35
  Like, if I were to put the crystal on the top one, then one of the bottom arrows, one of the bottom red arrows would flip.
• 1:41:42
  Yeah, yeah.
• 1:41:42
  And one of the top green arrows would flip.
• 1:41:44
  But at the end of the day, the sum of the two would still be zero.
• 1:41:47
  Yeah, yeah.
• 1:41:48
  This is so good.
• 1:41:49
  And this is so good because it goes back to what it makes me think of again, and correct me if I'm thinking about it, this gives this idea of that reversible function concept we talked about at the beginning.
• 1:42:02
  Right.
• 1:42:02
  Right.
• 1:42:03
  Like we're able to take the result, the arrows on the right, and then look back to construct what the crystal construction was in the middle because we are able to look at the – or am I mixing metaphors there?
• 1:42:16
  I think you're mixing metaphors there.
• 1:42:17
  I'm mixing metaphors there.
• 1:42:18
  Yeah, yeah, yeah.
• 1:42:19
  Yeah.
• 1:42:20
  The reversible part of stuff is happening like –
• 1:42:24
  When we implement the function itself, like the reversible part is happening.
• 1:42:28
  And that's when we have to get into the weeds about like how we actually implement this like function in a quantum computer.
• 1:42:35
  We can plus.
• 1:42:36
  Yeah, we need like an ancillary bit.
• 1:42:40
  I think it's called an ancilla bit.
• 1:42:42
  that like keeps track of all of the information that stuff here.
• 1:42:46
  It's still, it's still, you're still losing information though here, right?
• 1:42:50
  Because there's four inputs coming in and only one thing that I'm thinking.
• 1:42:54
  Like, I got you.
• 1:42:55
  Yes.
• 1:42:55
  No, no, that makes sense.
• 1:42:56
  I got you.
• 1:42:56
  Yeah.
• 1:42:57
  And like, remember quantum mechanics,
• 1:43:00
  the observation is not reversible.
• 1:43:05
  It destroys whatever thing is happening in the magic box.
• 1:43:08
  Yes.
• 1:43:08
  Right.
• 1:43:08
  And here we're doing an observation.
• 1:43:10
  Yeah.
• 1:43:10
  And so that is definitely not reversible.
• 1:43:13
  That's right.
• 1:43:14
  Right.
• 1:43:14
  That's right.
• 1:43:14
  Yeah.
• 1:43:15
  Whatever is, is the reversible parts happening before we make the observation.
• 1:43:19
  Yeah.
• 1:43:19
  Yeah.
• 1:43:20
  The reversible part is how we implement whatever the Oracle and like,
• 1:43:24
  How we create superpositions, because like we're going to start with zero, zero, zero, zero.
• 1:43:28
  And then what you do is apply like a Hadamard gate that will make, OK, now I put in a superposition of zero and one, zero and one, zero and one.
• 1:43:35
  And then I entangle them.
• 1:43:37
  So now I get all of the different products.
• 1:43:39
  So you can imagine for like N different binary digits, right?
• 1:43:43
  This is going to scale like crazy for a classical computer.
• 1:43:46
  But for a quantum computer, all I have to do is one shot.
• 1:43:49
  It's what happens inside the brackets of the equation that we were looking at earlier.
• 1:43:53
  Yeah, it happens inside of the... You start the qubits, then you do all the nonsense.
• 1:43:57
  All of the nonsense...
• 1:43:59
  It has to be reversible.
• 1:44:00
  Right, right.
• 1:44:01
  Before we make the observation at the very end.
• 1:44:04
  No, that makes sense.
• 1:44:05
  And that's a good distinction because there's just so many levels to this.
• 1:44:09
  So thank you for that correction.
• 1:44:10
  And so I'm just trying to make sure I'm tracking, connecting the ideas we built at the beginning and bringing them down now into reality.
• 1:44:19
  But I think the way you explain this is between looking at the math structure of balanced versus constant and then correlating it to the experimental architecture of the double slit experiment as a way to visualize the idea of what we're trying to say is happening in the magic box.
• 1:44:42
  Yeah, yeah.
• 1:44:43
  The double slit experiment is kind of showing you this interference stuff, right?
• 1:44:47
  Right, right.
• 1:44:49
  Of course, it's a lot more complicated, right?
• 1:44:51
  But the main point that I want to say is the reason why the Deutz-Joseph algorithm works is because it uses interference.
• 1:45:00
  Okay?
• 1:45:01
  It's like the problem itself is this kind of useless problem.
• 1:45:07
  of like, oh, there's a function that's either balanced or constant.
• 1:45:10
  Find out what it is.
• 1:45:12
  And because it's contrived that way, we can use quantum mechanics to figure it out.
• 1:45:20
  And part of the reason why this was the first algorithm is because it's designed to use quantum interference.
• 1:45:27
  Deutsch was literally thinking about, how do I prove to these people that,
• 1:45:31
  That there is a problem that exists, right?
• 1:45:34
  A computational problem that I could solve with a quantum computer in a one shot that would require a classical computer an exponential amount of time.
• 1:45:42
  This is a perfectly valid problem, right?
• 1:45:46
  Why you would want to solve it, who knows?
• 1:45:48
  Other than it's a very good mental exercise.
• 1:45:50
  And it actually proved to the world that, okay, there is a computational problem out there.
• 1:45:58
  that definitely a classical computer cannot solve.
• 1:46:02
  Okay.
• 1:46:02
  Which then created sort of this theoretical motivation or justification to say, okay, well, this is a problem that requires quantum computing to actually be able to efficiently solve.
• 1:46:14
  And it's concrete.
• 1:46:17
  It's right there.
• 1:46:18
  It's right there.
• 1:46:18
  Right.
• 1:46:19
  It's right there.
• 1:46:19
  I can describe it really well.
• 1:46:21
  Yeah.
• 1:46:21
  Right.
• 1:46:21
  Still, I mean, obviously people are going to look at this and be like, well, that's a useless problem.
• 1:46:25
  Yeah.
• 1:46:25
  Okay.
• 1:46:26
  Now we're going to get into some useful problems.
• 1:46:29
  This is what we just connected back to the idea of funding and basic research.
• 1:46:33
  Sometimes you got to do stuff that looks useless.
• 1:46:36
  Yes.
• 1:46:37
  In order to enable and create the foundation for things that are useful.
• 1:46:41
  And it's so can be counterintuitive.
• 1:46:43
  But I always want to hammer this point because we need to just explore sometimes.
• 1:46:47
  Yes, I agree.
• 1:46:48
  And just fool around.
• 1:46:50
  and argue.
• 1:46:52
  100%.
• 1:46:54
  So, Doge Joza, they proposed this thing.
• 1:46:59
  1993, computer scientist Daniel Simon, he formulates a quantum algorithm that demonstrates exponential speed-up over classical randomized algorithms where he's trying to consider a function that's guaranteed to have a hidden period under bitwise XOR addition.
• 1:47:18
  I don't really want to get into it,
• 1:47:20
  Effectively, there's a function that has some kind of period.
• 1:47:23
  In this case, this is a function that maps three-digit binary numbers to other three-digit binary numbers, except there's...
• 1:47:34
  two inputs always map to one input.
• 1:47:36
  Okay?
• 1:47:36
  So there's eight different binary numbers, but there's only four different outputs.
• 1:47:40
  And like the two green inputs map to the same 101, 101, and the two red outputs map to the same 000, right?
• 1:47:48
  And it turns out the bitwise XOR,
• 1:47:51
  of the inputs is the same.
• 1:47:53
  It's 110110 for both, if you were to take the bitwise XOR of both of the inputs.
• 1:47:59
  The idea is, given I have a function like this, with this constraint, can you figure out what is that invariant bitwise XOR for the two matched
• 1:48:09
  This is another contrived problem.
• 1:48:11
  It's very similar.
• 1:48:12
  It has a similar construction, but it creates a bit more complicated, creates a different mapping that ultimately is trying to accomplish the same concept.
• 1:48:20
  Yeah.
• 1:48:20
  It's like we're now trying to think of problems that a quantum computer could do very, very fast.
• 1:48:27
  That a classical computer can't do very, very fast.
• 1:48:29
  It's okay if you didn't understand that.
• 1:48:31
  The idea is there's some type of period in my function, and this thing is trying to figure out what that period is.
• 1:48:37
  Okay?
• 1:48:38
  Simon submits his findings to the 1993 IEEE Symposium on Theory of Computing.
• 1:48:44
  Okay?
• 1:48:45
  And the program committee rejects the paper.
• 1:48:47
  Okay.
• 1:48:47
  Because it dismisses it as just another artificial black box puzzle.
• 1:48:52
  It's like, oh, we got another Deutsch-Joseh here.
• 1:48:55
  It's like, who cares?
• 1:48:57
  When would I encounter such a periodic bitwise XOR addition function?
• 1:49:04
  Mathematician Peter Schor is on the committee for the STOC.
• 1:49:07
  This is Peter Schor when he was a young man.
• 1:49:11
  And Schor advocates to accept that manuscript because he recognizes that this formulation...
• 1:49:17
  represents a period finding over an algebraic group.
• 1:49:22
  Okay.
• 1:49:22
  Okay?
• 1:49:24
  Why is this important?
• 1:49:25
  He realizes that if period finding can be mapped to something that a quantum computer can do, period finding can also be mapped to cyclic groups over integers, okay?
• 1:49:42
  meaning like there's some weird algebraic math over integers, and that can be applied to computational problems in cryptography.
• 1:49:51
  The idea is the construction of this...
• 1:49:54
  Has a functional application to cryptography because of some of the mathematical underpinnings.
• 1:50:02
  Yes.
• 1:50:03
  That define the problem.
• 1:50:05
  Exactly.
• 1:50:05
  And, you know, Peter Short, he looked at it and was able to see those mathematical underpinnings in the construction of...
• 1:50:13
  Yeah, of the Simon problem, right?
• 1:50:15
  Of Simon's problem.
• 1:50:16
  He looked at this and he's like, this looks useless, but there's a way that this can be used to solve something that I think a lot of people are going to care about.
• 1:50:25
  Okay?
• 1:50:26
  So he sets out to extend Simon's technique to something called the discrete logarithm problem.
• 1:50:31
  April 1994, he succeeds.
• 1:50:33
  He figures out how to effectively do like a discrete Fourier transform.
• 1:50:38
  You know, in Fourier transforms...
• 1:50:40
  We've discussed this a lot for you.
• 1:50:42
  Transforms are when you go from the time domain of a signal to the frequency domain where you're extracting the frequencies that are relevant in whatever thing, right?
• 1:50:50
  In this case, this is like a frequency of numbers type thing, right?
• 1:50:56
  And he shares this logarithm result at Bell Labs.
• 1:50:58
  He was at Bell Labs.
• 1:51:00
  Every Tuesday they used to have this weekly seminar.
• 1:51:03
  He presents it at the seminar.
• 1:51:05
  It's known for rigorous and direct questioning.
• 1:51:08
  The presentation is very well received.
• 1:51:11
  And over the following days...
• 1:51:14
  everyone kind of realizes what Shore's going for, okay?
• 1:51:18
  Shore's technique to the discrete logarithm problem gets out, and he starts getting phone calls from the academic community, because now it's spreading, okay?
• 1:51:29
  Bell Labs had this seminar, the people who attended the seminar...
• 1:51:33
  are talking to their friends, they're talking to their friends.
• 1:51:36
  Through the grapevine, Umesh Vazirani, he's another computer scientist who currently is at the University of California, Berkeley, he phones Peter Shore on the weekend.
• 1:51:49
  So Tuesday is when he gave the seminar, on the weekend...
• 1:51:52
  uh vazarani phones got that phone call yeah he got that phone call and vazarani understands exactly where this is going and on the phone call he says i hear that you can factor efficiently with a quantum computer right and peter shore immediately is like this guy yeah he's got like he all he immediately like saw the through line right right in those four days though peter shore spent all
• 1:52:22
  because basically he sort of had an incomplete map yeah and he had an inkling that this could probably work and now he got feedback that it could probably work more importantly he got feedback from people who could definitely make it work right and he's like i need to lock in yeah like this is my thing right i mean he uh peter short gave a gave a presentation at ucla like two or three years ago um
• 1:52:45
  like a symposium and he was literally talking about this and he said you know when vazirani telephoned him and it's like i hear you can factor efficiently you know with a quantum computer he was like i had been working for four days and fortunately i had figured out how to do that if i hadn't and like i got that phone call i would have panicked because i'm like okay so now literally everybody is going after the factoring algorithm right that he is now known for peter shore
• 1:53:14
  spends these days creating that, he establishes a way to find prime factors of large products of primes.
• 1:53:25
  Why is that important?
• 1:53:26
  Because almost all of cryptography is dependent on large products of primes not being able to get factored efficiently, even by a supercomputer.
• 1:53:39
  Okay?
• 1:53:40
  If you take a giant prime number and you take a giant prime number,
• 1:53:44
  you get an even bigger number
• 1:53:47
  And if you give that to somebody, they could not tell you what two prime numbers make up that product.
• 1:53:53
  Okay?
• 1:53:54
  Unless you give them one of them.
• 1:53:55
  If you give them one of them, then you can just divide and I can get the other one.
• 1:53:58
  Right?
• 1:53:58
  This is how public key and private key encryption works.
• 1:54:03
  Public key is the giant big number.
• 1:54:05
  Private key is your own special prime number that you can figure out what the other one is based on just dividing.
• 1:54:12
  And then you can, you know, this is how passwords work.
• 1:54:14
  Email passwords.
• 1:54:15
  your Instagram password.
• 1:54:17
  This is why like hackers need to like fool you by telling you that like, you know, your, your grandma's in the hospital or something.
• 1:54:24
  Yeah.
• 1:54:25
  And they actually literally need you to type in your past.
• 1:54:27
  They can't just like do it.
• 1:54:28
  Yeah.
• 1:54:28
  Right.
• 1:54:29
  This becomes a huge, huge deal.
• 1:54:32
  Okay.
• 1:54:32
  In parallel, I just want to also mention in 1996, love Grover,
• 1:54:37
  who's actually, he's an Indian.
• 1:54:40
  He develops Grover algorithm also at Bell Labs.
• 1:54:43
  And this is another foundational quantum algorithm.
• 1:54:45
  It's the second big foundational quantum algorithm that people are excited about.
• 1:54:49
  It's optimal...
• 1:54:51
  searching of an unstructured database so if you want to find like where something is you can do it in square root of n time instead of like n and would be you know you got to check every single one to figure out where it is square root of n is what he showed so this is also this can be like you know applied to a various other things these are the two big algorithms that
• 1:55:12
  that are the reason why I think quantum computing has found all of this funding specifically, I think shorts and be perfectly honest.
• 1:55:21
  They're, they sort of have two fundamental entry points of what they're actually either doing or solving for.
• 1:55:28
  One is this sort of large factoring, large primes.
• 1:55:32
  And the other is like, uh, unlike some unbounded database search or bounded database search.
• 1:55:39
  Yeah.
• 1:55:39
  Um, and yeah,
• 1:55:42
  because of the structure of the problem, they fundamentally approach it in different ways.
• 1:55:49
  And so there's implications and derivative effects.
• 1:55:53
  Yeah, you can map certain problems to database search.
• 1:55:58
  Right.
• 1:55:58
  And then be like, oh, just apply Grover's algorithm.
• 1:56:00
  Right.
• 1:56:00
  I don't know if there's a lot that you can map to Shor's algorithm, but you don't need mapping to understand why Shor's is good.
• 1:56:07
  Shor is just like, look, literally anyone in cryptography...
• 1:56:12
  CIA, NSA, FBI, China, France, any intelligence community is going to want to have their access to something that can do shores.
• 1:56:22
  World wars have been lost over not being able to encrypt your communications.
• 1:56:28
  100%.
• 1:56:28
  And so from the – Good point.
• 1:56:30
  You know, like that is the –
• 1:56:32
  Yeah, exactly.
• 1:56:33
  And prior to Shor's 1994 factoring paper, quantum computing research was confined to academic communities.
• 1:56:40
  IBM, Yorktown Heights, Oxford, Los Alamos, Bell Labs, physics departments, computer science departments.
• 1:56:47
  Shor's algorithm altered that dynamic, right?
• 1:56:50
  Because now it introduced national security, cryptography.
• 1:56:54
  Yeah.
• 1:56:56
  If you have an operational quantum processor that could scale to several thousand logical qubits, now any encrypted communication that relies on RSA, the elliptic curve cryptography that is the bedrock of Bitcoin's blockchain,
• 1:57:13
  You can now decrypt it.
• 1:57:15
  I can steal all your Bitcoin.
• 1:57:17
  There's, like, dude, it's kind of scary because, like, I've been reading.
• 1:57:21
  There's, I don't know what you want to call them, cyberpunk, cyber gangs, cyber terrorists even, that are just, like, downloading data.
• 1:57:32
  Mm-hmm.
• 1:57:33
  So that one day when there's a – they're just waiting for one day there's going to be a fault-tolerant quantum computer and then I can just decrypt it.
• 1:57:41
  It's that HGTV show or whatever, Lifetime TV show, Hoarders.
• 1:57:45
  Oh.
• 1:57:46
  Right?
• 1:57:46
  Yeah, yeah, yeah.
• 1:57:47
  They just take whatever – They're just hoarding data.
• 1:57:49
  Right.
• 1:57:50
  Yeah.
• 1:57:50
  And this is such – I just briefly want to note that this is kind of like the –
• 1:57:56
  the scare tactic that in the media context is thrown around a lot.
• 1:58:01
  It's like, oh, well, like everything that you think is secure now, like don't put anything on the internet because as soon as you have something that breaks this encryption, then all of your stuff is accessible.
• 1:58:11
  And it, again, like most things, somewhere in the middle.
• 1:58:15
  It's somewhere in the middle because like, yes, if you rely on the old algorithms for too long and then a fault-tolerant quantum computer comes in,
• 1:58:24
  It's going to be an issue.
• 1:58:25
  On the other hand, there's concerns about – there's people that calculate how long is it going to take.
• 1:58:31
  Okay, it's fine.
• 1:58:33
  It's not going to take the age of the universe.
• 1:58:35
  But for certain hardware implementations, it might take days or weeks or months.
• 1:58:40
  I mean, okay, that's better than the age of the universe.
• 1:58:43
  But maybe, given how expensive quantum computers are going to be, maybe they're not going to want to get to your Instagram.
• 1:58:50
  Maybe your Instagram is not worth that.
• 1:58:52
  On the other hand, there are also ways to go post-quantum cryptography.
• 1:58:57
  There are protocols that are in place.
• 1:58:59
  And I think the U.S. government and DARPA specifically have, and I think NIST, the National Institute for Standards and Technology, they've created like...
• 1:59:08
  sort of mission statements on how do we go into a post-quantum cryptography world where things can't be hacked by a quantum computer.
• 1:59:18
  So there are efforts to do this.
• 1:59:20
  It's still kind of an issue, right?
• 1:59:23
  Because if adversarial nation states like China, I think we have a headline from Bloomberg that says that China is closing the gap in quantum technology.
• 1:59:33
  This is a concern for our own State Department and the State Departments of the West, right?
• 1:59:38
  Because clearly, I mean, you know, for whatever reason geopolitical, China is an adversarial nation.
• 1:59:47
  And so if they get to this before we do, that's going to be an issue.
• 1:59:52
  Critical infrastructure is definitely going to be the frontier of this battle.
• 1:59:58
  Yeah.
• 1:59:58
  And because people are going to want to use it for both defensive but 100% offensive purposes.
• 2:00:05
  Because in any...
• 2:00:08
  proxy war or other kind of geopolitical conflict between the superpowers.
• 2:00:15
  This is a thumb on the scale that can be pressed immediately.
• 2:00:20
  That arguably because of how connected we are digitally across the world now and even a lot of –
• 2:00:27
  systems you can air gap stuff and etc but even we've seen the example of like stuxnet with the iranian nuclear missile program and how we can find ways into these systems that ostensibly are not connected to the quote-unquote internet yeah and still have a lot of damage and so this is i know the focus of
• 2:00:50
  Thousands, tens of thousands of people every single day in a variety of ways.
• 2:00:58
  Because the implications are you would not want encrypted systems related to missiles, silos.
• 2:01:05
  Yeah, that would be really bad.
• 2:01:06
  And other kind of things.
• 2:01:07
  You would not want that to be easily accessible.
• 2:01:10
  Yeah.
• 2:01:10
  Yes, exactly.
• 2:01:11
  As an example.
• 2:01:12
  Yeah.
• 2:01:12
  And to show you just how much Shor's algorithm really changed the landscape, Shor's algorithm came out in the 1990s.
• 2:01:19
  And the DARPA QIST program established in 2001, this is the Quantum Information Science and Technology Initiative, this is the thing that funded university and industrial laboratories to pursue scalable qubit hardware.
• 2:01:32
  This created the funding that enabled now technologies like companies
• 2:01:40
  places to now piggyback off that research and try to create an actual quantum computer.
• 2:01:46
  The ARDA roadmap, the A-R-D-A, that's the advanced research and development activity.
• 2:01:53
  In 2002 and 2004, they convened like a quantum information science and technology experts panel to draft formal roadmaps to establish benchmarks on things like how good a quantum computer works,
• 2:02:08
  can keep its quantum superpositions, things like gate fidelity, qubit scalability, and quantum error correction.
• 2:02:15
  Those are more hardware questions, which we're going to get into in the next episode when we talk about the hardware.
• 2:02:21
  But I hope that this episode kind of showed you, you know, kind of the theory behind it and why we're building this thing in the first place.
• 2:02:30
  Okay.
• 2:02:31
  And I really personally, I think it's personally, I think it's because of Shores and Grover's.
• 2:02:37
  Feynman's dream of material science, I think in the age of AI, it's less so much a priority, right?
• 2:02:46
  Because just look at Google DeepMind's Alpha Fold.
• 2:02:52
  It won the Nobel Prize because it's really that good at predicting protein structure.
• 2:02:57
  Maybe we don't need a quantum computer to predict protein structure.
• 2:03:01
  I will make a small note.
• 2:03:03
  Yes, it's not 100% efficient.
• 2:03:06
  Yes, we've gotten a lot of comments about, yes, alpha-fold is interesting, but when brought into later stages...
• 2:03:12
  So I'm just qualifying it.
• 2:03:14
  Yes, we are aware.
• 2:03:16
  It's not perfect.
• 2:03:17
  We're not saying that it's perfect.
• 2:03:19
  But from where we were before to it existing and being able to then iterate and build on top of that.
• 2:03:27
  It's going to get good.
• 2:03:28
  And there's no reason to believe that it's not going to get good for material science itself and physics in general.
• 2:03:35
  The other thing why –
• 2:03:37
  The other reason is like, I think the best algorithm that's out there to, the one that's like most frequently used to figure out things like ground states of a material is something called the variational quantum eigensolver.
• 2:03:52
  This is, you know, just like how Shor's algorithm is built for this purpose of factoring, this VQE algorithm is built for the purpose of understanding materials.
• 2:04:02
  But that algorithm requires you to guess and ansatz.
• 2:04:07
  And, you know, how Hans Bethe had this idea of guessing an answer and then optimizing around what that answer is.
• 2:04:22
  at what you think the ground state wave function looks like, and then optimizing around that wave function.
• 2:04:29
  Well, if your guess is completely out of left field, you're not actually going to get anywhere.
• 2:04:33
  So it's not like one of these, it's not the dream of Feynman of like, oh, just simulate it.
• 2:04:39
  You still need a quantum algorithm to do the computation.
• 2:04:43
  And it's not as simple as like, oh, we just take density functional theory and create a quantum version of density functional theory.
• 2:04:50
  Right?
• 2:04:50
  Where like, oh, I know exactly what the electron clouds look like.
• 2:04:54
  The whole point is that thing is going to tell me what the electron clouds look like.
• 2:04:57
  So I have to guess first description, and then it only really varies the parameters around my guess.
• 2:05:04
  If my guess is wrong, I could be in trouble.
• 2:05:06
  And as I get to larger and larger systems, the probability of my guess becoming wrong gets higher and higher.
• 2:05:12
  So there's still not a good enough, I think, quantum algorithm to get me the material science algorithm
• 2:05:19
  promise that Feynman was dreaming of.
• 2:05:22
  Maybe one person who will help push the envelope there is someone we just covered in our last episode, Omar Yagi.
• 2:05:31
  Yes.
• 2:05:32
  Who's just moved out to Beijing, former Nobel Prize winner, 2025, and is the pioneer of reticular chemistry and is pushing this idea of what's being dubbed...
• 2:05:46
  AI-ometry, which is AI, material science, and chemistry, and trying to basically blend these disciplines.
• 2:05:54
  And potentially, I know that the quantum piece and quantum algorithms are not necessarily the basis of the concept.
• 2:06:02
  But seeing where this implementation of AI and speeding up next-gen material science discovery, and then if you add a fundamental quantum algorithm discovery...
• 2:06:14
  in that context, I think the acceleration becomes very interesting.
• 2:06:18
  Yeah, yeah.
• 2:06:19
  I mean, it could be like, we could live in a future where like, AI systems are making the guess.
• 2:06:25
  Right.
• 2:06:25
  Right?
• 2:06:25
  And then they get an answer from the quantum machine, and then they iterate on the guess.
• 2:06:30
  I mean, who knows, right?
• 2:06:30
  Who knows?
• 2:06:31
  Maybe in the future, only AI uses quantum machines because they're the ones creating such amazing algorithms.
• 2:06:38
  Who knows?
• 2:06:40
  It's a ripe field, but that's how we got here.
• 2:06:43
  Yeah.
• 2:06:44
  Okay.
• 2:06:44
  And I think that this is a great foundation.
• 2:06:48
  Again, the whole point of this show is we have an expert and a layman, myself being the layman, a resident PhD, Krishna Chowdhury being the expert, trying to navigate these complex topics and
• 2:07:01
  at both levels at an expert level so for those who are super technical shout out members of the hrl team that made it through two hours of this podcast uh and literally no one if you did drop it in the group chat i want to i want to hear you guys
• 2:07:19
  And then the regular everyday people like me that do have an interest and curiosity about some of these things but may not have the foundational tools to be able to dive in and get it.
• 2:07:29
  And I think that blend is why so many people love the pod because we're able to communicate to two different audiences.
• 2:07:36
  And so for those who keep asking in the comments, why does Lester just sit there staring the whole time?
• 2:07:40
  Yeah, first of all –
• 2:07:42
  Actually, no, this is a family-friendly show, so I'm not going to say what I think I want to say.
• 2:07:49
  I just, the structure of this show is very much present in other forms of media.
• 2:07:55
  You have subject matter expert, you have an everyday person, and you're trying to communicate for two different audiences listening.
• 2:08:05
  And so my job is to smile, listen, and look pretty and sound occasionally kind of smart.
• 2:08:12
  occasionally be like oh that's good that's what i fight for on this show christina being surprised that i made the oh made that connection that's pretty good um so again part two we're going to actually dive into and hopefully have a physical copy of yes that we can hang on the wall and start our gallery wall in the back of this cover story um quantum silicon processor yeah that's that is correct
• 2:08:36
  Yeah, you're goddamn right.
• 2:08:38
  It's going to be so exciting because we will now have this foundation of understanding the history of why this research discipline even began.
• 2:08:49
  And in modern times, what was arguably the enabling layer to work.
• 2:08:56
  Having the likes of IBM, Google, Microsoft, HRL, a variety of other players.
• 2:09:02
  I wouldn't put Microsoft in there, but okay.
• 2:09:04
  We'll talk about that in part two.
• 2:09:07
  We'll talk about that in part two.
• 2:09:09
  But this is now going to get into the fun stuff.
• 2:09:12
  We, again, appreciate you all greatly.
• 2:09:14
  If you've made it to the end of the pod and you have not yet given us a five-star on Apple Podcasts,
• 2:09:22
  or Spotify.
• 2:09:23
  Now is a great time to do so.
• 2:09:25
  You're on a jog, you're at the gym, you're sitting in the car in traffic on the way to work or from work,
• 2:09:32
  It really helps us reach more people.
• 2:09:34
  We are trying to build the best science show on the planet.
• 2:09:38
  Share it in the group chat, DMs, all the other things.
• 2:09:41
  Let's have a – because I always like seeing those who reach the end.
• 2:09:46
  If you have a comment to leave, you just gave one for – you gave an action for HRL, but that's in the group chat.
• 2:09:53
  But for the public, if there's one comment to leave because they've made it this far into the pod so that we know who the real fans are.
• 2:10:03
  What do you think?
• 2:10:03
  It's tough.
• 2:10:05
  What would you want?
• 2:10:06
  What would you want?
• 2:10:07
  If you had a personal quantum computer, what would you want to do with it?
• 2:10:10
  That's a good one.
• 2:10:12
  That's a very good one.
• 2:10:15
  I have thoughts, but we will save it for the comments.
• 2:10:18
  My name is Lester Nare, joined as always by my co-host, our resident PhD, and nature cover story co-author,
• 2:10:30
  Krishna Chowdhury, we are so grateful for you all listening to us rant every day.
• 2:10:36
  We also have seen your feedback.
• 2:10:38
  And so we know some of the things you all would like us to do differently as we move forward.
• 2:10:45
  As we have the opportunity to do so, we will do so.
• 2:10:48
  We will see you all next week for part two on Quantum Computing.