Talks by Scott Aaronson
-
Quantum Computational Supremacy and Its Applications
The University of Texas at Austin -
The Necromancy-Hardness of the Schrödinger's Cat Experiment
The University of Texas at Austin -
Certified Randomness from Quantum Supremacy
The University of Texas at Austin -
Complexity
-
The University of Texas at Austin
-
Massachusetts Institute of Technology (MIT)
-
-
Black Holes, Firewalls, and the Complexity of States and Unitary Transformations
The University of Texas at Austin -
The Territory Around BQP: Results and Open Problems
The University of Texas at Austin -
-
The Computational Complexity of Linear Optics
The University of Texas at Austin -
-
The Learnability of Quantum States
The University of Texas at Austin -
Limits on efficient computation in the physics world
The University of Texas at Austin -
