Quantum Supremacy Explained - YouTube

Channel: Domain of Science

[0]
Quantum supremacy’s that moment when a quantum computer beats the best supercomputers at
[5]
solving some kind of problem, and it’s a very exciting time right now in quantum computing
[10]
because, as of recording this video we’re on the brink of having quantum supremacy,
[15]
maybe it’s already happened.
[17]
So I’m going to explain what quantum supremacy is and why it is so exciting.
[22]
So to explain quantum supremacy it’s worth me explaining how quantum computers work.
[28]
Us physicists, we call normal computers ‘classical’ computers, and classical computers work with
[35]
binary.
[36]
There’s loads of bits that can either be in a state of zero or one.
[39]
In a quantum computer you have quantum bits, qubits, which can be in the state zero, or
[45]
one, or they can be in a special intermediate state and that’s called a superposition.
[49]
It’s a special phenomenon in quantum physics that quantum computers take advantage of.
[54]
Now when you measure a qubit the result you get is based on a probability, so if you set
[60]
this superposition state to be in the middle, you’ve got a 50% chance of getting a zero
[65]
and a 50% chance of getting a one.
[67]
But you can tune that state so you can make it so that you are more likely to get a zero
[71]
than a one, or the other way around.
[74]
So that’s the first phenomenon of quantum physics that quantum computers take advantage
[78]
of.
[79]
The second one is called entanglement, and this is where you bring together several qubits
[84]
and you join them together, and now that whole thing has to be treated as one object.
[89]
So if you take two qubits and you join them together, now this object can be in the mixed
[94]
state of four states, so zero zero, zero one, one zero and one one.
[101]
Each time you add a new qubit, you double the number of states that this thing can be
[105]
in, and that goes up exponentially.
[108]
So if you want to search through a whole load of different states, a classical computer
[112]
has to search through them one by one.
[114]
But in a quantum computer you’ve got these special quantum algorithms where you can enhance
[119]
the probability of the state that you want, and diminish the probability of it giving
[123]
you back the state that you don’t want.
[126]
So those two phenomena: entanglement and superposition are what give quantum computers their power.
[131]
So, what kind of quantum computers exist in the world today?
[136]
There are a whole bunch of different companies trying to make a quantum computer: Google,
[141]
Intel, IBM, Microsoft, D-Wave, amongst others.
[146]
And to complicate matters, there’s not just one kind of quantum computer there’s actually
[150]
a whole load of different approaches.
[151]
I’ve broken them all down here.
[153]
An important thing to point out here are Universal quantum computers.
[158]
Universal quantum computing can theoretically simulate any quantum system and so it’s
[164]
the fundamental computing machinery of the Universe.
[167]
There’s other approaches that aren’t Universal like quantum annealing and ion trap systems.
[173]
What they’re focused on are solving certain nice problems better than classical computers
[177]
by taking advantage of quantum physics and they’re a valid approach if those kinds
[182]
of problems are valuable.
[184]
They can be used as a good stepping stone towards a Universal quantum computer, because
[188]
Universal quantum computers are very difficult to build, and it’s good to learn stuff along
[192]
the way.
[194]
I’ve also included the number of qubits in these quantum computers as of today.
[199]
Now qubit number is just one measure of how good a quantum computer is.
[202]
Just as important is how low the noise is in the qubits, so how high quality the qubits
[208]
are, and also how well the qubits are connected together.
[213]
So let me describe a bit more about how you’d do the experiment to prove quantum supremacy.
[219]
Actually measuring when it has happened is quite a difficult thing to do.
[222]
So you take your best quantum computer and you take your best super computer and you
[226]
need to give them a problem to solve and then compare the results.
[229]
And to begin with the quantum computers can’t do anything better than a supercomputer except
[234]
for one thing, and that’s be a quantum computer.
[239]
Which might sound absurd, but the logic is this.
[243]
You can simulate a quantum computer on a classical computer, but it gets more and more difficult
[249]
to do so the more qubits you have.
[251]
Now IBM has got the current record for simulating a quantum computer with 56 qubits, so people
[258]
are seeing this as the target, that if you build a quantum computer with more than 56
[262]
qubits, you can’t simulate that with a classical computer, and so the quantum computer can
[267]
do some thing better than what a classical computer can do.
[273]
So the problem that they are looking at showing that the quantum computer can beat a classical
[277]
at is a certain problem called a sampling problem.
[280]
Now if you remember back when I was talking about a qubit being in a superposition state
[285]
between zero and one that gives you the probability of which one you’ll get back.
[292]
Imagine if you’ve got fifty qubits and they are all entangled together, they are simultaneously
[299]
in about quadrillion states, that’s a million billion states at the same time.
[306]
But when you measure that computer it just gives you back one state which will just be
[310]
a bit string of zero, zero, one, zero, one, one, one, corresponding to each qubit.
[316]
Now if you keep measuring that computer over and over again, you’ll get different bit
[322]
strings back, so different states back, but over time you’ll build up a distribution
[327]
of those states, the more likely ones and the less likely ones, and that’s a probability
[332]
distribution.
[333]
And each time you measure the quantum computer that’s like taking one sample from that
[337]
probability distribution.
[338]
Now quantum computers do that completely naturally, whereas simulating that whole thing on a classical
[343]
computer is incredibly difficult.
[346]
So that’s the problem that they are looking at proving that a quantum computer can do
[351]
it better than a classical computer.
[354]
So what’s that problem good for?
[357]
Absolutely nothing.
[359]
To begin with.
[360]
I mean there’s some crossover between this kind of sampling problem and a sampling problem
[366]
you get in machine learning.
[368]
But the shapes of those problems in quantum computing and machine learning are very ver
[372]
different, but they come from the same sort of underlying physics which is called statistical
[377]
mechanics so there is a tentative overlap there which people like Google are very very
[383]
interested in.
[384]
But I don’t undersell this achievement because, if you think about it, classical computers
[392]
have been around for seventy years and they’ve had literally trillions of dollars worth of
[396]
money pumped into research and development to reach them to the incredibly sophisticated
[401]
machine they are now.
[403]
Quantum computers have been around for twenty years-ish, and have had say a hundred million,
[411]
maybe a billion dollars worth of investment, for that technology, this new novel technology
[416]
to come along and beat the classical computers at even one narrow thing is a, is a huge achievement
[422]
and that’s only going to progress in the future and I’m really excited to see how
[427]
that whole thing evolves.
[430]
And finally I just want to end with a fact which I think is incredible.
[433]
You know I said that you can simulate, using our best supercomputers, you can simulate
[438]
a quantum computer with fifty six qubits.
[442]
Now if you raise the number of qubits up to two hundred and sixty, the size of the computer
[447]
you’d need to simulate that would need more bits then there are atoms in the entire known
[454]
Universe, which I think is just absolutely bonkers, but I love it.
[461]
Thanks so much for watching, that’s all I’ve got for you today.
[463]
And thanks also to the sponsor of this video brilliant.org they’re a website where you
[468]
learn by doing.
[470]
And I don’t know about you, when I was at University I would sit down, I’d write down
[473]
all the lecture notes, but the time where I’d really learn the subject was when I
[478]
sat down and did problems and Brilliant do a great job of making this fun and slightly
[484]
addictive, they have a way of framing questions that I get slightly obsessed with trying to
[489]
work out the answer to.
[492]
But that makes it really fun.
[493]
And they cover a bunch of different subjects: physics, mathematics, computer science and
[497]
many more.
[498]
So if you are interested in checking that out go to brilliant.org/dos the link’s also
[503]
in the description below, and otherwise, thank you for watching again, and I’ll see you
[507]
on the next video.