Opinion certainty 3/5 debate potential 2/5

Aaronson: Most important quantum computing use case is simulating nature

Scott Aaronson · Scott Aaronson on Computational Complexity Theory and Quantum Computers · Y Combinator · Jun 29, 2018 · at 11:36

Theoretical computer scientist Scott Aaronson explains the primary real-world scientific applications that justify interest in quantum computing.

0:00 / 0:12exact quote · 12.4s
▶ Watch the full episode on YouTube → 720p mp4 · rendered on demand · StarZero watermark
“Maybe the most important application that we know about is just giving us this new way to simulate nature, simulate physics and chemistry, and maybe discover new drugs, discover new materials, right?”

quote is from the automated transcript, cleaned for reading: filler sounds and stutters are removed, nothing is rephrased. names can be misheard (the analysis reads context, assessments check outside sources). how →

More from Scott Aaronson

Opinion
Aaronson: Human stupidity is a bigger near-term threat than superintelligent AI
“When I think about, like, the future of civilization, you know, let's say the next 20 years, the next 50 years, I tend to worry less about super intelligence than I do about super stupidity. You know, I tend to worry about, you know, killing ourselves off or y…”
Scott Aaronson Jun 29, 2018 ▶ 52:02 Scott Aaronson on Computational Complexity Theory and Quantum Computers · Y Combinator
Insight
Aaronson: Quantum error correction turned scaling into an engineering challenge
“What changed everything for most of us in the nineties was the discovery of quantum error correction, right? And quantum fault tolerance. The upshot of which was if you want to build a scalable quantum computer, you don't need to get perfect qubits. That are p…”
Scott Aaronson Jun 29, 2018 ▶ 9:31 Scott Aaronson on Computational Complexity Theory and Quantum Computers · Y Combinator
Prediction Not checkable as stated
Aaronson: Certified randomness may be quantum computing's first near-term application
“As far as I can see, may be the first application of quantum computing that people could actually be able to realize with, like, near-term devices with 50 or 60 or 70 qubits. And this application is to generate cryptographically secure random bits.”
Scott Aaronson Jun 29, 2018 ▶ 12:38 Scott Aaronson on Computational Complexity Theory and Quantum Computers · Y Combinator
Assertion Supported
Aaronson: Differential privacy and quantum shadow tomography share a mathematical connection
“There's a, you know, precise mathematical connection between these two problems. You can prove it. You know, it goes in both directions, and then we were actually able to use it to, you know, take work that's been done in differential privacy by people who don…”
Scott Aaronson Jun 29, 2018 ▶ 29:46 Scott Aaronson on Computational Complexity Theory and Quantum Computers · Y Combinator
Assertion Supported
Aaronson: Holographic bulk-boundary mapping is a quantum error-correcting code
“The mapping between the bulk theory and the boundary theory in recent years, people realize that it is literally an example of one of these quantum error correcting codes that I talked, told you about before.”
Scott Aaronson Jun 29, 2018 ▶ 38:52 Scott Aaronson on Computational Complexity Theory and Quantum Computers · Y Combinator
Assertion Supported
Aaronson: Snowden documents revealed NIST pseudorandom standard was NSA-backdoored
“In fact, you know, NIST did have a standard for pseudorandom bits, which we learned a few years ago because of the Snowden documents was backdoored. By most likely by the NSA, right?”
Scott Aaronson Jun 29, 2018 ▶ 15:02 Scott Aaronson on Computational Complexity Theory and Quantum Computers · Y Combinator
Made with StarZero

Turn any episode into a week of clips.

This entire site, over 300 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.