Related papers: The holographic entropy arrangement
In this thesis I present numerical studies of entanglement entropy and the quantum null energy condition in strongly coupled far-from-equilibrium quantum states using holography. I give a careful introduction into the numerical methods used…
We develop a reinforcement learning algorithm to study the holographic entropy cone. Given a target entropy vector, our algorithm searches for a graph realization whose min-cut entropies match the target vector. If the target vector does…
We present a deterministic way of finding contraction maps for candidate holographic entanglement entropy inequalities modulo choices due to actual degeneracy. We characterize its complexity and give an argument for the completeness of the…
We investigate the Holographic Entanglement Entropy proposal in the context of the (3+1)-dimensional topological black hole. In contrast to the well-studied (2+1)-dimensional case, the maximal extension for this black hole includes only a…
We review and generalize the recently introduced framework of entropy vectors for detecting and quantifying genuine multipartite entanglement in high dimensional multicomponent quantum systems. We show that these ideas can be extended to…
In this note we calculate the holographic entanglement entropy in the presence of a conformal interface for a geometric configuration in which the entangling region ${\cal A}$ lies on one side of the interface. For the supersymmetric Janus…
Holography is a cornerstone characterisation and imaging technique that can be applied to the full electromagnetic spectrum, from X-rays to radio waves or even particles such as neutrons. The key property in all these holographic approaches…
In this article, we review recent progresses on the holographic understandings of the entanglement entropy in the AdS/CFT correspondence. After reviewing the general idea of holographic entanglement entropy, we will explain its applications…
We introduce with geometric means a density matrix decomposition of a multipartite quantum system of a finite dimension into two density matrices: a separable one, also known as the best separable approximation, and an essentially entangled…
We consider holographic entanglement entropy in AdS black hole backgrounds by using the limit of large number of dimensions. By dividing the geometry to two patches (with one patch covering the vicinity of the black hole horizon and another…
Creating large-scale entanglement lies at the heart of many quantum information processing protocols and the investigation of fundamental physics. For multipartite quantum systems, it is crucial to identify not only the presence of…
Hypergraphs provide a natural way to represent polyadic relationships in network data. For large hypergraphs, it is often difficult to visually detect structures within the data. Recently, a scalable polygon-based visualization approach was…
We study holographic entanglement entropy in four-dimensional quantum gravity with negative cosmological constant. By using the replica trick and evaluating path integrals in the minisuperspace approximation, in conjunction with the…
We consider the problem of embedding the nodes of a hypergraph into Euclidean space under the assumption that the interactions arose through closeness to unknown hyperedge centres. In this way, we tackle the inverse problem associated with…
The holographic entanglement entropy is computed for an entangling surface that coincides with the horizon of a boundary de Sitter metric. This is achieved through an appropriate slicing of anti-de Sitter space and the implementation of a…
We investigate several problems in entanglement theory from the perspective of convex optimization. This list of problems comprises (A) the decision whether a state is multi-party entangled, (B) the minimization of expectation values of…
We develop a bicategorical framework for entropy and Landauer's principle in which entropy-ordered state spaces are treated not merely through deterministic monotone maps, but through open many-to-many interfaces encoding feasible…
Persistent homology is a powerful tool for characterizing the topology of a data set at various geometric scales. When applied to the description of molecular structures, persistent homology can capture the multiscale geometric features and…
In the AdS/CFT correspondence, it is often convenient to regulate infinite quantities in asymptotically anti-de Sitter spacetimes by introducing a sharp cutoff in a radial coordinate. This procedure is a priori coordinate-dependent, and may…
A crystallographic arrangement is a set of linear hyperplanes satisfying a certain integrality property and decomposing the space into simplicial cones. Crystallographic arrangements were completely classified in a series of papers by…