Related papers: Computing Entanglement Polytopes
We present local invariants of multi-partite pure or mixed states, which can be easily calculated and have a straight-forward physical meaning. As an application, we derive a new entanglement criterion for arbitrary mixed states of $n$…
In this paper we discuss two different existing algorithms for computing topological entropy and we perform one of them in order to compute the isentropes for cubic polynomials.
In this work we propose a practical entanglement classification scheme for pure states of $2\times L\times M\times N\times H$, under the stochastic local operation and classical communication (SLOCC), which generalizes the method explored…
Quantum information theory and quantum computing are theoritical basis of quantum computers. Thanks to entanglement, quantum mechanical systems are provisioned to realize many information processing problems faster than classical…
For a positive integer $n\ge 3$, the collection of $n$-sided polygons embedded in $3$-space defines the space of geometric knots. We will consider the subspace of equilateral knots, consisting of embedded $n$-sided polygons with unit length…
A convergent iterative procedure is proposed for the calculation of the relative entropy of entanglement of a given bipartite quantum state. When this state turns out to be non-separable the algorithm provides the corresponding optimal…
Knots, links and entangled filaments appear in many physical systems of interest in biology and engineering. Classifying knots and measuring entanglement is of interest both for advancing knot theory, as well as for analyzing large data…
Quantum entanglement is a particularly useful characterization of topological orders which lack conventional order parameters. In this work, we study the entanglement in topologically ordered states between two arbitrary spatial regions,…
The study of the entanglement entropy and entanglement spectrum has proven to be very fruitful in identifying topological phases of matter. Typically, one performs numerical studies of finite-size systems. However, there are few rigorous…
A method is proposed to characterize and quantify multipartite entanglement in terms of the probability density function of bipartite entanglement over all possible balanced bipartitions of an ensemble of qubits. The method is tested on a…
Quantifying entanglement in composite systems is a fundamental challenge, yet exact results are only available in few special cases. This is because hard optimization problems are routinely involved, such as finding the convex decomposition…
We consider three-partite pure states in the Hilbert space $\mathbb{C}^2 \otimes \mathbb{C}^m \otimes \mathbb{C}^n$ and investigate to which states a given state can be locally transformed with a non-vanishing probability. Whenever the…
In this paper, we study pure state entanglement in systems of dimension $2\otimes m\otimes n$. Two states are considered equivalent if they can be reversibly converted from one to the other with a nonzero probability using only local…
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…
It is a recent observation that entanglement classification for qubits is closely related to local $SL(2,\CC)$-invariants including the invariance under qubit permutations, which has been termed $SL^*$ invariance. In order to single out the…
Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…
To quantify the entanglement of bipartite systems in terms of some entanglement measure is a challenging problem in general, and it is much worse when the information about the system is less. In this manuscript, based on two classes of…
Present theoretical predictions for the entanglement entropy through topological defects are violated by numerical simulations. In order to resolve this, we introduce a paradigm shift in the preparation of reduced density matrices in the…
We consider a class of $0$-$1$ polynomial programming termed multiple choice polynomial programming (MCPP) where the constraint requires exact one component per subset of the partition to be $1$ after all the entries are partitioned.…
When a quantum system is divided into subsystems, their entanglement entropies are subject to an inequality known as "strong subadditivity". For a field theory this inequality can be stated as follows: given any two regions of space $A$ and…