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:0901.4504

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

M. A. Jafarizadeh, Korosh Aghayar, Ahmad Heshmati

Published Jan 28, 2009• 4 citations
arXivHTMLPDF

Abstract

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

DOI
10.48550/arxiv.0901.4510

Related papers

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

General algorithm for manipulating nonlinear and linear entanglement witnesses by using exact convex optimization

M. A. Jafarizadeh, Korosh Aghayar, Ahmad Heshmati

We consider the problem of obtaining the entanglement witnesses for a given quantum system. We present a method to convert this problem to a standard convex optimization problem by defining a feasible region. Then we develop a generic two-step algorithm for this problem which can be applied to the entanglement detection of $N$-partite quantum system. This permits an organized construction of nonlinear and linear entanglement witnesses for a given quantum system. To demonstrate the capability of this approach, we apply our results to several three-qubit systems which in some cases lead to necessary and sufficient conditions for separability.

Physical Review A•Nov 9, 2009•6 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

Manipulating multiqudit entanglement witnesses by using linear programming

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

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.

arXiv:quant-ph/0611256•Physical Review A•May 21, 2007•22 citations

Nonlinear and linear entanglement witnesses for bipartite systems via exact convex optimization

M. A. Jafarizadeh, Ahmad Heshmati, Korosh Aghayar

Linear and nonlinear entanglement witnesses for a given bipartite quantum systems are constructed. Using single particle feasible region, a way of constructing effective entanglement witnesses for bipartite systems is provided by exact convex optimization. Examples for some well known two qutrit quantum systems show these entanglement witnesses in most cases, provide necessary and sufficient conditions for separability of given bipartite system. Also this method is applied to a class of bipartite qudit quantum systems with details for d=3, 4 and 5.

arXiv:0910.5413•Quantum Information and Computation•Jul 1, 2010•6 citations

Bending hyperplanes: Nonlinear entanglement witnesses via envelopes of linear witnesses

AmirHossein Tangestaninejad, Vahid Karimipour

Entanglement witnesses (EWs) are fundamental tools for detecting entanglement. However, traditional linear witnesses often fail to identify most of the entangled states. In this work, we construct a family of nonlinear entanglement witnesses by taking the envelope of linear witnesses defined over continuous families of pure bipartite states with fixed Schmidt bases. This procedure effectively ``bends'' the hyperplanes associated with linear witnesses into curved hypersurfaces, thereby extending the region of detectable entangled states. The resulting conditions can be expressed in terms of the positive semidefiniteness of a family of matrices, whose principal minors define a hierarchy of increasingly sensitive detection criteria. We show that this construction is not limited to the transposition map and generalizes naturally to arbitrary positive but not completely positive maps, leading to nonlinear analogs of general entanglement witnesses. We emphasize that the required measurements remain experimentally accessible, as the nonlinear criteria are still formulated in terms of expectation values over local operator bases. Through both analytical and numerical examples, we demonstrate that the proposed nonlinear witnesses outperform their linear counterparts in detecting entangled states which may evade individual linear EWs in the construction. This approach offers a practical and conceptually elegant enhancement to entanglement detection in finite-dimensional systems.

arXiv:2506.23262•Physical Review A•Nov 6, 2025•0 citations
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
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
We consider the problem of obtaining the entanglement witnesses for a given quantum system. We present a method to convert this problem to a standard convex optimization problem by defining a feasible region. Then we develop a generic two-step algorithm for this problem which can be applied to the entanglement detection of NNN-partite quantum system. This permits an organized construction of nonlinear and linear entanglement witnesses for a given quantum system. To demonstrate the capability of this approach, we apply our results to several three-qubit systems which in some cases lead to necessary and sufficient conditions for separability.
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.
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.
Linear and nonlinear entanglement witnesses for a given bipartite quantum systems are constructed. Using single particle feasible region, a way of constructing effective entanglement witnesses for bipartite systems is provided by exact convex optimization. Examples for some well known two qutrit quantum systems show these entanglement witnesses in most cases, provide necessary and sufficient conditions for separability of given bipartite system. Also this method is applied to a class of bipartite qudit quantum systems with details for d=3, 4 and 5.
Entanglement witnesses (EWs) are fundamental tools for detecting entanglement. However, traditional linear witnesses often fail to identify most of the entangled states. In this work, we construct a family of nonlinear entanglement witnesses by taking the envelope of linear witnesses defined over continuous families of pure bipartite states with fixed Schmidt bases. This procedure effectively ``bends'' the hyperplanes associated with linear witnesses into curved hypersurfaces, thereby extending the region of detectable entangled states. The resulting conditions can be expressed in terms of the positive semidefiniteness of a family of matrices, whose principal minors define a hierarchy of increasingly sensitive detection criteria. We show that this construction is not limited to the transposition map and generalizes naturally to arbitrary positive but not completely positive maps, leading to nonlinear analogs of general entanglement witnesses. We emphasize that the required measurements remain experimentally accessible, as the nonlinear criteria are still formulated in terms of expectation values over local operator bases. Through both analytical and numerical examples, we demonstrate that the proposed nonlinear witnesses outperform their linear counterparts in detecting entangled states which may evade individual linear EWs in the construction. This approach offers a practical and conceptually elegant enhancement to entanglement detection in finite-dimensional systems.