Related papers: A Gap Between the Hypergraph and Stabilizer Entrop…
The default way of proving holographic entropy inequalities is the contraction method. It divides Ryu-Takayanagi (RT) surfaces on the `greater than' side of the inequality into segments, then glues the segments into candidate RT surfaces…
We review the results of refs. [1,2], in which the entanglement entropy in spaces with horizons, such as Rindler or de Sitter space, is computed using holography. This is achieved through an appropriate slicing of anti-de Sitter space and…
We use the concept of \textit{entangled graphs} with weighted edges to present a classification for four-qubit entanglement which is based neither on the LOCC nor the SLOCC. Entangled graphs, first introduced by Plesch et al. [Phys. Rev. A…
Stabilizer states and graph states find application in quantum error correction, measurement-based quantum computation and various other concepts in quantum information theory. In this work, we study party-local Clifford (PLC)…
We develop a method for visualizing the internal structure of multipartite entanglement in pure stabilizer states. Our algorithm graphically organizes the many-body correlations in a hierarchical structure. This provides a rich taxonomy…
In holographic duality, if a boundary state has a geometric description that realizes the Ryu-Takayanagi proposal then its entanglement entropies must obey certain inequalities that together define the so-called holographic entropy cone. A…
A hypergraph is Sperner if no hyperedge contains another one. A Sperner hypergraph is equilizable (resp., threshold) if the characteristic vectors of its hyperedges are the (minimal) binary solutions to a linear equation (resp., inequality)…
The wedge product of vectors has been shown to yield the generalised entanglement measure I-concurrence, wherein the separability of the multiparty qubit system arises from the parallelism of vectors in the underlying Hilbert space of the…
Recent work has characterized the various inequalities that entanglement entropies represented by min-cuts on hypergraphs will satisfy. This collection, the hypergraph entropy cone, can be seen as a generalization of the holographic entropy…
We continue the study of the quantum marginal independence problem, namely the question of which faces of the subadditivity cone are achievable by quantum states. We introduce a new representation of the patterns of marginal independence…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
We investigate the entanglement entropy in 1+1-dimensional $SU(N)$ gauge theories with various matter fields using the lattice regularization. Here we use extended Hilbert space definition for entanglement entropy, which contains three…
We present the modified relative entropy of entanglement for multi-party systems by a given relative density matrix which is spanned by a linear combination of the direct products of so-called basis of relative density matrices and reduced…
We determine holographically 2-point correlators of gauge invariant operators with large conformal weights and entanglement entropy of strips for a time-dependent anisotropic 5-dimensional asymptotically anti-de Sitter spacetime. At the…
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…
Exploring an analytical expression for the convex roof of the pure state squared concurrence for rank 2 mixed states the entanglement of a system of three particles under decoherence is studied, using the monogamy inequality for mixed…
We study various distance-like entanglement measures of multipartite states under certain symmetries. Using group averaging techniques we provide conditions under which the relative entropy of entanglement, the geometric measure of…
We investigate the hypercube networks that their nodes are considered as quantum harmonic oscillators. The entanglement of the ground state can be used to quantify the amount of information each part of a network shares with the rest of the…
For any graph, we define a rank-1 operator on a bipartite tensor product space, with components associated to the set of vertices and edges respectively. We show that the partial traces of the operator are the Laplacian and the…
Entanglement entropies computed using the holographic Ryu-Takayanagi formula are known to obey an infinite set of linear inequalities, which define the so-called RT entropy cone. The general structure of this cone, or equivalently the set…