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:1212.5851 · Journal of Physics A Mathematical and Theoretical

Constructing positive maps from block matrices

Yu Jing Guo, Heng Fan

Published Jun 12, 2013• 1 citation
arXivHTMLPDF

Abstract

Positive maps are useful for detecting entanglement in quantum information theory. Any entangled state can be detected by some positive map. In this paper, the relation between positive block matrices and completely positive trace-preserving maps is characterized. Consequently, a new method for constructing decomposable maps from positive block matrices is derived. In addition, a method for constructing positive but not completely positive maps from Hermitian block matrices is also obtained.

DOI
10.1088/1751-8113/46/26/265303

Related papers

Detecting entanglement harnessing Lindblad structure

Vaibhav Chimalgi, Bihalan Bhattacharya, Suchetana Goswami +1 more

Abstract The problem of entanglement detection is a long standing problem in quantum information theory. One of the primary procedures of detecting entanglement is to find the suitable positive but non-completely positive maps. Here we try to give a generic prescription to construct a positive map that can be useful for such scenarios. We study a class of positive maps arising from Lindblad structures. We show that two famous positive maps viz. transposition, reduction map and Choi map can be obtained as a special case of a class of positive maps having Lindblad structure. Generalizing the transposition map to a one parameter family we have used it to detect genuine multipartite entanglement. Finally being motivated by the negativity of entanglement, we have defined a similar measure for genuine multipartite entanglement.

arXiv:2210.17204•Physica Scripta•Sep 28, 2023•2 citations

General construction of noiseless networks detecting entanglement with the help of linear maps

Paweł Horodecki, Remigiusz Augusiak, Maciej Demianowicz

We present the general scheme for construction of noiseless networks detecting entanglement with the help of linear, hermiticity-preserving maps. We show how to apply the method to detect entanglement of an unknown state without its prior reconstruction. In particular, we prove there always exists noiseless network detecting entanglement with the help of positive, but not completely positive maps. Then the generalization of the method to the case of entanglement detection with arbitrary, not necessarily hermiticity-preserving, linear contractions on product states is presented.

arXiv:quant-ph/0603015•Physical Review A•Nov 15, 2006•21 citations

Random and Free Positive Maps with Applications to Entanglement Detection

Benoı̂t Collins, Patrick M. Hayden, Ion Nechita

We apply random matrix and free probability techniques to the study of linear maps of interest in quantum information theory. Random quantum channels have already been widely investigated with spectacular success. Here, we are interested in more general maps, asking only for k-positivity instead of the complete positivity required of quantum channels. Unlike the theory of completely positive maps, the theory of k-positive maps is far from being completely understood, and our techniques give many new parametrized families of such maps. We also establish a conceptual link with free probability theory and show that our constructions can be obtained to some extent without random techniques in the setup of free products of von Neumann algebras. Finally, we study the properties of our examples and show that for some parameters, they are indecomposable. In particular, they can be used to detect the presence of entanglement missed by the partial transposition test, that is, positive partial transposition entanglement. As an application, we considerably refine our understanding of positive partial transposition states in the case where one of the spaces is large, whereas the other one remains small.

arXiv:1505.08042•International Mathematics Research Notices•May 10, 2016•10 citations

Visualizing extremal positive maps in unital and trace-preserving form

Leif Ove Hansen, Jan Myrheim

We define an entanglement witness in a composite quantum system as an observable having a nonnegative expectation value in every separable state. Then a state is entangled if and only if it has a negative expectation value of some entanglement witness. Equivalent representations of entanglement witnesses are nonnegative biquadratic forms or positive linear maps of Hermitian matrices. As reported elsewhere, we have studied extremal entanglement witnesses in dimension $3\ifmmode\times\else\texttimes\fi{}3$ by constructing numerical examples of generic extremal nonnegative forms. These are so complicated that we do not know how to handle them other than by numerical methods. However, the corresponding extremal positive maps can be presented graphically, as we attempt to do in the present paper. We understand that a positive map is extremal when the image of $\mathcal{D}$, the set of density matrices, fills out $\mathcal{D}$ maximally, in a certain sense. For the graphical presentation of a map we transform it to a standard form where it is unital and trace preserving. We present an iterative algorithm for the transformation, which converges rapidly in all our numerical examples and presumably works for any positive map. This standard form of an entanglement witness is unique up to unitary product transformations.

arXiv:1511.02110•Physical Review A•Oct 5, 2015•3 citations

Structural approximations to positive maps and entanglement-breaking channels

Jarosław K. Korbicz, Mafalda L. Almeida, Joonwoo Bae +2 more

Structural approximations to positive, but not completely positive maps are approximate physical realizations of these nonphysical maps. They find applications in the design of direct entanglement-detection methods. We show that many of these approximations, in the relevant case of optimal positive maps, define an entanglement breaking channel and, consequently, can be implemented via a measurement and state-preparation protocol. We also show how our findings can be useful for the design of better and simpler direct entanglement detection methods.

arXiv:0808.1052•Physical Review A•Dec 8, 2008•81 citations

Sparse positive maps on qutrits with exact nondecomposability thresholds and PPT-entanglement transitions

Davide Poderini, Angela Rosy Morgillo, Fabio Benatti +3 more

We study a family of sparse positive maps on qutrits for which positivity, decomposability, and PPT entanglement can all be analysed explicitly. The block structure of the associated Choi matrices reduces positivity to a Hermitian biquadratic form and leads to exact positivity boundaries for three representative parametric families. For the same families we determine the exact transition between decomposable and non-decomposable maps and construct associated PPT states of two classes. The first consists of witness-adapted deformations naturally tied to the non-decomposability analysis. The second consists of analytically tractable families whose full PPT-entangled branch is detected by fixed positive maps, yielding exact thresholds between separability and bound entanglement. For the trace-preserving subclass, we further compare positivity with a recent eigenvalue bound for 2-positive maps, thereby making the gap between positivity and higher-order positivity fully explicit within this family.

quant-pharXiv:2606.19765•Quantum Science and Technology•Jun 19, 2026•0 citations
Positive maps are useful for detecting entanglement in quantum information theory. Any entangled state can be detected by some positive map. In this paper, the relation between positive block matrices and completely positive trace-preserving maps is characterized. Consequently, a new method for constructing decomposable maps from positive block matrices is derived. In addition, a method for constructing positive but not completely positive maps from Hermitian block matrices is also obtained.
Abstract The problem of entanglement detection is a long standing problem in quantum information theory. One of the primary procedures of detecting entanglement is to find the suitable positive but non-completely positive maps. Here we try to give a generic prescription to construct a positive map that can be useful for such scenarios. We study a class of positive maps arising from Lindblad structures. We show that two famous positive maps viz. transposition, reduction map and Choi map can be obtained as a special case of a class of positive maps having Lindblad structure. Generalizing the transposition map to a one parameter family we have used it to detect genuine multipartite entanglement. Finally being motivated by the negativity of entanglement, we have defined a similar measure for genuine multipartite entanglement.
We present the general scheme for construction of noiseless networks detecting entanglement with the help of linear, hermiticity-preserving maps. We show how to apply the method to detect entanglement of an unknown state without its prior reconstruction. In particular, we prove there always exists noiseless network detecting entanglement with the help of positive, but not completely positive maps. Then the generalization of the method to the case of entanglement detection with arbitrary, not necessarily hermiticity-preserving, linear contractions on product states is presented.
We apply random matrix and free probability techniques to the study of linear maps of interest in quantum information theory. Random quantum channels have already been widely investigated with spectacular success. Here, we are interested in more general maps, asking only for k-positivity instead of the complete positivity required of quantum channels. Unlike the theory of completely positive maps, the theory of k-positive maps is far from being completely understood, and our techniques give many new parametrized families of such maps. We also establish a conceptual link with free probability theory and show that our constructions can be obtained to some extent without random techniques in the setup of free products of von Neumann algebras. Finally, we study the properties of our examples and show that for some parameters, they are indecomposable. In particular, they can be used to detect the presence of entanglement missed by the partial transposition test, that is, positive partial transposition entanglement. As an application, we considerably refine our understanding of positive partial transposition states in the case where one of the spaces is large, whereas the other one remains small.
We define an entanglement witness in a composite quantum system as an observable having a nonnegative expectation value in every separable state. Then a state is entangled if and only if it has a negative expectation value of some entanglement witness. Equivalent representations of entanglement witnesses are nonnegative biquadratic forms or positive linear maps of Hermitian matrices. As reported elsewhere, we have studied extremal entanglement witnesses in dimension $3\ifmmode\times\else\texttimes\fi{}3$ by constructing numerical examples of generic extremal nonnegative forms. These are so complicated that we do not know how to handle them other than by numerical methods. However, the corresponding extremal positive maps can be presented graphically, as we attempt to do in the present paper. We understand that a positive map is extremal when the image of D\mathcal{D}D, the set of density matrices, fills out D\mathcal{D}D maximally, in a certain sense. For the graphical presentation of a map we transform it to a standard form where it is unital and trace preserving. We present an iterative algorithm for the transformation, which converges rapidly in all our numerical examples and presumably works for any positive map. This standard form of an entanglement witness is unique up to unitary product transformations.
Structural approximations to positive, but not completely positive maps are approximate physical realizations of these nonphysical maps. They find applications in the design of direct entanglement-detection methods. We show that many of these approximations, in the relevant case of optimal positive maps, define an entanglement breaking channel and, consequently, can be implemented via a measurement and state-preparation protocol. We also show how our findings can be useful for the design of better and simpler direct entanglement detection methods.
We study a family of sparse positive maps on qutrits for which positivity, decomposability, and PPT entanglement can all be analysed explicitly. The block structure of the associated Choi matrices reduces positivity to a Hermitian biquadratic form and leads to exact positivity boundaries for three representative parametric families. For the same families we determine the exact transition between decomposable and non-decomposable maps and construct associated PPT states of two classes. The first consists of witness-adapted deformations naturally tied to the non-decomposability analysis. The second consists of analytically tractable families whose full PPT-entangled branch is detected by fixed positive maps, yielding exact thresholds between separability and bound entanglement. For the trace-preserving subclass, we further compare positivity with a recent eigenvalue bound for 2-positive maps, thereby making the gap between positivity and higher-order positivity fully explicit within this family.