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/0202121 · Quantum Information Processing

Further Results on the Cross Norm Criterion for Separability

Oliver Rudolph

Published Aug 1, 2005• 323 citations
arXivHTMLPDF
DOI
10.1007/s11128-005-5664-1

Related papers

Computable Cross-norm Criterion for Separability

Oliver Rudolph

Letters in Mathematical Physics•Oct 1, 2004•51 citations

Norm duality and the cross norm criteria for quantum entanglement

Nathaniel Johnston

We use duality techniques to prove and generalize the cross norm and computable cross norm criteria for separability of quantum states. While the original proof of the cross norm criterion is long and involved, our new proof is short and elementary. Furthermore, our proof generalizes naturally to arbitrary Schmidt number. We also use these techniques to generalize the computable cross norm criterion to arbitrary Schmidt number and prove some results of independent interest along the way.

Linear and Multilinear Algebra•Jan 23, 2013•8 citations

Some properties of the computable cross-norm criterion for separability

Oliver Rudolph

The computable cross-norm (CCN) criterion is a powerful analytical and computable separability criterion for bipartite quantum states, which is also known to systematically detect bound entanglement. In certain aspects this criterion complements the well-known Peres positive partial transpose (PPT) criterion. In the present paper we study important analytical properties of the CCN criterion. We show that in contrast to the PPT criterion it is not sufficient in dimension $2\ifmmode\times\else\texttimes\fi{}2.$ In higher dimensions, theorems connecting the fidelity of a quantum state with the CCN criterion are proved. We also analyze the behavior of the CCN criterion under local operations and identify the operations that leave it invariant. It turns out that the CCN criterion is in general not invariant under local operations.

arXiv:quant-ph/0212047•Physical Review A•Mar 27, 2003•239 citations

Some aspects of separability revisited

Oliver Rudolph

Physics Letters A•Jan 7, 2004•3 citations

On the cross norm criterion for separability

Oliver Rudolph

The computable cross norm (CCN) criterion for separability is neither weaker nor stronger than the positive partial transpose (PPT) criterion.

Journal of Physics A Mathematical and General•May 12, 2003•36 citations

Some Remarks on Non-Separability

Enrico Giannetto

Springer eBooks•Jan 1, 1995•1 citation
The computable cross-norm (CCN) criterion is a powerful analytical and computable separability criterion for bipartite quantum states, which is also known to systematically detect bound entanglement. In certain aspects this criterion complements the well-known Peres positive partial transpose (PPT) criterion. In the present paper we study important analytical properties of the CCN criterion. We show that in contrast to the PPT criterion it is not sufficient in dimension $2\ifmmode\times\else\texttimes\fi{}2.$ In higher dimensions, theorems connecting the fidelity of a quantum state with the CCN criterion are proved. We also analyze the behavior of the CCN criterion under local operations and identify the operations that leave it invariant. It turns out that the CCN criterion is in general not invariant under local operations.