1
00:00:00,000 --> 00:00:07,926
rc3 preroll music
2
00:00:07,926 --> 00:00:14,720
Herald: And welcome back from our studio
live, as you could see in Halle! laugh The next
3
00:00:14,720 --> 00:00:19,200
talk will be Natalie Kilber. She will talk
about tales from the quantum industry.
4
00:00:19,920 --> 00:00:25,040
Natalie works since many, many years on
quantum computers to make them real and
5
00:00:25,040 --> 00:00:29,160
useful.
6
00:00:29,160 --> 00:00:33,440
Natalie: Hi, I'm Natalie, and I've been
talking about the progress, the prospects
7
00:00:33,440 --> 00:00:39,200
and the poppycock, the nonsense of quantum
technology, or you could also say tales
8
00:00:39,200 --> 00:00:44,560
from the quantum industry. A little bit
about me. I'm a prehistoric creature that
9
00:00:44,560 --> 00:00:49,520
has been there since the field emerged.
I'm the masses of stories for you today
10
00:00:50,240 --> 00:00:54,880
and you might ask yourselves, but why are
you so gung ho about quantum computing,
11
00:00:54,880 --> 00:01:01,280
buddy? Well, if you look at the Moore's
laws trends, then you know, already that
12
00:01:01,280 --> 00:01:06,720
since 2000, the clock speeds have been
kind of stagnating and we're going smaller
13
00:01:06,720 --> 00:01:13,600
and smaller, and IBM is going to fabricate
a chip of about two nanometers in 2023.
14
00:01:14,480 --> 00:01:19,200
The problem here is the smaller you go, if
you go smaller than one nanometer towards
15
00:01:19,200 --> 00:01:24,320
sub nano meter scales, then you go into
the quantum regime. And if you have a
16
00:01:24,320 --> 00:01:28,560
single electron transistor, you already
have a quantum dot. That means that's a
17
00:01:28,560 --> 00:01:33,280
qubit, that's part of a quantum computer.
But it's not reliable for classical
18
00:01:33,280 --> 00:01:40,320
computing, for any classical computation.
So. Well, there we have it. We already are
19
00:01:40,320 --> 00:01:45,440
at a quantum regime if we want to go into
the future. So why do I want quantum
20
00:01:45,440 --> 00:01:52,720
computers? I'm gung-ho about speed. I'm
gung-ho about premium power. I want more
21
00:01:52,720 --> 00:02:01,040
juice. So first, look at your PC, now back
to me now back in your PC. Sadly, it isn't
22
00:02:01,040 --> 00:02:09,360
an eight Core i9, or maybe it is so yet.
Are you happy about your wiring? Well, I
23
00:02:09,360 --> 00:02:13,840
don't know why, but this fellow's also
happy as a muffin about his wiring. This
24
00:02:13,840 --> 00:02:19,280
is a quantum computer in Google's lab, and
you can see the wiring is not trivial for
25
00:02:19,280 --> 00:02:23,920
this. And this is just one little chip. So
a quantum computer is an accelerator, and
26
00:02:23,920 --> 00:02:32,720
you need a co-host CPU to to do any sort
of meaningful computation with it. And if
27
00:02:32,720 --> 00:02:36,400
you look at the wiring here, there's a
different type of quantum computer. You
28
00:02:36,400 --> 00:02:40,800
see an optical table with optical
components on it. I think this one is the
29
00:02:40,800 --> 00:02:46,160
QuEra startup, and this guy's not that
happy about his wiring. You can see why.
30
00:02:47,520 --> 00:02:52,400
There's lots of other examples that look a
bit difficult. And here specifically, you
31
00:02:52,400 --> 00:02:59,200
see a lot of controls that are sending
signals into the quantum computer. And
32
00:02:59,200 --> 00:03:05,840
this one again, is QuEra with a bit better
wiring. This is specifically a trapped ion
33
00:03:05,840 --> 00:03:10,880
quantum computer, so they use trapped ion.
Quantum computers don't come in one
34
00:03:10,880 --> 00:03:16,000
flavor. We have different flavors with
different bases of fundamental technology
35
00:03:16,000 --> 00:03:20,240
that we use with different types of
components. So in trapped ions that use
36
00:03:20,240 --> 00:03:25,200
photonic components, there are photonic
computers in itself. And for example, this
37
00:03:25,200 --> 00:03:31,520
one is a huge cryogenic fridge. So you go
up to mini sub Kelvin stages right at the
38
00:03:31,520 --> 00:03:36,240
bottom and the first picture you see in it
without his clothes, without the enclosing
39
00:03:36,960 --> 00:03:43,200
the enclave. And then again at the top, the
massive wiring for just one chip. Then you
40
00:03:43,200 --> 00:03:48,240
have other examples like, for example, AQT
Alpine quantum technologies over there
41
00:03:48,240 --> 00:03:54,560
in Austria, and they know how to stuff
their cables really well and well. You
42
00:03:54,560 --> 00:03:59,920
might wonder why am I not talking about
quantum inhalers? And well, if we define
43
00:03:59,920 --> 00:04:04,960
them, if we define quantum computers, so
legs then a solid is a quantum computer
44
00:04:04,960 --> 00:04:12,640
too, you know, why a solid any sort of
type of plant uses quantum phenomena as
45
00:04:12,640 --> 00:04:19,120
well. So because of photosynthesis, the
light tries to travel as fast as possible
46
00:04:19,120 --> 00:04:23,200
to the side, and they do it through
quantum tunneling and it solves it pretty
47
00:04:23,200 --> 00:04:30,640
fast. Yeah. So no quantum inhalers. Then
look back at your PC, can it stand five
48
00:04:30,640 --> 00:04:35,560
gigahertz? You think you're unhappy about
your clock speed? I think I won the
49
00:04:35,560 --> 00:04:39,680
Complaining game a quantum computer can do
no more than 100 kilohertz, and that's
50
00:04:39,680 --> 00:04:45,040
twice the speed of the ENIAC back in the
day. But then again, don't be so harsh in
51
00:04:45,040 --> 00:04:49,040
your setup or on the quantum computers. We
still tinker with them with the
52
00:04:49,040 --> 00:04:54,720
capabilities we have. You've seen in the
pictures before, there's a lot of wiring
53
00:04:54,720 --> 00:05:01,840
there, components that are quite big, that
haven't been invented yet. So. The
54
00:05:01,840 --> 00:05:07,280
bottleneck component of a quantum computer
of any set up, the slowest component is
55
00:05:07,280 --> 00:05:11,680
your bottleneck clock speed or a
bottleneck in your clock cycle. And that's
56
00:05:11,680 --> 00:05:15,840
why they're so slow in quantum computers,
they have digital signaling processes.
57
00:05:15,840 --> 00:05:20,960
That means you have to convert digital
signals to analog and analog signals to
58
00:05:20,960 --> 00:05:26,480
digital signals again. And we have that
everywhere in our phones and our cameras.
59
00:05:26,480 --> 00:05:31,760
Imagine just sound that is analog, that
has to be converted into digital signals
60
00:05:31,760 --> 00:05:37,120
or, you know, literally light photons. If
you take a photo in two digital signals,
61
00:05:37,120 --> 00:05:42,560
that's a analog to digital interface that
we have. And here, because we're like
62
00:05:43,600 --> 00:05:48,080
shooting microwave pulses and, for
example, superconducting computers and
63
00:05:48,080 --> 00:05:54,960
qubits, that's kind of difficult to do.
So, yeah, you might say, but they are
64
00:05:54,960 --> 00:06:01,200
parallel and they do everything a little
bit different. Yeah. For algorithms, when
65
00:06:01,200 --> 00:06:06,800
you have such slow clock speed rates, if
your time to solution outlives you, that's
66
00:06:06,800 --> 00:06:13,920
a problem. If you don't live to see your
solution, that's too slow and. You might
67
00:06:13,920 --> 00:06:19,185
want to listen to your computer, listen.
So 30 dezibels or 40 decibels? This is
68
00:06:19,185 --> 00:06:46,906
what economists. You can hear this.
Yeah, that's the
69
00:06:46,906 --> 00:06:47,906
Woman voices speaks "Welcome to sound of IBM.
70
00:06:47,906 --> 00:06:48,575
truth of that sound, but you needed it.
That's so annoying. One tempers at the.
71
00:06:48,575 --> 00:06:49,800
You get into this by this. Then you have
this wonderful. The nightmare is now. It's
72
00:06:49,800 --> 00:06:54,243
a quiet place. But one thing is always the
same. We always talk about size and with
73
00:06:54,243 --> 00:07:00,739
size, I mean, we talk about qubits. You
might read in Wired or Spiegel or wherever
74
00:07:00,739 --> 00:07:06,521
you want and hype articles or just
articles talking about the advancements in
75
00:07:06,521 --> 00:07:14,960
quantum computing, how many qubits they
they could instantiate on a chip. IBM
76
00:07:14,960 --> 00:07:21,360
released about 127 qubits in QuEra bit about 200
77
00:07:22,000 --> 00:07:26,960
years. The trapped ion one and IBM was the
superconducting one of these cylinders and
78
00:07:26,960 --> 00:07:33,600
the cryogenic fridges. But here you have
to discern a lot of physical qubits is
79
00:07:33,600 --> 00:07:38,880
good, but a logical qubit is what you need
for computation. We have a high error rate
80
00:07:38,880 --> 00:07:44,240
for just one physical qubit because of the
noise. Because of temperature. All types
81
00:07:44,240 --> 00:07:48,080
of noise. All types of environmental
factors that you can't eliminate yet,
82
00:07:48,080 --> 00:07:52,160
because this is this is quite fundamental
research how you can control these things
83
00:07:52,160 --> 00:07:57,120
and how you can adjust the parameters so
noise stays low. And then again, we have
84
00:07:57,120 --> 00:08:04,400
these types of signals and in our normal
classical devices where we need parody
85
00:08:04,400 --> 00:08:10,480
checks, where we need error correction and
so do quantum computers. Error correction
86
00:08:10,480 --> 00:08:15,200
was a huge field that needs to be
advanced, and we use things that are
87
00:08:15,200 --> 00:08:20,400
called surface codes and these are error
correcting to get one logical qubit. So we
88
00:08:20,400 --> 00:08:24,640
have reliable computation. We need a lot
of physical qubits. So you could say
89
00:08:25,360 --> 00:08:30,400
there's a lot of overhead for those error
correcting code and parody checks. So if
90
00:08:30,400 --> 00:08:35,360
you hear about those, many Qubits have
been have been accomplished by a company.
91
00:08:35,360 --> 00:08:39,120
It's usually physical qubits, but then
another factor of 20, that's just one
92
00:08:39,120 --> 00:08:45,680
logical qubit that you can use. Yeah,
that's difficult. And there's a famous
93
00:08:45,680 --> 00:08:52,160
physicist that said, Well, he's still
alive, so it's actually on Twitter. And he
94
00:08:52,160 --> 00:08:56,480
said, Well, Qubits are like children's
better to have a few high quality ones
95
00:08:56,480 --> 00:09:01,680
than a bunch of noisy ones. Yes, I agree.
And John John Prescott has been at
96
00:09:01,680 --> 00:09:06,320
Microsoft before, and now he's at 8WRS.
But at Microsoft, we witnessed
97
00:09:06,320 --> 00:09:12,160
Maironascandal. Well, we thought we can
have a topological qubit that has no
98
00:09:12,160 --> 00:09:17,280
noise. That means if we have one qubit, we
don't need these many physical qubits to
99
00:09:17,920 --> 00:09:24,480
have one logical one because it is a
topological one with no with entrenched
100
00:09:24,480 --> 00:09:30,720
error correction. One could say by the
physical nature. So you also run a blood
101
00:09:30,720 --> 00:09:36,080
cells. Fittingly, it was called the
elusive marihuana particle because yes,
102
00:09:36,080 --> 00:09:42,400
we've been waiting for 10 years for this
sort of maiorana qubit. But there was this
103
00:09:42,400 --> 00:09:49,440
scandal. The big maiorana qubits
wasn't the big one. After all, they had to
104
00:09:49,440 --> 00:09:56,560
retract the paper that said they found
one. So we're still looking for it. Yeah.
105
00:09:56,560 --> 00:10:01,440
But then again, it is better to have a few
noisy physical qubits than none at all.
106
00:10:03,280 --> 00:10:08,080
So, yes, quantum computing is full of
challenges. You've seen the wiring.
107
00:10:08,800 --> 00:10:15,440
Getting so many wires into one of those
cryogenic fridges is very difficult. So we
108
00:10:15,440 --> 00:10:23,760
have to find new ways to get see my those
those control those little controllers
109
00:10:23,760 --> 00:10:28,720
into that fridge. So we have to reduce the
wiring, for example. And that's not a
110
00:10:28,720 --> 00:10:34,320
trivial task because you get a lot of
resistance when you go colder for four
111
00:10:34,320 --> 00:10:39,600
cables, for example. We're advancing
microwave technologies with quantum
112
00:10:39,600 --> 00:10:46,560
computers. And one thing that kind of
worries me the most is that we don't have
113
00:10:46,560 --> 00:10:52,000
quantum memory yet. So cue run from random
access memory because at the moment, a
114
00:10:52,000 --> 00:10:56,880
quantum computer is just an accelerator.
So it's a read only memory. So everything
115
00:10:56,880 --> 00:11:02,640
that is on the chip or on the qubits, on
the setup that is read out like that you
116
00:11:02,640 --> 00:11:07,680
can store them or you can do any more
meaningful computation. So that's a huge
117
00:11:07,680 --> 00:11:12,880
bottleneck. Another thing is the ethical
dimension we have to use in
118
00:11:12,880 --> 00:11:18,240
superconducting quantum computers. A lot
of helium and helium has supply
119
00:11:18,240 --> 00:11:22,480
bottlenecks, with just two companies Qatar
Gas and then one Northern Texas company
120
00:11:22,480 --> 00:11:27,840
that supplies helium. That is not really
the problem, though, because we need even
121
00:11:29,440 --> 00:11:33,360
something else. We need three helium,
which is an isotope, and that you get by
122
00:11:34,640 --> 00:11:41,040
as a nuclear byproduct for tritium. That's
not something I want to I'm going to count
123
00:11:41,040 --> 00:11:45,760
on, especially because these are limited
resources. And sometimes the components in
124
00:11:45,760 --> 00:11:50,240
quantum computers themselves. They're also
rare earth metal. Those are also limited
125
00:11:50,240 --> 00:11:56,480
resources. And then people keep talking
about democratizing quantum computers. Yet
126
00:11:56,480 --> 00:12:00,400
you have other problems there first. Not
everyone needs access to something that
127
00:12:00,400 --> 00:12:05,920
doesn't, doesn't solve a lot of things
yet. And to be honest with the security
128
00:12:05,920 --> 00:12:13,360
controls in place, it's kind of an open
system already. But yeah, when we look at
129
00:12:13,360 --> 00:12:19,280
quantum, we have to think about the
references. Which specs do you have to
130
00:12:19,280 --> 00:12:22,800
look for? And the magic here is common
sense. I've shown you compared to what,
131
00:12:22,800 --> 00:12:29,440
you know, the components that you know.
And again, the magic is common sense. And
132
00:12:29,440 --> 00:12:34,720
quantum computers are very specific that
quantum technologies, the component of a
133
00:12:34,720 --> 00:12:40,480
quantum computer, the sensors, single
electron sensors that we did. We use an
134
00:12:40,480 --> 00:12:46,320
MRI that we're using spectroscopy for
microscopes and yada yada, even more
135
00:12:46,320 --> 00:12:51,920
things and quantum communication types. So
semiconductors or or something else,
136
00:12:51,920 --> 00:12:58,160
semiconductor components or just our
infrastructure and communication. They can
137
00:12:58,160 --> 00:13:04,240
be part of the quantum technologies as
well. But you have to be also careful.
138
00:13:04,240 --> 00:13:11,120
Everything is quantum now. It's it's quite
the hype. So finance is doing somehow
139
00:13:11,120 --> 00:13:18,000
quantum. I don't know what other companies
think. Well, the buzzwords cyber isn't
140
00:13:18,000 --> 00:13:23,040
enough and used two buzzwords: quantum and
cyber. I'm very curious what they do. Then
141
00:13:23,040 --> 00:13:28,640
there's quantum transportation. I'm lost
here. I don't know what they do. I don't
142
00:13:28,640 --> 00:13:35,182
want to know. And here, I mean, I'm sure
that is pain free. Yeah. You can also have
143
00:13:35,182 --> 00:13:43,182
to be in and actually I really wanted to
find this in April 20 20. Yeah, so quantum
144
00:13:43,182 --> 00:13:49,355
computing is claimed to solve a lot of
today's problems. Some companies claim
145
00:13:49,355 --> 00:13:54,081
they're battling climate change, that
transforming the pharma industry to
146
00:13:54,081 --> 00:13:59,080
transform the finance industry into the
break all encryption in the future, as we
147
00:13:59,080 --> 00:14:05,403
know. So quantum computers will break the
internet in the future. Yet again, looking
148
00:14:05,403 --> 00:14:11,186
at the reasons estimations, not including
the clock speeds or the actual
149
00:14:11,186 --> 00:14:17,043
performance, that's difficult to claim.
But then again, looking at the references
150
00:14:17,043 --> 00:14:23,663
and the facts and the specs, not all claim
these weird things, but the reference
151
00:14:23,663 --> 00:14:30,680
facts like see lobs from IBM. These are
advancements that are meaningful. But then
152
00:14:30,680 --> 00:14:37,157
again, we have this flood of references of
qubids of we're advancing this and that
153
00:14:37,157 --> 00:14:43,013
complexity theory claims. But how are you
going to test these complexity theory
154
00:14:43,013 --> 00:14:48,252
claims? Well, because we don't have the
Quibits, are simulated on a fantasy
155
00:14:48,252 --> 00:14:54,688
machine. And if anyone like this old chap
here had to deal with theoretical
156
00:14:54,688 --> 00:15:03,061
complexity resource estimates a.k.a.
fantasy language. Well, welcome to
157
00:15:03,061 --> 00:15:10,958
imagination land this town. This town is
not a nice place for little fillies all
158
00:15:10,958 --> 00:15:15,042
alone. There are lots of twists and
corners that could lead to the unknown.
159
00:15:15,042 --> 00:15:19,200
Let me guide your way, and I'll be sure to
help you through. You could really use a
160
00:15:19,200 --> 00:15:25,297
friend of the , and luckily, I've picked
my three favorite corners for you. Well,
161
00:15:25,297 --> 00:15:32,352
quantum applications were applicability is
optional. So come on, let's start with the
162
00:15:32,352 --> 00:15:40,216
very well-known topic of optimization and
the beginning of talks. I want premium
163
00:15:40,216 --> 00:15:47,546
power. I want maximum juice. So VSLI
design, what is a VSLI? It's very large
164
00:15:47,546 --> 00:15:52,520
scale integration and it means you need to
partition these little chips that we have.
165
00:15:52,520 --> 00:15:57,621
And the first chip that we had back in the
day was an integrated circuit to help
166
00:15:57,621 --> 00:16:03,768
people hear better. So it was a hearing
aid that Jack Kilby in 1958 designed and
167
00:16:03,768 --> 00:16:09,783
this thoughtful design thought were the
basis of it is the basis for our
168
00:16:09,783 --> 00:16:14,626
technology everywhere, and it's not a
trivial task to design these chips. So you
169
00:16:14,626 --> 00:16:19,792
don't have a lot of waste and we can pack
more and more components on these little
170
00:16:19,792 --> 00:16:25,678
chips. So integrated circuits. If you
don't know anything, IoT is that. Another
171
00:16:25,678 --> 00:16:31,249
problem? The mathematical basis for this
problem is the same for network design or
172
00:16:31,249 --> 00:16:36,521
less waste and manufacturing like stenting
or lasering, even flight scheduling
173
00:16:36,521 --> 00:16:41,232
between cities has this mathematical
problem. Some might know it as bean
174
00:16:41,232 --> 00:16:47,000
packing, max card or multi card problems.
You either seek to minimize or to maximize
175
00:16:47,000 --> 00:16:52,916
an objective. So those commentary problems
are really one of the hardest one to
176
00:16:52,916 --> 00:16:58,782
solve. And I like to call them
combinatorial black magic. These levels of
177
00:16:58,782 --> 00:17:05,659
hard to solve are classes in themselves,
and this is actually a real graph. This is
178
00:17:05,659 --> 00:17:10,295
a Peterson graph, and you can tell it's
it's black magic you might think. This is
179
00:17:10,295 --> 00:17:14,428
not that hard, but I'll show you a
benchmark of max card problems. This one's
180
00:17:14,428 --> 00:17:19,303
NP hard NP complete. This is one of these
fantasy language classes. It just means
181
00:17:19,303 --> 00:17:25,013
that no polynomial time algorithms for max
card in general graphs are known. That
182
00:17:25,013 --> 00:17:29,164
means, again, your time to solution
outlives you, and it's a problem if you
183
00:17:29,164 --> 00:17:33,742
need to wait until your solution comes and
you die before. Or maybe it needs be a
184
00:17:33,742 --> 00:17:38,941
couple of hundred years. I don't know how
long you live, but some say it's almost as
185
00:17:38,941 --> 00:17:45,080
hard as beating cut of meat and dark
souls. But yeah, you don't live to see it.
186
00:17:45,080 --> 00:17:51,810
That's the that's the drawback of this. So
yeah, you might think optimization, it's
187
00:17:51,810 --> 00:17:57,243
black magic, it sounds weird, but you have
heard these terms before. I will
188
00:17:57,243 --> 00:18:02,848
specifically be gung ho and talk about
nature inspired once the physics inspired
189
00:18:02,848 --> 00:18:07,860
algorithms. But, you know, neural networks
you probably know to boost surge linear
190
00:18:07,860 --> 00:18:12,026
programing, mixed integer problem
programing with a branch and cut, you can
191
00:18:12,026 --> 00:18:17,175
see the max cut promise that's in the in
the brown part. And then, of course, other
192
00:18:17,175 --> 00:18:22,270
nature based methods like bad surge,
genetic algorithms of small methods where
193
00:18:22,270 --> 00:18:27,217
it becomes quantum is. And that's that's
what I like about the nature inspired part
194
00:18:27,217 --> 00:18:32,120
the nature inspired optimization
algorithms. For example, they minimize the
195
00:18:32,120 --> 00:18:37,516
Hamiltonian of an icing model. So whatever
mathematical but mathematical basis you
196
00:18:37,516 --> 00:18:43,350
have, you minimize and maximize your
objective. Hamiltonians are something you
197
00:18:43,350 --> 00:18:48,722
use in quantum computing and the icing
model I can explain later free up a little
198
00:18:48,722 --> 00:18:53,957
bit more time. So what we need here to
with classical and quantum computers is
199
00:18:53,957 --> 00:18:59,830
benchmark, so we can compare apples to
apples because classical computer and
200
00:18:59,830 --> 00:19:05,639
quantum computers is more like apples and
bananas. So we need a common ground. And
201
00:19:05,639 --> 00:19:11,960
if you want standardized benchmarks for
such problems, you can Google Chuck SHOOK.
202
00:19:11,960 --> 00:19:18,928
It's a it's an open source benchmark suit,
and you probably see it in the slide. Good
203
00:19:18,928 --> 00:19:24,706
old Professor Katzgrabor. He has written
this benchmark suit and he's gung ho about
204
00:19:24,706 --> 00:19:29,091
cats, so please spare him of cat content.
So, yeah, I told you we'll get into the
205
00:19:29,091 --> 00:19:36,985
max cut benchmarks. This is from a paper
of Cambridge, I think Cambridge quantum
206
00:19:36,985 --> 00:19:43,814
computing and these little circles, these
little dots, steel nodes. And you can see
207
00:19:43,814 --> 00:19:49,682
they have done they've done it on a
quantum computer for ten nodes. And it's
208
00:19:49,682 --> 00:19:55,392
very complicated. Yeah. And the problem
here is when they went to 13 or twenty
209
00:19:55,392 --> 00:19:59,846
three qubits, logic of qubits, they had to
simulate it. They had to put it on a
210
00:19:59,846 --> 00:20:04,710
fantasy machine and classical hardware.
And yeah, that's that's also one algorithm
211
00:20:04,710 --> 00:20:11,132
they used. Vicki variational quantum ion
solver and Qrolla, both of these are
212
00:20:11,132 --> 00:20:16,604
approximate algorithms you can think of
very noisy, annoying quantum computers
213
00:20:16,604 --> 00:20:23,802
that don't spit out results. But if you
run it 100 times, the majority of it will
214
00:20:23,802 --> 00:20:29,100
be towards the correct regime. And yeah,
that's that's how you go about it. And
215
00:20:29,100 --> 00:20:33,880
this is a relatively new paper, and I have
to say these resource estimations, these
216
00:20:33,880 --> 00:20:38,931
are amazing results, and I'm not worried
about the algorithmic advances in quantum
217
00:20:38,931 --> 00:20:43,437
computing because we have smart people and
I want more smart people. So if you want
218
00:20:43,437 --> 00:20:47,560
to, you should get into it. So, yeah,
that's that's not what I'm worried about
219
00:20:47,560 --> 00:20:53,980
yet. I don't want to solve something for
ten qubits or sorry, ten nodes on a
220
00:20:53,980 --> 00:21:01,184
quantum computer, yet we can solve
something bigger. So this is from another
221
00:21:01,184 --> 00:21:06,623
paper from a nature inspired, physics
inspired algorithm. Some already call it
222
00:21:06,623 --> 00:21:12,432
quantum inspired. These are 100 nodes, but
at the lowest, you can see the physics
223
00:21:12,432 --> 00:21:19,421
inspired GNN and Pi G, and they managed to
do it with a ten thousand nodes. So on
224
00:21:19,421 --> 00:21:24,722
classical hardware, the quantum the
quantum algorithm put on classical
225
00:21:24,722 --> 00:21:29,836
hardware to overcome the cube hardware
limitations by treating these physics
226
00:21:29,836 --> 00:21:34,731
algorithms as optimizes. So from a
business perspective, if I want to have
227
00:21:34,731 --> 00:21:41,046
maximum power and maximum Dru's, I would
use classical computers and use heuristics
228
00:21:41,046 --> 00:21:47,948
from quantum and classical until the
quantum computers are ready. So, yeah,
229
00:21:47,948 --> 00:21:53,328
neuro, I'm sorry. Nature inspired
optimization with quantum algorithms.
230
00:21:53,328 --> 00:21:58,990
That's like putting neural networks on
steroids. Quite like that. This is the
231
00:21:58,990 --> 00:22:06,613
paper for it. But yes, we've been far deep
into one corner. So I'll drag you back
232
00:22:06,613 --> 00:22:13,114
here and I'll show you another one. Some
companies claim we were solving climate
233
00:22:13,114 --> 00:22:18,718
change with it. We're transforming pharma.
And yeah, this comes from from ideas of
234
00:22:18,718 --> 00:22:26,047
physicists. What I said. Well, the nature
is quantum mechanical. We might as well
235
00:22:26,047 --> 00:22:32,202
need quantum phenomena to simulate what is
right. But yes, it's not that easy. This
236
00:22:32,202 --> 00:22:38,313
physicists played bongos and strip clubs.
He's a real hero. Many of the physicists
237
00:22:38,313 --> 00:22:44,000
he's known for that are talking about
chemistry. Here's ammonia. You don't think
238
00:22:44,000 --> 00:22:49,297
this is difficult, but ammonia is used for
a lot of things in the world who use it as
239
00:22:49,297 --> 00:22:55,240
a base, if there's something acidic, you
use it as a fertilizer, you use it in a
240
00:22:55,240 --> 00:23:02,687
lot of things in chemistry and even raw
latex is has been transported with it or
241
00:23:02,687 --> 00:23:09,543
anything that has an acidic nature. You
get it by a very difficult process. Well,
242
00:23:09,543 --> 00:23:14,765
it's not a difficult but energy
expenditure high one. So you need high
243
00:23:14,765 --> 00:23:20,246
temperatures and high energies to put it
into the harbor Bosch process, and it
244
00:23:20,246 --> 00:23:24,801
accounts for two percent of the global
energy expenditure. It's a very famous
245
00:23:24,801 --> 00:23:30,269
problem that quantum physicists wanted to
solve because it's really useful stuff
246
00:23:30,269 --> 00:23:36,631
ammonia. And if we can cut two percent of
the global energy expenditure, that's a
247
00:23:36,631 --> 00:23:42,559
good thing. It's not trivial, though,
Richard said it. It's not an easy thing to
248
00:23:42,559 --> 00:23:49,079
do here. You can see just the active side
of an enzyme where you can produce ammonia
249
00:23:49,079 --> 00:23:54,608
without high temperature and high energy.
Bacteria can do it by room temperature,
250
00:23:54,608 --> 00:24:01,003
ambient temperatures. There's algae.
That's all types of bacteria that can do
251
00:24:01,003 --> 00:24:08,156
it, and the active side is called from
FeMoco. You can see the resource estimates
252
00:24:08,156 --> 00:24:14,237
for half of the sides, for the for the
energy to simulate, to see how this works,
253
00:24:14,237 --> 00:24:19,840
because bacteria can do it. We don't know
how they do it. That's why we use so much
254
00:24:19,840 --> 00:24:25,440
energy in temperature. The enzyme and the
material looks like this. And then again,
255
00:24:25,440 --> 00:24:31,766
look back at the computer for both parts.
We need over 2000 logical qubits. Now,
256
00:24:31,766 --> 00:24:38,266
think back, physical qubits are by a
factor of 20 or 100 more. So we're not
257
00:24:38,266 --> 00:24:44,038
here yet. Then again, classical computers
can simulate it either, and we will
258
00:24:44,038 --> 00:24:49,006
probably simulated that on quantum, but
we're not there yet. And to put it into
259
00:24:49,006 --> 00:24:55,800
perspective, to the far right the orange
little molecules to form local bits in the
260
00:24:55,800 --> 00:25:02,014
whole enzyme. And you might wonder what is
the THC cost while that's tens or hyper
261
00:25:02,014 --> 00:25:06,640
contraction, so you algorithmic
advancements, I'm not so worried about.
262
00:25:08,080 --> 00:25:13,840
We're pushing, we're pushing the frontiers
there. So yeah, but but the imagination
263
00:25:13,840 --> 00:25:17,760
land, the most powerful magic is common
sense, and you should read it. So what do
264
00:25:17,760 --> 00:25:23,360
you think? Do you want to use a quantum
computer or intermediate steps to find out
265
00:25:23,360 --> 00:25:30,000
what we need? Well, what people do these
days is they're bit smarter and they do
266
00:25:30,000 --> 00:25:35,440
simulated. They do use some digital parts,
but it's mostly haptic. Haptic means they
267
00:25:35,440 --> 00:25:40,320
simulate a little bit and they tested in a
lab and got it tested in the lab. They can
268
00:25:41,440 --> 00:25:46,160
funnel down what they need to simulate.
The paper I'm talking about for the
269
00:25:46,160 --> 00:25:51,200
smokable and theological cubits is a very
recent one, so it's just a couple of days
270
00:25:51,200 --> 00:25:56,080
it's been published and I think this is a
preprint even. And if you want to know
271
00:25:56,080 --> 00:26:00,080
anything about resource estimates and
quantum computing for chemistry,
272
00:26:00,080 --> 00:26:07,040
specifically Nathan Vibha and Ryan
Burbuja, a good place to look for. Then we
273
00:26:07,040 --> 00:26:11,360
are still a quantum applications for
applicability is optional and it has been
274
00:26:11,360 --> 00:26:16,400
true so far, hasn't it? Let's move to a
corner that hits closer to home,
275
00:26:16,400 --> 00:26:25,520
cybersecurity. We have to be specific
here. I know a lot of companies claim
276
00:26:25,520 --> 00:26:30,080
there won't be any type of encryption as
we know of in the future, because quantum
277
00:26:30,080 --> 00:26:37,197
computers will break it off for once a
year to fifty sixty five fifty six years.
278
00:26:37,197 --> 00:26:47,200
As bad as 256 bit mode can be broken by
quantum computers and symmetric key size
279
00:26:47,200 --> 00:26:52,880
symmetric encryption methods are known to
be quantum secure the specific key size.
280
00:26:52,880 --> 00:26:59,440
So not really. What people usually think
of as asymmetric encryption. So, yeah,
281
00:27:00,800 --> 00:27:07,120
these are some resource estimates to look
out for. This is a Microsoft paper not too
282
00:27:07,120 --> 00:27:10,880
long ago, and they said through a punch
line, it is easier to break elliptic curve
283
00:27:10,880 --> 00:27:17,360
encryption than RSA. Then Google, not too
long ago, came up with two million noisy
284
00:27:17,360 --> 00:27:25,360
qubits or physical qubits to break RSA
2048 bit in eight hours. And then also the
285
00:27:25,360 --> 00:27:31,902
news paper saying that factoring a 2048
bit RSA integer can be done in one hundred
286
00:27:31,902 --> 00:27:36,240
and seventy seven days with about a little
bit more than 13000 qubits, but with a
287
00:27:36,240 --> 00:27:41,360
multimodal memory that does not exist yet.
These are incredible results over the
288
00:27:41,360 --> 00:27:47,280
years in resource estimation numbers. Yet
again, let's put it into perspective. So
289
00:27:47,280 --> 00:27:55,520
2012 he said, it's a billion in this year.
2021 isn't over yet. This year, Google
290
00:27:55,520 --> 00:28:01,040
came up with 20 million noisy qubits and
then Gaussian came up with a little bit of
291
00:28:01,040 --> 00:28:05,440
thousand or more, but let alone any
workable implementation of curium as a
292
00:28:05,440 --> 00:28:09,360
purely theoretical nature as of now. So
we're still in imagination land when it
293
00:28:09,360 --> 00:28:15,920
comes to breaking the internet as we know
it. It's time to leave Fantasyland, or you
294
00:28:15,920 --> 00:28:22,080
might say, hey, but we did factor
relatively high numbers back there in
295
00:28:22,080 --> 00:28:27,360
2013. You've heard this in the news. Well,
yes, we did. But if you know the base
296
00:28:27,360 --> 00:28:34,160
beforehand, so if you know that with
thirty five, the number thirty five, you
297
00:28:34,160 --> 00:28:39,760
can divide by five or seven if you know
one base, that's a really easy thing to do
298
00:28:39,760 --> 00:28:44,880
and you can do that classically as well.
So IBM had to counter published that they
299
00:28:44,880 --> 00:28:49,680
were oversimplifying quantum factoring,
and the algorithm you use for it is
300
00:28:49,680 --> 00:28:54,000
Schwar's algorithm. It's one of the
purebreds quantum algorithms out there.
301
00:28:54,720 --> 00:28:57,920
And then again, another one pretending to
fact the large numbers and quantum
302
00:28:57,920 --> 00:29:05,920
computers. So no, we haven't been able to
break it so far. Another one in 2019, and
303
00:29:05,920 --> 00:29:10,080
this is in very, very interesting one
because IBM goes close to these problems
304
00:29:10,080 --> 00:29:13,360
and says, yeah, well, I want to test it. I
want to simulate it. A sorry, not
305
00:29:13,360 --> 00:29:18,400
simulated. I want to test it literally in
quantum hardware. And they did so, but
306
00:29:18,400 --> 00:29:28,080
they failed to factor just the number 35.
So I think we're safe for some time. You
307
00:29:28,080 --> 00:29:33,600
have to think of quantum computers not as
a quantum threat, but more as a quantum
308
00:29:33,600 --> 00:29:39,120
advantage. If someone knows how to steer
encrypted data and store it about 20 years
309
00:29:39,120 --> 00:29:44,720
to decrypt it, you know, get it now and
decrypted 20 years later and stored
310
00:29:44,720 --> 00:29:48,832
somewhere, they probably know where to get
it unencrypted as well. They're more low
311
00:29:48,832 --> 00:29:53,200
hanging fruit for them, and I don't think
they will wait until the quantum computer
312
00:29:53,760 --> 00:29:58,640
comes into fruition to do these sort of
things. So let's put the quantum thread
313
00:29:58,640 --> 00:30:04,720
into perspective. Quantum computers are
logical extensions of Moore's law strand,
314
00:30:05,360 --> 00:30:10,560
and quantum computers are tailor made for
simulating the behavior of quantum systems
315
00:30:10,560 --> 00:30:16,400
like molecules or materials, and whether
they lead to breakthroughs in cryptography
316
00:30:16,400 --> 00:30:21,040
or optimization problems. That is less
clear yet, but we're we're pushing the
317
00:30:21,040 --> 00:30:26,160
boundaries. If anything, components of
quantum computers are pushing the
318
00:30:26,160 --> 00:30:31,280
boundaries for us literally now, if we
have better seeds like quantum random
319
00:30:31,280 --> 00:30:38,400
number generators for short Q, R and GS,
that is very useful. We need seeds that
320
00:30:38,400 --> 00:30:42,560
are truly random. For example, in places
where we can't use true random number
321
00:30:42,560 --> 00:30:47,200
generators that use entropy to generate
the random numbers because in a data
322
00:30:47,200 --> 00:30:52,160
center, you don't want a lot of entropy,
so you don't want temperature diversity,
323
00:30:52,160 --> 00:30:59,680
you want it to be cold and stay cold, or
sometimes you don't have the possibility
324
00:30:59,680 --> 00:31:09,760
of having this anywhere where it's just
not there. So we do make things smaller
325
00:31:09,760 --> 00:31:13,600
with it as well. You've seen the wiring,
so we have to design microwave technology
326
00:31:13,600 --> 00:31:18,720
or any type of cabling, any types of
chips, um, pre processes that can go into
327
00:31:19,760 --> 00:31:27,040
smaller and smaller spaces. So yes, we do
need quantum computers and the research
328
00:31:27,040 --> 00:31:32,400
around it. We don't need it in business
settings just yet because they're not
329
00:31:32,400 --> 00:31:38,480
ready. This is still very much fundamental
research, and we should note that so
330
00:31:39,760 --> 00:31:45,200
mathematical concepts are more useful to
find. Also new ciphers when we're talking
331
00:31:45,200 --> 00:31:49,040
about cyber security. And I'm not talking
specifically about peak. You see, there
332
00:31:49,040 --> 00:31:52,560
are other mathematical mathematical
concepts for asymmetric and symmetric
333
00:31:52,560 --> 00:31:58,240
encryption that can be that can be used.
But for now, let's leave imagination land,
334
00:31:58,800 --> 00:32:03,612
and let's think about how quantum
computers interface with the world. Well,
335
00:32:03,612 --> 00:32:11,302
I've shown you before that quantum
computers sometimes have a crude and
336
00:32:11,302 --> 00:32:15,525
fridge, so if you look at the cylinder,
you see the the enclosure of it. So this
337
00:32:15,525 --> 00:32:21,472
specific example, I use a superconducting
computer for now, I've told I've told you
338
00:32:21,472 --> 00:32:27,398
before we need a host CPU and then a
control system. Lots of peripherals and
339
00:32:27,398 --> 00:32:33,108
wiring to get into the cryogenic stage and
the enclosure. And there we usually have
340
00:32:33,108 --> 00:32:38,757
an analog to digital digital interface.
And at the bottom where it's the cold is
341
00:32:38,757 --> 00:32:45,317
the qbu. So you can think of it as, yeah,
a huge system. So this is an example of
342
00:32:45,317 --> 00:32:50,333
Google's setup. And I think the key
concept that needs to be highlighted here
343
00:32:50,333 --> 00:32:55,053
is the quantum computers are merely core
processes. And as such, they depend on
344
00:32:55,053 --> 00:32:59,608
traditional compute environments to host a
quantum processing unit, a cube you
345
00:32:59,608 --> 00:33:04,108
require as an analog to digital interface
to to convert those signals back and forth
346
00:33:04,108 --> 00:33:09,482
and in turn, the application logic in the
host CPU. You may connect to a network
347
00:33:09,482 --> 00:33:14,921
may. Some people think if I have it in the
lab and it's not connected to anything,
348
00:33:14,921 --> 00:33:20,160
there's must be air gapped. But then
again, you know how loud these devices
349
00:33:20,160 --> 00:33:26,560
are. So you kind of want RTP so people
don't become death and we've corona, you
350
00:33:26,560 --> 00:33:32,484
kind of want people to work from home as
well, so they won't be arrogant. For the
351
00:33:32,484 --> 00:33:38,024
foreseeable future, I guess we're for the
next year at least. So the issue of cyber
352
00:33:38,024 --> 00:33:43,063
security and mass and quantum computing
resources that is rarely discussed, these
353
00:33:43,063 --> 00:33:47,898
systems are and they will be hybrid
systems for the foreseeable future with
354
00:33:47,898 --> 00:33:53,781
those CPU hosts with cloud based or
managed APIs. And we need reliable
355
00:33:53,781 --> 00:33:59,239
services and secure services and
architectures as this arises. So
356
00:33:59,239 --> 00:34:05,209
subsequently, the critical applications
and data these systems will handle and
357
00:34:05,209 --> 00:34:13,408
store if it's the knowledge and the
algorithms, how to how to simulate for
358
00:34:13,408 --> 00:34:21,853
Mocko we can produce the ammonia with less
energy expenditure if we design new
359
00:34:21,853 --> 00:34:27,320
batteries. These are probably patents, so
we want to secure the data behind it and
360
00:34:27,320 --> 00:34:33,240
those algorithms. So this means that all
classical security best practices hold for
361
00:34:33,240 --> 00:34:39,238
quantum computers. So this example, the QC
lab at Google, sees enterprise system
362
00:34:39,238 --> 00:34:46,141
constituted of a mix of Windows, macOS,
Linux, maybe Azure, Adi, SAS network,
363
00:34:46,141 --> 00:34:52,840
containers, whatever platforms. And
they're part of these industrial control
364
00:34:52,840 --> 00:34:58,880
systems and programable logic controllers,
pulses or discrete process control
365
00:34:58,880 --> 00:35:04,516
systems. You know, anything in ICS, Escada
that is rarely air gapped or physically
366
00:35:04,516 --> 00:35:09,018
means physically separated from any
network. So we need API hardening. I see
367
00:35:09,018 --> 00:35:14,219
our security is not a big topic in quantum
computing yet because it's still just a
368
00:35:14,219 --> 00:35:21,280
system on the internet, and it's not quite
ripe yet. People sell it and companies put
369
00:35:21,280 --> 00:35:29,557
sensible data on there. So if this is back
in the day got infected with the MIMO worm
370
00:35:29,557 --> 00:35:35,673
that was considered air gapped. No, I CS
system is truly, really arrogant anymore.
371
00:35:35,673 --> 00:35:41,141
So before we offer quantum computing as
breakthrough accelerators, we need to make
372
00:35:41,141 --> 00:35:46,240
them safe to use. So if you want to join
me, let's protect quantum computers from
373
00:35:46,240 --> 00:35:51,250
getting pond. Thank you for listening to
me. That's talk.
374
00:35:51,250 --> 00:35:59,713
Herald: Thank you so much. Um, we have
some time for questions. So, uh. Audience,
375
00:35:59,713 --> 00:36:06,109
dear audience, please ask some questions.
The hashtags are on Mastodon and Twitter
376
00:36:06,109 --> 00:36:17,787
hashtag RC3Chaos Zone, and the I.R.C. room
is the Channel RC three Dash Chaos Zone.
377
00:36:17,787 --> 00:36:30,125
All right, and I will watch the questions.
All right. We have some questions already.
378
00:36:30,125 --> 00:36:41,760
Herald: What do you think about rolling
out so-called post-quantum cryptography
379
00:36:41,760 --> 00:36:47,520
now?
Natalie: Oh yeah. Post quantum crypto, I
380
00:36:47,520 --> 00:36:54,560
know it's been. It's been a useful concept
promised and they have a never specific
381
00:36:55,120 --> 00:37:00,800
problem in mind. And this is for the
national security and probably the
382
00:37:00,800 --> 00:37:06,560
government, for infrastructure and in the
U.S. specifically. But they're thinking
383
00:37:06,560 --> 00:37:10,240
of, along lived systems, the pig. You see,
you have the problem. It's highly
384
00:37:10,240 --> 00:37:15,280
computationally intensive. So a lot of
infrastructure can't, can't cope with it.
385
00:37:15,280 --> 00:37:21,440
So we need to deploy other infrastructure.
And if you're worried about your data,
386
00:37:21,440 --> 00:37:26,320
you're in the intelligence behind your
data being stolen and then, you know, say,
387
00:37:26,320 --> 00:37:33,040
for 20 years. Not many companies have
secrets that you can store for that intel
388
00:37:33,040 --> 00:37:39,600
isn't that specific data that data steal
and store that is useful. So if you have
389
00:37:39,600 --> 00:37:44,000
data, doesn't intelligence lie for over 20
years yet? It's useful if it's a
390
00:37:44,000 --> 00:37:48,880
government side of, you know, it's a
nuclear bomb placed side or something very
391
00:37:48,880 --> 00:37:56,080
critical. Yes, you have to think about it
now, and we do need time to implement the
392
00:37:56,080 --> 00:38:01,040
infrastructure. And I mean, the hits close
to home. We've heard about crypto agility
393
00:38:01,040 --> 00:38:06,240
to think that we would like to have, but
it's it's not the reality. We just have
394
00:38:06,240 --> 00:38:11,280
legacy systems. We have to keep them
running. And especially if it's critical
395
00:38:11,280 --> 00:38:14,480
infrastructure, you can just turn it off,
build something new and turn it all and it
396
00:38:14,480 --> 00:38:20,640
has to work throughout. So you see is
useful for some problems, but not for all.
397
00:38:20,640 --> 00:38:26,960
It's not a one fits all glove.
Herald: All right. All right, thank you.
398
00:38:28,560 --> 00:38:36,880
The next question is, you talked about the
current number of qubits and how no
399
00:38:36,880 --> 00:38:43,440
practical problem, a lack of the difficult
problems that the people are hopeful for
400
00:38:43,440 --> 00:38:50,080
quantum computers to solve. The technology
isn't there yet due to the low number of
401
00:38:50,080 --> 00:38:56,640
qubits. Would it make sense to serialize
the problems and run them on low qubit
402
00:38:56,640 --> 00:39:05,360
count quantum computers? Does that work?
Natalie: I think I might not understand
403
00:39:05,360 --> 00:39:13,680
the question fully, but I assume you mean
you package these little programs and I've
404
00:39:13,680 --> 00:39:19,520
shown you the algorithm, the THC, the
tensor hyper contraction algorithm that
405
00:39:19,520 --> 00:39:26,720
the chemical guys have used where we do
these sort of things. But then again, one
406
00:39:26,720 --> 00:39:33,440
qubit you can think of roughly as one
transistor and you just need a couple more
407
00:39:33,440 --> 00:39:40,080
than five or 10 to do meaningful
computations, as you've seen. That is a
408
00:39:40,080 --> 00:39:47,120
very good question that we do package
these problems into smaller bits. And if
409
00:39:47,120 --> 00:39:53,200
you go back into the slides or look into
the the the paper of Nathan Vibha and
410
00:39:53,200 --> 00:39:56,880
Rayen Babbush around because you see that
you need still about more than two
411
00:39:56,880 --> 00:40:02,480
thousand logical qubits, so you're spot
on. This is the direction that they wanted
412
00:40:02,480 --> 00:40:07,200
to go and we have to go and there to try
to. Unfortunately, we still need more than
413
00:40:07,200 --> 00:40:10,924
a couple of hundred.
Herald: So are there any current quantum
414
00:40:10,924 --> 00:40:14,568
computers that are programable to do
something useful?
415
00:40:14,568 --> 00:40:20,324
Natalie: I mean, it depends really useful.
It's very educational to use them. If you
416
00:40:20,324 --> 00:40:26,056
want to have a have a workforce in 10
years that knows how to use them, you need
417
00:40:26,056 --> 00:40:30,600
to do. You need to have, you know,
postdocs or master students who know how
418
00:40:30,600 --> 00:40:36,395
to program these things. We need to know
how to write better compilers. What are
419
00:40:36,395 --> 00:40:42,731
the what are the bottlenecks, how we can
swap gates, quantum gates? Some of these
420
00:40:42,731 --> 00:40:47,764
are operations on a quantum computers. So
how we can swap these things and there
421
00:40:47,764 --> 00:40:52,875
that's a useful thing for them to do in
any stage are workable quantum computer.
422
00:40:52,875 --> 00:40:57,166
Just a few qubits is still needed to
advance the field and to advance the
423
00:40:57,166 --> 00:41:03,262
workforce. So for me, it is still useful.
Herald: All right. Yea, it makes sense.
424
00:41:03,262 --> 00:41:10,195
What do you see as candidates for earliest
productive uses of quantum computers?
425
00:41:10,195 --> 00:41:15,659
Natalie: Oh, so you mean the question of
the killer application for quantum
426
00:41:15,659 --> 00:41:21,680
computers? That's a difficult one. So for
cryptography or for optimization of I've
427
00:41:21,680 --> 00:41:29,560
said it before, it's less clear. But for
chemistry, once we hit those 20000 or more
428
00:41:29,560 --> 00:41:37,114
logical qubits, we'll see advancements and
catalysts. You see it from local molecules
429
00:41:37,114 --> 00:41:42,998
to active side for the nitrogenous to to
get ammonia at room temperature. And
430
00:41:42,998 --> 00:41:49,437
that's where I see the advancements for
four small catalysts for get alloys and
431
00:41:49,437 --> 00:41:54,633
metals to find better storage batteries.
There's there's still a field out there
432
00:41:54,633 --> 00:41:59,619
that we have that we couldn't simulate on
classical because it's quite intractable.
433
00:41:59,619 --> 00:42:04,053
But we're pushing the field and I think
chemistry could be one of the first ones
434
00:42:04,053 --> 00:42:08,665
that's just not there yet.
Herald: All right. Do you also think
435
00:42:08,665 --> 00:42:13,080
that'll be the earliest one's chemistry
applications?
436
00:42:13,080 --> 00:42:18,189
Natalie: Small molecules for catalysts?
Yes, they could be. I mean, the smarter
437
00:42:18,189 --> 00:42:23,929
people than me out there might have better
ideas. Maybe design a completely new
438
00:42:23,929 --> 00:42:28,080
battery storage or I mean, ammonia is
being used in fuel cells as well for
439
00:42:28,080 --> 00:42:34,600
storage. Maybe they'll simulate how to get
ammonia, cheaper energy expenditure wise
440
00:42:34,600 --> 00:42:42,824
and then use it to store, have better
storage and fuel cells yet. I mean, there
441
00:42:42,824 --> 00:42:49,649
are some quantum computing services out
there that are kind of interesting depends
442
00:42:49,649 --> 00:42:53,720
what you're looking for. Yes. In
Cambridge, quantum computing offers a
443
00:42:53,720 --> 00:42:58,261
three qubit encryption suite if you want
to do QCD. I mean, it's a fun toy game.
444
00:42:58,261 --> 00:43:02,801
I'm not sure if it's very business
relevant, but if you want to look at your
445
00:43:02,801 --> 00:43:07,424
current infrastructure could hold it.
That's an interesting one. Quantum
446
00:43:07,424 --> 00:43:15,597
communication components, especially in
that part of the quantum tech world, is
447
00:43:15,597 --> 00:43:22,220
more advanced and more ripe. So a lot of
devices in quantum communication you can
448
00:43:22,220 --> 00:43:29,889
use now already. So it's just about your
risk appetite. Do you want to, well, spend
449
00:43:29,889 --> 00:43:35,960
a lot of money on it? Do you want to
invest into it and try it out? There are
450
00:43:35,960 --> 00:43:42,361
some test beds in Berlin and Paris where
they're trying out QKD networks yet.
451
00:43:42,361 --> 00:43:47,061
You know, this is telecom. This is not
quantum computing, but it would be the
452
00:43:47,061 --> 00:43:50,493
backbone if we want to have a quantum
internet where then again, quantum
453
00:43:50,493 --> 00:43:56,240
computers are useful. So everything is
useful because it's it's an intermediate
454
00:43:56,240 --> 00:44:01,932
step towards something you would like to
have. But most of the things in quantum
455
00:44:01,932 --> 00:44:06,226
computers, they don't fit classical
solutions yet.
456
00:44:06,226 --> 00:44:13,120
Question: All right. You talked about the
attack vectors on quantum computers and
457
00:44:14,400 --> 00:44:18,800
dramatizing this a little bit. And what is
the worst case of the quantum computer
458
00:44:18,800 --> 00:44:22,080
getting on?
Natalie: I mean, worst case is some
459
00:44:22,080 --> 00:44:27,440
company has their sensible business data
on it, and they harvest that. I mean,
460
00:44:27,440 --> 00:44:32,400
because they're not, you know, they're not
critical components as of yet. And there
461
00:44:32,400 --> 00:44:36,960
are a lot of down times because they have
to recalibrate them, you know, get them
462
00:44:36,960 --> 00:44:42,480
off the grid, see if the fridge works or
do some sort of maintenance. You don't
463
00:44:42,480 --> 00:44:50,080
have to use usually SLS with them yet, but
think about all these companies that don't
464
00:44:50,080 --> 00:44:56,560
know what they're doing, and they might
have, you know, the critical data up there
465
00:44:56,560 --> 00:45:02,240
in the cloud pushing it there. And if the
API isn't, isn't hard and if it's, you
466
00:45:02,240 --> 00:45:06,880
know, open access for everything, they may
just have low hanging fruit to pick out
467
00:45:06,880 --> 00:45:12,880
their.
Herald: Thank you so much, Nacho. This was
468
00:45:12,880 --> 00:45:20,640
tales from the quantum industry. Bye
Nacho. Thank you. Thank you. All right.
469
00:45:20,640 --> 00:45:28,560
Our next talk will be at 17:30. What is
Algarve? It's about a community that live
470
00:45:28,560 --> 00:45:34,660
codes music and celebrates the artifacts
and the algorithms that they use.
471
00:45:34,660 --> 00:45:45,225
RC3 postroll music
472
00:45:45,225 --> 00:45:48,549
Subtitles created by c3subtitles.de
in the year 2022. Join, and help us!