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