dorsal/arxiv
View SchemaExact calculation of robustness of entanglement via convex semi-definite programming
| Authors | M. A. Jafarizadeh, M. Mirzaee, M. Rezaee |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0608225 |
| URL | https://arxiv.org/abs/quant-ph/0608225 |
| Journal | International Journal of Quantum Information (IJQI) vol3, no 3 (2005) 511-533 |
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: $2\otimes 2$ Bell decomposable (BD) states, a generic two qubit state in Wootters basis, iso-concurrence decomposable states, $2\otimes 3$ Bell decomposable states, $d\otimes d$ Werner and isotropic states, a one parameter $3\otimes 3$ state and finally multi partite isotropic state, is calculated exactly, where thus obtained results are in agreement with those of :$2\otimes 2$ 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}. {\bf Keywords: Robustness of entanglement, Semi-definite programming, Bell decomposable states, Werner and isotropic states.}
{
"annotation_id": "ef7d1a23-f8ba-4a6d-8ba6-fef957b2f557",
"date_created": "2026-03-02T18:02:31.252000Z",
"date_modified": "2026-03-02T18:02:31.252000Z",
"file_hash": "b19d398c19d8f6413f06b00439066e71481918283f2f743995396dfdc546f76c",
"private": false,
"record": {
"abstract": "In general the calculation of robustness of entanglement for the mixed\nentangled quantum states is rather difficult to handle analytically. Using the\nthe convex semi-definite programming method, the robustness of entanglement of\nsome mixed entangled quantum states such as: $2\\otimes 2$ Bell decomposable\n(BD) states, a generic two qubit state in Wootters basis, iso-concurrence\ndecomposable states, $2\\otimes 3$ Bell decomposable states, $d\\otimes d$ Werner\nand isotropic states, a one parameter $3\\otimes 3$ state and finally multi\npartite isotropic state, is calculated exactly, where thus obtained results are\nin agreement with those of :$2\\otimes 2$ density matrices, already calculated\nby one of the authors in \\cite{Bell1,Rob3}. Also an analytic expression is\ngiven for separable states that wipe out all entanglement and it is further\nshown that they are on the boundary of separable states as pointed out in\n\\cite{du}.\n {\\bf Keywords: Robustness of entanglement, Semi-definite programming, Bell\ndecomposable states, Werner and isotropic states.}",
"arxiv_id": "quant-ph/0608225",
"authors": [
"M. A. Jafarizadeh",
"M. Mirzaee",
"M. Rezaee"
],
"categories": [
"quant-ph"
],
"journal_ref": "International Journal of Quantum Information (IJQI) vol3, no 3\n (2005) 511-533",
"title": "Exact calculation of robustness of entanglement via convex semi-definite programming",
"url": "https://arxiv.org/abs/quant-ph/0608225"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "76255134-36cd-47a7-8429-5fe14d332375",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}