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:0705.2583 · Journal of Physics A Mathematical and Theoretical

Further results on entanglement detection and quantification from the correlation matrix criterion

Julio I de Vicente

Published Jan 29, 2008• 76 citations
arXivHTMLPDF

Abstract

The correlation matrix (CM) criterion is a recently derived powerful sufficient condition for the presence of entanglement in bipartite quantum states of arbitrary dimensions. It has been shown that it can be stronger than the positive partial transpose (PPT) criterion, as well as the computable cross norm or realignment (CCNR) criterion in different situations. However, it remained as an open question whether there existed sets of states for which the CM criterion could be stronger than both criteria simultaneously. Here, we give an affirmative answer to this question by providing examples of entangled states that scape detection by both the PPT and CCNR criteria whose entanglement is revealed by the CM condition. We also show that the CM can be used to measure the entanglement of pure states and obtain lower bounds for the entanglement measure known as tangle for general (mixed) states.

DOI
10.1088/1751-8113/41/6/065309

Related papers

Correlation Minor Norm as a Detector and Quantifier of Entanglement

Bar Y. Peled, Amit Te’eni, Avishy Y. Carmi +1 more

In this paper we develop an approach for detecting entanglement, which is based on measuring quantum correlations and constructing a correlation matrix. The correlation matrix is then used for defining a family of parameters, named Correlation Minor Norms, which allow one to detect entanglement. This approach generalizes the computable cross-norm or realignment (CCNR) criterion, and moreover requires measuring a state-independent set of operators. Furthermore, we illustrate a scheme which yields for each Correlation Minor Norm a separable state that maximizes it. The proposed entanglement detection scheme is believed to be advantageous in comparison to other methods because correlations have a simple, intuitive meaning and in addition they can be directly measured in experiment. Moreover, it is demonstrated to be stronger than the CCNR criterion. We also illustrate the relation between the Correlation Minor Norm and entanglement entropy for pure states. Finally, we discuss the relation between the Correlation Minor Norm and quantum discord, and briefly discuss possible generalizations for multipartite scenarios.

•May 25, 2020•0 citations

Correlation minor norms, entanglement detection and discord

Bar Y. Peled, Amit Te’eni, Avishy Carmi +1 more

In this paper we develop an approach for detecting entanglement, which is based on measuring quantum correlations and constructing a correlation matrix. The correlation matrix is then used for defining a family of parameters, named Correlation Minor Norms, which allow one to detect entanglement. This approach generalizes the computable cross-norm or realignment (CCNR) criterion, and moreover requires measuring a state-independent set of operators. Furthermore, we illustrate a scheme which yields for each Correlation Minor Norm a separable state that maximizes it. The proposed entanglement detection scheme is believed to be advantageous in comparison to other methods because correlations have a simple, intuitive meaning and in addition they can be directly measured in experiment. Moreover, it is demonstrated to be stronger than the CCNR criterion. We also illustrate the relation between the Correlation Minor Norm and entanglement entropy for pure states. Finally, we discuss the relation between the Correlation Minor Norm and quantum discord. We demonstrate that the CMN may be used to define a new measure for quantum discord.

arXiv:2005.12079•Scientific Reports•Feb 2, 2021•5 citations

Moments based entanglement criteria and measures

Yiding Wang, Tinggui Zhang, Xiaofen Huang +1 more

Abstract Quantum entanglement plays a key role in quantum computation and quantum information processing. It is of great significance to find efficient and experimentally friend separability criteria to detect entanglement. In this paper, we firstly propose two easily used entanglement criteria based on matrix moments. The first entanglement criterion only uses the first two realignment moments of a density matrix. The second entanglement criterion is based on the moments related to the partially transposed matrix. By detailed examples we illustrate the effectiveness of these criteria in detecting entanglement. Moreover, we provide an experimentally measurable lower bound of concurrence based on these moments. Finally, we present both bipartite and genuine tripartite entanglement measures based on the moments of the reduced states. By detailed examples, we show that our entanglement measures characterize the quantum entanglement in a more fine ways than the existing measures.

arXiv:2405.04754•Journal of Physics A Mathematical and Theoretical•Apr 19, 2024•4 citations

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•93 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

Enhanced Schmidt-number criteria based on correlation trace norms

Armin Tavakoli, Simon Morelli

The Schmidt number represents the genuine entanglement dimension of a bipartite quantum state. We derive simple criteria for the Schmidt number of a density matrix in arbitrary local dimensions, given that certain symmetric measurements exist. They are based on the trace norm of correlations obtained from seminal families of quantum measurements, specifically symmetric informationally complete measurements and mutually unbiased bases. Our criteria are strictly stronger than both the well-known fidelity witness criterion and the computable cross-norm or realignment criterion.

arXiv:2402.09972•Physical Review A•Dec 11, 2024•16 citations
The correlation matrix (CM) criterion is a recently derived powerful sufficient condition for the presence of entanglement in bipartite quantum states of arbitrary dimensions. It has been shown that it can be stronger than the positive partial transpose (PPT) criterion, as well as the computable cross norm or realignment (CCNR) criterion in different situations. However, it remained as an open question whether there existed sets of states for which the CM criterion could be stronger than both criteria simultaneously. Here, we give an affirmative answer to this question by providing examples of entangled states that scape detection by both the PPT and CCNR criteria whose entanglement is revealed by the CM condition. We also show that the CM can be used to measure the entanglement of pure states and obtain lower bounds for the entanglement measure known as tangle for general (mixed) states.
In this paper we develop an approach for detecting entanglement, which is based on measuring quantum correlations and constructing a correlation matrix. The correlation matrix is then used for defining a family of parameters, named Correlation Minor Norms, which allow one to detect entanglement. This approach generalizes the computable cross-norm or realignment (CCNR) criterion, and moreover requires measuring a state-independent set of operators. Furthermore, we illustrate a scheme which yields for each Correlation Minor Norm a separable state that maximizes it. The proposed entanglement detection scheme is believed to be advantageous in comparison to other methods because correlations have a simple, intuitive meaning and in addition they can be directly measured in experiment. Moreover, it is demonstrated to be stronger than the CCNR criterion. We also illustrate the relation between the Correlation Minor Norm and entanglement entropy for pure states. Finally, we discuss the relation between the Correlation Minor Norm and quantum discord, and briefly discuss possible generalizations for multipartite scenarios.
In this paper we develop an approach for detecting entanglement, which is based on measuring quantum correlations and constructing a correlation matrix. The correlation matrix is then used for defining a family of parameters, named Correlation Minor Norms, which allow one to detect entanglement. This approach generalizes the computable cross-norm or realignment (CCNR) criterion, and moreover requires measuring a state-independent set of operators. Furthermore, we illustrate a scheme which yields for each Correlation Minor Norm a separable state that maximizes it. The proposed entanglement detection scheme is believed to be advantageous in comparison to other methods because correlations have a simple, intuitive meaning and in addition they can be directly measured in experiment. Moreover, it is demonstrated to be stronger than the CCNR criterion. We also illustrate the relation between the Correlation Minor Norm and entanglement entropy for pure states. Finally, we discuss the relation between the Correlation Minor Norm and quantum discord. We demonstrate that the CMN may be used to define a new measure for quantum discord.
Abstract Quantum entanglement plays a key role in quantum computation and quantum information processing. It is of great significance to find efficient and experimentally friend separability criteria to detect entanglement. In this paper, we firstly propose two easily used entanglement criteria based on matrix moments. The first entanglement criterion only uses the first two realignment moments of a density matrix. The second entanglement criterion is based on the moments related to the partially transposed matrix. By detailed examples we illustrate the effectiveness of these criteria in detecting entanglement. Moreover, we provide an experimentally measurable lower bound of concurrence based on these moments. Finally, we present both bipartite and genuine tripartite entanglement measures based on the moments of the reduced states. By detailed examples, we show that our entanglement measures characterize the quantum entanglement in a more fine ways than the existing measures.
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.
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.
The Schmidt number represents the genuine entanglement dimension of a bipartite quantum state. We derive simple criteria for the Schmidt number of a density matrix in arbitrary local dimensions, given that certain symmetric measurements exist. They are based on the trace norm of correlations obtained from seminal families of quantum measurements, specifically symmetric informationally complete measurements and mutually unbiased bases. Our criteria are strictly stronger than both the well-known fidelity witness criterion and the computable cross-norm or realignment criterion.