A geometric understanding of entanglement is proposed based on local measurements. Taking recourse to the general structure of density matrices in the framework of Euclidean geometry, we first illustrate our approach for bipartite Werner states. It is demonstrated that separable states satisfy certain geometric constraints that entangled states do not. A separability criterion for multiparty Werner states of arbitrary dimension is derived. This approach can be used to determine separability across any bipartition of a general density matrix and leads naturally to a computable measure of entanglement for multiparty pure states. It is known that all density matrices within a certain distance of the normalized identity are separable. This distance is determined for a general setting of $n$ qudits, each of dimension $d$.
A geometric understanding of entanglement is proposed based on local measurements. Taking recourse to the general structure of density matrices in the framework of Euclidean geometry, we first illustrate our approach for bipartite Werner states. It is demonstrated that separable states satisfy certain geometric constraints that entangled states do not. A separability criterion for multiparty Werner states of arbitrary dimension is derived. This approach can be used to determine separability across any bipartition of a general density matrix and leads naturally to a computable measure of entanglement for multiparty pure states. It is known that all density matrices within a certain distance of the normalized identity are separable. This distance is determined for a general setting of n qudits, each of dimension d.
A geometric understanding of entanglement is proposed based on local measurements. Taking recourse to the general structure of density matrices in the framework of Euclidean geometry, we illustrate our approach for the two qubit states, which is subsequently generalized for qudits and arbitrary number of entangled qubits. It is demonstrated that separable states satisfy certain geometric constraints that entangled states do not. This approach leads to the known geometric measure of entanglement for pure states. The crucial role of local measurement in quantification of entanglement is explicated.
In the studies of quantum information and computation, the quantum correlations
present in a non-classical system are seen as natural resources. In this
thesis, we present a detailed study on quantification and characterization of
multipartite quantum entanglement from a geometric perspective. Furthermore,
we present protocols and algorithms where quantum correlations such
as entanglement, quantum Fisher information, and quantum superposition
have been used to provide advantages as well securities in quantum communication
tasks, quantum speed-up, and protection against the decoherence in
an open quantum system.
First, we use a geometric measure of entanglement quantification based
on Euclidean distance of the Hermitian matrices to obtain the minimum distance
between the set of bipartite n- qudit density matrices with a positive
partial transpose and the maximally mixed state. This minimum distance coincides
with the radius of the largest separable ball. We present the interior
geometry of the set of all positive semidefinite matrices and identify a particular
class of Werner states for which the Peres-Horodecki criterion is both
necessary and sufficient for separability even in the dimensions greater than
six.
Quantum properties, such as entanglement and coherence, are indispensable resources in various quantum information processing tasks. However, given a quantum state, it is not a simple question to identify whether it is entangled or not. We study the entanglement of quantum systems in arbitrary dimensions using the Bloch representation of density matrix. This approach enables us to consider quantum entanglement geometrically. We first analyze the effect of local Bloch vector on determining whether a quantum state is entangled or separable, and obtain an entanglement criterion related to local Bloch vector, which is stronger than the criterion that only considers the correlation matrix. This criterion is equivalent to the optimized computable cross norm criterion in [14]. Our proof is considered from the perspective of Bloch representation, and there is no need to know the matrix relignment in advance. This criterion also be extended to the problem of the separability of tripartite quantum states. We then combine the local filtering transformation with this entanglement criterion. After applying a suitable local filtering transformation, the quantum state has at most one nonzero Bloch vector, and examples are given to illustrate that the local filtering transformation can help detect some bound states where the original entanglement criterion fails. Moreover, for a finite-dimensional quantum system in which one party is a qubit, we give an analytical form of the combined entanglement criterion.
Summary: \nEntanglement is a strange feature contained in the quantum mechanical framework, first observed theoretically by Erwin Schrödinger and Albert Einstein. An inherent attribute of entanglement is non-locality, and in the continuation of this, several non-reductionist features, which are conceptually challenging and philosophically interesting. \n \nA considerable growth of the interest in quantum entanglement has occurred since the early 1990s, and much of the reason for this is that the tools of quantum optics and modern instrumentation have made it possible to measure and manipulate entangled quantum systems. Today, several applications of entanglement exist, including quantum computers and several areas in quantum communications. \n \nA quantum state is either separable or entangled, it cannot be none or both. A separable state do not exhibit the non-local features found in entangled states, and are in this sense comparable to classic states. An important issue here is the separability problem, which is the problem of determining whether a given state is entangled or not. \n \nWe study these quantum states as Hermitian matrices with positive eigenvalues in convex spaces. The PPT criterion is based on the partial transposition operation, which essentially transposes one of the two subsystems in the quantum system. For some states the result is another quantum (positive) state, and these are PPT (Positive Partial Transpose) states, while others that gain negative eigenvalues are called NPT states. \n \nFor systems of dimensions 2 × 2 and 2 × 3, the PPT states are identical to the separable states, and the NPT states are identical to the entangled states, so the PPT criterion is always conclusive. But for larger dimensions, such as for instance the 3 × 3 system, there always exist PPT states that are entangled, so for this case the PPT criterion can only be used in a contrapositive way. Since entangled PPT states in this sense seem to have great significance, their characteristics are worth studying. \nAs mentioned, the PPT criterion uses the transposition map on one of the two subsystems of a composite quantum system. Transposition is an example of a positive map, in that it maps all quantum states into quantum states. It is possible to use positive maps to formulate a much more general criterion for the separability problem.There is a link (an isomorphism) between positive maps and a subset of Hermitian operators called entanglement witnesses. \n \nThe so-called Horodecki criterion states that a quantum state is separable if and only if the expectation value of all entanglement witnesses in the state are non-negative. If the expectation value of one (or possibly several) entanglement witnesses in a given quantum state is negative, then the state is always entangled. This criterion is both necessary and sufficient, but demands that we can characterize the entire set of entanglement witnesses. \n \nThe approach in this thesis is through geometry. Of fundamental importance is the convex nature of the sets in question. The knowledge and understanding of the extremal points in these sets is very relevant, since they describe the sets completely. Undertaking completely analytic studies of the geometry at hand is in general very hard, especially as the dimension of the systems grow. The development and use of numerical tools is therefore essential.
Quantum entanglement is a fundamental resource in quantum information theory, yet its general characterization and quantification remain challenging, especially in multipartite systems. In this work we investigate entanglement from a geometric perspective, focusing on the Riemannian structure induced by the Fubini--Study metric on the projective Hilbert space of multi-qubit quantum states. By exploiting the local-unitary invariance of this metric, we derive the entanglement distance (ED), a geometric measure that quantifies entanglement as an obstruction to locally minimizing the sum of squared Fubini--Study distances generated by local operations.
We analyze the properties of ED for pure multi-qubit states and discuss its behavior under local operations and classical communication. In particular, we show that ED reproduces established entanglement measures in well-defined and restricted settings. For pure states of two qubits, ED reduces to an exact monotone function of the concurrence and, independently, to an explicit monotone function of the entropy of entanglement. These results provide a clear geometric interpretation of standard bipartite entanglement measures within the present framework, while highlighting the limitations of such correspondences beyond the two-qubit case.
Abstract We introduce a geometric framework for studying Bell nonlocality in Hilbert space, where, for a given quantum state, nonlocality is quantified by the distance between the state and the set of local states. This approach applies to any Bell inequality and any measurement scenario. Whenever the local set is characterized, the proposed nonlocality measure can be computed explicitly. As a general result, we prove that for any scenario in arbitrary dimension the closest local state to a Werner state is itself a Werner state, and analogously, the closest local state to an isotropic state is again isotropic. In the two-qubit case, we further show that the closest local state to a Bell-diagonal state is Bell-diagonal as well. These structural results are independent of the specific Bell inequality considered, thus revealing intrinsic geometric features of these families of states and providing significant simplifications for computing the proposed measures. For the Clauser–Horne–Shimony–Holt inequality in two-qubit systems and the Collins-Gisin-Linden-Massar-Popescu inequality for two qudits of arbitrary finite dimension, we derive explicit geometric measures of nonlocality for Bell-diagonal, Werner, and isotropic states using various distance metrics, including the trace, Hellinger, Hilbert–Schmidt distances, and relative entropy. Furthermore, we prove in all generality that for all scenarios in which the local set is not fully characterized, the geometric measures provide rigorous lower bounds on nonlocality.