EXACT CALCULATION OF ROBUSTNESS OF ENTANGLEMENT VIA CONVEX SEMI-DEFINITE PROGRAMMING

DOI10.1142/S0219749905001043MaRDI QIDQ5704262zbMATH OpenOpenAlexFDO

Authors

Publication date 14 November 2005

Published in International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0608225

zbMATH Keywords

Bell decomposable statesRobustness of entanglementsemi-definite programmingWerner and isotropic states

Mathematics Subject Classification ID

Quantum measurement theory, state operations, state preparations (81P15) Quantum computation (81P68) Semidefinite programming (90C22)

Abstract: In general the calculation of robustness of entanglement for the mixed entangled quantum states is rather difficult to handle analytically. Using the the convex semi-definite programming method, the robustness of entanglement of some mixed entangled quantum states such as: $2otimes2$ Bell decomposable (BD) states, a generic two qubit state in Wootters basis, iso-concurrence decomposable states, $2otimes3$ Bell decomposable states, $dotimesd$ Werner and isotropic states, a one parameter $3otimes3$ state and finally multi partite isotropic state, is calculated exactly, where thus obtained results are in agreement with those of :$2otimes2$ density matrices, already calculated by one of the authors in cite{Bell1,Rob3}. Also an analytic expression is given for separable states that wipe out all entanglement and it is further shown that they are on the boundary of separable states as pointed out in cite{du}. {�f Keywords: Robustness of entanglement, Semi-definite programming, Bell decomposable states, Werner and isotropic states.}

Recommendations

• Derivation of the robustness from the concurrence
• Distinguishing separable and entangled states
• The robustness of entanglement and the generalized robustness of entanglement of W-states
• Weakly entangled states are dense and robust
• A semidefinite program for distillable entanglement

Cites work

• A semidefinite program for distillable entanglement
• Bound Entanglement Can Be Activated
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Designing optimal quantum detectors via semidefinite programming
• Entanglement of formation of an arbitrary state of two qubits
• Geometrical interpretation for robustness of entanglement
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Linear Matrix Inequalities in System and Control Theory
• Mixed-state entanglement and quantum error correction
• Optimal Lewenstein–Sanpera decomposition for some bipartite systems
• Quantifying Entanglement
• Quantum detection and estimation theory
• Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
• Semidefinite Programming
• Separability and the stella octangula
• Separability Criterion for Density Matrices
• Separability of mixed states: necessary and sufficient conditions.
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels

Cited in

(7)

• \texttt{libCreme}: an optimization library for evaluating convex-roof entanglement measures
• The robustness of entanglement and the generalized robustness of entanglement of W-states
• Weakly entangled states are dense and robust
• scientific article; zbMATH DE number 6531447 (Why is no real title available?)
• Derivation of the robustness from the concurrence
• On the Schmidt robustness of pure states
• The minimum-error discrimination via Helstrom family of ensembles and convex optimization

This page was built for publication: EXACT CALCULATION OF ROBUSTNESS OF ENTANGLEMENT VIA CONVEX SEMI-DEFINITE PROGRAMMING

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704262)