{"paper":{"title":"Exact calculation of robustness of entanglement via convex semi-definite programming","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"M. A. Jafarizadeh, M. Mirzaee, M.Rezaee","submitted_at":"2006-08-29T05:21:34Z","abstract_excerpt":"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 obtaine"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0608225","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}