A Quantum Complexity Approach to the Problem of Weak Cosmic Censorship

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



Duration: 1:06:04
136 views
2


Netta Engelhardt (MIT)
https://simons.berkeley.edu/talks/netta-engelhardt-mit-2024-03-22
Quantum Complexity: Quantum PCP; Area Laws; and Quantum Gravity

I’ll motivate and describe the conjecture of weak cosmic censorship — that singularities resulting from gravitational collapse always lie behind event horizons. This conjecture is false in its standard classical formulation, but I’ll argue that there exists a partial quantum analogue that can be proved using complexity theoretic arguments.







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
Netta Engelhardt