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

Published 6 Sep 2016 in hep-th, cs.CC, gr-qc, and quant-ph | (1609.01727v2)

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.

Abstract PDF Upgrade to Chat

Authors (2)

Citations (5)

View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.