What this covers

This is a single-narrator survey of the whole field, organized as a map. It starts with how a qubit works. A qubit is pictured as an arrow in 3D space: up is 0, down is 1, and any other direction is a superposition. From there it builds to the doubling of states with each added qubit, to entanglement, where qubits stop being independent, and to interference, where wavefunctions add or cancel like ripples on water. The narrator is not named in the supplied material.

The middle of the video turns to algorithms and what they are for. Peter Shor's 1994 algorithm for factorization is presented as the moment many people began taking the field seriously, because it threatened the encryption behind secure websites, email and banking. The narrator adds caveats. Running it on large numbers would take roughly a million qubits, against about 100 in the best universal machines today. A clever classical factoring method is unlikely but not ruled out, and post-quantum and quantum cryptography are already being developed. Grover's search algorithm is offered as a contrast, with a different level of speedup. Quantum simulation of chemistry and materials is treated as a natural fit, since classical machines struggle with quantum systems.

The final stretch covers the hardware and the models of computation. Noise and scalability, including the wiring needed per qubit, are named as the central engineering problems. The tour then moves through superconducting qubits, the most popular approach; neutral atoms in optical lattices; and quantum dot or silicon spin devices. Topological computing is called the most theoretical route, built on a Majorana zero-mode quasi-particle that is protected from noise by an energy gap. Adiabatic computing, which encodes an answer as the lowest point of an energy landscape, and measurement-based computing, proven equivalent to the gate model, are covered as alternative models. The video closes by noting that early users of a new technology rarely foresee its eventual uses.

Sharpest takeaway

Quantum computers represent a fundamentally different computational paradigm than classical computers, leveraging superposition, entanglement, and interference to solve certain intractable problems faster, and multiple physical implementations are being pursued with different tradeoffs rather than a single winning approach being clear.

  • Quantum computers can exist in superposition of 2^n states simultaneously while classical computers can only be in one state at a time
  • Shor's algorithm reduces integer factorization from exponential to polynomial time complexity, making it theoretically transformative for cryptography
  • At least seven major physical implementations (superconducting, trapped ion, optical, topological, neutral atoms, quantum dots, color centers) are actively being developed with unclear long-term winners

The claims · ranked33 claims · weighted by value

This asset isn't compiled yet

You're seeing its claims, ranked. Compile it to build the argument threads, weight them, and check each claim against your library — the full view.

0.74

Quantum simulation involves simulating things like chemical reactions or how electrons behave in different materials with a quantum computer, and quantum computers have an exponential speedup over classical computers for this application because classical computers really struggle to simulate quantum systems.

definitionhigh valueestablishednovelty 1/4durability 4/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“Quantum simulation is simulating things like chemical reactions or how electrons behave in different materials with a computer. Here quantum computers also have an exponential speedup over classical computers because classical computers really struggle to simulate quantum systems.”

0.74

A qubit in superposition can be visualized as an arrow pointing in 3D space where pointing up represents 0 state, pointing down represents 1 state, and pointing in any other direction represents a superposition state which is a combination of 0 and 1.

definitionhigh valueestablishednovelty 1/4durability 4/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“For a useful visualisation you can think of them as an arrow pointing in 3D space. If they point up they are in the 0 state and if they point down they are in the 1 state, just like a classical bit, but they also have the option to be in a thing called a superposition state which is when the arrow points in any other direction. This superposition state is a combination state of 0 and 1.”

0.74

Scalability is a major obstacle in quantum computers: for each qubit you need to have a bunch of wires to manipulate and measure it; as the number of qubits increases the amount of extra stuff you need increases linearly, which is a massive engineering problem.

factualhigh valueestablishednovelty 1/4durability 4/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“And this brings us to another major obstacle: scalability. For each qubit you need to have a bunch of wires to manipulate and measure it. For a small number of qubits this is all manageable, but as the number of qubits increases the amount of extra stuff you need increases linearly, which is a massive engineering problem.”

0.73

Classical computers are very versatile devices, and there is nothing to say that someone may not find a very clever classical algorithm that could solve the hardest problems like integer factorization more efficiently than currently known algorithms; people think it is very unlikely, but it is not ruled out.

factualhigh valueestablishednovelty 2/4durability 4/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“But I should be careful here to make sure I don't mischaracterize classical computers. They are very versatile devices, and there is nothing to say that someone may find a very clever classical algorithm that could solve the hardest problems like integer factorization more efficiently. People think it is very unlikely, but it is not ruled out.”

0.69

Post-quantum encryption schemes are being developed which don't use integer factorization, and quantum cryptography is another technology from quantum physics that can help with cryptographic security without relying on factorization hardness.

factualhigh valueestablishednovelty 1/4durability 3/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“Also, people are working on what's known as post-quantum encryption schemes which don't use integer factorization, and another technology from the world of quantum physics can help here too, a cryptographic scheme known as quantum cryptography.”

0.69

Superconducting quantum computers are currently the most popular approach; a superconducting qubit is made from superconducting wires with a break in the superconductor called a josephson junction.

factualhigh valueestablishednovelty 1/4durability 3/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“Superconducting quantum computers are currently the most popular approach. A superconducting qubit is made from superconducting wires with a break in the superconductor called a josephson junction.”

0.68

In 1994, Peter Shor published a fast quantum algorithm that can efficiently find the factors of large integers, which caused quite the stir because it was the first application to a real world problem with potentially huge real world security implications, and is the moment that a lot of people started to take the idea of quantum computing seriously.

factualhigh valueestablishednovelty 0/4durability 4/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“Which is why in 1994, when Peter Shor published a fast quantum algorithm that can efficiently find the factors of large integers, it caused quite the stir. This is the moment that a lot of people started to take the idea of quantum computing seriously because it was the first application to a real world problem with potentially huge real world security implications.”

0.66

Adiabatic quantum computing works by taking advantage of the fundamental behavior that every system in physics always moves towards the minimum energy state; you pose problems such that the minimum energy state of the quantum system is the answer to the problem, start with a flat landscape, and gradually introduce the energy landscape of your problem where the answer is the lowest position on the map.

definitionhigh valueestablishednovelty 1/4durability 4/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“In adiabatic quantum computing you are taking advantage of one of the fundamental behaviours in physics, the fact that every system in physics always moves towards the minimum energy state. This is a very general principle, and adiabatic quantum computing takes advantage of this by posing the problems you want solved in such a way so that the minimum energy state of the quantum system is the answer to the problem. You can picture this as an energy landscape, where each point on the landscape is one of the potential outputs of the computer. In adiabatic quantum computing you start off with a flat landscape, and gradually introduce the energy landscape of your problem where the answer to your problem is the lowest position on the map.”

0.66

When qubits are entangled, changing the direction of the arrow on one qubit changes the probability distribution for the whole system, so the qubits are no longer independent of each other; they are all part of the same large state.

causalhigh valueestablishednovelty 1/4durability 4/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“But when we entangle them, we have to throw away those independent probabilities and calculate a probability distribution of all of the possible states we can get out. Either 00, 01, 10, or 11. The important point here is because the qubits are entangled, if you change the direction of the arrow on one qubit, it changes the probability distribution for the whole system, so the qubits are no longer independent of each other, they are all part of the same large state.”

0.66

For one qubit you have a probability distribution over 2 states, for two qubits you have a distribution over 4 states, for three qubits over 8 states, and this keeps doubling each time you add another qubit; in general, a quantum computer of n qubits can be in a combination of 2^n states.

factualhigh valueestablishednovelty 1/4durability 4/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“You'll also note that for one qubit you have a probability distribution over 2 states. For two qubits you have a probability distribution over 4 states. For three qubits you have a distribution over 8 states, and this keeps on doubling each time you add another qubit. In general, a quantum computer of n qubits can be in a combination of 2^n states.”

0.66

When wavefunctions are added together in quantum computers they can constructively interfere and add together to make a bigger wave, or destructively interfere to cancel each other out, just like with ripples of water.

definitionhigh valueestablishednovelty 1/4durability 4/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“This adding together of wavefunctions is the interference because, just like with say ripples of water, when we add waves together they can constructively interfere and add together to make a bigger wave, or destructively interfere to cancel each other out.”

0.66

Quantum dot or silicon spin quantum computers use electrons or groups of electrons as qubits with the two level system encoded in the spin or charge of the electrons; on the chip there's a small area where the electron is restricted to called a quantum dot, and operations are performed through voltages on the chip or microwaves or magnetic fields.

definitionhigh valueestablishednovelty 1/4durability 4/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“Next are quantum dot quantum computers or silicon spin quantum computers. Here I'm using quantum dot quantum computers to collect a range of qubit designs built from semiconductors, things like silicon. Here the qubits are made from electrons or even groups of electrons and the two level system is encoded into the spin or charge of the electrons. On the chip there's a small area where the electron is restricted to is called a quantum dot, and operations on the qubits are performed through voltages on the chip, or microwaves or magnetic fields.”

0.66

Neutral atoms in optical lattices quantum computers use qubits that are atoms captured into an optical lattice which is a crisscrossed arrangement of laser beams forming energy wells shaped kind of like an egg box; atoms are cooled down with lasers to a few millionths of a kelvin.

definitionhigh valueestablishednovelty 1/4durability 4/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“The final approach is called neutral atoms in optical lattices. In this approach the qubits are atoms, and the design uses cold atom physics capturing neutral atoms like caesium into an optical lattice which is a crisscrossed arrangement of laser beams, which form energy wells shaped kind of like an egg box. These atoms are cooled down with lasers to a few millionths of a kelvin”

0.66

Measurement-based or one-way quantum computing involves setting up an initial entangled state and then measuring qubits one-by-one during computation, and has been mathematically proven to be equivalent to the gate model.

factualhigh valueestablishednovelty 1/4durability 4/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“measurement based or one-way quantum computing which involves setting up an initial entangled state, and then measuring qubits one by one during the computation, and mathematically this has been shown to be equivalent to the circuit model.”

0.66

Quasi-particles aren't fundamental particles like atoms, electrons or photons; they are created from the collective behavior of many particles together and end up having particle-like properties despite not being actually real.

definitionhigh valueestablishednovelty 1/4durability 4/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“Quasi-particles aren't fundamental particles like atoms, electrons or photons, quasi-particles are created from the collected behaviour of many particles together, and end up having particle-like properties despite not being actually real.”

0.66

Quantum computers have certain advantages over normal computers for certain problems which comes from their ability to be in a huge number of states at the same time whereas classical computers can only be in one state at a time.

factualhigh valueestablishednovelty 1/4durability 4/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“Quantum computers have certain advantages over normal computers for certain problems which comes from their ability to be in a huge number of states at the same time whereas classical computers can only be in one state at a time”

0.66

Grover's algorithm can search unstructured lists of data faster than the best classical algorithm, and is another notable example of quantum algorithms with different levels of speedup compared to classical algorithms.

factualhigh valueestablishednovelty 1/4durability 4/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“Another notable example is Grover's algorithm which can search unstructured lists of data faster than the best classical algorithm.”

0.66

Majorana quasi-particles are protected from noise by an energy gap, meaning it takes a certain energy to bring the parts of the Majorana particle back together; any perturbations of noise which have lower energy than that energy gap is not felt by the quasi-particle.

factualhigh valueestablishednovelty 1/4durability 4/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“But these quasi-particles are special because they are protected from the noise by an energy gap. Basically what this means is it takes a certain energy to bring the parts of the Majorana particle back together, so any perturbations of noise which have a lower energy than that energy gap is not felt by the quasi-particle.”

0.64

Today's quantum computers are not able to run Shor's algorithm on large numbers yet; the speaker has estimated they would need about a million qubits to do so, but so far the most advanced universal quantum computers have around 100 qubits.

factualhigh valueestablishednovelty 1/4durability 2/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“But you don't need to worry about the security of your bank account yet because today's quantum computers are not able to run Shor's algorithm on large numbers yet. I've estimated they would need about a million qubits to do so, but so far the most advanced universal quantum computers have around 100.”

0.63

Internet encryption including secure websites, emails and bank accounts uses the mathematical property that if you know the factors of a number you can easily decrypt information, but if you don't you'd need to find them first which is intractable on the world's most powerful computers.

factualhigh valueestablishednovelty 0/4durability 3/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“For this reason we use this mathematical property for internet encryption: secure websites, emails and bank accounts. If you know these factors you can easily decrypt the information, but if you don't you'd need to find them first which is intractable on the world's most powerful computers.”

0.61

Topological quantum computing is the most theoretical model of quantum computing because it builds its qubits from an entity in physics called a Majorana zero-mode quasi-particle, which is a type of non-abelian anyon.

definitionhigh valueestablishednovelty 1/4durability 3/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“The last model we are going to look at is called topological quantum computing which is currently the most theoretical model of quantum computing because it builds its qubits from an entity in physics called a Majorana zero-mode quasi-particle which is a type of non-abelian anyon.”

0.60

Noise in quantum computers comes from rogue forms of energy creeping into the quantum computer making the qubits drift away from where they should be and causing errors; this is the main source of failure in quantum computers.

definitionhigh valueestablishednovelty 0/4durability 4/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“This is good because the main source of failure in a quantum computer is noise, which comes from rogue forms of energy creeping into the quantum computer making the qubits drift away from where they should be and causing errors.”

0.60

Integer factorization is a problem where there is a very fast classical algorithm for multiplying two large numbers together, but finding the original factors is much more difficult because the search space of possible factors is so large, and there is no efficient classical algorithm for finding the factors of large numbers.

factualhigh valueestablishednovelty 0/4durability 4/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“If you have two large numbers and you multiply them together there is a very fast, efficient, classical algorithm for finding the answer. However, if you start with the answer and ask, what are the original numbers that multiply together to make this number? It is a lot more difficult. This is known as factorization, and these numbers are called factors, and the reason finding them is so hard is because the search space of possible factors is so large. And there is no efficient classical algorithm for finding the factors of large numbers.”

0.59

Historically, when a new technology has come along, the people of the time aren't the best at being able to tell what it's going to be used for; for example the people who invented the first computers never dreamed of the internet and all of the things on it, and this is likely to be the same for quantum computers.

causalhigh valuespeaker onlynovelty 2/4durability 4/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“But my take on it is that historically, when a new technology has come along, the people of the time aren't the best at being able to tell what it's going to be used for. For example the people who invented the first computers never dreamed of the internet, and all of the things on it. And this is likely to be the same for quantum computers.”

0.57

Majorana zero-mode quasi-particles are entities that have been theoretically predicted in condensed matter physics, but there is still significant debate over whether they've actually been experimentally observed or not.

factualhigh valuecontestednovelty 1/4durability 2/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“In condensed matter physics there are a large range of different kinds of quasi-particle and a Majorana zero-mode quasti-particle is an entity that has been theoretically predicted, but there is still significant debate over whether they've actually been experimentally observed or not.”

0.52

A lot of the claims of what quantum computers will be good for come from people who are actively raising money to build them, and so it makes sense for them to piggyback on topical subjects in their pitches, which requires caution about potential hype.

normativehigh valuespeaker onlynovelty 2/4durability 3/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“Now we need to be a little careful about the potential of hype here, as a lot of the claims of what quantum computers will be good for come from people who are actively raising money to build them and so it makes sense for them to piggyback on topical subjects in their pitches.”

0.42

Quantum annealing is a stepping stone to building a universal adiabatic quantum computer, suggesting that the limitation of quantum annealing (non-universality) is a technical constraint rather than fundamental.

forecasthigh valuespeaker onlynovelty 1/4durability 2/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“quantum annealing is a stepping stone to building a universal adiabatic quantum computer.”

0.34

A classical bit can either be a 0 or a 1 which you are probably already familiar with as binary or binary information, and when we measure a bit we just get back the state that it's currently in.

factualestablishednovelty 0/4durability 4/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“A classical bit is kind of like a switch that can either be a 0 or a 1 which you are probably already familiar with as binary or binary information. When we measure a bit we just get back the state that it's currently in”

0.29

Other superconducting qubit designs use the magnetic flux in a loop of wire or the phase across a wire as a two level system, known as flux qubits or phase qubits.

factualestablishednovelty 0/4durability 3/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“But there have been other designs that use the magnetic flux in a loop of wire, or the phase across a wire as a two level system known as flux qubits or phase qubits.”

0.29

Other qubit design approaches that have not been built at the same scale as the main implementations include: Electron-on-helium qubit, Cavity quantum electrodynamics, Magnetic Molecule, Molecular Spins, NMR quantum computers.

factualestablishednovelty 0/4durability 3/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“These are the main approaches I'm going to cover in this video, but it is not an exhaustive list, some other qubit designs include: Electron-on-helium qubit, Cavity quantum electrodynamics, Magnetic Molecule, Molecular Spins, NMR quantum computers. But these have not been built at the same scale as the other approaches I mentioned in more detail.”

0.29

People have used semiconductor materials other than silicon including gallium arsenide, silicon carbide and diamond for quantum dot quantum computers, which all have different properties.

factualestablishednovelty 0/4durability 3/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“As well as silicon, people have also used other semiconducting materials like gallium arsenide, silicon carbide and also diamond amongst others, which all have different properties.”

0.24

The speaker can really understand the value of quantum simulation, which is why they have focused on it in the video, whereas other applications are more speculative.

normativespeaker onlynovelty 0/4durability 4/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“But for me the application that I can really understand the value of is quantum simulation which is why I've focused on it in this video.”

0.17

The speaker will look at companies and startups and which quantum computing approaches they are using along with their current best quantum computers and their roadmaps in a next video.

forecastspeaker onlynovelty 0/4durability 2/4· Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]

“Now one thing I haven't covered in this video are the companies and startups and which approach they are using, along with their current best quantum computers, and their roadmaps into the future. But this is what I'll look at in my next video so keep your eyes peeled for that.”