< Return to Video

Tales from the Quantum Industry

  • 0:00 - 0:08
    rc3 preroll music
  • 0:08 - 0:15
    Herald: And welcome back from our studio
    live, as you could see in Halle! laugh The next
  • 0:15 - 0:19
    talk will be Natalie Kilber. She will talk
    about tales from the quantum industry.
  • 0:20 - 0:25
    Natalie works since many, many years on
    quantum computers to make them real and
  • 0:25 - 0:29
    useful.
  • 0:29 - 0:33
    Natalie: Hi, I'm Natalie, and I've been
    talking about the progress, the prospects
  • 0:33 - 0:39
    and the poppycock, the nonsense of quantum
    technology, or you could also say tales
  • 0:39 - 0:45
    from the quantum industry. A little bit
    about me. I'm a prehistoric creature that
  • 0:45 - 0:50
    has been there since the field emerged.
    I'm the masses of stories for you today
  • 0:50 - 0:55
    and you might ask yourselves, but why are
    you so gung ho about quantum computing,
  • 0:55 - 1:01
    buddy? Well, if you look at the Moore's
    laws trends, then you know, already that
  • 1:01 - 1:07
    since 2000, the clock speeds have been
    kind of stagnating and we're going smaller
  • 1:07 - 1:14
    and smaller, and IBM is going to fabricate
    a chip of about two nanometers in 2023.
  • 1:14 - 1:19
    The problem here is the smaller you go, if
    you go smaller than one nanometer towards
  • 1:19 - 1:24
    sub nano meter scales, then you go into
    the quantum regime. And if you have a
  • 1:24 - 1:29
    single electron transistor, you already
    have a quantum dot. That means that's a
  • 1:29 - 1:33
    qubit, that's part of a quantum computer.
    But it's not reliable for classical
  • 1:33 - 1:40
    computing, for any classical computation.
    So. Well, there we have it. We already are
  • 1:40 - 1:45
    at a quantum regime if we want to go into
    the future. So why do I want quantum
  • 1:45 - 1:53
    computers? I'm gung-ho about speed. I'm
    gung-ho about premium power. I want more
  • 1:53 - 2:01
    juice. So first, look at your PC, now back
    to me now back in your PC. Sadly, it isn't
  • 2:01 - 2:09
    an eight Core i9, or maybe it is so yet.
    Are you happy about your wiring? Well, I
  • 2:09 - 2:14
    don't know why, but this fellow's also
    happy as a muffin about his wiring. This
  • 2:14 - 2:19
    is a quantum computer in Google's lab, and
    you can see the wiring is not trivial for
  • 2:19 - 2:24
    this. And this is just one little chip. So
    a quantum computer is an accelerator, and
  • 2:24 - 2:33
    you need a co-host CPU to to do any sort
    of meaningful computation with it. And if
  • 2:33 - 2:36
    you look at the wiring here, there's a
    different type of quantum computer. You
  • 2:36 - 2:41
    see an optical table with optical
    components on it. I think this one is the
  • 2:41 - 2:46
    QuEra startup, and this guy's not that
    happy about his wiring. You can see why.
  • 2:48 - 2:52
    There's lots of other examples that look a
    bit difficult. And here specifically, you
  • 2:52 - 2:59
    see a lot of controls that are sending
    signals into the quantum computer. And
  • 2:59 - 3:06
    this one again, is QuEra with a bit better
    wiring. This is specifically a trapped ion
  • 3:06 - 3:11
    quantum computer, so they use trapped ion.
    Quantum computers don't come in one
  • 3:11 - 3:16
    flavor. We have different flavors with
    different bases of fundamental technology
  • 3:16 - 3:20
    that we use with different types of
    components. So in trapped ions that use
  • 3:20 - 3:25
    photonic components, there are photonic
    computers in itself. And for example, this
  • 3:25 - 3:32
    one is a huge cryogenic fridge. So you go
    up to mini sub Kelvin stages right at the
  • 3:32 - 3:36
    bottom and the first picture you see in it
    without his clothes, without the enclosing
  • 3:37 - 3:43
    the enclave. And then again at the top, the
    massive wiring for just one chip. Then you
  • 3:43 - 3:48
    have other examples like, for example, AQT
    Alpine quantum technologies over there
  • 3:48 - 3:55
    in Austria, and they know how to stuff
    their cables really well and well. You
  • 3:55 - 4:00
    might wonder why am I not talking about
    quantum inhalers? And well, if we define
  • 4:00 - 4:05
    them, if we define quantum computers, so
    legs then a solid is a quantum computer
  • 4:05 - 4:13
    too, you know, why a solid any sort of
    type of plant uses quantum phenomena as
  • 4:13 - 4:19
    well. So because of photosynthesis, the
    light tries to travel as fast as possible
  • 4:19 - 4:23
    to the side, and they do it through
    quantum tunneling and it solves it pretty
  • 4:23 - 4:31
    fast. Yeah. So no quantum inhalers. Then
    look back at your PC, can it stand five
  • 4:31 - 4:36
    gigahertz? You think you're unhappy about
    your clock speed? I think I won the
  • 4:36 - 4:40
    Complaining game a quantum computer can do
    no more than 100 kilohertz, and that's
  • 4:40 - 4:45
    twice the speed of the ENIAC back in the
    day. But then again, don't be so harsh in
  • 4:45 - 4:49
    your setup or on the quantum computers. We
    still tinker with them with the
  • 4:49 - 4:55
    capabilities we have. You've seen in the
    pictures before, there's a lot of wiring
  • 4:55 - 5:02
    there, components that are quite big, that
    haven't been invented yet. So. The
  • 5:02 - 5:07
    bottleneck component of a quantum computer
    of any set up, the slowest component is
  • 5:07 - 5:12
    your bottleneck clock speed or a
    bottleneck in your clock cycle. And that's
  • 5:12 - 5:16
    why they're so slow in quantum computers,
    they have digital signaling processes.
  • 5:16 - 5:21
    That means you have to convert digital
    signals to analog and analog signals to
  • 5:21 - 5:26
    digital signals again. And we have that
    everywhere in our phones and our cameras.
  • 5:26 - 5:32
    Imagine just sound that is analog, that
    has to be converted into digital signals
  • 5:32 - 5:37
    or, you know, literally light photons. If
    you take a photo in two digital signals,
  • 5:37 - 5:43
    that's a analog to digital interface that
    we have. And here, because we're like
  • 5:44 - 5:48
    shooting microwave pulses and, for
    example, superconducting computers and
  • 5:48 - 5:55
    qubits, that's kind of difficult to do.
    So, yeah, you might say, but they are
  • 5:55 - 6:01
    parallel and they do everything a little
    bit different. Yeah. For algorithms, when
  • 6:01 - 6:07
    you have such slow clock speed rates, if
    your time to solution outlives you, that's
  • 6:07 - 6:14
    a problem. If you don't live to see your
    solution, that's too slow and. You might
  • 6:14 - 6:19
    want to listen to your computer, listen.
    So 30 dezibels or 40 decibels? This is
  • 6:19 - 6:47
    what economists. You can hear this.
    Yeah, that's the
  • 6:47 - 6:48
    Woman voices speaks "Welcome to sound of IBM.
  • 6:48 - 6:49
    truth of that sound, but you needed it.
    That's so annoying. One tempers at the.
  • 6:49 - 6:50
    You get into this by this. Then you have
    this wonderful. The nightmare is now. It's
  • 6:50 - 6:54
    a quiet place. But one thing is always the
    same. We always talk about size and with
  • 6:54 - 7:01
    size, I mean, we talk about qubits. You
    might read in Wired or Spiegel or wherever
  • 7:01 - 7:07
    you want and hype articles or just
    articles talking about the advancements in
  • 7:07 - 7:15
    quantum computing, how many qubits they
    they could instantiate on a chip. IBM
  • 7:15 - 7:21
    released about 127 qubits in QuEra bit about 200
  • 7:22 - 7:27
    years. The trapped ion one and IBM was the
    superconducting one of these cylinders and
  • 7:27 - 7:34
    the cryogenic fridges. But here you have
    to discern a lot of physical qubits is
  • 7:34 - 7:39
    good, but a logical qubit is what you need
    for computation. We have a high error rate
  • 7:39 - 7:44
    for just one physical qubit because of the
    noise. Because of temperature. All types
  • 7:44 - 7:48
    of noise. All types of environmental
    factors that you can't eliminate yet,
  • 7:48 - 7:52
    because this is this is quite fundamental
    research how you can control these things
  • 7:52 - 7:57
    and how you can adjust the parameters so
    noise stays low. And then again, we have
  • 7:57 - 8:04
    these types of signals and in our normal
    classical devices where we need parody
  • 8:04 - 8:10
    checks, where we need error correction and
    so do quantum computers. Error correction
  • 8:10 - 8:15
    was a huge field that needs to be
    advanced, and we use things that are
  • 8:15 - 8:20
    called surface codes and these are error
    correcting to get one logical qubit. So we
  • 8:20 - 8:25
    have reliable computation. We need a lot
    of physical qubits. So you could say
  • 8:25 - 8:30
    there's a lot of overhead for those error
    correcting code and parody checks. So if
  • 8:30 - 8:35
    you hear about those, many Qubits have
    been have been accomplished by a company.
  • 8:35 - 8:39
    It's usually physical qubits, but then
    another factor of 20, that's just one
  • 8:39 - 8:46
    logical qubit that you can use. Yeah,
    that's difficult. And there's a famous
  • 8:46 - 8:52
    physicist that said, Well, he's still
    alive, so it's actually on Twitter. And he
  • 8:52 - 8:56
    said, Well, Qubits are like children's
    better to have a few high quality ones
  • 8:56 - 9:02
    than a bunch of noisy ones. Yes, I agree.
    And John John Prescott has been at
  • 9:02 - 9:06
    Microsoft before, and now he's at 8WRS.
    But at Microsoft, we witnessed
  • 9:06 - 9:12
    Maironascandal. Well, we thought we can
    have a topological qubit that has no
  • 9:12 - 9:17
    noise. That means if we have one qubit, we
    don't need these many physical qubits to
  • 9:18 - 9:24
    have one logical one because it is a
    topological one with no with entrenched
  • 9:24 - 9:31
    error correction. One could say by the
    physical nature. So you also run a blood
  • 9:31 - 9:36
    cells. Fittingly, it was called the
    elusive marihuana particle because yes,
  • 9:36 - 9:42
    we've been waiting for 10 years for this
    sort of maiorana qubit. But there was this
  • 9:42 - 9:49
    scandal. The big maiorana qubits
    wasn't the big one. After all, they had to
  • 9:49 - 9:57
    retract the paper that said they found
    one. So we're still looking for it. Yeah.
  • 9:57 - 10:01
    But then again, it is better to have a few
    noisy physical qubits than none at all.
  • 10:03 - 10:08
    So, yes, quantum computing is full of
    challenges. You've seen the wiring.
  • 10:09 - 10:15
    Getting so many wires into one of those
    cryogenic fridges is very difficult. So we
  • 10:15 - 10:24
    have to find new ways to get see my those
    those control those little controllers
  • 10:24 - 10:29
    into that fridge. So we have to reduce the
    wiring, for example. And that's not a
  • 10:29 - 10:34
    trivial task because you get a lot of
    resistance when you go colder for four
  • 10:34 - 10:40
    cables, for example. We're advancing
    microwave technologies with quantum
  • 10:40 - 10:47
    computers. And one thing that kind of
    worries me the most is that we don't have
  • 10:47 - 10:52
    quantum memory yet. So cue run from random
    access memory because at the moment, a
  • 10:52 - 10:57
    quantum computer is just an accelerator.
    So it's a read only memory. So everything
  • 10:57 - 11:03
    that is on the chip or on the qubits, on
    the setup that is read out like that you
  • 11:03 - 11:08
    can store them or you can do any more
    meaningful computation. So that's a huge
  • 11:08 - 11:13
    bottleneck. Another thing is the ethical
    dimension we have to use in
  • 11:13 - 11:18
    superconducting quantum computers. A lot
    of helium and helium has supply
  • 11:18 - 11:22
    bottlenecks, with just two companies Qatar
    Gas and then one Northern Texas company
  • 11:22 - 11:28
    that supplies helium. That is not really
    the problem, though, because we need even
  • 11:29 - 11:33
    something else. We need three helium,
    which is an isotope, and that you get by
  • 11:35 - 11:41
    as a nuclear byproduct for tritium. That's
    not something I want to I'm going to count
  • 11:41 - 11:46
    on, especially because these are limited
    resources. And sometimes the components in
  • 11:46 - 11:50
    quantum computers themselves. They're also
    rare earth metal. Those are also limited
  • 11:50 - 11:56
    resources. And then people keep talking
    about democratizing quantum computers. Yet
  • 11:56 - 12:00
    you have other problems there first. Not
    everyone needs access to something that
  • 12:00 - 12:06
    doesn't, doesn't solve a lot of things
    yet. And to be honest with the security
  • 12:06 - 12:13
    controls in place, it's kind of an open
    system already. But yeah, when we look at
  • 12:13 - 12:19
    quantum, we have to think about the
    references. Which specs do you have to
  • 12:19 - 12:23
    look for? And the magic here is common
    sense. I've shown you compared to what,
  • 12:23 - 12:29
    you know, the components that you know.
    And again, the magic is common sense. And
  • 12:29 - 12:35
    quantum computers are very specific that
    quantum technologies, the component of a
  • 12:35 - 12:40
    quantum computer, the sensors, single
    electron sensors that we did. We use an
  • 12:40 - 12:46
    MRI that we're using spectroscopy for
    microscopes and yada yada, even more
  • 12:46 - 12:52
    things and quantum communication types. So
    semiconductors or or something else,
  • 12:52 - 12:58
    semiconductor components or just our
    infrastructure and communication. They can
  • 12:58 - 13:04
    be part of the quantum technologies as
    well. But you have to be also careful.
  • 13:04 - 13:11
    Everything is quantum now. It's it's quite
    the hype. So finance is doing somehow
  • 13:11 - 13:18
    quantum. I don't know what other companies
    think. Well, the buzzwords cyber isn't
  • 13:18 - 13:23
    enough and used two buzzwords: quantum and
    cyber. I'm very curious what they do. Then
  • 13:23 - 13:29
    there's quantum transportation. I'm lost
    here. I don't know what they do. I don't
  • 13:29 - 13:35
    want to know. And here, I mean, I'm sure
    that is pain free. Yeah. You can also have
  • 13:35 - 13:43
    to be in and actually I really wanted to
    find this in April 20 20. Yeah, so quantum
  • 13:43 - 13:49
    computing is claimed to solve a lot of
    today's problems. Some companies claim
  • 13:49 - 13:54
    they're battling climate change, that
    transforming the pharma industry to
  • 13:54 - 13:59
    transform the finance industry into the
    break all encryption in the future, as we
  • 13:59 - 14:05
    know. So quantum computers will break the
    internet in the future. Yet again, looking
  • 14:05 - 14:11
    at the reasons estimations, not including
    the clock speeds or the actual
  • 14:11 - 14:17
    performance, that's difficult to claim.
    But then again, looking at the references
  • 14:17 - 14:24
    and the facts and the specs, not all claim
    these weird things, but the reference
  • 14:24 - 14:31
    facts like see lobs from IBM. These are
    advancements that are meaningful. But then
  • 14:31 - 14:37
    again, we have this flood of references of
    qubids of we're advancing this and that
  • 14:37 - 14:43
    complexity theory claims. But how are you
    going to test these complexity theory
  • 14:43 - 14:48
    claims? Well, because we don't have the
    Quibits, are simulated on a fantasy
  • 14:48 - 14:55
    machine. And if anyone like this old chap
    here had to deal with theoretical
  • 14:55 - 15:03
    complexity resource estimates a.k.a.
    fantasy language. Well, welcome to
  • 15:03 - 15:11
    imagination land this town. This town is
    not a nice place for little fillies all
  • 15:11 - 15:15
    alone. There are lots of twists and
    corners that could lead to the unknown.
  • 15:15 - 15:19
    Let me guide your way, and I'll be sure to
    help you through. You could really use a
  • 15:19 - 15:25
    friend of the , and luckily, I've picked
    my three favorite corners for you. Well,
  • 15:25 - 15:32
    quantum applications were applicability is
    optional. So come on, let's start with the
  • 15:32 - 15:40
    very well-known topic of optimization and
    the beginning of talks. I want premium
  • 15:40 - 15:48
    power. I want maximum juice. So VSLI
    design, what is a VSLI? It's very large
  • 15:48 - 15:53
    scale integration and it means you need to
    partition these little chips that we have.
  • 15:53 - 15:58
    And the first chip that we had back in the
    day was an integrated circuit to help
  • 15:58 - 16:04
    people hear better. So it was a hearing
    aid that Jack Kilby in 1958 designed and
  • 16:04 - 16:10
    this thoughtful design thought were the
    basis of it is the basis for our
  • 16:10 - 16:15
    technology everywhere, and it's not a
    trivial task to design these chips. So you
  • 16:15 - 16:20
    don't have a lot of waste and we can pack
    more and more components on these little
  • 16:20 - 16:26
    chips. So integrated circuits. If you
    don't know anything, IoT is that. Another
  • 16:26 - 16:31
    problem? The mathematical basis for this
    problem is the same for network design or
  • 16:31 - 16:37
    less waste and manufacturing like stenting
    or lasering, even flight scheduling
  • 16:37 - 16:41
    between cities has this mathematical
    problem. Some might know it as bean
  • 16:41 - 16:47
    packing, max card or multi card problems.
    You either seek to minimize or to maximize
  • 16:47 - 16:53
    an objective. So those commentary problems
    are really one of the hardest one to
  • 16:53 - 16:59
    solve. And I like to call them
    combinatorial black magic. These levels of
  • 16:59 - 17:06
    hard to solve are classes in themselves,
    and this is actually a real graph. This is
  • 17:06 - 17:10
    a Peterson graph, and you can tell it's
    it's black magic you might think. This is
  • 17:10 - 17:14
    not that hard, but I'll show you a
    benchmark of max card problems. This one's
  • 17:14 - 17:19
    NP hard NP complete. This is one of these
    fantasy language classes. It just means
  • 17:19 - 17:25
    that no polynomial time algorithms for max
    card in general graphs are known. That
  • 17:25 - 17:29
    means, again, your time to solution
    outlives you, and it's a problem if you
  • 17:29 - 17:34
    need to wait until your solution comes and
    you die before. Or maybe it needs be a
  • 17:34 - 17:39
    couple of hundred years. I don't know how
    long you live, but some say it's almost as
  • 17:39 - 17:45
    hard as beating cut of meat and dark
    souls. But yeah, you don't live to see it.
  • 17:45 - 17:52
    That's the that's the drawback of this. So
    yeah, you might think optimization, it's
  • 17:52 - 17:57
    black magic, it sounds weird, but you have
    heard these terms before. I will
  • 17:57 - 18:03
    specifically be gung ho and talk about
    nature inspired once the physics inspired
  • 18:03 - 18:08
    algorithms. But, you know, neural networks
    you probably know to boost surge linear
  • 18:08 - 18:12
    programing, mixed integer problem
    programing with a branch and cut, you can
  • 18:12 - 18:17
    see the max cut promise that's in the in
    the brown part. And then, of course, other
  • 18:17 - 18:22
    nature based methods like bad surge,
    genetic algorithms of small methods where
  • 18:22 - 18:27
    it becomes quantum is. And that's that's
    what I like about the nature inspired part
  • 18:27 - 18:32
    the nature inspired optimization
    algorithms. For example, they minimize the
  • 18:32 - 18:38
    Hamiltonian of an icing model. So whatever
    mathematical but mathematical basis you
  • 18:38 - 18:43
    have, you minimize and maximize your
    objective. Hamiltonians are something you
  • 18:43 - 18:49
    use in quantum computing and the icing
    model I can explain later free up a little
  • 18:49 - 18:54
    bit more time. So what we need here to
    with classical and quantum computers is
  • 18:54 - 19:00
    benchmark, so we can compare apples to
    apples because classical computer and
  • 19:00 - 19:06
    quantum computers is more like apples and
    bananas. So we need a common ground. And
  • 19:06 - 19:12
    if you want standardized benchmarks for
    such problems, you can Google Chuck SHOOK.
  • 19:12 - 19:19
    It's a it's an open source benchmark suit,
    and you probably see it in the slide. Good
  • 19:19 - 19:25
    old Professor Katzgrabor. He has written
    this benchmark suit and he's gung ho about
  • 19:25 - 19:29
    cats, so please spare him of cat content.
    So, yeah, I told you we'll get into the
  • 19:29 - 19:37
    max cut benchmarks. This is from a paper
    of Cambridge, I think Cambridge quantum
  • 19:37 - 19:44
    computing and these little circles, these
    little dots, steel nodes. And you can see
  • 19:44 - 19:50
    they have done they've done it on a
    quantum computer for ten nodes. And it's
  • 19:50 - 19:55
    very complicated. Yeah. And the problem
    here is when they went to 13 or twenty
  • 19:55 - 20:00
    three qubits, logic of qubits, they had to
    simulate it. They had to put it on a
  • 20:00 - 20:05
    fantasy machine and classical hardware.
    And yeah, that's that's also one algorithm
  • 20:05 - 20:11
    they used. Vicki variational quantum ion
    solver and Qrolla, both of these are
  • 20:11 - 20:17
    approximate algorithms you can think of
    very noisy, annoying quantum computers
  • 20:17 - 20:24
    that don't spit out results. But if you
    run it 100 times, the majority of it will
  • 20:24 - 20:29
    be towards the correct regime. And yeah,
    that's that's how you go about it. And
  • 20:29 - 20:34
    this is a relatively new paper, and I have
    to say these resource estimations, these
  • 20:34 - 20:39
    are amazing results, and I'm not worried
    about the algorithmic advances in quantum
  • 20:39 - 20:43
    computing because we have smart people and
    I want more smart people. So if you want
  • 20:43 - 20:48
    to, you should get into it. So, yeah,
    that's that's not what I'm worried about
  • 20:48 - 20:54
    yet. I don't want to solve something for
    ten qubits or sorry, ten nodes on a
  • 20:54 - 21:01
    quantum computer, yet we can solve
    something bigger. So this is from another
  • 21:01 - 21:07
    paper from a nature inspired, physics
    inspired algorithm. Some already call it
  • 21:07 - 21:12
    quantum inspired. These are 100 nodes, but
    at the lowest, you can see the physics
  • 21:12 - 21:19
    inspired GNN and Pi G, and they managed to
    do it with a ten thousand nodes. So on
  • 21:19 - 21:25
    classical hardware, the quantum the
    quantum algorithm put on classical
  • 21:25 - 21:30
    hardware to overcome the cube hardware
    limitations by treating these physics
  • 21:30 - 21:35
    algorithms as optimizes. So from a
    business perspective, if I want to have
  • 21:35 - 21:41
    maximum power and maximum Dru's, I would
    use classical computers and use heuristics
  • 21:41 - 21:48
    from quantum and classical until the
    quantum computers are ready. So, yeah,
  • 21:48 - 21:53
    neuro, I'm sorry. Nature inspired
    optimization with quantum algorithms.
  • 21:53 - 21:59
    That's like putting neural networks on
    steroids. Quite like that. This is the
  • 21:59 - 22:07
    paper for it. But yes, we've been far deep
    into one corner. So I'll drag you back
  • 22:07 - 22:13
    here and I'll show you another one. Some
    companies claim we were solving climate
  • 22:13 - 22:19
    change with it. We're transforming pharma.
    And yeah, this comes from from ideas of
  • 22:19 - 22:26
    physicists. What I said. Well, the nature
    is quantum mechanical. We might as well
  • 22:26 - 22:32
    need quantum phenomena to simulate what is
    right. But yes, it's not that easy. This
  • 22:32 - 22:38
    physicists played bongos and strip clubs.
    He's a real hero. Many of the physicists
  • 22:38 - 22:44
    he's known for that are talking about
    chemistry. Here's ammonia. You don't think
  • 22:44 - 22:49
    this is difficult, but ammonia is used for
    a lot of things in the world who use it as
  • 22:49 - 22:55
    a base, if there's something acidic, you
    use it as a fertilizer, you use it in a
  • 22:55 - 23:03
    lot of things in chemistry and even raw
    latex is has been transported with it or
  • 23:03 - 23:10
    anything that has an acidic nature. You
    get it by a very difficult process. Well,
  • 23:10 - 23:15
    it's not a difficult but energy
    expenditure high one. So you need high
  • 23:15 - 23:20
    temperatures and high energies to put it
    into the harbor Bosch process, and it
  • 23:20 - 23:25
    accounts for two percent of the global
    energy expenditure. It's a very famous
  • 23:25 - 23:30
    problem that quantum physicists wanted to
    solve because it's really useful stuff
  • 23:30 - 23:37
    ammonia. And if we can cut two percent of
    the global energy expenditure, that's a
  • 23:37 - 23:43
    good thing. It's not trivial, though,
    Richard said it. It's not an easy thing to
  • 23:43 - 23:49
    do here. You can see just the active side
    of an enzyme where you can produce ammonia
  • 23:49 - 23:55
    without high temperature and high energy.
    Bacteria can do it by room temperature,
  • 23:55 - 24:01
    ambient temperatures. There's algae.
    That's all types of bacteria that can do
  • 24:01 - 24:08
    it, and the active side is called from
    FeMoco. You can see the resource estimates
  • 24:08 - 24:14
    for half of the sides, for the for the
    energy to simulate, to see how this works,
  • 24:14 - 24:20
    because bacteria can do it. We don't know
    how they do it. That's why we use so much
  • 24:20 - 24:25
    energy in temperature. The enzyme and the
    material looks like this. And then again,
  • 24:25 - 24:32
    look back at the computer for both parts.
    We need over 2000 logical qubits. Now,
  • 24:32 - 24:38
    think back, physical qubits are by a
    factor of 20 or 100 more. So we're not
  • 24:38 - 24:44
    here yet. Then again, classical computers
    can simulate it either, and we will
  • 24:44 - 24:49
    probably simulated that on quantum, but
    we're not there yet. And to put it into
  • 24:49 - 24:56
    perspective, to the far right the orange
    little molecules to form local bits in the
  • 24:56 - 25:02
    whole enzyme. And you might wonder what is
    the THC cost while that's tens or hyper
  • 25:02 - 25:07
    contraction, so you algorithmic
    advancements, I'm not so worried about.
  • 25:08 - 25:14
    We're pushing, we're pushing the frontiers
    there. So yeah, but but the imagination
  • 25:14 - 25:18
    land, the most powerful magic is common
    sense, and you should read it. So what do
  • 25:18 - 25:23
    you think? Do you want to use a quantum
    computer or intermediate steps to find out
  • 25:23 - 25:30
    what we need? Well, what people do these
    days is they're bit smarter and they do
  • 25:30 - 25:35
    simulated. They do use some digital parts,
    but it's mostly haptic. Haptic means they
  • 25:35 - 25:40
    simulate a little bit and they tested in a
    lab and got it tested in the lab. They can
  • 25:41 - 25:46
    funnel down what they need to simulate.
    The paper I'm talking about for the
  • 25:46 - 25:51
    smokable and theological cubits is a very
    recent one, so it's just a couple of days
  • 25:51 - 25:56
    it's been published and I think this is a
    preprint even. And if you want to know
  • 25:56 - 26:00
    anything about resource estimates and
    quantum computing for chemistry,
  • 26:00 - 26:07
    specifically Nathan Vibha and Ryan
    Burbuja, a good place to look for. Then we
  • 26:07 - 26:11
    are still a quantum applications for
    applicability is optional and it has been
  • 26:11 - 26:16
    true so far, hasn't it? Let's move to a
    corner that hits closer to home,
  • 26:16 - 26:26
    cybersecurity. We have to be specific
    here. I know a lot of companies claim
  • 26:26 - 26:30
    there won't be any type of encryption as
    we know of in the future, because quantum
  • 26:30 - 26:37
    computers will break it off for once a
    year to fifty sixty five fifty six years.
  • 26:37 - 26:47
    As bad as 256 bit mode can be broken by
    quantum computers and symmetric key size
  • 26:47 - 26:53
    symmetric encryption methods are known to
    be quantum secure the specific key size.
  • 26:53 - 26:59
    So not really. What people usually think
    of as asymmetric encryption. So, yeah,
  • 27:01 - 27:07
    these are some resource estimates to look
    out for. This is a Microsoft paper not too
  • 27:07 - 27:11
    long ago, and they said through a punch
    line, it is easier to break elliptic curve
  • 27:11 - 27:17
    encryption than RSA. Then Google, not too
    long ago, came up with two million noisy
  • 27:17 - 27:25
    qubits or physical qubits to break RSA
    2048 bit in eight hours. And then also the
  • 27:25 - 27:32
    news paper saying that factoring a 2048
    bit RSA integer can be done in one hundred
  • 27:32 - 27:36
    and seventy seven days with about a little
    bit more than 13000 qubits, but with a
  • 27:36 - 27:41
    multimodal memory that does not exist yet.
    These are incredible results over the
  • 27:41 - 27:47
    years in resource estimation numbers. Yet
    again, let's put it into perspective. So
  • 27:47 - 27:56
    2012 he said, it's a billion in this year.
    2021 isn't over yet. This year, Google
  • 27:56 - 28:01
    came up with 20 million noisy qubits and
    then Gaussian came up with a little bit of
  • 28:01 - 28:05
    thousand or more, but let alone any
    workable implementation of curium as a
  • 28:05 - 28:09
    purely theoretical nature as of now. So
    we're still in imagination land when it
  • 28:09 - 28:16
    comes to breaking the internet as we know
    it. It's time to leave Fantasyland, or you
  • 28:16 - 28:22
    might say, hey, but we did factor
    relatively high numbers back there in
  • 28:22 - 28:27
    2013. You've heard this in the news. Well,
    yes, we did. But if you know the base
  • 28:27 - 28:34
    beforehand, so if you know that with
    thirty five, the number thirty five, you
  • 28:34 - 28:40
    can divide by five or seven if you know
    one base, that's a really easy thing to do
  • 28:40 - 28:45
    and you can do that classically as well.
    So IBM had to counter published that they
  • 28:45 - 28:50
    were oversimplifying quantum factoring,
    and the algorithm you use for it is
  • 28:50 - 28:54
    Schwar's algorithm. It's one of the
    purebreds quantum algorithms out there.
  • 28:55 - 28:58
    And then again, another one pretending to
    fact the large numbers and quantum
  • 28:58 - 29:06
    computers. So no, we haven't been able to
    break it so far. Another one in 2019, and
  • 29:06 - 29:10
    this is in very, very interesting one
    because IBM goes close to these problems
  • 29:10 - 29:13
    and says, yeah, well, I want to test it. I
    want to simulate it. A sorry, not
  • 29:13 - 29:18
    simulated. I want to test it literally in
    quantum hardware. And they did so, but
  • 29:18 - 29:28
    they failed to factor just the number 35.
    So I think we're safe for some time. You
  • 29:28 - 29:34
    have to think of quantum computers not as
    a quantum threat, but more as a quantum
  • 29:34 - 29:39
    advantage. If someone knows how to steer
    encrypted data and store it about 20 years
  • 29:39 - 29:45
    to decrypt it, you know, get it now and
    decrypted 20 years later and stored
  • 29:45 - 29:49
    somewhere, they probably know where to get
    it unencrypted as well. They're more low
  • 29:49 - 29:53
    hanging fruit for them, and I don't think
    they will wait until the quantum computer
  • 29:54 - 29:59
    comes into fruition to do these sort of
    things. So let's put the quantum thread
  • 29:59 - 30:05
    into perspective. Quantum computers are
    logical extensions of Moore's law strand,
  • 30:05 - 30:11
    and quantum computers are tailor made for
    simulating the behavior of quantum systems
  • 30:11 - 30:16
    like molecules or materials, and whether
    they lead to breakthroughs in cryptography
  • 30:16 - 30:21
    or optimization problems. That is less
    clear yet, but we're we're pushing the
  • 30:21 - 30:26
    boundaries. If anything, components of
    quantum computers are pushing the
  • 30:26 - 30:31
    boundaries for us literally now, if we
    have better seeds like quantum random
  • 30:31 - 30:38
    number generators for short Q, R and GS,
    that is very useful. We need seeds that
  • 30:38 - 30:43
    are truly random. For example, in places
    where we can't use true random number
  • 30:43 - 30:47
    generators that use entropy to generate
    the random numbers because in a data
  • 30:47 - 30:52
    center, you don't want a lot of entropy,
    so you don't want temperature diversity,
  • 30:52 - 31:00
    you want it to be cold and stay cold, or
    sometimes you don't have the possibility
  • 31:00 - 31:10
    of having this anywhere where it's just
    not there. So we do make things smaller
  • 31:10 - 31:14
    with it as well. You've seen the wiring,
    so we have to design microwave technology
  • 31:14 - 31:19
    or any type of cabling, any types of
    chips, um, pre processes that can go into
  • 31:20 - 31:27
    smaller and smaller spaces. So yes, we do
    need quantum computers and the research
  • 31:27 - 31:32
    around it. We don't need it in business
    settings just yet because they're not
  • 31:32 - 31:38
    ready. This is still very much fundamental
    research, and we should note that so
  • 31:40 - 31:45
    mathematical concepts are more useful to
    find. Also new ciphers when we're talking
  • 31:45 - 31:49
    about cyber security. And I'm not talking
    specifically about peak. You see, there
  • 31:49 - 31:53
    are other mathematical mathematical
    concepts for asymmetric and symmetric
  • 31:53 - 31:58
    encryption that can be that can be used.
    But for now, let's leave imagination land,
  • 31:59 - 32:04
    and let's think about how quantum
    computers interface with the world. Well,
  • 32:04 - 32:11
    I've shown you before that quantum
    computers sometimes have a crude and
  • 32:11 - 32:16
    fridge, so if you look at the cylinder,
    you see the the enclosure of it. So this
  • 32:16 - 32:21
    specific example, I use a superconducting
    computer for now, I've told I've told you
  • 32:21 - 32:27
    before we need a host CPU and then a
    control system. Lots of peripherals and
  • 32:27 - 32:33
    wiring to get into the cryogenic stage and
    the enclosure. And there we usually have
  • 32:33 - 32:39
    an analog to digital digital interface.
    And at the bottom where it's the cold is
  • 32:39 - 32:45
    the qbu. So you can think of it as, yeah,
    a huge system. So this is an example of
  • 32:45 - 32:50
    Google's setup. And I think the key
    concept that needs to be highlighted here
  • 32:50 - 32:55
    is the quantum computers are merely core
    processes. And as such, they depend on
  • 32:55 - 33:00
    traditional compute environments to host a
    quantum processing unit, a cube you
  • 33:00 - 33:04
    require as an analog to digital interface
    to to convert those signals back and forth
  • 33:04 - 33:09
    and in turn, the application logic in the
    host CPU. You may connect to a network
  • 33:09 - 33:15
    may. Some people think if I have it in the
    lab and it's not connected to anything,
  • 33:15 - 33:20
    there's must be air gapped. But then
    again, you know how loud these devices
  • 33:20 - 33:27
    are. So you kind of want RTP so people
    don't become death and we've corona, you
  • 33:27 - 33:32
    kind of want people to work from home as
    well, so they won't be arrogant. For the
  • 33:32 - 33:38
    foreseeable future, I guess we're for the
    next year at least. So the issue of cyber
  • 33:38 - 33:43
    security and mass and quantum computing
    resources that is rarely discussed, these
  • 33:43 - 33:48
    systems are and they will be hybrid
    systems for the foreseeable future with
  • 33:48 - 33:54
    those CPU hosts with cloud based or
    managed APIs. And we need reliable
  • 33:54 - 33:59
    services and secure services and
    architectures as this arises. So
  • 33:59 - 34:05
    subsequently, the critical applications
    and data these systems will handle and
  • 34:05 - 34:13
    store if it's the knowledge and the
    algorithms, how to how to simulate for
  • 34:13 - 34:22
    Mocko we can produce the ammonia with less
    energy expenditure if we design new
  • 34:22 - 34:27
    batteries. These are probably patents, so
    we want to secure the data behind it and
  • 34:27 - 34:33
    those algorithms. So this means that all
    classical security best practices hold for
  • 34:33 - 34:39
    quantum computers. So this example, the QC
    lab at Google, sees enterprise system
  • 34:39 - 34:46
    constituted of a mix of Windows, macOS,
    Linux, maybe Azure, Adi, SAS network,
  • 34:46 - 34:53
    containers, whatever platforms. And
    they're part of these industrial control
  • 34:53 - 34:59
    systems and programable logic controllers,
    pulses or discrete process control
  • 34:59 - 35:05
    systems. You know, anything in ICS, Escada
    that is rarely air gapped or physically
  • 35:05 - 35:09
    means physically separated from any
    network. So we need API hardening. I see
  • 35:09 - 35:14
    our security is not a big topic in quantum
    computing yet because it's still just a
  • 35:14 - 35:21
    system on the internet, and it's not quite
    ripe yet. People sell it and companies put
  • 35:21 - 35:30
    sensible data on there. So if this is back
    in the day got infected with the MIMO worm
  • 35:30 - 35:36
    that was considered air gapped. No, I CS
    system is truly, really arrogant anymore.
  • 35:36 - 35:41
    So before we offer quantum computing as
    breakthrough accelerators, we need to make
  • 35:41 - 35:46
    them safe to use. So if you want to join
    me, let's protect quantum computers from
  • 35:46 - 35:51
    getting pond. Thank you for listening to
    me. That's talk.
  • 35:51 - 36:00
    Herald: Thank you so much. Um, we have
    some time for questions. So, uh. Audience,
  • 36:00 - 36:06
    dear audience, please ask some questions.
    The hashtags are on Mastodon and Twitter
  • 36:06 - 36:18
    hashtag RC3Chaos Zone, and the I.R.C. room
    is the Channel RC three Dash Chaos Zone.
  • 36:18 - 36:30
    All right, and I will watch the questions.
    All right. We have some questions already.
  • 36:30 - 36:42
    Herald: What do you think about rolling
    out so-called post-quantum cryptography
  • 36:42 - 36:48
    now?
    Natalie: Oh yeah. Post quantum crypto, I
  • 36:48 - 36:55
    know it's been. It's been a useful concept
    promised and they have a never specific
  • 36:55 - 37:01
    problem in mind. And this is for the
    national security and probably the
  • 37:01 - 37:07
    government, for infrastructure and in the
    U.S. specifically. But they're thinking
  • 37:07 - 37:10
    of, along lived systems, the pig. You see,
    you have the problem. It's highly
  • 37:10 - 37:15
    computationally intensive. So a lot of
    infrastructure can't, can't cope with it.
  • 37:15 - 37:21
    So we need to deploy other infrastructure.
    And if you're worried about your data,
  • 37:21 - 37:26
    you're in the intelligence behind your
    data being stolen and then, you know, say,
  • 37:26 - 37:33
    for 20 years. Not many companies have
    secrets that you can store for that intel
  • 37:33 - 37:40
    isn't that specific data that data steal
    and store that is useful. So if you have
  • 37:40 - 37:44
    data, doesn't intelligence lie for over 20
    years yet? It's useful if it's a
  • 37:44 - 37:49
    government side of, you know, it's a
    nuclear bomb placed side or something very
  • 37:49 - 37:56
    critical. Yes, you have to think about it
    now, and we do need time to implement the
  • 37:56 - 38:01
    infrastructure. And I mean, the hits close
    to home. We've heard about crypto agility
  • 38:01 - 38:06
    to think that we would like to have, but
    it's it's not the reality. We just have
  • 38:06 - 38:11
    legacy systems. We have to keep them
    running. And especially if it's critical
  • 38:11 - 38:14
    infrastructure, you can just turn it off,
    build something new and turn it all and it
  • 38:14 - 38:21
    has to work throughout. So you see is
    useful for some problems, but not for all.
  • 38:21 - 38:27
    It's not a one fits all glove.
    Herald: All right. All right, thank you.
  • 38:29 - 38:37
    The next question is, you talked about the
    current number of qubits and how no
  • 38:37 - 38:43
    practical problem, a lack of the difficult
    problems that the people are hopeful for
  • 38:43 - 38:50
    quantum computers to solve. The technology
    isn't there yet due to the low number of
  • 38:50 - 38:57
    qubits. Would it make sense to serialize
    the problems and run them on low qubit
  • 38:57 - 39:05
    count quantum computers? Does that work?
    Natalie: I think I might not understand
  • 39:05 - 39:14
    the question fully, but I assume you mean
    you package these little programs and I've
  • 39:14 - 39:20
    shown you the algorithm, the THC, the
    tensor hyper contraction algorithm that
  • 39:20 - 39:27
    the chemical guys have used where we do
    these sort of things. But then again, one
  • 39:27 - 39:33
    qubit you can think of roughly as one
    transistor and you just need a couple more
  • 39:33 - 39:40
    than five or 10 to do meaningful
    computations, as you've seen. That is a
  • 39:40 - 39:47
    very good question that we do package
    these problems into smaller bits. And if
  • 39:47 - 39:53
    you go back into the slides or look into
    the the the paper of Nathan Vibha and
  • 39:53 - 39:57
    Rayen Babbush around because you see that
    you need still about more than two
  • 39:57 - 40:02
    thousand logical qubits, so you're spot
    on. This is the direction that they wanted
  • 40:02 - 40:07
    to go and we have to go and there to try
    to. Unfortunately, we still need more than
  • 40:07 - 40:11
    a couple of hundred.
    Herald: So are there any current quantum
  • 40:11 - 40:15
    computers that are programable to do
    something useful?
  • 40:15 - 40:20
    Natalie: I mean, it depends really useful.
    It's very educational to use them. If you
  • 40:20 - 40:26
    want to have a have a workforce in 10
    years that knows how to use them, you need
  • 40:26 - 40:31
    to do. You need to have, you know,
    postdocs or master students who know how
  • 40:31 - 40:36
    to program these things. We need to know
    how to write better compilers. What are
  • 40:36 - 40:43
    the what are the bottlenecks, how we can
    swap gates, quantum gates? Some of these
  • 40:43 - 40:48
    are operations on a quantum computers. So
    how we can swap these things and there
  • 40:48 - 40:53
    that's a useful thing for them to do in
    any stage are workable quantum computer.
  • 40:53 - 40:57
    Just a few qubits is still needed to
    advance the field and to advance the
  • 40:57 - 41:03
    workforce. So for me, it is still useful.
    Herald: All right. Yea, it makes sense.
  • 41:03 - 41:10
    What do you see as candidates for earliest
    productive uses of quantum computers?
  • 41:10 - 41:16
    Natalie: Oh, so you mean the question of
    the killer application for quantum
  • 41:16 - 41:22
    computers? That's a difficult one. So for
    cryptography or for optimization of I've
  • 41:22 - 41:30
    said it before, it's less clear. But for
    chemistry, once we hit those 20000 or more
  • 41:30 - 41:37
    logical qubits, we'll see advancements and
    catalysts. You see it from local molecules
  • 41:37 - 41:43
    to active side for the nitrogenous to to
    get ammonia at room temperature. And
  • 41:43 - 41:49
    that's where I see the advancements for
    four small catalysts for get alloys and
  • 41:49 - 41:55
    metals to find better storage batteries.
    There's there's still a field out there
  • 41:55 - 42:00
    that we have that we couldn't simulate on
    classical because it's quite intractable.
  • 42:00 - 42:04
    But we're pushing the field and I think
    chemistry could be one of the first ones
  • 42:04 - 42:09
    that's just not there yet.
    Herald: All right. Do you also think
  • 42:09 - 42:13
    that'll be the earliest one's chemistry
    applications?
  • 42:13 - 42:18
    Natalie: Small molecules for catalysts?
    Yes, they could be. I mean, the smarter
  • 42:18 - 42:24
    people than me out there might have better
    ideas. Maybe design a completely new
  • 42:24 - 42:28
    battery storage or I mean, ammonia is
    being used in fuel cells as well for
  • 42:28 - 42:35
    storage. Maybe they'll simulate how to get
    ammonia, cheaper energy expenditure wise
  • 42:35 - 42:43
    and then use it to store, have better
    storage and fuel cells yet. I mean, there
  • 42:43 - 42:50
    are some quantum computing services out
    there that are kind of interesting depends
  • 42:50 - 42:54
    what you're looking for. Yes. In
    Cambridge, quantum computing offers a
  • 42:54 - 42:58
    three qubit encryption suite if you want
    to do QCD. I mean, it's a fun toy game.
  • 42:58 - 43:03
    I'm not sure if it's very business
    relevant, but if you want to look at your
  • 43:03 - 43:07
    current infrastructure could hold it.
    That's an interesting one. Quantum
  • 43:07 - 43:16
    communication components, especially in
    that part of the quantum tech world, is
  • 43:16 - 43:22
    more advanced and more ripe. So a lot of
    devices in quantum communication you can
  • 43:22 - 43:30
    use now already. So it's just about your
    risk appetite. Do you want to, well, spend
  • 43:30 - 43:36
    a lot of money on it? Do you want to
    invest into it and try it out? There are
  • 43:36 - 43:42
    some test beds in Berlin and Paris where
    they're trying out QKD networks yet.
  • 43:42 - 43:47
    You know, this is telecom. This is not
    quantum computing, but it would be the
  • 43:47 - 43:50
    backbone if we want to have a quantum
    internet where then again, quantum
  • 43:50 - 43:56
    computers are useful. So everything is
    useful because it's it's an intermediate
  • 43:56 - 44:02
    step towards something you would like to
    have. But most of the things in quantum
  • 44:02 - 44:06
    computers, they don't fit classical
    solutions yet.
  • 44:06 - 44:13
    Question: All right. You talked about the
    attack vectors on quantum computers and
  • 44:14 - 44:19
    dramatizing this a little bit. And what is
    the worst case of the quantum computer
  • 44:19 - 44:22
    getting on?
    Natalie: I mean, worst case is some
  • 44:22 - 44:27
    company has their sensible business data
    on it, and they harvest that. I mean,
  • 44:27 - 44:32
    because they're not, you know, they're not
    critical components as of yet. And there
  • 44:32 - 44:37
    are a lot of down times because they have
    to recalibrate them, you know, get them
  • 44:37 - 44:42
    off the grid, see if the fridge works or
    do some sort of maintenance. You don't
  • 44:42 - 44:50
    have to use usually SLS with them yet, but
    think about all these companies that don't
  • 44:50 - 44:57
    know what they're doing, and they might
    have, you know, the critical data up there
  • 44:57 - 45:02
    in the cloud pushing it there. And if the
    API isn't, isn't hard and if it's, you
  • 45:02 - 45:07
    know, open access for everything, they may
    just have low hanging fruit to pick out
  • 45:07 - 45:13
    their.
    Herald: Thank you so much, Nacho. This was
  • 45:13 - 45:21
    tales from the quantum industry. Bye
    Nacho. Thank you. Thank you. All right.
  • 45:21 - 45:29
    Our next talk will be at 17:30. What is
    Algarve? It's about a community that live
  • 45:29 - 45:35
    codes music and celebrates the artifacts
    and the algorithms that they use.
  • 45:35 - 45:45
    RC3 postroll music
  • 45:45 - 45:49
    Subtitles created by c3subtitles.de
    in the year 2022. Join, and help us!
Title:
Tales from the Quantum Industry
Description:

more » « less
Video Language:
English
Duration:
45:43

English subtitles

Revisions