Jul 15, 2017 · 28m · a16z

Quantum Computing: A Primer

Frank Chen · 24m spoken Justin Trudeau · 45s spoken
0:00 / 0:00
▶ Watch on YouTube →

gold bands on the timeline = statements, start to end. Hover to read, click to jump. CC turns on captions

In this Andreessen Horowitz presentation, Frank Chen demystifies quantum computing by contrasting its fundamental mechanics with classical computing, detailing major engineering challenges, and outlining transformative applications across artificial intelligence, cryptography, and quantum chemistry.

How this conversation actually went

Every chapter scored 0–10 on four independent dynamics. Hover any point for the reasoning behind the score. How this is scored →

The host as informed peer 0.0 Guest teaching 4.0 Guest disagreement 0.2 The host pushing back 0.0
05100:0010:0020:000:38–2:50 · The host as informed peer 0/10 Justin Trudeau Explains Quantum Computing Frank Chen introduces a clip of Canadian Prime Minister Justin Trudeau explaining quantum computing. Trudeau playfully shuts down an interrupter, after which Chen gently notes that Trudeau's description misses the core point by focusing on making smaller computers.2:50–5:21 · The host as informed peer 0/10 A Little History: Feynman and Particle Accelerators Chen provides historical context on Richard Feynman and the necessity of particle accelerators like the Large Hadron Collider for subatomic research. The podcast host is silent, keeping host-side metrics at zero.5:21–9:05 · The host as informed peer 0/10 Supercomputers as Simulation Tools Chen explains why supercomputers are used for physics simulations and illustrates quantum complexity using a 1,000-electron example requiring 2^1000 states. This educational breakdown highlights the presenter's expertise in a monologue format.9:05–13:30 · The host as informed peer 0/10 How Traditional Computers Work: Bits and Semiconductors Chen contrasts classical computing using transistors and Boolean logic against quantum computing using qubits and linear algebra operators. The segment is entirely monologue with no host participation.13:30–17:48 · The host as informed peer 0/10 Solving the Phonebook Problem with Grover's Algorithm Chen illustrates Grover's algorithm using the phonebook problem to demonstrate how quantum computers manipulate vector magnitudes. He notes how searching a million entries drops from a million classical iterations to 30,000 quantum operations.17:48–20:42 · The host as informed peer 0/10 Engineering Challenges of Building Quantum Computers Chen details the extreme engineering constraints of quantum hardware, such as cooling systems operating at 0.1 Kelvin and 100-microsecond coherence times. The host remains silent.20:42–22:42 · The host as informed peer 0/10 Applications: Deep Learning and Modern Encryption Chen breaks down applications in deep learning and prime factorization, explaining how quantum algorithms could disrupt modern RSA encryption. The monologue format results in zero host score values.22:42–25:57 · The host as informed peer 0/10 Applications: Quantum Chemistry for Catalysts and Battery Materials Chen discusses quantum chemistry, citing energy savings in the Haber-Bosch ammonia production process and breakthroughs in Tesla Gigafactory battery chemistry. The presentation remains purely educational.25:57–28:32 · The host as informed peer 0/10 Why Now? Ecosystem Growth and Investment Landscape Chen compares the current momentum in quantum computing to the golden era of Bell Labs and outlines growing startup and state investments. Host scores remain zero due to monologue structure.0:38–2:50 · Guest teaching 4/10 Justin Trudeau Explains Quantum Computing Frank Chen introduces a clip of Canadian Prime Minister Justin Trudeau explaining quantum computing. Trudeau playfully shuts down an interrupter, after which Chen gently notes that Trudeau's description misses the core point by focusing on making smaller computers.2:50–5:21 · Guest teaching 3/10 A Little History: Feynman and Particle Accelerators Chen provides historical context on Richard Feynman and the necessity of particle accelerators like the Large Hadron Collider for subatomic research. The podcast host is silent, keeping host-side metrics at zero.5:21–9:05 · Guest teaching 5/10 Supercomputers as Simulation Tools Chen explains why supercomputers are used for physics simulations and illustrates quantum complexity using a 1,000-electron example requiring 2^1000 states. This educational breakdown highlights the presenter's expertise in a monologue format.9:05–13:30 · Guest teaching 4/10 How Traditional Computers Work: Bits and Semiconductors Chen contrasts classical computing using transistors and Boolean logic against quantum computing using qubits and linear algebra operators. The segment is entirely monologue with no host participation.13:30–17:48 · Guest teaching 5/10 Solving the Phonebook Problem with Grover's Algorithm Chen illustrates Grover's algorithm using the phonebook problem to demonstrate how quantum computers manipulate vector magnitudes. He notes how searching a million entries drops from a million classical iterations to 30,000 quantum operations.17:48–20:42 · Guest teaching 4/10 Engineering Challenges of Building Quantum Computers Chen details the extreme engineering constraints of quantum hardware, such as cooling systems operating at 0.1 Kelvin and 100-microsecond coherence times. The host remains silent.20:42–22:42 · Guest teaching 4/10 Applications: Deep Learning and Modern Encryption Chen breaks down applications in deep learning and prime factorization, explaining how quantum algorithms could disrupt modern RSA encryption. The monologue format results in zero host score values.22:42–25:57 · Guest teaching 4/10 Applications: Quantum Chemistry for Catalysts and Battery Materials Chen discusses quantum chemistry, citing energy savings in the Haber-Bosch ammonia production process and breakthroughs in Tesla Gigafactory battery chemistry. The presentation remains purely educational.25:57–28:32 · Guest teaching 3/10 Why Now? Ecosystem Growth and Investment Landscape Chen compares the current momentum in quantum computing to the golden era of Bell Labs and outlines growing startup and state investments. Host scores remain zero due to monologue structure.0:38–2:50 · Guest disagreement 2/10 Justin Trudeau Explains Quantum Computing Frank Chen introduces a clip of Canadian Prime Minister Justin Trudeau explaining quantum computing. Trudeau playfully shuts down an interrupter, after which Chen gently notes that Trudeau's description misses the core point by focusing on making smaller computers.2:50–5:21 · Guest disagreement 0/10 A Little History: Feynman and Particle Accelerators Chen provides historical context on Richard Feynman and the necessity of particle accelerators like the Large Hadron Collider for subatomic research. The podcast host is silent, keeping host-side metrics at zero.5:21–9:05 · Guest disagreement 0/10 Supercomputers as Simulation Tools Chen explains why supercomputers are used for physics simulations and illustrates quantum complexity using a 1,000-electron example requiring 2^1000 states. This educational breakdown highlights the presenter's expertise in a monologue format.9:05–13:30 · Guest disagreement 0/10 How Traditional Computers Work: Bits and Semiconductors Chen contrasts classical computing using transistors and Boolean logic against quantum computing using qubits and linear algebra operators. The segment is entirely monologue with no host participation.13:30–17:48 · Guest disagreement 0/10 Solving the Phonebook Problem with Grover's Algorithm Chen illustrates Grover's algorithm using the phonebook problem to demonstrate how quantum computers manipulate vector magnitudes. He notes how searching a million entries drops from a million classical iterations to 30,000 quantum operations.17:48–20:42 · Guest disagreement 0/10 Engineering Challenges of Building Quantum Computers Chen details the extreme engineering constraints of quantum hardware, such as cooling systems operating at 0.1 Kelvin and 100-microsecond coherence times. The host remains silent.20:42–22:42 · Guest disagreement 0/10 Applications: Deep Learning and Modern Encryption Chen breaks down applications in deep learning and prime factorization, explaining how quantum algorithms could disrupt modern RSA encryption. The monologue format results in zero host score values.22:42–25:57 · Guest disagreement 0/10 Applications: Quantum Chemistry for Catalysts and Battery Materials Chen discusses quantum chemistry, citing energy savings in the Haber-Bosch ammonia production process and breakthroughs in Tesla Gigafactory battery chemistry. The presentation remains purely educational.25:57–28:32 · Guest disagreement 0/10 Why Now? Ecosystem Growth and Investment Landscape Chen compares the current momentum in quantum computing to the golden era of Bell Labs and outlines growing startup and state investments. Host scores remain zero due to monologue structure.0:38–2:50 · The host pushing back 0/10 Justin Trudeau Explains Quantum Computing Frank Chen introduces a clip of Canadian Prime Minister Justin Trudeau explaining quantum computing. Trudeau playfully shuts down an interrupter, after which Chen gently notes that Trudeau's description misses the core point by focusing on making smaller computers.2:50–5:21 · The host pushing back 0/10 A Little History: Feynman and Particle Accelerators Chen provides historical context on Richard Feynman and the necessity of particle accelerators like the Large Hadron Collider for subatomic research. The podcast host is silent, keeping host-side metrics at zero.5:21–9:05 · The host pushing back 0/10 Supercomputers as Simulation Tools Chen explains why supercomputers are used for physics simulations and illustrates quantum complexity using a 1,000-electron example requiring 2^1000 states. This educational breakdown highlights the presenter's expertise in a monologue format.9:05–13:30 · The host pushing back 0/10 How Traditional Computers Work: Bits and Semiconductors Chen contrasts classical computing using transistors and Boolean logic against quantum computing using qubits and linear algebra operators. The segment is entirely monologue with no host participation.13:30–17:48 · The host pushing back 0/10 Solving the Phonebook Problem with Grover's Algorithm Chen illustrates Grover's algorithm using the phonebook problem to demonstrate how quantum computers manipulate vector magnitudes. He notes how searching a million entries drops from a million classical iterations to 30,000 quantum operations.17:48–20:42 · The host pushing back 0/10 Engineering Challenges of Building Quantum Computers Chen details the extreme engineering constraints of quantum hardware, such as cooling systems operating at 0.1 Kelvin and 100-microsecond coherence times. The host remains silent.20:42–22:42 · The host pushing back 0/10 Applications: Deep Learning and Modern Encryption Chen breaks down applications in deep learning and prime factorization, explaining how quantum algorithms could disrupt modern RSA encryption. The monologue format results in zero host score values.22:42–25:57 · The host pushing back 0/10 Applications: Quantum Chemistry for Catalysts and Battery Materials Chen discusses quantum chemistry, citing energy savings in the Haber-Bosch ammonia production process and breakthroughs in Tesla Gigafactory battery chemistry. The presentation remains purely educational.25:57–28:32 · The host pushing back 0/10 Why Now? Ecosystem Growth and Investment Landscape Chen compares the current momentum in quantum computing to the golden era of Bell Labs and outlines growing startup and state investments. Host scores remain zero due to monologue structure.

speaking balance: gold is the host, purple is the guest (3 minute bins)

0:00 · the host 0% · guest 100%0:00 · the host 0% · guest 100%3:00 · the host 0% · guest 100%3:00 · the host 0% · guest 100%6:00 · the host 0% · guest 100%6:00 · the host 0% · guest 100%9:00 · the host 0% · guest 100%9:00 · the host 0% · guest 100%12:00 · the host 0% · guest 100%12:00 · the host 0% · guest 100%15:00 · the host 0% · guest 100%15:00 · the host 0% · guest 100%18:00 · the host 0% · guest 100%18:00 · the host 0% · guest 100%21:00 · the host 0% · guest 100%21:00 · the host 0% · guest 100%24:00 · the host 0% · guest 100%24:00 · the host 0% · guest 100%27:00 · the host 0% · guest 100%27:00 · the host 0% · guest 100%
Sharpest disagreement ▶ 1:12 Trudeau shuts down a heckler

Justin Trudeau directly rebuffs an interrupter during his speech, stating 'Come on, don't interrupt me' before continuing his explanation of quantum computing.

Hardest push from the host ▶ 2:15 Frank Chen reframes Justin Trudeau's explanation

Frank Chen respectfully reframes Justin Trudeau's framing, pointing out that Trudeau implied quantum computers are about making smaller devices, which misses the fundamental purpose.

Biggest teaching moment ▶ 7:15 The 2^1000 calculation state example

Frank Chen educates the audience on the scale of quantum mechanics by showing that simulating 1,000 hydrogen electrons requires 2^1000 states, exceeding all atoms in the observable universe.

The host holds their own ▶ 16:20 Demonstration of Grover's algorithm efficiency

In lieu of host dialogue, the presenter demonstrates maximum domain authority by detailing how Grover's algorithm achieves a square-root speedup over classical brute-force database searches.

the scores for every segment, with the reasoning behind each
ChapterTopicThe host as informed peerGuest teachingGuest disagreementThe host pushing backWhy
Justin Trudeau Explains Quantum Computing 0420 Frank Chen introduces a clip of Canadian Prime Minister Justin Trudeau explaining quantum computing. Trudeau playfully shuts down an interrupter, after which Chen gently notes that Trudeau's description misses the core point by focusing on making smaller computers.
A Little History: Feynman and Particle Accelerators 0300 Chen provides historical context on Richard Feynman and the necessity of particle accelerators like the Large Hadron Collider for subatomic research. The podcast host is silent, keeping host-side metrics at zero.
Supercomputers as Simulation Tools 0500 Chen explains why supercomputers are used for physics simulations and illustrates quantum complexity using a 1,000-electron example requiring 2^1000 states. This educational breakdown highlights the presenter's expertise in a monologue format.
How Traditional Computers Work: Bits and Semiconductors 0400 Chen contrasts classical computing using transistors and Boolean logic against quantum computing using qubits and linear algebra operators. The segment is entirely monologue with no host participation.
Solving the Phonebook Problem with Grover's Algorithm 0500 Chen illustrates Grover's algorithm using the phonebook problem to demonstrate how quantum computers manipulate vector magnitudes. He notes how searching a million entries drops from a million classical iterations to 30,000 quantum operations.
Engineering Challenges of Building Quantum Computers 0400 Chen details the extreme engineering constraints of quantum hardware, such as cooling systems operating at 0.1 Kelvin and 100-microsecond coherence times. The host remains silent.
Applications: Deep Learning and Modern Encryption 0400 Chen breaks down applications in deep learning and prime factorization, explaining how quantum algorithms could disrupt modern RSA encryption. The monologue format results in zero host score values.
Applications: Quantum Chemistry for Catalysts and Battery Materials 0400 Chen discusses quantum chemistry, citing energy savings in the Haber-Bosch ammonia production process and breakthroughs in Tesla Gigafactory battery chemistry. The presentation remains purely educational.
Why Now? Ecosystem Growth and Investment Landscape 0300 Chen compares the current momentum in quantum computing to the golden era of Bell Labs and outlines growing startup and state investments. Host scores remain zero due to monologue structure.

Statements from this episode (17)

Assertion Not checkable as stated
Trudeau: Quantum states encode complex information into single bits
“What quantum states allow for is much more complex information to be encoded into a single bit. Regular computer bit is either a one or a zero, on or off. A quantum state can be much more complex than that because, as we know things can be both particle and wa…”
Justin Trudeau Jul 15, 2017 ▶ 1:34
Assertion Not checkable as stated
Chen: Quantum computing's goal is not making smaller computers
“Now, if you listen to the prime minister, he implied that what we were trying to do with quantum computers was make smaller computers. And while he didn't say anything technically inaccurate, I think that misses the point a little. So we're not really trying t…”
Frank Chen Jul 15, 2017 ▶ 2:30
Assertion Not checkable as stated
Chen: Most quantum physics experimentation happens inside supercomputers
“And so much of the experimentation that happens today on quantum physics happens inside supercomputers.”
Frank Chen Jul 15, 2017 ▶ 5:36
Assertion Partly supported
Chen: US relies entirely on computer simulation for nuclear weapons testing
“So the United States doesn't actually explode nuclear devices anymore. We signed the Comprehensive Test Ban Treaty, and so all of the work that we do now is in simulation.”
Frank Chen Jul 15, 2017 ▶ 6:18
Assertion Supported
Chen: Feynman realized traditional computers cannot simulate quantum mechanics
“The key insight that Richard Feynman had was that quantum mechanics is just way too complicated to simulate using traditional computers.”
Frank Chen Jul 15, 2017 ▶ 6:37
Assertion Supported
Chen: Simulating 1,000 electrons requires more states than universe's atoms
“So even with this very relatively simple example, we would need a computer that could represent more states, two to the 1000, then there are atoms in the known universe.”
Frank Chen Jul 15, 2017 ▶ 7:25
Insight
Chen: Quantum computers target problems impossible for classical hardware
“What we're really trying to do is build quantum computers that can solve a class of mathematical problems that we couldn't solve with traditional computers or that we could only solve with way big amounts of memory and would take a long, long, long, long time.”
Frank Chen Jul 15, 2017 ▶ 8:51
Assertion Not checkable as stated
Chen: Unobserved qubits represent probabilities between zero and one
“But a crazy quantum mechanics property is that when it's not observed, this qubit is actually representing the probability that it's zero or one.”
Frank Chen Jul 15, 2017 ▶ 11:19
Assertion Not checkable as stated
Chen: Quantum computers perform linear algebra instead of Boolean operations
“Instead of performing Boolean algebra operations, in quantum computers, what we're using is a set of quantum gates, and they implement quantum operations, and the way to think about this is as linear algebra operations.”
Frank Chen Jul 15, 2017 ▶ 12:27
Assertion Partly supported
Chen: Most quantum computers are cooled to 0.1 Kelvin
“Most quantum computers are cooled to 0.1 degrees Kelvin to minimize their interactions with the outside world.”
Frank Chen Jul 15, 2017 ▶ 18:30
Assertion Partly supported
Chen: State-of-the-art quantum coherence time is 100 microseconds
“State of the art these days is a hundred microseconds, but even a hundred microseconds is not a lot of time to perform operations in before the quantum coherence time makes it impossible for us to get a result out of the quantum computer.”
Frank Chen Jul 15, 2017 ▶ 19:07
Assertion Supported
Chen: Quantum coherence times are improving faster than Moore's Law
“In particular, the quantum coherence time seems to be progressing very, very quickly these days, and in fact, faster than Moore's Law”
Frank Chen Jul 15, 2017 ▶ 20:28
Assertion Supported
Chen: Quantum computers will make modern encryption instantly vulnerable
“So if we had a quantum computer, we could dramatically reduce the time it Took to recover the prime factors and all of modern crypto that we're using today would instantly be susceptible to attack because it wouldn't take a long, long time to decrypt somebody'…”
Frank Chen Jul 15, 2017 ▶ 22:12
Assertion Supported
Chen: NSA actively investigates quantum computing for prime factorization
“This is why the NSA and other state researchers are actively investigating how to use quantum computers and new algorithms to solve this particular mathematical problem.”
Frank Chen Jul 15, 2017 ▶ 22:31
Assertion Supported
Chen: Ammonia manufacturing consumes 1% to 2% of global energy
“Scientists estimate that between one and two percent of all of the energy generated in the world today goes to making ammonia from natural gas so we can make fertilizer.”
Frank Chen Jul 15, 2017 ▶ 23:50
Prediction Didn’t hold up
Chen: Tesla Gigafactory will surpass pre-2013 global battery output by 2020
“When it's in full production in 2020, this Gigafactory will produce more batteries each year than were produced in the entire world cumulatively through 2013.”
Frank Chen Jul 15, 2017 ▶ 24:37
Assertion Supported
Chen: Battery energy density improves at only 3% annually
“And since that time, the energy density, in other words, the amount of energy we can cram into a given volume of batteries, has been progressing at a rate of about three percent A year.”
Frank Chen Jul 15, 2017 ▶ 25:07
Made with StarZero

Turn any episode into a week of clips.

This entire site, over 1,000 episodes transcribed, diarized, checked and made playable, runs on the StarZero media pipeline. Drop in your own episode and the podcast clipper finds the moments worth sharing, cuts them, captions them, and reframes them for every feed.