Complexity, action, and black holes
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 "WheelerDeWitt" 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.
 Publication:

Physical Review D
 Pub Date:
 April 2016
 DOI:
 10.1103/PhysRevD.93.086006
 arXiv:
 arXiv:1512.04993
 Bibcode:
 2016PhRvD..93h6006B
 Keywords:

 High Energy Physics  Theory;
 General Relativity and Quantum Cosmology;
 Quantum Physics
 EPrint:
 55+14 pages, many figures. v2: (so many) typos fixed, references added