[01:05.360 --> 01:06.660]  Check, check.
[01:33.290 --> 01:34.070]  Hey, everyone.
[01:34.150 --> 01:34.530]  How's it going?
[01:35.690 --> 01:36.230]  Good.
[01:36.610 --> 01:36.990]  Hell yeah.
[01:37.970 --> 01:41.950]  Can we give a hand for everyone who has put together this f*cking amazing conference?
[01:44.290 --> 01:45.750]  Thank you guys so much.
[01:47.590 --> 01:50.570]  I'm really excited to talk and hope again.
[01:50.850 --> 01:55.030]  I haven't been able to do a presentation here since 2016, so it's been a while.
[01:55.810 --> 01:58.650]  But yeah, it's good to be back.
[01:58.650 --> 02:02.410]  And it's just good to be back with everyone here.
[02:02.570 --> 02:04.650]  I'm really excited to do this today.
[02:04.850 --> 02:06.510]  So thanks for showing up.
[02:06.610 --> 02:07.790]  This is like such a cool theater.
[02:07.930 --> 02:08.770]  I love this place.
[02:08.890 --> 02:09.390]  This is awesome.
[02:11.210 --> 02:11.750]  All right.
[02:11.850 --> 02:16.130]  So they say you're always supposed to open up a presentation with a joke.
[02:16.750 --> 02:19.390]  So I apologize for the joke that's about to come.
[02:20.870 --> 02:23.430]  They say there are three types of people in this world.
[02:23.990 --> 02:25.930]  Those who understand quantum computing.
[02:25.930 --> 02:28.850]  Those who do not understand quantum computing.
[02:29.110 --> 02:34.570]  And those who both simultaneously understand quantum computing and do not understand quantum computing.
[02:38.270 --> 02:41.170]  So, unfortunately, I have to come clean with you guys.
[02:41.350 --> 02:42.890]  I am one of the third type.
[02:43.230 --> 02:43.650]  Right?
[02:43.870 --> 02:46.470]  I both do and do not understand quantum computing.
[02:46.590 --> 02:51.130]  And I feel like the more I learn about quantum computing, The less I actually understand sometimes.
[02:51.810 --> 03:06.710]  But my goal today is to... well, before I say what my goal is, let me give you a quick disclaimer at the start of the presentation, which is that I am not an expert on quantum computing, or quantum physics, or quantum mechanics.
[03:06.970 --> 03:11.830]  In fact, what I don't know about these topics has already filled several libraries.
[03:12.510 --> 03:16.630]  So, if I'm not an expert, why am I doing this talk at HOPE today?
[03:16.990 --> 03:17.970]  That's a good question.
[03:17.970 --> 03:23.510]  Because a few years ago, I thought I might never be able to use a quantum computer.
[03:24.210 --> 03:26.750]  And now, I already have.
[03:27.130 --> 03:29.030]  So, that's the reason.
[03:29.290 --> 03:44.090]  It seems a little ridiculous, but when I first started learning about quantum computing, I thought it was kind of like reading and wired in 1998 about how there were going to be nanobots in your bloodstream, and they were going to clean everything out.
[03:44.190 --> 03:44.710]  You know what I mean?
[03:44.790 --> 03:47.770]  Kind of like that vaporware idea that was really cool.
[03:47.770 --> 03:48.190]  People at the time.
[03:48.870 --> 03:54.930]  You know, I thought quantum computing was about as real as those nanobots, or flying cars, or whatever, right?
[03:56.030 --> 04:02.470]  It was stuff that people were experimenting with, but not something you could actually use in real life.
[04:03.030 --> 04:03.890]  I was wrong.
[04:04.170 --> 04:06.030]  And that's why I decided to do this talk.
[04:07.130 --> 04:13.810]  Because the democratization of quantum computing means that if you want to use a quantum computer today, you can.
[04:14.150 --> 04:15.390]  And that's the coolest part.
[04:16.710 --> 04:20.250]  The reason I wanted to do the talk is not because I know everything about quantum computing.
[04:20.390 --> 04:23.270]  In fact, I know a sliver of a sliver about it, right?
[04:23.470 --> 04:34.330]  But I think I know just about enough to get to the really smart people in this room who know more than me, and who will get really excited about some of this stuff, and can actually code it, and can actually do it.
[04:34.330 --> 04:43.790]  So, you know, sometimes you point people towards things instead of actually doing it yourself, and I feel like that's part of what my presentation is designed to do.
[04:44.290 --> 04:50.610]  Because I know how many brilliant people there are at this conference, and I bet that you can do this way better than I can.
[04:50.610 --> 04:56.010]  So, I wanted to show you that quantum computing is something you can actually achieve today.
[04:57.550 --> 05:07.570]  And, you know, I want to tell you that you and virtually anyone in the world who wants to learn to code for quantum computers can do it today.
[05:07.570 --> 05:08.630]  And you know what?
[05:08.890 --> 05:10.730]  Most of it is actually free.
[05:10.930 --> 05:13.050]  And we have the open source community to thank for that.
[05:13.410 --> 05:17.090]  There are so many great open source free tools that you can use.
[05:18.770 --> 05:26.190]  SDKs, actual quantum computing systems that you can use today that will allow you to interact with this world.
[05:26.650 --> 05:28.530]  So, let's go ahead and talk through some of this stuff.
[05:30.870 --> 05:36.110]  It's hard to know where to start with quantum because it is really, really complex, right?
[05:37.570 --> 05:42.650]  So, I was kind of thinking, where should I start when talking about quantum computing?
[05:42.890 --> 05:52.270]  Well, sometimes when I start learning about a difficult topic, I go to r slash ELI5 to get a quick and easy explanation of what I'm working on.
[05:52.450 --> 06:05.110]  For those of you who don't know, ELI5 is a subreddit called Explain Like I'm 5, where you get people to explain incredibly complex concepts to you in fairly easy to understand ways.
[06:05.110 --> 06:10.350]  And I feel like Schrodinger's cat is the same idea when it comes to quantum computing.
[06:10.770 --> 06:13.030]  It's a thought experiment, so don't worry.
[06:13.330 --> 06:16.170]  No animals were harmed in the making of this presentation.
[06:17.630 --> 06:34.610]  To illustrate the idea of quantum superposition, there was a physicist, you can see up here, named Erwin Schrodinger, who actually had some of these conversations with Einstein and other physicists at the time who he was working with.
[06:35.070 --> 06:44.110]  And it's kind of strange, the story is a little bit discombobulated, because Schrodinger was actually on the wrong side of this argument at first.
[06:44.530 --> 06:48.650]  Everyone kind of thinks of Schrodinger's cat as him sort of justifying superposition.
[06:48.650 --> 06:52.550]  He actually was arguing against it, but that's neither here nor there.
[06:53.790 --> 07:12.490]  The illustration itself was that Schrodinger joked that if you put a radioactive atom inside of a windowless box, and then put a cat inside of it, and left it there for an hour without any way to observe it, you wouldn't know whether the cat was alive or dead.
[07:13.110 --> 07:20.610]  And because of this, that meant that until the box itself was actually opened, the cat is both alive and dead.
[07:21.290 --> 07:28.230]  You don't know whether the cat is 100% alive or 100% dead until you observe it after opening the box.
[07:28.750 --> 07:29.350]  Right?
[07:29.490 --> 07:31.290]  So that's the idea of Schrodinger's cat.
[07:31.510 --> 07:39.890]  And the point of this analogy for Schrodinger was to describe what happens when humans observe something like a quantum particle.
[07:40.530 --> 07:51.850]  Because of the steps that humans need to go through in order to actually observe the behavior of something as small as an electron, our observation of the electron itself would actually change its behavior.
[07:52.230 --> 07:54.310]  So just like the cat, right?
[07:54.390 --> 07:56.410]  It's the same idea as Schrodinger's cat.
[07:56.870 --> 08:01.390]  And until we open the box with the electron inside, we don't know where it is.
[08:01.390 --> 08:11.910]  And you can see here that Schrodinger's entire idea here was to describe the idea of observation.
[08:12.510 --> 08:17.870]  And how observation can actually have an impact on the experiment itself.
[08:18.150 --> 08:22.290]  And this is actually an explanation of the concept of superposition.
[08:22.290 --> 08:22.850]  Right?
[08:23.570 --> 08:34.550]  And the idea of superposition is that something can be, in the example of Schrodinger's cat, is that the cat is both alive and dead until it is actually observed.
[08:34.730 --> 08:34.850]  Right?
[08:34.930 --> 08:39.390]  So you don't know what state the cat is in until it is actually observed.
[08:39.450 --> 08:43.790]  And that actually describes one of the principles of quantum computing and quantum mechanics.
[08:44.070 --> 08:48.470]  That was kind of the thought experiment that Schrodinger used in order to explain this.
[08:50.170 --> 08:56.490]  So now that we understand the idea of Schrodinger's cat, let's apply that to the concept of quantum computing.
[09:01.360 --> 09:03.210]  So our next topic is quantum computing.
[09:03.540 --> 09:04.560]  What is it?
[09:04.660 --> 09:06.140]  And how does it actually function?
[09:06.300 --> 09:06.920]  How does it work?
[09:08.070 --> 09:15.740]  Well, to really understand what quantum computing is, let's think about actual classical computing.
[09:15.920 --> 09:19.260]  The computing that we all work with on a daily basis and that we understand.
[09:20.300 --> 09:22.580]  So a traditional computer, right?
[09:22.660 --> 09:26.160]  The ones that we all have in our houses or sometimes here even at the conference.
[09:26.620 --> 09:30.420]  A classical computer or traditional computer will use bits.
[09:30.640 --> 09:30.880]  Right?
[09:30.950 --> 09:32.500]  We're all very familiar with the idea of a bit.
[09:32.710 --> 09:34.020]  It's either a zero or a one.
[09:34.340 --> 09:34.830]  Right?
[09:34.980 --> 09:38.000]  And computers use zeros and ones to perform calculations.
[09:38.540 --> 09:46.260]  Well, quantum computers are a little bit different since they actually use a data storage method called qubits instead of these bits.
[09:47.480 --> 09:51.020]  Now, a qubit can represent the number zero or one like a bit.
[09:51.540 --> 09:54.900]  But qubits can also be in what's called quantum superposition.
[09:55.260 --> 09:58.420]  Which describes their quantum state before they're actually measured.
[09:58.710 --> 10:05.140]  So in this quantum superposition state, a qubit can be both a zero and a one.
[10:05.140 --> 10:09.310]  And the only way to find out whether it's a zero or one is to actually measure it.
[10:09.380 --> 10:14.720]  But we can use that quantum state in order to perform calculations incredibly quickly.
[10:15.280 --> 10:25.580]  And manipulation of that superposition state allows developers to create different algorithms that are able to more quickly and efficiently compute data than traditional classical computers.
[10:25.580 --> 10:38.400]  So, quantum computing, the term quantum computing, describes a computer that uses quantum concepts like superposition and entanglement to perform calculations faster than traditional computers.
[10:39.280 --> 10:42.380]  A qubit can represent the number zero or one.
[10:42.550 --> 10:42.620]  Right?
[10:42.740 --> 10:43.480]  Like we were saying.
[10:43.710 --> 10:45.550]  But it can also be in that superposition state.
[10:45.670 --> 10:48.190]  It can be both a zero and a one.
[10:48.950 --> 10:53.600]  Right now, quantum computers aren't actually general purpose programmable computers.
[10:53.860 --> 10:54.140]  Right?
[10:54.280 --> 10:58.120]  They're only designed to solve specific problems.
[10:58.400 --> 11:03.560]  So, it's not like quantum computers are going to take over the role of classical computers.
[11:03.760 --> 11:16.080]  For most things, at least until we really reach true quantum supremacy, where quantum computers are always more efficient than classical computers, we will still be using both classical and quantum computers for different purposes.
[11:17.360 --> 11:24.960]  So, quantum computers are better at different problems like, for instance, factorization, which is a problem that's oftentimes used in encryption.
[11:25.240 --> 11:29.920]  One of the things that, you know, this particular conference might be a little bit interested in.
[11:30.080 --> 11:30.540]  Right?
[11:30.640 --> 11:35.740]  How can you break some of the most widely used encryption schemes in the world today?
[11:36.000 --> 11:39.540]  Like RSA, for example, or elliptic curve cryptography.
[11:39.880 --> 11:44.980]  Well, quantum is really the way you can do that by attacking these problems like factorization.
[11:46.060 --> 11:52.500]  It can also attack something like the traveling salesman problem, which we currently work on with classical computers.
[11:52.640 --> 12:11.900]  But because of quantum computing, we can actually solve problems like the traveling salesman problem, where you try to find the shortest possible route across multiple cities or, you know, multiple different areas in some hypothetical problem in a much more efficient and fast way than classical computing.
[12:13.000 --> 12:22.920]  And quantum computers excel at solving these kinds of problems because they're able to use this superposition of qubits to perform vast amounts of calculations almost instantly.
[12:23.460 --> 12:30.340]  This is because they're able to perform calculations based on the probability of an object's state before it's actually measured.
[12:31.000 --> 12:34.240]  So think back to the Schrodinger's cat example I just told you about.
[12:34.600 --> 12:38.960]  Remember that you don't know whether the cat is alive or dead until you look in the box.
[12:39.280 --> 12:48.340]  The way quantum computers actually work involves performing calculations before you look in the box and then opening the box afterward.
[12:53.640 --> 12:56.840]  Let's talk a little bit more about how quantum computers actually function.
[12:57.340 --> 13:01.780]  So IBM actually gives a great example of this on their quantum computing site.
[13:02.020 --> 13:06.700]  And for this to make sense, you might want to think back to your high school biology days.
[13:06.720 --> 13:10.020]  So I apologize in advance if this conjures up any bad memories.
[13:12.440 --> 13:16.260]  But protein folding is one of the problems that quantum can really take on.
[13:16.260 --> 13:26.280]  And a protein is basically just a long string of amino acids that after you fold them, they become complex shapes.
[13:26.280 --> 13:28.860]  And they actually become useful biological machines.
[13:29.320 --> 13:34.920]  So figuring out how proteins will fold is important for biology and medicine.
[13:35.420 --> 13:39.580]  A classical supercomputer might try to fold a protein with brute force.
[13:39.740 --> 13:42.160]  And that's what we use it for right now.
[13:42.160 --> 13:55.020]  You may have heard of the at-home projects like SETI at home where you can search for extraterrestrial intelligence through kind of grid computing using the idea of multiple computers working together as a supercomputer.
[13:56.440 --> 14:01.580]  Well, they also had a project called Folding at Home which was designed to do this with protein folding.
[14:01.820 --> 14:11.680]  Basically just using a bunch of classical computers in order to figure out all the different methods of bending this chemical chain just through pure brute force.
[14:12.470 --> 14:18.080]  Well, a much more efficient way of doing this is to use a quantum computer.
[14:18.080 --> 14:24.200]  Because as the protein sequences get longer and more complex, the supercomputer itself actually stalls.
[14:24.760 --> 14:30.640]  So a chain of 100 amino acids could theoretically fold in like trillions of different ways, right?
[14:30.780 --> 14:34.500]  And brute forcing that with classical computers is really not very practical.
[14:34.500 --> 14:42.020]  No computer has the working memory to actually be able to handle all the possible combinations of those protein folds.
[14:43.220 --> 14:47.520]  But when we think about quantum computing, it's a lot different.
[14:47.940 --> 14:56.080]  In the case of proteins, there are actually quantum algorithms today that can find folding patterns in entirely new and more efficient ways.
[14:56.240 --> 15:01.320]  And that's without going through all of the brute forcing that those classical computers have to do.
[15:01.960 --> 15:12.480]  As quantum hardware continues to scale and grow and these algorithms get more and more advanced, they can also tackle protein folding problems that are too complex for any supercomputer today.
[15:13.800 --> 15:22.540]  So that's the idea kind of behind why we would use quantum computing rather than classical computing to handle some of these very complex computational problems.
[15:23.360 --> 15:26.360]  Let's talk about how quantum computers actually function too.
[15:27.480 --> 15:32.720]  You'll use a quantum processing unit or a QPU along with your CPU.
[15:33.020 --> 15:40.560]  But in order to do that, in order to get a functioning QPU, there are a lot of different methods that you have to use in order to build a quantum computer.
[15:40.980 --> 15:43.160]  So let's talk about superfluids first.
[15:44.060 --> 15:49.160]  You probably have a fan or some kind of internal cooling system on your PC at home, right?
[15:49.700 --> 15:53.900]  Well, quantum processors need to be incredibly cold.
[15:53.900 --> 15:56.060]  It's not just keeping them at room temperature.
[15:56.100 --> 16:01.080]  It's actually keeping them at about a hundredth of a degree above absolute zero.
[16:01.620 --> 16:06.640]  So quantum computers have to be in incredibly, incredibly cold spaces.
[16:07.000 --> 16:22.880]  And manufacturers of quantum computers use superfluids, which are these fluids that will actually keep the quantum computers at this degree above absolute zero in order to create something called a superconductor.
[16:23.800 --> 16:30.820]  Because of the incredibly low temperature, electrons can actually move through quantum computers without any resistance at all.
[16:31.200 --> 16:33.780]  So that makes them superconductors.
[16:34.060 --> 16:40.540]  And when electrons pass through superconductors, they match up and they form something called a Cooper pair.
[16:41.360 --> 16:47.960]  So a Cooper pair can carry a charge across insulators through a process called quantum tunneling.
[16:48.140 --> 16:50.420]  And I know this is a little more advanced.
[16:50.640 --> 16:52.660]  You can read up on this online.
[16:52.820 --> 17:00.260]  Unfortunately, this topic is so complex that it's hard to sort of encapsulate it all within a 50-minute talk.
[17:00.260 --> 17:08.780]  But the idea here is basically that you're using these Cooper pairs to be able to carry that charge across these insulators, which kind of act as barriers.
[17:09.160 --> 17:12.200]  And that's the process known as quantum tunneling.
[17:12.510 --> 17:20.010]  So if you put two superconductors on either side of one of these insulators, they form something called a Josephson junction.
[17:22.100 --> 17:30.970]  Now, as we think about this, these Josephson junctions are basically used as the qubits, as the superconducting qubits, right?
[17:31.220 --> 17:37.460]  That's how we get to a qubit, something that can store a zero, a one, or a zero and one at the same time.
[17:38.160 --> 17:48.580]  And the way that these can actually be controlled, these qubits can be controlled, is you fire microwave photons at the qubits in order to control their behavior.
[17:48.800 --> 17:58.550]  So you can actually get them to hold, you can get them to change, and you can get them to read out different parts of quantum information by firing these microwave photons at the qubits.
[17:58.780 --> 18:00.260]  So it's really crazy.
[18:00.440 --> 18:03.260]  I mean, it sounds like sci-fi, but people are doing it today.
[18:04.920 --> 18:07.820]  That brings us to another topic, which is entanglement.
[18:07.970 --> 18:10.010]  You may have heard of quantum entanglement before.
[18:10.600 --> 18:12.030]  If you haven't...
[18:12.030 --> 18:19.160]  Quantum entanglement is basically an effect that correlates the behavior of two separate things.
[18:19.160 --> 18:22.640]  So let's say that we have two qubits that are entangled, right?
[18:22.760 --> 18:29.120]  Maybe one qubit is in a superposition state and another qubit is also in a superposition state.
[18:29.300 --> 18:36.600]  But a change to one of those qubits will actually impact the other qubit, right?
[18:36.660 --> 18:45.260]  And so the way that quantum algorithms work is they actually leverage those relationships to find solutions to different complex problems.
[18:45.260 --> 18:51.730]  And we'll talk about one of those algorithms in just a moment and how that operates.
[18:51.990 --> 18:59.680]  And again, the source for this is from the IBM quantum computing site at ibm.com slash topic slash quantum computing.
[19:05.030 --> 19:10.650]  So let's next talk about what quantum computing is used for and how you can actually use it.
[19:10.850 --> 19:14.930]  So you can see up here, we have an actual IBM quantum computer.
[19:14.930 --> 19:25.210]  And I really wanted to show the pictures of these quantum computers because for some reason, and I don't know exactly why this was, I always thought these things were very theoretical, right?
[19:25.370 --> 19:28.510]  I didn't think that they were something you could use today, but they are.
[19:28.950 --> 19:34.490]  And, you know, obviously, you know, this thing probably costs about $15 million, right?
[19:34.670 --> 19:37.090]  So none of us have the money to do that.
[19:37.110 --> 19:41.030]  But I'll show you how you can actually interact with these quantum computers in just a minute.
[19:42.510 --> 19:46.210]  Think about almost any computational process today.
[19:47.690 --> 19:56.870]  And eventually, with the advancement of different quantum properties, at some point, quantum computing will probably be able to handle a lot of these different use cases.
[19:57.590 --> 20:03.810]  So InfoSec is one of the most interesting things for us to think about right at a hacker conference.
[20:03.810 --> 20:12.830]  And I've already mentioned sort of the method of breaking asymmetric algorithms like RSA or elliptic curve cryptography.
[20:13.150 --> 20:20.030]  But there are a lot of other really fascinating ways of making new algorithms that are also quantum resistant.
[20:20.290 --> 20:24.490]  So you can make an algorithm so strong that even a quantum computer can't break it.
[20:24.650 --> 20:26.470]  And we'll talk a little bit about that in a minute.
[20:26.470 --> 20:30.810]  But there are a number of other really interesting use cases as well.
[20:31.190 --> 20:39.710]  So there are quantum algorithms for things like financial modeling, which are going to be really useful for banks and other financial institutions.
[20:40.470 --> 20:48.510]  Data sorting, which is a great use case, especially if you're working with big data, and you're trying to figure out a way to optimally sort that data.
[20:48.790 --> 20:52.530]  Quantum computing is one method of doing that really efficiently.
[20:53.430 --> 21:03.270]  Another really interesting use case is, you know, on the science level, chemical and physics problems can be solved with quantum computing.
[21:05.110 --> 21:10.090]  So the problem is, you know, I mentioned these quantum computers are like $15 million.
[21:10.950 --> 21:14.290]  Anyone here have $15 million to drop on a quantum computer today?
[21:15.470 --> 21:17.150]  If you do, talk to me after.
[21:17.330 --> 21:18.790]  We'll have a good talk.
[21:18.790 --> 21:23.990]  If you don't, the good news is that you don't need to anymore, right?
[21:24.050 --> 21:31.470]  We're in the era of the cloud, where you can actually use quantum computers today without having to buy one, right?
[21:31.530 --> 21:34.610]  You can rent time on one of these quantum computers.
[21:34.870 --> 21:44.210]  In fact, AWS, Microsoft Azure, IBM Cloud all have great methods of being able to interact with quantum computers today.
[21:46.170 --> 21:51.290]  So let's talk a little bit more about quantum computing and some of the cool things that we can do with quantum.
[21:55.410 --> 22:01.690]  All right, as you can see here, this shit is so real that even boring business people care now, right?
[22:02.310 --> 22:03.870]  You guys heard of Gartner?
[22:04.290 --> 22:07.670]  Gartner is like a boring consulting company for rich people, right?
[22:07.670 --> 22:17.230]  But Gartner has said, as you can see up here, that they estimate that less than 1% of companies are budgeting for quantum today.
[22:17.610 --> 22:24.130]  By next year, they estimate 20% of organizations will be budgeting for quantum computing projects.
[22:24.370 --> 22:27.890]  So from less than 1% to 20% in like a year.
[22:28.270 --> 22:30.990]  And I've seen this myself in the business world.
[22:30.990 --> 22:37.990]  I have talked to multiple companies that are hiring for quantum developers that are looking for people in this space right now.
[22:38.190 --> 22:41.450]  So I think Gartner's estimate might be a little bit on the high side.
[22:41.610 --> 22:43.350]  I'm not sure 20% of organizations.
[22:43.530 --> 22:55.110]  But I think if you look at really large institutions, especially banks, especially, you know, other institutions that have the funding for this kind of thing, I think it's fairly realistic.
[22:55.110 --> 22:56.850]  I would estimate closer to 10 or 15%.
[22:56.850 --> 23:00.630]  But that's kind of what I'm looking at right now.
[23:00.850 --> 23:07.770]  You can see here also, there are a lot of different kinds of use cases that we can think of for quantum.
[23:08.030 --> 23:09.690]  And we'll go over these in a little more detail.
[23:09.950 --> 23:16.150]  But, you know, things like machine learning, chemistry, physics, being able to solve manufacturing and logistics problems.
[23:16.590 --> 23:20.670]  There are all kinds of different methods that we can use quantum for.
[23:21.870 --> 23:27.390]  And you can see here in this graph, pretty much pick your poison, right?
[23:27.650 --> 23:32.090]  I mentioned protein folding already, but even use cases like autonomous vehicles.
[23:32.570 --> 23:36.950]  You know, being able to have, you know, being able to take your Uber without an Uber driver.
[23:37.690 --> 23:44.330]  Being able to use these things to come up with new use cases for pharmaceuticals.
[23:44.570 --> 23:51.290]  There are a virtually infinite number of use cases when it comes to what we can use quantum for.
[23:51.290 --> 23:53.630]  And they're still figuring out use cases today.
[23:54.490 --> 24:08.010]  So even though quantum is being used for these very specialized situations at the moment, there are a lot of other possibilities in the future, particularly as we move closer to true quantum supremacy, which I don't really think we've reached yet.
[24:08.410 --> 24:13.170]  Google and IBM have both come out and said, oh yeah, we're at the quantum supremacy place.
[24:13.350 --> 24:17.310]  And then each one of them have sort of debunked the other's claims.
[24:17.310 --> 24:21.390]  So I'm not really sure we're quite there yet, but I think we will be someday.
[24:23.910 --> 24:28.610]  So let's talk a little bit about cryptography, where we are at a hacker conference after all.
[24:28.910 --> 24:32.750]  Let's talk about hacking quantum or what quantum can actually do to hack.
[24:33.510 --> 24:39.250]  You see here, Peter Shore, one of the most brilliant computer scientists and mathematicians in the world.
[24:39.250 --> 24:46.130]  And he came up with this incredible algorithm called Shor's algorithm.
[24:46.650 --> 24:53.970]  You can see here, Shor's algorithm is a polynomial time quantum algorithm for the factoring problem.
[24:54.370 --> 25:00.730]  Classical computers have not been able to develop any kind of polynomial solution to the factoring problem.
[25:00.950 --> 25:13.450]  But Peter Shore proved, which you can actually see on the graph on the right hand side of the screen here, how much more efficient quantum computing can be to actually go through the factoring algorithm.
[25:13.610 --> 25:23.230]  So if you're not familiar with the factoring problem, the factoring problem is one way to make it difficult for classical computers to find prime factors of very large numbers.
[25:23.710 --> 25:38.030]  When cryptographers were trying to figure out what cryptographic algorithms can we actually use to protect data, they had to figure out something that was really difficult, which is what kind of problem is going to be hard for a computer to solve.
[25:38.450 --> 25:42.070]  And the problem that they came up with was the factoring problem.
[25:42.330 --> 25:47.290]  And that's basically figuring out the prime factors of very large numbers.
[25:47.290 --> 25:59.050]  So if I gave you, you know, a number like, you know, 10 trillion, 500 million, 500 billion, 300 million, blah, blah, blah, whatever, right?
[25:59.190 --> 26:06.110]  Trying to figure out what the prime factors are that come up with that number is very difficult for classical computers to do.
[26:06.250 --> 26:11.130]  And that's one of the ways that especially our asymmetric encryption functions today.
[26:11.130 --> 26:22.430]  RSA uses this factoring problem as a way of making traditional computers too slow at being able to solve this kind of problem to make it efficient enough to actually break the cryptography.
[26:23.010 --> 26:37.930]  Well, Shor's algorithm was brilliant because it uses this extremely efficient method of quantum Fourier transformation and modular exponentiation by repeated squaring these different numbers to vastly speed up this process.
[26:37.930 --> 26:41.810]  Basically, he makes the computer go really fast, right?
[26:43.050 --> 26:58.810]  And it's really interesting when you actually take a look at sort of the efficiency of a classical algorithm, which is that arc in red versus the blue here on the screen.
[26:58.830 --> 26:59.430]  You can see that.
[26:59.550 --> 27:02.950]  And then the number of digits here is D, right?
[27:03.110 --> 27:07.770]  You can see the classical record in terms of number of operations here is 230 digits.
[27:07.770 --> 27:21.550]  Whereas, if you were to use Shor's algorithm on a computer with qubits that go beyond the number of qubits that we have on quantum computers today, we could be able to very easily break these algorithms.
[27:21.790 --> 27:35.450]  Now, because of hardware constraints, because quantum computing is developing rapidly but not quite where it will be eventually, Shor's algorithm has not yet broken these encryption algorithms, right?
[27:35.450 --> 27:37.070]  So you can still use RSA today.
[27:37.410 --> 27:43.070]  The question is, what do we do when our crypto is broken, right?
[27:43.870 --> 27:47.610]  Today's crypto is going to be pwned at some point.
[27:48.070 --> 27:58.090]  You can see here that especially when we're talking about asymmetric crypto, symmetric crypto is probably going to withstand quantum for the most part.
[27:58.090 --> 28:03.810]  But asymmetric crypto, because of some of the techniques that we use, is probably most at danger here.
[28:04.710 --> 28:11.450]  And you can see, because of Shor's algorithm, these quantum machines will be able to break algorithms like RSA and ECC.
[28:13.030 --> 28:20.290]  Actually, it's really interesting because very recently I was going through the outline for my presentation as I was creating it.
[28:20.410 --> 28:24.690]  And I clicked on my link to NIST and I saw it was a dead link.
[28:24.970 --> 28:36.610]  And that's because NIST has actually changed the algorithms that they've already chosen for this project, even since the time that I originally created the outline for my presentation.
[28:36.610 --> 28:47.650]  So, as of July 2nd, just three weeks ago, NIST has actually chosen algorithms that are quantum resistant.
[28:47.930 --> 28:51.590]  That means they're going to be very difficult for even quantum computers to be able to break.
[28:52.190 --> 28:57.830]  So, you guys remember when DES was broken by the EFF, like back in the late 90s?
[28:58.390 --> 29:03.670]  If you don't, DES was the old standard for encryption that the U.S.government used to use.
[29:03.670 --> 29:17.390]  A lot of conspiracy minded people or even people who aren't so conspiracy minded think that NSA probably put an intentional bug into DES to make it easier for them to decrypt because it was only a 56-bit crypto system.
[29:18.390 --> 29:24.490]  So, they came up with AES, which is what we're all using right now to stay connected to the Wi-Fi, right?
[29:24.850 --> 29:26.790]  AES encryption is now the government standard.
[29:26.790 --> 29:35.170]  And they went through a very careful selection process for this in, I believe, the early 2000s, where they took a bunch of different candidates.
[29:35.370 --> 29:39.210]  One was Rijndael, which is the actual candidate that was chosen for AES.
[29:39.770 --> 29:44.570]  Another one was, I believe, Bruce Schneier's Blowfish algorithm was another.
[29:45.750 --> 29:53.590]  So, this process is what NIST does to basically come up with the most secure encryption algorithms going forward.
[29:53.590 --> 30:03.230]  And for these quantum-resistant algorithms, they have chosen the Crystals-Kyber algorithm as the new quantum-resistant algorithm.
[30:03.250 --> 30:09.770]  That means even when we have quantum computers, we'll still be able to encrypt our data with something that is quantum-safe.
[30:10.230 --> 30:13.250]  Now, they also have a number of digital signature-related algorithms.
[30:13.830 --> 30:18.250]  The Crystals-Dilithium algorithm is actually related to Crystals-Kyber.
[30:18.930 --> 30:24.150]  I believe it's the same developers, but they use some of the same concepts.
[30:24.690 --> 30:30.610]  Falcon and Sphinx are also being used as the new digital signature quantum-resistant algorithms.
[30:31.370 --> 30:41.150]  And NIST has gone through this very elaborate process to figure out what the best methods of protecting our data will be in a post-quantum world.
[30:42.590 --> 30:47.290]  Now, there are a few other candidates that are currently going through round four of the process.
[30:47.650 --> 30:49.890]  And you can read more on the NIST site about this.
[30:49.990 --> 30:51.370]  I'll have some links in the presentation.
[30:51.690 --> 30:58.170]  But it's good to know that the crypto that we're using for the future will eventually be quantum-resistant.
[30:58.550 --> 31:04.370]  That said, the current encryption algorithms we use are not quantum-resistant.
[31:04.370 --> 31:06.270]  So they're going to have problems in the future.
[31:08.210 --> 31:13.990]  Now, let's take a look at what problems that might actually cause.
[31:16.030 --> 31:17.350]  You can see here...
[31:17.350 --> 31:18.750]  Well, let's see.
[31:18.930 --> 31:19.320]  I believe...
[31:19.830 --> 31:20.350]  Oh, you know what?
[31:20.390 --> 31:20.790]  I'm sorry.
[31:20.870 --> 31:21.970]  It was on my previous slide.
[31:22.150 --> 31:22.890]  Sorry about that.
[31:23.450 --> 31:34.670]  On the right-hand side of the screen here, you can see the GitHub for Kyber, which is the general-use post-quantum encryption algorithm that NIST has standardized on.
[31:34.670 --> 31:40.790]  You also see on the far right side of the screen here, the NSA Utah data center.
[31:41.330 --> 31:57.330]  I'm not sure if any of you guys have heard about this, but the NSA has built an enormous data center in Utah that is storing incredible amounts of data about both Americans and foreign nationals, right?
[31:57.330 --> 32:10.050]  So, at some point, if you think about it, people who think they are sending secure data are having that secure data captured that maybe can't be decrypted today.
[32:10.450 --> 32:20.270]  But as soon as NSA gets their hands on one of these quantum computers that's actually able to decrypt something like RSA or ECC, all of a sudden they'll have the keys to the kingdom, right?
[32:20.270 --> 32:24.330]  And data that they've been collecting over years will be able to be compromised.
[32:24.690 --> 32:37.350]  So, that's the reason why it's so important to develop these post-quantum algorithms so that even if someone like NSA is able to break crypto, that we can still have a method of securing our data.
[32:37.570 --> 32:42.610]  The great part about these algorithms is that they are all open source and open to the public.
[32:43.050 --> 32:47.690]  Thankfully, they aren't classified like the old Skipjack algorithm or something like that was.
[32:47.690 --> 32:55.330]  So, you can actually go through the code, look at how it's functioning, and you can actually see weaknesses in the code, which is a really important part of this.
[32:56.270 --> 33:05.030]  So, I think it's important to know how your data is being secured so that you can be confident that even far into the future that you will be able to secure your data.
[33:07.270 --> 33:09.930]  Now, let's talk a little bit about what else quantum can do.
[33:10.790 --> 33:16.050]  So, there are a number of other different use cases that we can kind of focus on when it comes to quantum.
[33:16.910 --> 33:22.990]  And a couple of those use cases include artificial intelligence and machine learning, right?
[33:23.150 --> 33:28.710]  There's actually a field called QML or quantum machine learning right now that is already really focused on this problem.
[33:28.770 --> 33:36.190]  And when you start to see things like GPT-3 or DALI, you can see how important AI and ML are going to be going forward.
[33:37.090 --> 33:41.290]  I already mentioned chemistry and physics as two of the different use cases here.
[33:43.170 --> 33:51.570]  Being able to study chemical reactions through quantum will be a huge, huge advantage for scientists, as well as physics, right?
[33:51.670 --> 34:01.270]  You can actually, you know, especially when it comes to simulating quantum systems, being able to use quantum computers to do that will be an invaluable resource.
[34:02.310 --> 34:03.950]  Even things like weather forecasting.
[34:04.130 --> 34:05.670]  I know there are probably some weather nerds in here.
[34:06.510 --> 34:08.450]  The hacker crowd tends to kind of bring them out.
[34:08.790 --> 34:16.930]  But being able to predict what weather will look like in the future based on being able to compute these incredibly large data sources.
[34:18.190 --> 34:20.730]  We also have a couple of other use cases.
[34:20.810 --> 34:22.370]  I already mentioned finance, right?
[34:22.450 --> 34:24.950]  And how finance may work with some of these things.
[34:25.450 --> 34:28.070]  Even, you know, if you want to look at the blockchain, right?
[34:28.130 --> 34:30.130]  There are probably a lot of people here who are interested in that.
[34:30.130 --> 34:36.950]  Now, the blockchain uses, you know, symmetric cryptography, but there are some blockchain implementations that use asymmetric cryptography.
[34:37.370 --> 34:47.970]  If we have a quantum system and the blockchain is not using quantum-safe cryptography, there's a possibility that you can actually break some of this cryptography with quantum computers.
[34:49.070 --> 34:54.950]  Finally, the logistics problem, which I believe is going to be a really great use case.
[34:55.050 --> 34:57.310]  I kind of talked about the traveling salesman problem already.
[34:57.310 --> 35:05.770]  But being able to find the most efficient way for goods and services to be delivered is going to be another really great use case for quantum computing.
[35:09.330 --> 35:13.470]  So, the question comes, well, all this seems cool, but, like, who cares, right?
[35:13.890 --> 35:17.230]  Only rich people can get to use these quantum computers right now.
[35:17.630 --> 35:18.830]  I don't have one.
[35:18.830 --> 35:20.170]  I don't have access to one.
[35:20.550 --> 35:24.790]  You know, this stuff seems kind of cool, but, like, what's in it for me, right?
[35:25.390 --> 35:26.870]  Well, let me tell you.
[35:27.250 --> 35:32.210]  There are a lot of really great ways that you can actually interact with quantum today.
[35:32.710 --> 35:37.690]  You can see on the right-hand side of the screen, I put a prompt into this cool little AI app.
[35:37.790 --> 35:41.870]  It's kind of similar to something like Dolly, but it's called Wombo Dream.
[35:41.870 --> 35:45.610]  So, I typed in, cyberpunk hacker pwning a quantum computer.
[35:46.070 --> 35:48.230]  And that's what it came up with on the right.
[35:49.510 --> 35:51.510]  So, that could be you today.
[35:52.990 --> 35:55.990]  A couple of really cool links, and I put these in the presentation.
[35:56.150 --> 35:58.410]  I'll give a link to the presentation here at the end.
[35:58.690 --> 36:02.030]  But you can see here, GitHub has one of their awesome lists.
[36:02.310 --> 36:07.670]  I don't know if you've ever seen a GitHub awesome list, but it basically is, like, the best resources for dealing with any problem.
[36:07.670 --> 36:11.030]  And the awesome list is really great for quantum.
[36:11.310 --> 36:17.410]  There are all kinds of really, really cool tools that are mostly free and open source that you can access there.
[36:18.570 --> 36:22.010]  IBM has created this SDK called Qiskit.
[36:22.350 --> 36:23.550]  Totally open source.
[36:23.970 --> 36:27.230]  There are some amazing, amazing aspects of it.
[36:27.470 --> 36:33.870]  I would like to show you, if we have a little bit of time at the end, and I might even get a chance to show you kind of a basic Qiskit use case here.
[36:34.170 --> 36:40.010]  But a couple of other really great projects that you should check out.
[36:40.230 --> 36:42.750]  One is the Quantum Open Source Foundation.
[36:43.130 --> 36:46.530]  They have tons of different dev tools, if you're interested in getting into this.
[36:47.410 --> 36:50.230]  And these are all tools that you can use for free, right?
[36:51.030 --> 36:58.110]  The really great part about this community is they have open sourced and made really free software out of a lot of their tools.
[36:58.110 --> 37:01.010]  So, you don't have to pay anything to get involved.
[37:01.970 --> 37:05.750]  Microsoft has created Qsharp in the Quantum Development Kit, or their QDK.
[37:06.510 --> 37:15.430]  They have an entire language that they've created, very similar to something like IBM's Qiskit, where you can use the existing programming knowledge you have.
[37:15.550 --> 37:18.330]  Like, Qiskit is essentially Python, right?
[37:18.450 --> 37:24.570]  But you can import these quantum modules that you can actually use to interact with quantum computers.
[37:25.870 --> 37:34.490]  And Microsoft is also working on a lot of different cool methods of establishing quantum-safe algorithms today.
[37:34.750 --> 37:45.470]  So, I've been playing around a little bit with their implementation of OpenVPN, but they implement it in a way that is safe from quantum.
[37:45.470 --> 38:00.630]  So, even if you do have a quantum computer that can attack existing algorithms, they have a VPN, a quantum-safe VPN system that they're building, as well as a quantum-safe TLS system for certificates.
[38:00.630 --> 38:02.990]  So, some very cool stuff there.
[38:05.550 --> 38:10.750]  But, you know, those are just some tools with kind of working on how to develop for quantum computers.
[38:10.750 --> 38:14.090]  How can I actually get my hands on a quantum computer today?
[38:14.790 --> 38:25.450]  Again, a lot of really good ways of using current cloud computing providers' resources in order to access quantum computing.
[38:25.650 --> 38:31.930]  I use the analogy of this being kind of like having access to a PDP-11 in the 70s, right?
[38:32.290 --> 38:35.130]  That's what Bill Gates and Paul Allen did, right?
[38:35.130 --> 38:40.370]  They were able to get timeshare access on one of these enormous machines that took up a whole room.
[38:40.530 --> 38:44.750]  It's not like Gates and Allen could have actually bought one of those computers, no.
[38:45.230 --> 38:48.070]  Instead, they bought timeshare rights on them.
[38:48.330 --> 38:51.910]  And current quantum computers are much like that, right?
[38:51.990 --> 38:54.130]  We have the same idea here.
[38:54.270 --> 38:58.030]  So, you are essentially getting timeshare access to the next wave.
[38:58.410 --> 39:02.530]  And you can do that through systems that you are probably already really familiar with.
[39:02.530 --> 39:05.570]  How many of us have worked with AWS or Azure in the past?
[39:06.330 --> 39:08.630]  Yeah, I see tons of hands going up, right?
[39:08.930 --> 39:10.590]  These are very familiar systems.
[39:10.730 --> 39:17.350]  And you can use tools in AWS and Azure today in order to access real quantum computers.
[39:17.490 --> 39:18.270]  It's super cool.
[39:18.770 --> 39:28.750]  So, AWS has their bracket system you can use to access really, really incredibly fast quantum computers.
[39:28.750 --> 39:33.670]  Sometimes you'll have to wait for a few hours or whatever to get the quantum computer to do the job for you.
[39:33.950 --> 39:35.750]  I actually wanted to do a live demo.
[39:35.750 --> 39:43.090]  But unfortunately, just because of the amount of time that we had, a lot of the times those quantum computers aren't available for a few hours or something.
[39:43.390 --> 39:45.690]  It's kind of like when you were working on a PDP-11.
[39:45.710 --> 39:50.010]  You had to wait your turn for the computer to actually do what you wanted to do.
[39:50.010 --> 39:59.030]  But you can put yourself in the queue and after a few hours have your quantum code run by a real quantum computer.
[39:59.250 --> 40:05.610]  And a lot of the time, like in AWS bracket or something, it costs like 30 cents per job or something.
[40:05.930 --> 40:10.770]  And just like regular AWS boxes, you don't want to leave that box just running indefinitely.
[40:10.850 --> 40:14.510]  Because then, you know, the charges start to build up.
[40:14.510 --> 40:19.430]  But if you want to run single jobs with quantum, you can actually do that right now.
[40:19.630 --> 40:25.010]  Or alternatively, if you want to keep it free, you can run them in a quantum simulator, right?
[40:25.130 --> 40:28.770]  And be able to figure out how it would operate on a real quantum computer.
[40:28.970 --> 40:31.250]  But you don't have to use a quantum simulator today.
[40:31.390 --> 40:33.630]  You can actually use a real quantum computer to do this.
[40:34.470 --> 40:35.910]  We've got some other systems up here.
[40:36.110 --> 40:37.630]  Azure Quantum, like I mentioned.
[40:37.930 --> 40:39.390]  The IBM Q experience.
[40:39.390 --> 40:47.450]  IBM is really digging their heels in when it comes to being able to create some pretty impressive quantum systems.
[40:47.610 --> 40:49.470]  They're going about this in the right way.
[40:49.930 --> 40:51.890]  Qiskit is a great system to be able to develop in.
[40:52.750 --> 40:54.070]  Google's quantum AI.
[40:54.450 --> 40:55.590]  Super cool stuff.
[40:55.850 --> 41:00.630]  TensorFlow, if any of you have worked with that before, is kind of key to that Google AI.
[41:01.250 --> 41:03.230]  So definitely recommend checking that out.
[41:03.430 --> 41:08.750]  And then IonQ, who are one of the main computer manufacturers working in the quantum space right now.
[41:12.830 --> 41:16.090]  Let's talk a little bit more about just how to get involved in the quantum community.
[41:16.130 --> 41:17.230]  Because this stuff is hard.
[41:17.410 --> 41:18.670]  It's really complicated.
[41:19.050 --> 41:23.270]  Like I have no idea how 99.9% of it works, to be honest.
[41:23.590 --> 41:26.770]  The main point of this presentation is to get you involved.
[41:26.870 --> 41:30.150]  Because I know there are people who are way smarter than me at this conference.
[41:30.370 --> 41:36.030]  And I think that the more we focus on this stuff as a community, the deeper into quantum we can get.
[41:36.130 --> 41:37.870]  And the cooler shit that we can make.
[41:38.930 --> 41:41.710]  So a couple of really good places to check out.
[41:41.890 --> 41:43.430]  You want to check out Unitary Fund.
[41:43.770 --> 41:49.630]  They're this non-profit that's been put together by a bunch of companies to help spread the message of quantum.
[41:49.850 --> 41:53.490]  And to really try to democratize quantum and get this to as many people as we can.
[41:54.730 --> 41:57.110]  They have a website which is just unitary.fund.
[41:57.110 --> 42:00.150]  And then their discord is discord.unitary.fund.
[42:01.350 --> 42:03.290]  Quantum.info is another great place.
[42:03.290 --> 42:05.490]  If you want to go to conferences kind of like HOPE.
[42:05.650 --> 42:08.850]  But that are really revolving around quantum in this new space.
[42:09.150 --> 42:10.330]  Check out quantum.info.
[42:12.050 --> 42:15.510]  Quantumapalooza is another list of free quantum training and conferences.
[42:15.770 --> 42:18.330]  Another really good resource if you're trying to get involved in the community.
[42:18.590 --> 42:21.770]  If you want to learn more about this stuff from way smarter people than me.
[42:21.770 --> 42:23.050]  Great place to go.
[42:23.610 --> 42:25.750]  And finally, the quantum computing subreddit.
[42:25.970 --> 42:27.550]  Really good place for information.
[42:27.850 --> 42:30.070]  You can kind of just talk to people a little more casually there.
[42:30.270 --> 42:32.150]  It's just r slash quantum computing.
[42:35.230 --> 42:37.730]  And honestly, that's pretty much it.
[42:38.670 --> 42:45.470]  If you want to troll me, you can hit me up on any of these different services.
[42:46.210 --> 42:51.210]  There's also a copy of the presentation slides.
[42:51.210 --> 42:53.290]  I promise it is malware free.
[42:53.590 --> 42:56.050]  It will reflect on me very badly if it weren't.
[42:56.170 --> 42:59.130]  But it's just tinyurl.com slash quantum computing hope.
[42:59.670 --> 43:02.210]  So you can go to that if you're interested in getting these slides.
[43:02.950 --> 43:04.430]  And seeing some more of the links.
[43:04.670 --> 43:08.910]  The final page of the presentation is just a whole bunch of links.
[43:09.090 --> 43:10.870]  I was hoping to get to show you guys some of this stuff.
[43:11.030 --> 43:12.750]  But I'm too long winded and ran out of time.
[43:13.950 --> 43:17.530]  So I want to open it up to any questions.
[43:18.230 --> 43:20.310]  Thank you guys so much for listening to the talk.
[43:20.310 --> 43:21.330]  I really appreciate it.
[43:26.030 --> 43:26.630]  Thanks guys.
[43:29.790 --> 43:32.750]  Yeah, any questions or thoughts about this stuff?
[43:32.870 --> 43:35.310]  And I may or may not be able to answer these questions.
[43:35.490 --> 43:36.050]  Just so you know.
[43:36.290 --> 43:38.610]  Like I said, I am not an expert in this stuff.
[43:38.910 --> 43:41.830]  So I may have to refer you to someone else or somewhere else.
[43:41.990 --> 43:44.670]  But glad to take any questions if anyone has any.
[43:46.410 --> 43:47.630]  I can, definitely.
[43:47.890 --> 43:49.910]  I was actually going to do that on the Qiskit side.
[43:51.310 --> 43:51.750]  Absolutely.
[43:53.250 --> 43:55.530]  If anyone have questions, I have a microphone.
[43:55.830 --> 43:57.050]  So just raise your hand.
[44:00.090 --> 44:01.010]  Give me one second here.
[44:22.480 --> 44:23.060]  Let's see.
[44:23.440 --> 44:25.500]  Can I get the screen back up please?
[44:25.640 --> 44:25.920]  Thank you.
[44:28.120 --> 44:29.160]  Whoops, hold on.
[44:33.430 --> 44:33.910]  Awesome.
[44:34.110 --> 44:34.690]  Thanks very much.
[44:34.890 --> 44:36.570]  You're doing a great job on the screen.
[44:36.570 --> 44:37.010]  Thank you.
[44:37.090 --> 44:37.810]  It's been killer.
[44:40.090 --> 44:40.830]  All right.
[44:41.110 --> 44:48.510]  So here's a quick intro to Qiskit, which is the SDK that IBM has created for quantum computing.
[44:48.750 --> 44:55.090]  And you can see here, this is kind of an intro for the way that the user workflow operates.
[44:55.770 --> 44:58.470]  Let me scroll down a little bit so you can actually see the code here.
[44:59.670 --> 45:02.490]  And there are links to all these things within the presentation.
[45:02.790 --> 45:06.370]  Again, that's just tinyurl.com slash quantum computing hope.
[45:07.830 --> 45:11.110]  You can see here, this is all Python code, right?
[45:11.190 --> 45:23.410]  And that's like the coolest part is you can use... you can stand on the shoulders of giants, and you can use the knowledge that you already have about how to hack Python in order to do this stuff.
[45:23.410 --> 45:26.790]  So this is an example of the different workflow.
[45:27.410 --> 45:28.970]  This is sort of the whole example.
[45:29.090 --> 45:30.690]  So let me scroll down a little bit.
[45:31.190 --> 45:34.530]  You can import the different packages that are needed for your app.
[45:34.610 --> 45:39.590]  So you can just do standard Python importing here.
[45:39.870 --> 45:49.170]  But you're also going to be importing quantum circuit, chasm simulator, and being able to plot the histogram of the actual quantum circuits that you're simulating.
[45:50.410 --> 45:52.570]  Then you will initialize variables, right?
[45:52.570 --> 45:54.490]  So you can create a quantum circuit.
[45:54.870 --> 46:01.690]  Here, all you have to do is type in circuit equals quantum circuit, parenthesis, two, comma, two, end parenthesis.
[46:01.970 --> 46:06.230]  And you can initialize two qubits in the zero state, right?
[46:06.350 --> 46:08.850]  With two of the classical bits set to zero.
[46:09.270 --> 46:10.490]  Really, really cool stuff.
[46:11.070 --> 46:13.110]  I know I'm kind of... I'm running out of time a little bit.
[46:13.170 --> 46:14.730]  I just want to show you a couple more quick things.
[46:14.950 --> 46:18.030]  You can add different gates to actually manipulate registers of the circuit.
[46:18.030 --> 46:29.690]  So this is where you can actually interact with the circuit itself, is by using these different operations to create Hadamard gates, right?
[46:29.790 --> 46:33.230]  Which is one of the ways that quantum computing actually functions.
[46:33.670 --> 46:37.650]  And then you can even visualize the circuit and get kind of a physical representation of...
[46:37.650 --> 46:42.330]  I should say a logical representation of what the circuit looks like.
[46:43.930 --> 46:46.670]  Finally, you can actually perform a simulation of the experiment.
[46:46.830 --> 46:50.830]  Or you can actually run this live code on real quantum computers.
[46:51.470 --> 46:56.570]  Now, there is a very small cost associated with that most of the time, depending on what system you're using.
[46:56.570 --> 47:04.210]  If you're using something like bracket, there is a fee of, like I said, I think it's like 30, 50 cents, something like that.
[47:04.470 --> 47:10.230]  But that's kind of the idea behind how this stuff actually works in the cloud.
[47:11.690 --> 47:14.710]  And then you can actually perform a visualization of the results.
[47:14.910 --> 47:24.190]  So you can see here, you actually get a histogram of the probabilities here based on the different counts.
[47:24.970 --> 47:28.770]  So that's a quick little tutorial of how some of the code works.
[47:28.950 --> 47:33.830]  I promise if you go online and look at it, you'll get a much more in-depth explanation than I can offer here.
[47:34.050 --> 47:36.370]  But totally worth checking out the resources.
[47:37.470 --> 47:44.630]  I can go ahead and throw the presentation thing back on the screen.
[47:44.630 --> 47:45.650]  Hold on one sec.
[47:47.670 --> 47:48.810]  One second here, guys.
[47:48.930 --> 47:49.110]  Sorry.
[47:49.450 --> 47:50.070]  There we go.
[47:50.070 --> 47:59.690]  So this is the link to all the different resources that I was mentioning here.
[48:01.730 --> 48:05.510]  Just go to tinyurl.com slash quantum computing hope.
[48:05.690 --> 48:07.930]  You'll have links to all those different resources.
[48:08.890 --> 48:17.570]  Links to the IBM site, the AWS site, Azure, and all the other quantum community resources.
[48:17.570 --> 48:20.790]  So what I would advise you to is get involved in this stuff.
[48:20.930 --> 48:21.590]  It's super cool.
[48:21.830 --> 48:22.710]  You can hack it today.
[48:23.130 --> 48:24.850]  This is not just sci-fi anymore.
[48:25.070 --> 48:27.010]  It's not just something that's going to happen in the future.
[48:27.270 --> 48:29.130]  You can work with quantum computers today.
[48:29.230 --> 48:30.390]  And that's the point of my talk.
[48:30.610 --> 48:31.550]  So thanks a lot, guys.
[48:31.710 --> 48:32.450]  I really appreciate it.
[48:32.450 --> 48:32.470]  Thank you very much.
[48:32.970 --> 48:33.270]  I appreciate it.