EXACT CALCULATION OF ROBUSTNESS OF ENTANGLEMENT VIA CONVEX SEMI-DEFINITE PROGRAMMING
From MaRDI portal
Publication:5704262
DOI10.1142/S0219749905001043zbMath1077.81023arXivquant-ph/0608225OpenAlexW1996939615MaRDI QIDQ5704262
No author found.
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
semi-definite programmingBell decomposable statesWerner and isotropic statesRobustness of entanglement
Semidefinite programming (90C22) Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15)
Related Items (1)
Cites Work
- Unnamed Item
- Quantum detection and estimation theory
- Geometrical interpretation for robustness of entanglement
- Separability of mixed states: necessary and sufficient conditions.
- Linear Matrix Inequalities in System and Control Theory
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Optimal Lewenstein–Sanpera decomposition for some bipartite systems
- 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
- Quantifying Entanglement
- Bound Entanglement Can Be Activated
- A semidefinite program for distillable entanglement
- Designing optimal quantum detectors via semidefinite programming
- Semidefinite Programming
- Entanglement of Formation of an Arbitrary State of Two Qubits
- Mixed-state entanglement and quantum error correction
- Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
- Separability and the stella octangula
This page was built for publication: EXACT CALCULATION OF ROBUSTNESS OF ENTANGLEMENT VIA CONVEX SEMI-DEFINITE PROGRAMMING
