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/0604050 · Physical Review A

Entanglement criteria based on local uncertainty relations are strictly stronger than the computable cross norm criterion

Otfried Gühne, Matyas I. Mechler, Géza Tóth, Петер Адам

Published Jul 10, 2006• 103 citations
arXivHTMLPDF

Abstract

We show that any state that violates the computable cross norm (or realignment) criterion for separability also violates the separability criterion of the local uncertainty relations. The converse is not true. The local uncertainty relations provide a straightforward construction of nonlinear entanglement witnesses for the cross norm criterion.

DOI
10.1103/physreva.74.010301

Related papers

Entanglement detection beyond the computable cross-norm or realignment criterion

Chengjie Zhang, Yong-Sheng Zhang, Shun Zhang +1 more

Separability problem, to decide whether a given state is entangled or not, is a fundamental problem in quantum information theory. We propose a powerful and computationally simple separability criterion, which allows us to detect the entanglement of many bound entangled states. The criterion is strictly stronger than the criterion based on Bloch representations, the computable cross-norm or realignment criterion and its optimal nonlinear entanglement witnesses. Furthermore, this criterion can be generalized to an analog of permutation separability criteria in the even-partite systems.

arXiv:0709.3766•Physical Review A•Jun 2, 2008•95 citations

Unifying several separability conditions using the covariance matrix criterion

Oleg Gittsovich, Otfried Gühne, P. Hyllus +1 more

We present a framework for deciding whether a quantum state is separable or entangled using covariance matrices of locally measurable observables. This leads to the covariance matrix criterion as a general separability criterion. We demonstrate that this criterion allows us to detect many states where the familiar criterion of the positivity of the partial transpose fails. It turns out that a large number of criteria that have been proposed to complement the positive partial transpose criterion---the computable cross norm or realignment criterion, the criterion based on local uncertainty relations, criteria derived from extensions of the realignment map, and others---are in fact a corollary of the covariance matrix criterion.

arXiv:0803.0757•Physical Review A•Nov 12, 2008•103 citations

A class of inequalities inducing new separability criteria for bipartite quantum systems

Paolo Aniello, Cosmo Lupo

Inspired by the realignment or computable cross norm criterion, we present a new result about the characterization of quantum entanglement. Precisely, an interesting class of inequalities satisfied by all separable states of a bipartite quantum system is derived. These inequalities induce new separability criteria that generalize the realignment criterion.

arXiv:0711.3390•Journal of Physics A Mathematical and Theoretical•Jul 28, 2008•22 citations

Covariance Matrices and the Separability Problem

Otfried Gühne, P. Hyllus, Oleg Gittsovich +1 more

We propose a unifying approach to the separability problem using covariance matrices of locally measurable observables. From a practical point of view, our approach leads to strong entanglement criteria that allow us to detect the entanglement of many bound entangled states in higher dimensions and which are at the same time necessary and sufficient for two qubits. From a fundamental perspective, our approach leads to insights into the relations between several known entanglement criteria--such as the computable cross-norm and local uncertainty criteria--as well as their limitations.

arXiv:quant-ph/0611282•Physical Review Letters•Sep 28, 2007•170 citations

The Separability versus Entanglement Problem

Sreetama Das, Titas Chanda, Maciej Lewenstein +3 more

This chapter defines formally what entangled states are, presents some important criteria to discriminate entangled states from separable ones, and shows their classification according to their capability to perform some precisely defined tasks. Operational entanglement criteria for bipartite quantum states included are the partial transposition criterion, the majorization criterion, the cross-norm or realignment criterion, and the covariance matrix criterion. They detect whether a quantum state is separable or entangled. Some non-operational separability criteria introduced are not state-independent and provide important insights into the structure of the set of entangled states. The concept of entanglement witnesses can be used to detect entanglement experimentally, by performing only a few local measurements, assuming some prior knowledge of the density matrix. The chapter further shows how the Hahn-Banach theorem can be used to obtain “entanglement witnesses". It concludes by presenting a few remarks on multipartite states and multipartite entanglement.

Wiley eBooks•Apr 18, 2016•27 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•244 citations
We show that any state that violates the computable cross norm (or realignment) criterion for separability also violates the separability criterion of the local uncertainty relations. The converse is not true. The local uncertainty relations provide a straightforward construction of nonlinear entanglement witnesses for the cross norm criterion.
Separability problem, to decide whether a given state is entangled or not, is a fundamental problem in quantum information theory. We propose a powerful and computationally simple separability criterion, which allows us to detect the entanglement of many bound entangled states. The criterion is strictly stronger than the criterion based on Bloch representations, the computable cross-norm or realignment criterion and its optimal nonlinear entanglement witnesses. Furthermore, this criterion can be generalized to an analog of permutation separability criteria in the even-partite systems.
We present a framework for deciding whether a quantum state is separable or entangled using covariance matrices of locally measurable observables. This leads to the covariance matrix criterion as a general separability criterion. We demonstrate that this criterion allows us to detect many states where the familiar criterion of the positivity of the partial transpose fails. It turns out that a large number of criteria that have been proposed to complement the positive partial transpose criterion---the computable cross norm or realignment criterion, the criterion based on local uncertainty relations, criteria derived from extensions of the realignment map, and others---are in fact a corollary of the covariance matrix criterion.
We propose a unifying approach to the separability problem using covariance matrices of locally measurable observables. From a practical point of view, our approach leads to strong entanglement criteria that allow us to detect the entanglement of many bound entangled states in higher dimensions and which are at the same time necessary and sufficient for two qubits. From a fundamental perspective, our approach leads to insights into the relations between several known entanglement criteria--such as the computable cross-norm and local uncertainty criteria--as well as their limitations.
This chapter defines formally what entangled states are, presents some important criteria to discriminate entangled states from separable ones, and shows their classification according to their capability to perform some precisely defined tasks. Operational entanglement criteria for bipartite quantum states included are the partial transposition criterion, the majorization criterion, the cross-norm or realignment criterion, and the covariance matrix criterion. They detect whether a quantum state is separable or entangled. Some non-operational separability criteria introduced are not state-independent and provide important insights into the structure of the set of entangled states. The concept of entanglement witnesses can be used to detect entanglement experimentally, by performing only a few local measurements, assuming some prior knowledge of the density matrix. The chapter further shows how the Hahn-Banach theorem can be used to obtain “entanglement witnesses". It concludes by presenting a few remarks on multipartite states and multipartite entanglement.
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.