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/0501023

On PPT States in KxMxN Composite Quantum Systems

Xiaohong Wang, Shao-Ming Fei, Zhi‐Xi Wang, Ke Wu

Published Jan 6, 2005• 0 citations
arXivHTMLPDF

Abstract

We study the general representations of positive partial transpose (PPT) states in ${\cal C}^K \otimes {\cal C}^M \otimes {\cal C}^N$. For the PPT states with rank-$N$ a canonical form is obtained, from which a sufficient separability condition is presented.

DOI
10.48550/arxiv.quant-ph/0501023

Related papers

On PPT States in C K ⊗ C M ⊗ C N Composite Quantum Systems

Xiaohong Wang, Shao-Ming Fei, Zhi‐Xi Wang +1 more

We study the general representations of positive partial transpose (PPT) states in C K ⊗C M ⊗C N. For the PPT states with rank-N a canonical form is obtained, from which a sufficient separability condition is presented.

Communications in Theoretical Physics•Aug 15, 2004•2 citations

CANONICAL FORM AND SEPARABILITY OF PPT STATES IN ${\mathcal C}^2\otimes {\mathcal C}^M\otimes {\mathcal C}^N$ COMPOSITE QUANTUM SYSTEMS

Xiaohong Wang, Shao-Ming Fei, Zhi‐Xi Wang +1 more

We investigate the canonical forms of positive partial transposition (PPT) density matrices in [Formula: see text] composite quantum systems with rank N. A general expression for these PPT states are explicitly obtained. From this canonical form a sufficient separability condition is presented.

arXiv:quant-ph/0312031•International Journal of Quantum Information•Sep 1, 2003•0 citations

Canonical Form and Separability of PPT States in C 2 ⊗ C 2 ⊗ C 2 ⊗ C N Composite Quantum Systems

Fei Shao-Ming, Gao Xiu-Hong, Wang Xiao-Hong +2 more

We give a canonical form of PPT states in C 2 ⊗ C 2 ⊗ C 2 ⊗ C N with rank=N. From this canonical form a sufficient separability condition for these states is presented.

arXiv:quant-ph/0310146•Communications in Theoretical Physics•Nov 15, 2003•0 citations

CANONICAL FORM AND SEPARABILITY OF PPT STATES ON MULTIPLE QUANTUM SPACES

Xiaohong Wang, Shao-Ming Fei

By using the "subtracting projectors" method in proving the separability of PPT states on multiple quantum spaces, we derive a canonical form of PPT states in [Formula: see text] composite quantum systems with rank N, from which a sufficient separability condition for these states is presented.

arXiv:quant-ph/0504145•International Journal of Quantum Information•Dec 17, 2004•2 citations

Entangled States with Positive Partial Transpose in Any-Dimensional Quantum System

Yu-Chun Wu, Ping‐Xing Chen, Zheng-Wei Zhou +1 more

It is well known that the positive partial transpose (PPT) criterion for determining separability is an operational separability criterion. However, in a high-dimensional (>6) situation, this criterion is not sufficient. How can we judge whether an entangled state in any high-dimensional quantum system is PPT or not? Here we propose a linear algebra method for checking the positivity of the partial transpose of a state and present a set of entangled mixed states with non-positive partial transpose.

Chinese Physics Letters•Feb 24, 2005•2 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•15 citations
We study the general representations of positive partial transpose (PPT) states in CK⊗CM⊗CN{\cal C}^K \otimes {\cal C}^M \otimes {\cal C}^NCK⊗CM⊗CN. For the PPT states with rank-NNN a canonical form is obtained, from which a sufficient separability condition is presented.
CANONICAL FORM AND SEPARABILITY OF PPT STATES IN C2⊗CM⊗CN{\mathcal C}^2\otimes {\mathcal C}^M\otimes {\mathcal C}^NC2⊗CM⊗CN COMPOSITE QUANTUM SYSTEMS
It is well known that the positive partial transpose (PPT) criterion for determining separability is an operational separability criterion. However, in a high-dimensional (>6) situation, this criterion is not sufficient. How can we judge whether an entangled state in any high-dimensional quantum system is PPT or not? Here we propose a linear algebra method for checking the positivity of the partial transpose of a state and present a set of entangled mixed states with non-positive partial transpose.
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.