相关论文: Exact calculation of robustness of entanglement vi…
By considering the decomposition of a generic two qubit density matrix presented by Wootters [W. K. Wootters, Phys. Rev. Lett. {\bf 80} 2245 (1998)], the robustness of entanglement for any mixed state of two qubit systems is obtained…
We propose a simple geometrical approach for finding the robustness of entanglement for Bell decomposable states of 2 otimes 2 quantum systems. It is shown that the robustness of entanglement is equal to the concurrence. We also present an…
Motivated by the mathematical definition of entanglement we undertake a rigorous analysis of the separability and non-distillability properties in the neighborhood of those three-qubit mixed states which are entangled and completely…
In the quest of completely describing entanglement in the general case of a finite number of parties sharing a physical system of finite dimensional Hilbert space a new entanglement magnitude is introduced for its pure and mixed states:…
Adding the maximally mixed state with some weight to the entanglement system leads to disentanglement of the latter. For each predefined entangled state there exists a minimal value of this weight for which the system loses its entanglement…
With a probability of success of $95 \%$ we solve the separability problem for Bell diagonal qutrit states with positive partial transposition (PPT). The separability problem, i.e. distinguishing separable and entangled states, generally…
This paper is an appendix to a previous paper: quant-ph/0101123 ``Relaxation Method for Calculating Quantum Entanglement", by Robert Tucci. For certain mixtures of Bell basis states, namely the Werner States, we use the theoretical…
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…
When some of the parties of a multipartite entangled pure state are lost, the question arises whether the residual mixed state is also entangled, in which case the initial entangled pure state is said to be robust against particle loss. In…
We show a simple semidefinite program whose optimal value is equal to the maximum probability of perfectly distinguishing orthogonal maximally entangled states using any PPT measurement (a measurement whose operators are positive under…
This thesis is an attempt to enhance understanding of the following questions A- Given a multipartite quantum state (possibly mixed), how to find out whether it is entangled or separable? (Detection of entanglement.) B- Given an entangled…
We express the optimization of entanglement witnesses for arbitrary bipartite states in terms of a class of convex optimization problems known as Robust Semidefinite Programs (RSDP). We propose, using well known properties of RSDP, several…
The degree to which a pure quantum state is entangled can be characterized by the distance or angle to the nearest unentangled state. This geometric measure of entanglement is explored for bi-partite and multi-partite pure and mixed states.…
We provide an analytical expression for optimal Lewenstein-Sanpera decomposition of Bell decomposable states by using semi-definite programming. Also using the Karush-Kuhn-Tucker optimization method, the minimum relative entropy of…
We investigate the decay of entanglement, due to decoherence, of multi-qubit systems that are initially prepared in highly (in some cases maximally) entangled states. We assume that during the decoherence processes each qubit of the system…
We compare the classification as entangled or separable of Bell diagonal bipartite qudits with positive partial transposition (PPT) and their properties for different dimensions. For dimension $d \geq 3$, a form of entanglement exists that…
The present methods for obtaining the optimal Lewenestein- Sanpera decomposition of a mixed state are difficult to handle analytically. We provide a simple analytical expression for the optimal Lewenstein-Sanpera decomposition by using…
We present a description of finite dimensional quantum entanglement, based on a study of the space of all convex decompositions of a given density matrix. On this space we construct a system of real polynomial equations describing separable…
We present a conjugate gradient method for calculating the entanglement of formation of arbitrary mixed quantum states of any dimension and with any bipartite division of the Hilbert space. The development of the gradient used by the…
We present a review of the problem of finding out whether a quantum state of two or more parties is entangled or separable. After a formal definition of entangled states, we present a few criteria for identifying entangled states and…