We present a constructive algorithm for the determination of Ryu-Takayanagi surfaces in AdS3/CFT2 which exploits previously noted connections between holographic entanglement entropy and max-flow/min-cut. We then characterize its complexity as a polynomial time algorithm.
I. Agol, J. Hass and W. Thurston, The computational complexity of knot genus and spanning area, Trans. Amer. Math. Soc. 358 (2006) 3821 [math/0205057].
G. Chartrand and O.R. Oellermann, Applied and algorithmic graph theory, McGraw-Hill, U.S.A. (1993).
W. Ballmann, Lectures on spaces of nonpositive curvature, Springer, Germany (1995).
M. Headrick and V. Hubeny, to appear.
This article is distributed under the terms of the Creative Commons Attribution License (CC-BY 4.0), which permits any use, distribution and reproduction in any medium, provided the original author(s) and source are credited.
ArXiv ePrint: 1609.01727
About this article
Cite this article
Bao, N., Chatwin-Davies, A. The complexity of identifying Ryu-Takayanagi surfaces in AdS3/CFT2 . J. High Energ. Phys. 2016, 34 (2016). https://doi.org/10.1007/JHEP11(2016)034
- AdS-CFT Correspondence
- Classical Theories of Gravity