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

TL;DR

This paper introduces a polynomial-time algorithm for finding Ryu-Takayanagi surfaces in AdS3/CFT2, leveraging max-flow/min-cut connections to improve understanding of holographic entanglement entropy.

Contribution

It provides the first constructive, polynomial-time algorithm for identifying Ryu-Takayanagi surfaces in AdS3/CFT2, advancing computational methods in holography.

Findings

Algorithm operates in polynomial time

Utilizes max-flow/min-cut connections

Enhances computational understanding of holographic entanglement

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.