Related papers: Computing Entanglement Polytopes
Multipartite entanglement is a natural generalization of bipartite entanglement, but is relatively poorly understood. In this paper, we develop tools to calculate a class of multipartite entanglement measures - known as multi-invariants -…
We analyze entanglement in the family of translationally-invariant matrix product states (MPS). We give a criterion to determine when two states can be transformed into each other by SLOCC transformations, a central question in entanglement…
We present a graphical method for proving holographic entanglement entropy inequalities (HEIs) in general multipartite systems. By introducing a geometric representation of the entanglement structure, we develop a systematic approach that…
We introduce the notion of entanglement of subspaces as a measure that quantify the entanglement of bipartite states in a randomly selected subspace. We discuss its properties and in particular we show that for maximally entangled subspaces…
We present a theoretical study of entanglement in ensembles consisting of an arbitrary number of particles. Multipartite entanglement criteria in terms of observables are formulated for a fixed number of particles as well as for systems…
The entanglement entropy of various geometries is calculated for the boundary theory dual to a stack of N Dp-branes. The entanglement entropies are readily expressed in terms of the effective coupling at the appropriate energy scales. The…
We present an approach to characterize genuine multiparticle entanglement using appropriate approximations in the space of quantum states. This leads to a criterion for entanglement which can easily be calculated using semidefinite…
We propose a new approach to the problem of defining the degree of entanglement between two particles in a pure state with Hilbert spaces of arbitrary finite dimensions. The central idea is that entanglement gives rise to correlations…
Witness operators are a central tool to detect entanglement or to distinguish among the different entanglement classes of multiparticle systems, which can be defined using stochastic local operations and classical communication (SLOCC). We…
Entanglement is known to serve as an order parameter for true topological order in two-dimensional systems. We show how entanglement of disconnected partitions defines topological invariants for one-dimensional topological superconductors.…
We provide a classification of entangled states that uses new discrete entanglement invariants. The invariants are defined by algebraic properties of linear maps associated with the states. We prove a theorem on a correspondence between the…
Entropy is a fundamental concept in quantum information theory that allows to quantify entanglement and investigate its properties, for example its monogamy over multipartite systems. Here, we derive variational formulas for relative…
The entanglement of graph states up to eight qubits is calculated in the regime of iteration calculation. The entanglement measures could be the relative entropy of entanglement, the logarithmic robustness or the geometric measure. All 146…
This paper presents a new measure of entanglement which can be employed for multipartite entangled systems. The classification of multipartite entangled systems based on this measure is considered. Two approaches to applying this measure to…
We compute all third-order local invariants accessible via randomised measurements and employ them to derive separability criteria. The reconstruction of the invariants yields experimentally accessible entanglement criteria for multipartite…
The study on the entanglement polygon inequality of multipartite systems has attracted much attention. However, most of the results are on pure states. Here we consider the property for a class of mixed states, which are the reduced density…
In [M. Walter et al., Science 340, 1205, 7 June (2013)], they gave a sufficient condition for genuinely entangled pure states and discussed SLOCC classification via polytopes and the eigenvalues of the single-particle states. In this paper,…
We present an easy implementable algorithm for approximating the geometric measure of entanglement from above. The algorithm can be applied to any multipartite mixed state. It involves only the solution of an eigenproblem and finding a…
This paper proposes a novel and simple algorithm of facet enumeration for convex polytopes. The complexity of the algorithm is discussed. The algorithm is implemented in Matlab. Some simple polytopes with known H-representations and…
Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…