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

Quantum Bio-Informatics

SOME CHARACTERIZATIONS OF PPT STATES AND THEIR RELATION

Takashi Matsuoka, Joint work with W. A. Majewski and M. Ohya

Published Feb 1, 2009• 0 citations
Publisher

Abstract

Recently some descriptions to characterize partially transposed (PPT) sates were obtained. In this note we focus the two of them and discuss their relation.
DOI
10.1142/9789814273756_0013

Related papers

On a characterization of PPT states

W. A. Majewski

We present two different descriptions of positive partially transposed (PPT) states. One is based on the theory of positive maps while the second description provides a characterization of PPT states in terms of Hilbert space vectors. Our note is based on our previous results.

arXiv:0708.3980•Aug 29, 2007•2 citations

ENTANGLEMENT OF CONVEX LINEAR COMBINATION AND CONSTRUCTION OF PPT ENTANGLED STATES

Wei Cheng, Fang Xu, Hua Li +1 more

Given two bipartite quantum states and the convex linear combination of them, we discuss the relation between the entanglement of the convex linear combination state and the entanglement of states being combined. This is achieved by characterizing quantum states quantitatively via the positive partial transpose (PPT) criterion and the computable cross-norm or realignment (CCNR) criterion. Inspired by the Horodecki's 3 ⊗ 3 quantum states, we also give explicit examples to illustrate all possible cases of convex linear combination. Finally, as an application of this method, we show how to construct new bipartite PPT entangled states from known PPT entangled states by convex linear combination.

International Journal of Quantum Information•Feb 1, 2013•2 citations

Sinkhorn–Knopp theorem for PPT states

Daniel Cariello

arXiv:1807.06955•Letters in Mathematical Physics•Apr 19, 2019•2 citations

PARTIAL TRANSPOSITION OF RANDOM STATES AND NON-CENTERED SEMICIRCULAR DISTRIBUTIONS

Guillaume Aubrun

Let W be a Wishart random matrix of size d 2 × d 2 , considered as a block matrix with d × d blocks. Let Y be the matrix obtained by transposing each block of W. We prove that the empirical eigenvalue distribution of Y approaches a non-centered semicircular distribution when d → ∞. We also show the convergence of extreme eigenvalues towards the edge of the expected spectrum. The proofs are based on the moments method. This matrix model is relevant to Quantum Information Theory and corresponds to the partial transposition of a random induced state. A natural question is: "When does a random state have a positive partial transpose (PPT)?". We answer this question and exhibit a strong threshold when the parameter from the Wishart distribution equals 4. When d gets large, a random state on C d ⊗ C d obtained after partial tracing a random pure state over some ancilla of dimension αd 2 is typically PPT when α > 4 and typically non-PPT when α < 4.

arXiv:1011.0275•Random Matrices Theory and Application•Mar 13, 2012•58 citations

Comment on some theories of state reduction

A. M. Jayannavar

Physics Letters A•Aug 1, 1992•1 citation

State reduction theories, their classical analogs and some comments

A. M. Jayannavar

Pramana•Jan 1, 1993•0 citations
Given two bipartite quantum states and the convex linear combination of them, we discuss the relation between the entanglement of the convex linear combination state and the entanglement of states being combined. This is achieved by characterizing quantum states quantitatively via the positive partial transpose (PPT) criterion and the computable cross-norm or realignment (CCNR) criterion. Inspired by the Horodecki's 3 ⊗ 3 quantum states, we also give explicit examples to illustrate all possible cases of convex linear combination. Finally, as an application of this method, we show how to construct new bipartite PPT entangled states from known PPT entangled states by convex linear combination.
Let W be a Wishart random matrix of size d 2 × d 2 , considered as a block matrix with d × d blocks. Let Y be the matrix obtained by transposing each block of W. We prove that the empirical eigenvalue distribution of Y approaches a non-centered semicircular distribution when d → ∞. We also show the convergence of extreme eigenvalues towards the edge of the expected spectrum. The proofs are based on the moments method. This matrix model is relevant to Quantum Information Theory and corresponds to the partial transposition of a random induced state. A natural question is: "When does a random state have a positive partial transpose (PPT)?". We answer this question and exhibit a strong threshold when the parameter from the Wishart distribution equals 4. When d gets large, a random state on C d ⊗ C d obtained after partial tracing a random pure state over some ancilla of dimension αd 2 is typically PPT when α > 4 and typically non-PPT when α < 4.