Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0611256 · Physical Review A

Manipulating multiqudit entanglement witnesses by using linear programming

M. A. Jafarizadeh, G. Najarbashi, Hessam Habibian

Published May 21, 2007• 22 citations
arXivHTMLPDF

Abstract

A class of entanglement witnesses (EWs) called reduction-type entanglement witnesses is introduced, which can detect some multipartite entangled states including positive partial transpose ones with Hilbert space of dimension ${d}_{1}\ensuremath{\bigotimes}{d}_{2}\ensuremath{\bigotimes}\ensuremath{\cdots}\ensuremath{\bigotimes}{d}_{n}$. In fact the feasible regions of these EWs turn out to be convex polygons and hence the manipulation of them reduces to linear programming which can be solved exactly by using the simplex method. The decomposability and nondecomposability of these EWs are studied and it is shown that it has a close connection with eigenvalues and optimality of EWs. Also using the Jamio\l{}kowski isomorphism, the corresponding possible positive maps, including the generalized reduction maps of Hall [Phys. Rev. A 72, 022311 (2005)] are obtained.

DOI
10.1103/physreva.75.052326

Related papers

Bell-state diagonal-entanglement witnesses

M. A. Jafarizadeh, M. Rezaee, S. K. A. Seyed Yagoobi

It has been shown that finding generic Bell-state diagonal-entanglement witnesses for ${d}_{1}\ensuremath{\bigotimes}{d}_{2}\ensuremath{\bigotimes}\ensuremath{\cdots}\ensuremath{\bigotimes}{d}_{n}$ systems reduces to linear programming if the feasible region is a polygon by itself, and it can be solved approximately via linear programming if the feasible region is encircled by a polygon. Since solving linear programming for the generic case is difficult, multiqubit, $2\ensuremath{\bigotimes}N$ and $3\ensuremath{\bigotimes}3$ systems for the special case of generic Bell-state diagonal-entanglement witnesses for some particular choice of parameters have been considered. We obtain the optimal nondecomposable entanglement witness for a $3\ensuremath{\bigotimes}3$ system for some particular choice of parameters. By proving the optimality of the well-known reduction map and combining it with the optimal and nondecomposable $3\ensuremath{\bigotimes}3$ Bell-state diagonal-entanglement witnesses (named critical entanglement witnesses) the family of optimal and nondecomposable $3\ensuremath{\bigotimes}3$ Bell-state diagonal-entanglement witnesses has also been obtained. Using the approximately critical entanglement witnesses, some $3\ensuremath{\bigotimes}3$ bound entangled states are so detected. So the well-known Choi map as a particular case of the positive map in connection with this witness via Jamiolkowski isomorphism has been considered.

arXiv:quant-ph/0507035•Physical Review A•Dec 6, 2005•27 citations

A general algorithm for manipulating non-linear and linear entanglement witnesses by using exact convex optimization

M. A. Jafarizadeh, Korosh Aghayar, Ahmad Heshmati

A generic algorithm is developed to reduce the problem of obtaining linear and nonlinear entanglement witnesses of a given quantum system, to convex optimization problem. This approach is completely general and can be applied for the entanglement detection of any N-partite quantum system. For this purpose, a map from convex space of separable density matrices to a convex region called feasible region is defined, where by using exact convex optimization method, the linear entanglement witnesses can be obtained from polygonal shape feasible regions, while for curved shape feasible regions, envelope of the family of linear entanglement witnesses can be considered as nonlinear entanglement witnesses. This method proposes a new methodological framework within which most of previous EWs can be studied. To conclude and in order to demonstrate the capability of the proposed approach, besides providing some nonlinear witnesses for entanglement detection of density matrices in unextendible product bases, W-states, and GHZ with W-states, some further examples of three qubits systems and their classification and entanglement detection are included. Also it is explained how one can manipulate most of the non-decomposable linear and nonlinear three qubits entanglement witnesses appearing in some of the papers published by us and other authors, by the method proposed in this paper. Keywords: non-linear and linear entanglement witnesses, convex optimization. PACS number(s): 03.67.Mn, 03.65.Ud

arXiv:0901.4504•Jan 28, 2009•4 citations

Bell-state diagonal entanglement witnesses for relativistic and nonrelativistic multispinor systems in arbitrary dimensions

M. A. Jafarizadeh, Rahime Sufiani

Two kinds of Bell-state diagonal (BSD) entanglement witnesses (EWs) are constructed by using the algebra of Dirac $\ensuremath{\gamma}$ matrices in a space-time of arbitrary dimension $d$, where the first kind can detect some BSD relativistic and nonrelativistic $m$-partite multispinor bound entangled states in a Hilbert space of dimension ${2}^{m\ensuremath{\lfloor}d/2\ensuremath{\rfloor}}$, including the bipartite Bell-type and isoconcurrence-type states in four-dimensional space-time $(d=4)$. By using the connection between the Hilbert-Schmidt measure and the optimal EWs associated with the states, it is shown that, as far as the spin quantum correlations are concerned, the amount of entanglement is not a relativistic scalar and has no invariant meaning. The introduced EWs are manipulated via linear programming (LP) and can be solved exactly by using the simplex method. The decomposability or nondecomposability of these EWs is investigated, the region of nondecomposable EWs of the first kind is partially determined and it is shown that, all of the EWs of the second kind are decomposable. These EWs have the property that in bipartite systems they can determine the region of separable states, i.e., bipartite nondetectable density matrices of the same type as the EWs of the first kind are necessarily separable. Also, multispinor EWs with nonpolygon feasible regions are provided, where the problem is solved by approximate LP, and in contrast to the exactly manipulatable EWs, both the first and second kinds of the optimal approximate EWs can detect some bound entangled states.

arXiv:quant-ph/0703106•Physical Review A•Jan 17, 2008•18 citations

Perfect state transfer of a qudit over underlying networks of group association schemes

M. A. Jafarizadeh, Rahime Sufiani, Seyed Farid Taghavi +1 more

A generic algorithm is developed to reduce the problem of obtaining linear and nonlinear entanglement witnesses of a given quantum system, to convex optimization problem. This approach is completely general and can be applied for the entanglement detection of any N-partite quantum system. For this purpose, a map from convex space of separable density matrices to a convex region called feasible region is defined, where by using exact convex optimization method, the linear entanglement witnesses can be obtained from polygonal shape feasible regions, while for curved shape feasible regions, envelope of the family of linear entanglement witnesses can be considered as nonlinear entanglement witnesses. This method proposes a new methodological framework within which most of previous EWs can be studied. To conclude and in order to demonstrate the capability of the proposed approach, besides providing some nonlinear witnesses for entanglement detection of density matrices in unextendible product bases, W-states, and GHZ with W-states, some further examples of three qubits systems and their classification and entanglement detection are included. Also it is explained how one can manipulate most of the non-decomposable linear and nonlinear three qubits entanglement witnesses appearing in some of the papers published by us and other authors, by the method proposed in this paper. Keywords: non-linear and linear entanglement witnesses, convex optimization. PACS number(s): 03.67.Mn, 03.65.Ud

arXiv:0901.4510•Journal of Statistical Mechanics Theory and Experiment•Apr 6, 2009•5 citations

Generalized qudit Choi maps

M. A. Jafarizadeh, M. Rezaee, Sodeif Ahadpour

Following the linear programming prescription of Jafarizadeh et al. [Phys. Rev. A 72, 062106 (2005)], the $d\ensuremath{\bigotimes}d$ Bell diagonal entanglement witnesses are provided. By using Jamiolkowski isomorphism, it is shown that the corresponding positive maps are the generalized qudit Choi maps. Also by manipulating particular $d\ensuremath{\bigotimes}d$ Bell diagonal separable states and constructing corresponding bound entangled states, it is shown that the obtained $d\ensuremath{\bigotimes}d$ Bell states diagonal entanglement witnesses (consequently qudit Choi maps) are nondecomposable in a certain range of their parameters.

arXiv:quant-ph/0607164•Physical Review A•Oct 27, 2006•16 citations

Investigating a class of 2⊗2⊗d bound entangled density matrices via linear and nonlinear entanglement witnesses constructed by exact convex optimization

M. A. Jafarizadeh, Y. Akbari, Korosh Aghayar +2 more

Here we consider a class of $2\ensuremath{\bigotimes}2\ensuremath{\bigotimes}d$ density matrices which have positive partial transposes with respect to all subsystems. The entanglement witness approach is used to investigate the entanglement of these density matrices. To demonstrate the approach, the three-qubit case is considered in detail. For constructing entanglement witnesses (EWs) detecting these density matrices, we attempt to convert the problem to an exact convex optimization problem. To this aim, we map the convex set of separable states into a convex region, named feasible region, and consider the cases in which the exact geometrical shape of the feasible region can be obtained. In this way, various linear and nonlinear EWs are constructed. The optimality and decomposability of some of the introduced EWs are also considered. Furthermore, the detection of the density matrices by the introduced EWs are discussed analytically and numerically.

arXiv:0801.4953•Physical Review A•Sep 11, 2008•13 citations
A class of entanglement witnesses (EWs) called reduction-type entanglement witnesses is introduced, which can detect some multipartite entangled states including positive partial transpose ones with Hilbert space of dimension d1\ensuremath⨂d2\ensuremath⨂\ensuremath⋯\ensuremath⨂dn{d}_{1}\ensuremath{\bigotimes}{d}_{2}\ensuremath{\bigotimes}\ensuremath{\cdots}\ensuremath{\bigotimes}{d}_{n}d1​\ensuremath⨂d2​\ensuremath⨂\ensuremath⋯\ensuremath⨂dn​. In fact the feasible regions of these EWs turn out to be convex polygons and hence the manipulation of them reduces to linear programming which can be solved exactly by using the simplex method. The decomposability and nondecomposability of these EWs are studied and it is shown that it has a close connection with eigenvalues and optimality of EWs. Also using the Jamio\l{}kowski isomorphism, the corresponding possible positive maps, including the generalized reduction maps of Hall [Phys. Rev. A 72, 022311 (2005)] are obtained.
It has been shown that finding generic Bell-state diagonal-entanglement witnesses for ${d}_{1}\ensuremath{\bigotimes}{d}_{2}\ensuremath{\bigotimes}\ensuremath{\cdots}\ensuremath{\bigotimes}{d}_{n}$ systems reduces to linear programming if the feasible region is a polygon by itself, and it can be solved approximately via linear programming if the feasible region is encircled by a polygon. Since solving linear programming for the generic case is difficult, multiqubit, $2\ensuremath{\bigotimes}N$ and $3\ensuremath{\bigotimes}3$ systems for the special case of generic Bell-state diagonal-entanglement witnesses for some particular choice of parameters have been considered. We obtain the optimal nondecomposable entanglement witness for a $3\ensuremath{\bigotimes}3$ system for some particular choice of parameters. By proving the optimality of the well-known reduction map and combining it with the optimal and nondecomposable $3\ensuremath{\bigotimes}3$ Bell-state diagonal-entanglement witnesses (named critical entanglement witnesses) the family of optimal and nondecomposable $3\ensuremath{\bigotimes}3$ Bell-state diagonal-entanglement witnesses has also been obtained. Using the approximately critical entanglement witnesses, some $3\ensuremath{\bigotimes}3$ bound entangled states are so detected. So the well-known Choi map as a particular case of the positive map in connection with this witness via Jamiolkowski isomorphism has been considered.
A generic algorithm is developed to reduce the problem of obtaining linear and nonlinear entanglement witnesses of a given quantum system, to convex optimization problem. This approach is completely general and can be applied for the entanglement detection of any N-partite quantum system. For this purpose, a map from convex space of separable density matrices to a convex region called feasible region is defined, where by using exact convex optimization method, the linear entanglement witnesses can be obtained from polygonal shape feasible regions, while for curved shape feasible regions, envelope of the family of linear entanglement witnesses can be considered as nonlinear entanglement witnesses. This method proposes a new methodological framework within which most of previous EWs can be studied. To conclude and in order to demonstrate the capability of the proposed approach, besides providing some nonlinear witnesses for entanglement detection of density matrices in unextendible product bases, W-states, and GHZ with W-states, some further examples of three qubits systems and their classification and entanglement detection are included. Also it is explained how one can manipulate most of the non-decomposable linear and nonlinear three qubits entanglement witnesses appearing in some of the papers published by us and other authors, by the method proposed in this paper. Keywords: non-linear and linear entanglement witnesses, convex optimization. PACS number(s): 03.67.Mn, 03.65.Ud
Two kinds of Bell-state diagonal (BSD) entanglement witnesses (EWs) are constructed by using the algebra of Dirac $\ensuremath{\gamma}$ matrices in a space-time of arbitrary dimension ddd, where the first kind can detect some BSD relativistic and nonrelativistic mmm-partite multispinor bound entangled states in a Hilbert space of dimension ${2}^{m\ensuremath{\lfloor}d/2\ensuremath{\rfloor}}$, including the bipartite Bell-type and isoconcurrence-type states in four-dimensional space-time (d=4)(d=4)(d=4). By using the connection between the Hilbert-Schmidt measure and the optimal EWs associated with the states, it is shown that, as far as the spin quantum correlations are concerned, the amount of entanglement is not a relativistic scalar and has no invariant meaning. The introduced EWs are manipulated via linear programming (LP) and can be solved exactly by using the simplex method. The decomposability or nondecomposability of these EWs is investigated, the region of nondecomposable EWs of the first kind is partially determined and it is shown that, all of the EWs of the second kind are decomposable. These EWs have the property that in bipartite systems they can determine the region of separable states, i.e., bipartite nondetectable density matrices of the same type as the EWs of the first kind are necessarily separable. Also, multispinor EWs with nonpolygon feasible regions are provided, where the problem is solved by approximate LP, and in contrast to the exactly manipulatable EWs, both the first and second kinds of the optimal approximate EWs can detect some bound entangled states.
A generic algorithm is developed to reduce the problem of obtaining linear and nonlinear entanglement witnesses of a given quantum system, to convex optimization problem. This approach is completely general and can be applied for the entanglement detection of any N-partite quantum system. For this purpose, a map from convex space of separable density matrices to a convex region called feasible region is defined, where by using exact convex optimization method, the linear entanglement witnesses can be obtained from polygonal shape feasible regions, while for curved shape feasible regions, envelope of the family of linear entanglement witnesses can be considered as nonlinear entanglement witnesses. This method proposes a new methodological framework within which most of previous EWs can be studied. To conclude and in order to demonstrate the capability of the proposed approach, besides providing some nonlinear witnesses for entanglement detection of density matrices in unextendible product bases, W-states, and GHZ with W-states, some further examples of three qubits systems and their classification and entanglement detection are included. Also it is explained how one can manipulate most of the non-decomposable linear and nonlinear three qubits entanglement witnesses appearing in some of the papers published by us and other authors, by the method proposed in this paper. Keywords: non-linear and linear entanglement witnesses, convex optimization. PACS number(s): 03.67.Mn, 03.65.Ud
Following the linear programming prescription of Jafarizadeh et al. [Phys. Rev. A 72, 062106 (2005)], the $d\ensuremath{\bigotimes}d$ Bell diagonal entanglement witnesses are provided. By using Jamiolkowski isomorphism, it is shown that the corresponding positive maps are the generalized qudit Choi maps. Also by manipulating particular $d\ensuremath{\bigotimes}d$ Bell diagonal separable states and constructing corresponding bound entangled states, it is shown that the obtained $d\ensuremath{\bigotimes}d$ Bell states diagonal entanglement witnesses (consequently qudit Choi maps) are nondecomposable in a certain range of their parameters.
Here we consider a class of $2\ensuremath{\bigotimes}2\ensuremath{\bigotimes}d$ density matrices which have positive partial transposes with respect to all subsystems. The entanglement witness approach is used to investigate the entanglement of these density matrices. To demonstrate the approach, the three-qubit case is considered in detail. For constructing entanglement witnesses (EWs) detecting these density matrices, we attempt to convert the problem to an exact convex optimization problem. To this aim, we map the convex set of separable states into a convex region, named feasible region, and consider the cases in which the exact geometrical shape of the feasible region can be obtained. In this way, various linear and nonlinear EWs are constructed. The optimality and decomposability of some of the introduced EWs are also considered. Furthermore, the detection of the density matrices by the introduced EWs are discussed analytically and numerically.