pith. sign in

arxiv: 1609.01727 · v2 · pith:EAXZFNOBnew · submitted 2016-09-06 · ✦ hep-th · cs.CC· gr-qc· quant-ph

The Complexity of Identifying Ryu-Takayanagi Surfaces in AdS3/CFT2

classification ✦ hep-th cs.CCgr-qcquant-ph
keywords ads3algorithmcft2complexityryu-takayanagisurfacescharacterizeconnections
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.