Complexity, action, and black holes
Adam R. Brown, Daniel A. Roberts, Leonard Susskind, Brian Swingle,, Ying Zhao
TL;DR
This paper supports the conjecture that the quantum complexity of holographic states equals the classical action of a bulk region, explores its broader implications, and discusses black holes as the universe's fastest computers.
Contribution
It provides detailed calculations confirming the 'Complexity Equals Action' conjecture and elaborates on black holes as optimal computational entities.
Findings
Confirmed the complexity-action relationship through calculations
Connected the conjecture to tensor network frameworks
Discussed black holes as the fastest computational systems
Abstract
Our earlier paper "Complexity Equals Action" conjectured that the quantum computational complexity of a holographic state is given by the classical action of a region in the bulk (the "Wheeler-DeWitt" patch). We provide calculations for the results quoted in that paper, explain how it fits into a broader (tensor) network of ideas, and elaborate on the hypothesis that black holes are the fastest computers in nature.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Mechanics and Applications · Computational Physics and Python Applications