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

DOI10.1142/S0219749905001043zbMATH Open1077.81023arXivquant-ph/0608225OpenAlexW1996939615MaRDI QIDQ5704262FDOQ5704262

Authors:

Publication date: 14 November 2005

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

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.}

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

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

zbMATH Keywords

semi-definite programmingBell decomposable statesWerner and isotropic statesRobustness of entanglement

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Weakly entangled states are dense and robust
• On the Schmidt robustness of pure states
• The robustness of entanglement and the generalized robustness of entanglement of W-states
• \texttt{libCreme}: an optimization library for evaluating convex-roof entanglement measures
• The minimum-error discrimination via Helstrom family of ensembles and convex optimization
• Derivation of the robustness from the concurrence
• Title not available (Why is that?)

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)