Black Holes, Firewalls, and the Limits of Quantum Computers

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=cstKRACrMQY


Duration: 1:24:02
9,363 views
195

Scott Aaronson (University of Texas at Austin)
Theoretically Speaking Series
https://simons.berkeley.edu/events/theoretically-speaking-series-scott-aaronson



Other Videos By Simons Institute for the Theory of Computing


2017-11-07Weak Decoupling, Polynomial Folds, and Approximate Optimization over the Sphere
2017-11-07Pseudocalibration and SoS Lower Bounds
2017-11-06Sparse Polynomial Interpolation: Compressed Sensing, Super-resolution, or Prony?
2017-11-06Using Symmetry in Semidefinite Programming
2017-11-06Bounds for Matrix Factorization Ranks via Semidefinite Programming and...
2017-11-06A Lower Bound on the Positive Semidefinite Rank of Convex Bodies
2017-11-06Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time
2017-11-06Small (Explicit) Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits
2017-11-06Constructing Extended Formulations
2017-11-01Lower Bounds on the Size of Linear Programs
2017-10-27Black Holes, Firewalls, and the Limits of Quantum Computers
2017-10-06Natasha 2: Faster Non-convex Optimization Than SGD
2017-10-06From Minimum Cut to Submodular Minimization: Leveraging the Decomposable Structure
2017-10-06Will Vanishing Gradients Ever Vanish from Deep Learning?
2017-10-05Nonconvex Optimization for High-dimensional Learning: From ReLUs to Submodular Maximization
2017-10-05Faster Algorithms and New Iterative Methods for Computing the Stationary Distribution
2017-10-05Trends in Large-scale Nonconvex Optimization
2017-10-04Sketchy Decisions: Convex Low-Rank Matrix Optimization with Optimal Storage
2017-10-04Randomized Iterative Methods and Complexity for Markov Decision Process
2017-10-04Hashing-based-estimators for Kernel Density in High Dimensions
2017-10-04Sublinear Time Low-rank Approximation of Positive Semidefinite Matrices


Tags:
Simons Institute
theoretical computer science
UC Berkeley
theoretically speaking
quantum computing