2005
DOI: 10.1142/s0219749905001043
|View full text |Cite
|
Sign up to set email alerts
|

Exact Calculation of Robustness of Entanglement via Convex Semi-Definite Programming

Abstract: In general, the calculation of robustness of entanglement for the mixed entangled quantum states is rather difficult to handle analytically. Using the convex semi-definite programming method, we claculate exactly the robustness of entanglement of some mixed entangled quantum states such as the generic two-qubit state in the Wootters basis, 2 ⊗ 2 Bell decomposable (BD) states, iso-concurrence decomposable states, 2 ⊗ 3 Bell decomposable states, d ⊗ d Werner and isotropic states, a one parameter 3 ⊗ 3 state and … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2008
2008
2019
2019

Publication Types

Select...
8

Relationship

3
5

Authors

Journals

citations
Cited by 11 publications
(13 citation statements)
references
References 35 publications
0
13
0
Order By: Relevance
“…These results allow us to obtain nontrivial bounds for resource trading in specific theories by computing the modification coefficients (which can be efficiently done in many cases [9,[67][68][69][70][71][72]). For example, the golden coefficients of coherence, entanglement and purity theories induce bounds directly given by the smooth resource measures without modification, which is consistent with previous results [44,46,47,73].…”
Section: Optimal Rates Of One-shot Resource Manipulationmentioning
confidence: 99%
See 1 more Smart Citation
“…These results allow us to obtain nontrivial bounds for resource trading in specific theories by computing the modification coefficients (which can be efficiently done in many cases [9,[67][68][69][70][71][72]). For example, the golden coefficients of coherence, entanglement and purity theories induce bounds directly given by the smooth resource measures without modification, which is consistent with previous results [44,46,47,73].…”
Section: Optimal Rates Of One-shot Resource Manipulationmentioning
confidence: 99%
“…We also note that the resource measures considered in this work often admit efficient SDP formulation [9,71] as well as analytical expressions [9,[67][68][69][70]72], which make our bounds of practical use in many important circumstances.…”
Section: Optimal Rates Of One-shot Resource Manipulationmentioning
confidence: 99%
“…In this section, we are motivated by the following fact: it is important to have efficiently computable quantifications of quantum resources. A convex optimization problem constrained by semidefinite matrix inequalities is called a semidefinite program (SDP) [26]; they are efficiently computable, and appear frequently in quantum information theory [8,15,28]. In fact, entanglement measures are often defined via suitable optimization [14].…”
Section: Incompatibility Monotones Via Semidefinite Programmentioning
confidence: 99%
“…All the measures mentioned in the main text use semidefinite cones, as already noted by various authors [12,21,60,61]. Building upon the conic linear form detailed in Appendix B, we provide below practical recipes to construct entanglement measure cones.…”
Section: Appendix B: Conic Linear Programsmentioning
confidence: 99%