Entanglement Spread in Communication Complexity and Many-Body Physics

Entanglement Spread in Communication Complexity and Many-Body Physics

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


Duration: 45:26
395 views
15

Aram Harrow (MIT)
https://simons.berkeley.edu/talks/communication-complexity-entanglement-spread-area-law-ground-state-gapped-local-hamiltonians
Quantum Wave in Computing Reunion



Other Videos By Simons Institute for the Theory of Computing


2021-08-24The Fine Line between Hard and Easy Inference Problems: The View from CSPs
2021-08-24In Search of New Algorithms Part II: Graphical Models
2021-08-23In Search of New Algorithms Part I: Neural Networks
2021-08-06An Almost Constant Lower Bound of the Isoperimetric Coefficient in the KLS Conjecture
2021-07-18Until the Sun Engulfs the Earth: Lower Bounds in Computational Complexity | Theory Shorts
2021-07-17Twisted Product Constructions for LDPC Quantum Codes
2021-07-17What the Foundations of Quantum Computer Science Teach Us About Chemistry
2021-07-17Electronic Structure in a Fixed Basis Is QMA-Complete
2021-07-17Improved Upper Bounds on the Stabilizer Rank of Magic States
2021-07-16Linear Growth of Quantum Circuit Complexity
2021-07-16Entanglement Spread in Communication Complexity and Many-Body Physics
2021-07-16Exponential Separations Between Learning With and Without Quantum Memory
2021-07-16A Rigorous and Robust Quantum Speed-up in Supervised Machine Learning
2021-07-16Provably Efficient Machine Learning for Quantum Many-Body Problems
2021-07-16Quantum Pseudorandomness and Classical Complexity
2021-07-15Quantum Generative Training Using Rényi Divergences
2021-07-15Quantum Algorithms for Escaping from Saddle Points
2021-07-15Quantum Pseudo-Randomness From Domain Walls and Spectral Gaps
2021-07-15Noise vs Imprecision in the Hardness of Random Quantum Circuits
2021-07-15Quantum Learning Algorithms Imply Circuit Lower Bounds
2021-07-15One-Way Functions Imply Secure Computation in a Quantum World


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Quantum Wave in Computing Reunion
Aram Harrow