How Quantum Complexity Found Its Way into Black Hole Physics | Special Lecture

Published on ● Video Link: https://www.youtube.com/watch?v=Ayp1yFAFoKQ



Duration: 1:11:35
316 views
0


Leonard Susskind (Stanford University)
https://simons.berkeley.edu/talks/leonard-susskind-stanford-university-2024-03-18
Quantum Complexity: Quantum PCP, Area Laws, and Quantum Gravity

Computational complexity is a very deep mathematical and logical concept that can give objective meaning to questions as varied as: How difficult is a theorem (some theorems are clearly more difficult than others); to how long a time does it take to produce a given quantum state of a quantum computer. But it has never till now been thought of as a physical property of a system. It was a great surprise that it found its way into black hole physics as a geometric property of black holes---the geometric size of their interiors. The introduction of complexity has greatly clarified the meaning of the black hole horizon. For example we now know that in many cases it is wrong to say that things cannot escape from behind the horizon; it is merely very complex. The horizon is also a censor that forbids an observer outside the black hole from witnessing violations of a profound physical principle: the so-called "quantum extended Church Turing Thesis." I'll try my best to explain these things.




Other Videos By Simons Institute for the Theory of Computing


2024-04-15What on Earth Does Complexity Theory Have to Do with Gravity?
2024-04-15Expansion of Higher-Dimensional Cubical Complexes With Application To Good ...
2024-04-15The Quantum Games PCP: Results and Confessions
2024-04-15Circuit-To-Hamiltonian From Tensor Networks and Fault Tolerance
2024-04-15NLTS Hamiltonians (and Strongly-Explicit SoS Lower Bounds) from Low-Rate Quantum LDPC Codes
2024-04-15Local Minima in Quantum Systems
2024-04-15Oracle Separations Between QMA and QCMA
2024-04-15Classification of 2D Gapped Ground States With Strict Area Law
2024-04-15Introduction To Commuting Local Hamiltonian Problems
2024-04-15Quantum Complexity of Clique Homology
2024-04-15How Quantum Complexity Found Its Way into Black Hole Physics | Special Lecture
2024-04-04Private Information Retrieval: Chasing Capacity with Algebraic Codes
2024-04-04Data Deduplication For Redundant Graph Structures Files
2024-04-04High-Rate Fair-Density Parity-Check Codes
2024-04-04Graph Neural Networks for Classical and Quantum Channel Coding
2024-04-04Sparsity and Privacy in Distributed Matrix Multiplication
2024-04-04Service Rates Of Mds Codes & Fractional Matchings In Quasi-Uniform Hypergraphs
2024-04-04Combinatorial Problems in Support Recovery for 1-bit Compressed Sensing
2024-04-04Approximate coding computing
2024-04-04Coded matrix computation: numerical stability, partial stragglers and sparse input matrices
2024-04-04Coding For Dna Storage With Nanopore Sequencing



Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Quantum Complexity: Quantum PCP; Area Laws; and Quantum Gravity
Leonard Susskind