The structural study of entanglement in multipartite systems is hindered by the lack of necessary and sufficient operational criteria able to discriminate among the various entanglement properties of a given mixed state. Here, we pursue a different route to the study of multipartite entanglement based on the closeness of a multipartite state to the set of separable ones. In particular, we analyze multipartite diagonal symmetric N qubit states and provide the analytical expression for their Best Separable Approximation (BSA [Phys. Rev. Lett. 80, 2261 (1998)]), that is, their unique convex decomposition into a separable part and an entangled one with maximal weight of the separable one.
A geometric approach to investigation of quantum entanglement is advocated. Analyzing the space of pure states of a bipartite system we show how an entanglement measure of a gives state can be related to its distance to the closest separable state. We study geometry of the (N2 - 1)-dimensional convex body of mixed quantum states acting on an N-dimensional Hilbert space and demonstrate that it belongs to the class of sets of a constant height. The same property characterizes the set of all separable states of a two-qubit system. These results contribute to our understanding of quantum entanglement and its dynamics.
The structural study of entanglement in multipartite systems is hindered by the lack of necessary and sufficient operational criteria able to discriminate among the various entanglement properties of a given mixed state. Here, we pursue a different route to the study of multipartite entanglement based on the closeness of a multipartite state to the set of separable ones. In particular, we analyze multipartite diagonal symmetric
N-qubit states and provide the analytical expression for their best separable approximation (BSA, [Phys. Rev. Lett. 80, 2261 (1998)]), that is, their unique convex decomposition into a separable part and an entangled part, with maximal weight of the separable part.
Quantum states are the key mathematical objects in quantum mechanics, and entanglement lies at the heart of the nascent fields of quantum information processing and computation. However, there has not been a general, necessary and sufficient, and operational separability condition to determine whether an arbitrary quantum state is entangled or separable. In this paper, we show that whether a quantum state is entangled or not is determined by a threshold within the quantum state. We first introduce the concept of finer and optimal separable states based on the properties of separable states in the role of higher-level witnesses. Then we show that any bipartite quantum state can be decomposed into a convex mixture of its optimal entangled state and its optimal separable state. Furthermore, we show that whether an arbitrary quantum state is entangled or separable, as well as positive partial transposition (PPT) or not, is determined by the robustness of its optimal entangled state to its optimal separable state with reference to a crucial threshold. Moreover, for an arbitrary quantum state, we provide operational algorithms to obtain its optimal entangled state, its optimal separable state, its best separable approximation (BSA) decomposition, and its best PPT approximation decomposition. And the open question of how to calculate the BSA in high-dimension systems is partially done.
An important problem in quantum information theory is the quantification of entanglement in multipartite mixed quantum states. In this work, a connection between the geometric measure of entanglement and a distance measure of entanglement is established. We present a new expression for the geometric measure of entanglement in terms of the maximal fidelity with a separable state. A direct application of this result provides a closed expression for the Bures measure of entanglementof two qubits. We also prove that the number of elements in an optimal decomposition w.r.t. the geometric measure of entanglement is bounded from above by the Caratheodory bound, and we find necessary conditions for the structure of an optimal decomposition.
We investigate the geometric structure of the set of spectra of bipartite absolute separable states (
ASEPm,n) and absolute positive partial transpose states (
APPTm,n), \emph{i.e.}, bipartite quantum states that remain separable or PPT, respectively, under all global unitary transformations. First, we establish general geometric properties of absolute convex sets of matrices, their spectra and extreme points. Regarding absolute separability, we present a permutation-symmetric reformulation of the absolute PPT criterion and use it to demonstrate that
APPTm,n is a spectrahedron for all
m≤n: in particular, all its faces are exposed. While
ASEP2,n is a spectrahedron, too, for
ASEPm,n we can in general only show that it is a semialgebraic set for all
m,n≥3. Furthermore, we provide a complete characterization of the faces and extreme points of
APPTm,n and demonstrate that the dimension of a face is determined by the rank of a certain matrix, with maximal proper faces having dimension
mn−m−1.
In the quantitative setting, we provide a rigorous lower bound on the maximal attainable purity of
APPTm,n via an inscribed polytope
Pm,n and conjecture that the maximal purity of
APPTm,n (along with its spectra) coincides with the polytope for arbitrary dimensions except when
m=n=2. Additionally, we also provide a rigorous upper bound on the minimal von Neumann entropy of
APPTm,n and demonstrate numerically that the minimum entropy eventually coincides with the polytope
Pm,n as the local system dimension
n increases. Finally, we show that the relative spectral volume of
APPTm,n decays exponentially in
n by a constant multiplicative factor of the relative volume of the inscribed polytope
Pm,n.