SA
Guest dossier
Scott Aaronson
computer scientist
Scott Joel Aaronson is an American theoretical computer scientist and Schlumberger Centennial Chair of Computer Science at the University of Texas at Austin. His primary areas of research are computational complexity theory and quantum computing.
Across 2 conversations, Scott Aaronson ranges across NISQ era, decoherence, post-quantum cryptography. Quantum supremacy was demonstrated by Google's quantum computer solving a sampling problem with 53 qubits, requiring classical verification of about nine quadrillion calculations. Quantum computing's potential to break current cryptographic systems hinges on scalable quantum computers, which require millions of qubits.
Synthesized by TLexDR from 2 conversations. AI-generated. Report an inaccuracy
The idea map
Scott's intellectual territory
Click a star to read the quotes and jump into the episode.
For the specialist
previewQuantum error correction is vital due to decoherence, which remains a fundamental challenge since the 1990s.
#72Scott Aaronson: Quantum Computing
Dequantization has led to classical algorithms performing similarly to some quantum algorithms, challenging the uniqueness of quantum speedups.
#72Scott Aaronson: Quantum Computing
Aaronson argues that IIT's phi, a measure of consciousness, lacks scientific rigor and is based on flawed assumptions about system connectivity.
#130Scott Aaronson: Computational Complexity and Consciousness
Quantum computing's inability to efficiently solve NP problems like factoring challenges its perceived potential to revolutionize cryptography.
#130Scott Aaronson: Computational Complexity and Consciousness
The appearances
Every conversation, in order
Reading list
What they pointed you toward
books
papers
articles
Every idea, by region
The full territory
quantum supremacy
NISQ eradecoherencepost-quantum cryptographyquantum supremacyquantum error correctionquantum computing
quantum computingAdjacent minds