Related papers: Towards a complete classification of holographic e…
We prove existence and uniqueness of solutions for an entropic version of the semi-geostrophic equations. We also establish convergence to a weak solution of the semi-geostrophic equations as the entropic parameter vanishes. Convergence is…
Even though little is known about the quantum entropy cone for $N\geq4$ subsystems, holographic techniques allow one to get a handle on the subspace of entropy vectors corresponding to states with gravity duals. For static spacetimes and…
We investigate a new definition of holographic entanglement entropy in the framework of static patch holography for de Sitter space. Using the replica trick and twist operator formalism, we derive an entropy functional in three-dimensional…
The holographic entanglement entropy for the most general higher derivative gravity is investigated. We find a new type of Wald entropy, which appears on entangling surface without the rotational symmetry and reduces to usual Wald entropy…
The holographic entropy cone (HEC) characterizes the entanglement structure of quantum states which admit geometric bulk duals in holography. Due to its intrinsic complexity, to date it has only been possible to completely characterize the…
On the basis of postulates for the holographic description of gravity and the introduction of entropic force, for static sources we derive the universal law: the entropy of a holographic screen is equal to quarter of its area in the Planck…
In the $(G,H)$-isomorphism game, a verifier interacts with two non-communicating players (called provers) by privately sending each of them a random vertex from either $G$ or $H$, whose aim is to convince the verifier that two graphs $G$…
We use holographic techniques to calculate the first thermal correction to the entanglement entropy of a cap-like region of a CFT defined on a sphere, successfully reproducing the field theory result. Since this is an order-one correction…
We completely classify the computational complexity of the list H-colouring problem for graphs (with possible loops) in combinatorial and algebraic terms: for every graph H the problem is either NP-complete, NL-complete, L-complete or is…
We study a number of (3+1)- and (2+1)-dimensional defect and boundary conformal field theories holographically dual to supergravity theories. In all cases the defects or boundaries are planar, and the defects are codimension-one. Using…
Using the probability theory-based approach, this paper reveals the equivalence of an arbitrary NP-complete problem to a problem of checking whether a level set of a specifically constructed harmonic cost function (with all diagonal entries…
We study holographic entanglement entropy in spatially anisotropic field theory. We observe that for the background we consider in this paper, to a good approximation, the holographic entanglement entropy can be decomposed into two terms.…
We examine the holographic entanglement entropy in hyperscaling violating backgrounds. Precisely in such theories by semi-analytic computation, we use holographic methods to derive the universal terms of entanglement entropy in various…
As it follows from G\"odel's incompleteness theorems, any consistent formal system of axioms and rules of inference should imply a true unprovable statement. Actually, this fundamental principle can be efficiently applicable in…
We revisit the recent reformulation of the holographic prescription to compute entanglement entropy in terms of a convex optimization problem, introduced by Freedman and Headrick. According to it, the holographic entanglement entropy…
Quantum corrections to holographic entanglement entropy require knowledge of the bulk quantum state. In this paper, we derive a novel dual prescription for the generalized entropy that allows us to interpret the leading quantum corrections…
We show that approximating the trace norm contraction coefficient of a quantum channel within a constant factor is NP-hard. Equivalently, this shows that determining the optimal success probability for encoding a bit in a quantum system…
In this paper we present the first deterministic polynomial time algorithm for determining the existence of a Hamiltonian cycle and finding a Hamiltonian cycle in general graphs. Our algorithm can also solve the Hamiltonian path problem in…
Co-compact entropy is introduced as an invariant of topological conjugation for perfect mappings defined on any Hausdorff space(compactness and metrizability not necessarily required). This is achieved through the consideration of…
We develop a formalism for calculating the entanglement entropy of an arbitrary spatial region of a gravitating spacetime at a moment of time symmetry. The crucial ingredient is a path integral over embeddings of the region into the overall…