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

Role Of Partial Transpose And Generalized Choi Maps In Quantum Dynamical Semigroups Involving Separable And Entangled States

Ajit Iqbal Singh

Published Dec 21, 2015• 1 citation
OpenAlex

Abstract

Power symmetric stochastic matrices introduced by R. Sinkhorn (1981) and their generalization by R.B. Bapat, S.K. Jain and K. Manjunatha Prasad (1999) have been utilized to give positive block matrices with trace one possessing positive partial transpose, the so-called PPT states. Another method to construct such PPT states is given, it uses the form of a matrix unitarily equivalent to to its transpose obtained by S.R. Garcia and J.E. Tener (2012). Evolvement or suppression of separability or entanglement of various levels for a quantum dynamical semigroup of completely positive maps has been studied using Choi-Jamiolkowsky matrix of such maps and the famous Hordeckis criteria (1996). A Trichotomy Theorem has been proved, and examples have been given that depend mainly on generalized Choi maps and clearly distinguish the levels of entanglement breaking.

Related papers

Role Of Partial Transpose And Generalized Choi Maps In Quantum Dynamical Semigroups Involving Separable And Entangled States

Ajit Singh

Power symmetric stochastic matrices introduced by R. Sinkhorn (1981) and their generalization by R.B. Bapat, S.K. Jain and K. Manjunatha Prasad (1999) have been utilized to give positive block matrices with trace one possessing positive partial transpose, the so-called PPT states. Another method to construct such PPT states is given, it uses the form of a matrix unitarily equivalent to to its transpose obtained by S.R. Garcia and J.E. Tener (2012). Evolvement or suppression of separability or entanglement of various levels for a quantum dynamical semigroup of completely positive maps has been studied using Choi-Jamiolkowsky matrix of such maps and the famous Hordeckis criteria (1996). A Trichotomy Theorem has been proved, and examples have been given that depend mainly on generalized Choi maps and clearly distinguish the levels of entanglement breaking.

arXiv:1201.0250•Electronic Journal of Linear Algebra•Sep 20, 2015•2 citations

Some applications of Choi polynomials of linear maps

Minh Toan Ho, Thanh Hieu Le, Cong Trinh Le +1 more

This paper investigates the properties of Choi polynomials and their fundamental role in the theory of positive linear maps between matrix algebras. By focusing on Hermitian symmetric biquadratic forms, we establish a connection between the positivity of these forms and the structure of positive maps. We specifically explore the construction of indecomposable positive maps in matrix algebras, and their application as entanglement witnesses. Our analysis extends to the detection of Positive Partial Transpose (PPT) entangled states and the classification of edge PPT states in $M_m(\mathbb{C}) \otimes M_n(\mathbb{C})$. Our results provide a refined framework for identifying non-separable states that escape the standard PPT criterion, contributing to the broader understanding of entanglement distillation and quantum information theory.

quant-pharXiv:2604.27034•Linear Algebra and its Applications•Apr 30, 2026•0 citations

Quantum dynamical semigroups involving separable and entangled states

Ajit Iqbal Singh

Power symmetric matrices defned and studied by R. Sinkhorn (1981) and their generalization by R.B. Bapat, S.K. Jain and K. Manjunatha Prasad (1999) have been utilized to give positive block matrices with trace one possessing positive partial transpose, the so-called PPT states. Another method to construct such PPT states is given, it uses the form of a matrix unitarily equivalent to its transpose obtained by S.R. Garcia and J.E. Tener (2012). Evolvement or suppression of separability or entanglement of various levels for a quantum dynamical semigroup of completely positive maps has been studied using Choi-Jamiolkowsky matrix of such maps and the famous Horodecki's criteria (1996). A Trichotomy Theorem has been proved, and examples have been given that depend mainly on generalized Choi maps and clearly distinguish the levels of entanglement breaking.

•Jan 1, 2012•4 citations

Beyond the Positive Partial Transpose Squared Conjecture: The Qutrit Case

Junhyeong An, Soojoon Lee

Entanglement swapping is a fundamental operation in quantum repeaters for establishing entanglement between distant parties. The positive partial transpose (PPT) squared conjecture asks whether two PPT entangled links can generate terminal entanglement through entanglement swapping, or equivalently, whether the composition of two PPT maps is always entanglement breaking. Motivated by this conjecture, we investigate the map-composition problem beyond the PPT setting. For qutrit completely positive (CP) maps, we prove that the composition of any CP map whose Choi matrix is $1$-undistillable with any CP map whose Choi matrix has Schmidt number at most two is entanglement breaking in either order. Moreover, we show that the cone of $1$-undistillable CP maps is exactly the largest qutrit cone of CP maps whose composition with every CP map whose Choi matrix has Schmidt number at most two is entanglement breaking in both orders. Finally, although map composition captures only the standard maximally entangled outcome in entanglement swapping, we prove that any $1$-undistillable two-qutrit state and any state of Schmidt number at most two cannot generate terminal entanglement under an arbitrary selective measurement on the intermediate systems.

quant-pharXiv:2607.15947•Jul 20, 2026•0 citations

Partial transpose criteria for symmetric states

Fabian Bohnet-Waldraff, Daniel Braun, O. Giraud

We express the positive-partial-transpose (PPT) separability criterion for symmetric states of multiqubit systems in terms of matrix inequalities based on the recently introduced tensor representation for spin states. We construct a matrix from the tensor representation of the state and show that it is similar to the partial transpose of the density matrix written in the computational basis. Furthermore, the positivity of this matrix is equivalent to the positivity of a correlation matrix constructed from tensor products of Pauli operators. This allows for a more transparent experimental interpretation of the PPT criteria for an arbitrary spin-$j$ state. The unitary matrices connecting our matrix to the partial transpose of the state generalize the so-called magic basis that plays a central role in Wootters' explicit formula for the concurrence of a two-qubit system and the Bell bases used for the teleportation of a one- or two-qubit state.

arXiv:1606.07635•Physical Review A•Oct 31, 2016•28 citations

Low-rank positive-partial-transpose states and their relation to product vectors

Leif Ove Hansen, Andreas Hauge, Jan Myrheim +1 more

Deciding whether a mixed quantum state is separable or entangled is a difficult problem in general. Separable states are positive under partial transposition [they are positive-partial-transpose (PPT) states], but this simple test does not exclude all entangled states. In order to understand the entangled PPT states, having so-called bound entanglement, we want to study the extremal PPT states. An extremal PPT state is either a pure product state, then it is separable, or it is entangled, in which case the state and its partial transpose must still be rather low-rank density matrices, although it is known that the rank must be at least 4. In a previous paper we presented a complete classification of the rank-4 entangled PPT states in dimension $3\ifmmode\times\else\texttimes\fi{}3$, generalizing the construction by Bennett et al. from unextendible sets of orthogonal product vectors. In the present paper we continue our investigations of the low-rank entangled PPT states, mostly in dimension $3\ifmmode\times\else\texttimes\fi{}3$, using a combination of analytical and numerical methods. We use perturbation theory in order to construct rank-5 entangled PPT states close to the known rank-4 states, and in order to compute dimensions and study the geometry of surfaces of low-rank PPT states. We exploit the close connection between low-rank PPT states and product vectors. In particular, we show how to reconstruct a low-rank PPT state from a sufficient number of product vectors in its kernel. It may seem surprising that the number of product vectors needed may be smaller than the dimension of the kernel.

arXiv:1104.1519•Physical Review A•Feb 6, 2012•16 citations
Power symmetric stochastic matrices introduced by R. Sinkhorn (1981) and their generalization by R.B. Bapat, S.K. Jain and K. Manjunatha Prasad (1999) have been utilized to give positive block matrices with trace one possessing positive partial transpose, the so-called PPT states. Another method to construct such PPT states is given, it uses the form of a matrix unitarily equivalent to to its transpose obtained by S.R. Garcia and J.E. Tener (2012). Evolvement or suppression of separability or entanglement of various levels for a quantum dynamical semigroup of completely positive maps has been studied using Choi-Jamiolkowsky matrix of such maps and the famous Hordeckis criteria (1996). A Trichotomy Theorem has been proved, and examples have been given that depend mainly on generalized Choi maps and clearly distinguish the levels of entanglement breaking.
Power symmetric stochastic matrices introduced by R. Sinkhorn (1981) and their generalization by R.B. Bapat, S.K. Jain and K. Manjunatha Prasad (1999) have been utilized to give positive block matrices with trace one possessing positive partial transpose, the so-called PPT states. Another method to construct such PPT states is given, it uses the form of a matrix unitarily equivalent to to its transpose obtained by S.R. Garcia and J.E. Tener (2012). Evolvement or suppression of separability or entanglement of various levels for a quantum dynamical semigroup of completely positive maps has been studied using Choi-Jamiolkowsky matrix of such maps and the famous Hordeckis criteria (1996). A Trichotomy Theorem has been proved, and examples have been given that depend mainly on generalized Choi maps and clearly distinguish the levels of entanglement breaking.
This paper investigates the properties of Choi polynomials and their fundamental role in the theory of positive linear maps between matrix algebras. By focusing on Hermitian symmetric biquadratic forms, we establish a connection between the positivity of these forms and the structure of positive maps. We specifically explore the construction of indecomposable positive maps in matrix algebras, and their application as entanglement witnesses. Our analysis extends to the detection of Positive Partial Transpose (PPT) entangled states and the classification of edge PPT states in Mm(C)⊗Mn(C)M_m(\mathbb{C}) \otimes M_n(\mathbb{C})Mm​(C)⊗Mn​(C). Our results provide a refined framework for identifying non-separable states that escape the standard PPT criterion, contributing to the broader understanding of entanglement distillation and quantum information theory.
Power symmetric matrices defned and studied by R. Sinkhorn (1981) and their generalization by R.B. Bapat, S.K. Jain and K. Manjunatha Prasad (1999) have been utilized to give positive block matrices with trace one possessing positive partial transpose, the so-called PPT states. Another method to construct such PPT states is given, it uses the form of a matrix unitarily equivalent to its transpose obtained by S.R. Garcia and J.E. Tener (2012). Evolvement or suppression of separability or entanglement of various levels for a quantum dynamical semigroup of completely positive maps has been studied using Choi-Jamiolkowsky matrix of such maps and the famous Horodecki's criteria (1996). A Trichotomy Theorem has been proved, and examples have been given that depend mainly on generalized Choi maps and clearly distinguish the levels of entanglement breaking.
Entanglement swapping is a fundamental operation in quantum repeaters for establishing entanglement between distant parties. The positive partial transpose (PPT) squared conjecture asks whether two PPT entangled links can generate terminal entanglement through entanglement swapping, or equivalently, whether the composition of two PPT maps is always entanglement breaking. Motivated by this conjecture, we investigate the map-composition problem beyond the PPT setting. For qutrit completely positive (CP) maps, we prove that the composition of any CP map whose Choi matrix is 111-undistillable with any CP map whose Choi matrix has Schmidt number at most two is entanglement breaking in either order. Moreover, we show that the cone of 111-undistillable CP maps is exactly the largest qutrit cone of CP maps whose composition with every CP map whose Choi matrix has Schmidt number at most two is entanglement breaking in both orders. Finally, although map composition captures only the standard maximally entangled outcome in entanglement swapping, we prove that any 111-undistillable two-qutrit state and any state of Schmidt number at most two cannot generate terminal entanglement under an arbitrary selective measurement on the intermediate systems.
We express the positive-partial-transpose (PPT) separability criterion for symmetric states of multiqubit systems in terms of matrix inequalities based on the recently introduced tensor representation for spin states. We construct a matrix from the tensor representation of the state and show that it is similar to the partial transpose of the density matrix written in the computational basis. Furthermore, the positivity of this matrix is equivalent to the positivity of a correlation matrix constructed from tensor products of Pauli operators. This allows for a more transparent experimental interpretation of the PPT criteria for an arbitrary spin-jjj state. The unitary matrices connecting our matrix to the partial transpose of the state generalize the so-called magic basis that plays a central role in Wootters' explicit formula for the concurrence of a two-qubit system and the Bell bases used for the teleportation of a one- or two-qubit state.
Deciding whether a mixed quantum state is separable or entangled is a difficult problem in general. Separable states are positive under partial transposition [they are positive-partial-transpose (PPT) states], but this simple test does not exclude all entangled states. In order to understand the entangled PPT states, having so-called bound entanglement, we want to study the extremal PPT states. An extremal PPT state is either a pure product state, then it is separable, or it is entangled, in which case the state and its partial transpose must still be rather low-rank density matrices, although it is known that the rank must be at least 4. In a previous paper we presented a complete classification of the rank-4 entangled PPT states in dimension $3\ifmmode\times\else\texttimes\fi{}3$, generalizing the construction by Bennett et al. from unextendible sets of orthogonal product vectors. In the present paper we continue our investigations of the low-rank entangled PPT states, mostly in dimension $3\ifmmode\times\else\texttimes\fi{}3$, using a combination of analytical and numerical methods. We use perturbation theory in order to construct rank-5 entangled PPT states close to the known rank-4 states, and in order to compute dimensions and study the geometry of surfaces of low-rank PPT states. We exploit the close connection between low-rank PPT states and product vectors. In particular, we show how to reconstruct a low-rank PPT state from a sufficient number of product vectors in its kernel. It may seem surprising that the number of product vectors needed may be smaller than the dimension of the kernel.