ycliper

Популярное

Музыка Кино и Анимация Автомобили Животные Спорт Путешествия Игры Юмор

Интересные видео

2025 Сериалы Трейлеры Новости Как сделать Видеоуроки Diy своими руками

Топ запросов

смотреть а4 schoolboy runaway турецкий сериал смотреть мультфильмы эдисон
Скачать

Quantum Complexity: Scott Aaronson on P vs NP and the Future

Автор: 632nm

Загружено: 2025-07-15

Просмотров: 10898

Описание: In this episode of the 632nm podcast, Scott Aaronson shares his early fascination with calculus at age 11 and how “rediscovering” old mathematics led him toward groundbreaking work in complexity theory. He gives a lucid explanation of P vs NP, revealing how seemingly trivial questions about verifying solutions speak to some of the deepest unsolved problems in all of computing.

Aaronson also explores the frontiers of quantum computing, from the nuances of quantum supremacy experiments to the idea of quantum money and certified randomness. He explains how amplitudes—rather than straightforward probabilities—unlock powerful interference effects, yet still face limits imposed by measurement. The conversation concludes with a look at the future of fault-tolerant quantum computers and the possibility that we’ve finally reached the ultimate horizon of computability—unless nature has even stranger surprises in store.

02:01 Early Fascination with Mathematics
05:10 Exploring Complexity Theory
09:10 Understanding P vs NP
22:38 The Significance of P vs NP in Cryptography and AI
35:04 Mapping Problems and NP Completeness
38:37 Quantum Computing and BQP
41:41 Shor's Algorithm and Cryptography
45:39 Simulating Quantum Systems
52:04 Digital vs Analog Quantum Computers
58:18 Grover's Algorithm and Quantum Speedup
01:02:04 Challenges in Quantum Algorithm Development
01:06:41 Beam Splitter Networks and Quantum Sampling
01:15:22 Quantum Computing and Information Storage
01:17:24 Shor's Algorithm and Factoring Numbers
01:20:56 Google's Quantum Supremacy Demonstration
01:49:19 Quantum Money and Unclonable Cash
01:57:15 The Future of Quantum Computing

Follow us:

Twitter: https://x.com/632nmPodcast
Substack: https://632nmpodcast.substack.com/
Mikhail Shalaginov:   / mikhail-shalaginov  
Michael Dubrovsky: https://x.com/MikeDubrovsky
Xinghui Yin: https://x.com/XinghuiYin

Subscribe:

Apple Podcasts: https://podcasts.apple.com/us/podcast...
Spotify: https://open.spotify.com/show/4aVH9vT...
Website: https://www.632nm.com

Не удается загрузить Youtube-плеер. Проверьте блокировку Youtube в вашей сети.
Повторяем попытку...
Quantum Complexity: Scott Aaronson on P vs NP and the Future

Поделиться в:

Доступные форматы для скачивания:

Скачать видео

  • Информация по загрузке:

Скачать аудио

Похожие видео

The Future of Quantum Computing and AI - Scott Aaronson

The Future of Quantum Computing and AI - Scott Aaronson

Information, Entropy & Reality | MIT Professor Seth Lloyd on Quantum Computing

Information, Entropy & Reality | MIT Professor Seth Lloyd on Quantum Computing

Scott Aaronson: The Greatest Unsolved Problem in Math

Scott Aaronson: The Greatest Unsolved Problem in Math

David Deutsch: AGI, the origins of quantum computing, and the future of humanity

David Deutsch: AGI, the origins of quantum computing, and the future of humanity

Scott Aaronson on Computational Complexity Theory and Quantum Computers

Scott Aaronson on Computational Complexity Theory and Quantum Computers

P vs. NP and the Computational Complexity Zoo

P vs. NP and the Computational Complexity Zoo

Refuting Eric Weinstein's and Stephen Wolfram's Theories of Everything | Scott Aaronson & Tim Nguyen

Refuting Eric Weinstein's and Stephen Wolfram's Theories of Everything | Scott Aaronson & Tim Nguyen

Самая большая головоломка в информатике: P против NP

Самая большая головоломка в информатике: P против NP

Prof. Scott Aaronson: Why Philosophers Should Care About Computational Complexity @ UT Austin

Prof. Scott Aaronson: Why Philosophers Should Care About Computational Complexity @ UT Austin

Quantum Expert Insight:  Peter Shor

Quantum Expert Insight: Peter Shor

Scott Aaronson: What is a Quantum Computer? | AI Podcast Clips

Scott Aaronson: What is a Quantum Computer? | AI Podcast Clips

Straight Talk on Quantum Computing

Straight Talk on Quantum Computing

How to Build Fault-Tolerant Quantum Computers | Austin Fowler on Surface Codes + TQEC

How to Build Fault-Tolerant Quantum Computers | Austin Fowler on Surface Codes + TQEC

QTML Panel Discussion - Future of Quantum Computing - Just Zoom screen

QTML Panel Discussion - Future of Quantum Computing - Just Zoom screen

Trapped Ion Quantum Computing: From BEC to Big Industry

Trapped Ion Quantum Computing: From BEC to Big Industry

How Much Math Is Knowable?

How Much Math Is Knowable?

Может ли новый закон физики объяснить парадокс черной дыры?

Может ли новый закон физики объяснить парадокс черной дыры?

Quantum Computing: Peter Zoller and Ignacio Cirac on the Quantum Revolution

Quantum Computing: Peter Zoller and Ignacio Cirac on the Quantum Revolution

Scott Aaronson: Computational Complexity and Consciousness | Lex Fridman Podcast #130

Scott Aaronson: Computational Complexity and Consciousness | Lex Fridman Podcast #130

Quantum Computing, Complexity Theory & AI ft. Scott Aaronson | Know Time 119

Quantum Computing, Complexity Theory & AI ft. Scott Aaronson | Know Time 119

© 2025 ycliper. Все права защищены.



  • Контакты
  • О нас
  • Политика конфиденциальности



Контакты для правообладателей: [email protected]