Complexity, action, and black holes
arXiv:1512.04993 · doi:10.1103/PhysRevD.93.086006
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.
55+14 pages, many figures. v2: (so many) typos fixed, references added