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:0912.3018 · Physical Review A

Quantifying entanglement with covariance matrices

Oleg Gittsovich, Otfried Gühne

Published Mar 29, 2010• 46 citations
arXivHTMLPDF

Abstract

Covariance matrices are a useful tool for investigating correlations and entanglement in quantum systems. They are widely used in continuous-variable systems, but recently also for finite-dimensional systems powerful entanglement criteria in terms of covariance matrices have been derived. We show how these results can be used for the quantification of entanglement in bipartite systems. To that aim we introduce an entanglement parameter that quantifies the violation of the covariance matrix criterion and can be used to give lower bounds on the concurrence. These lower bounds are easily computable and give entanglement estimates for many weakly entangled states.

DOI
10.1103/physreva.81.032333

Related papers

A note on lower bounds of concurrence for arbitrary dimensional bipartite quantum states

Zhi-Bo Chen, Shao-Ming Fei

Abstract Quantification of quantum entanglement plays a crucial role in the study of quantum information tasks. We present analytical lower bounds for both concurrence and 2-concurrence based on the correlation matrices of bipartite quantum states. Compared with other related lower bounds, our approach provides a better estimation of the entanglement, particularly for states with large purity.

arXiv:2503.16291•Laser Physics•Mar 18, 2025•1 citation

Covariance-Matrix-Based Criteria for Network Entanglement

Kiara Hansenne, Otfried Gühne

Quantum networks offer a realistic and practical scheme for generating multiparticle entanglement and implementing multiparticle quantum communication protocols. However, the correlations that can be generated in networks with quantum sources and local operations are not yet well understood. Covariance matrices, which are powerful tools in entanglement theory, have been also applied to the network scenario. We present simple proofs for the decomposition of such matrices into the sum of positive semi-definite block matrices and, based on that, develop analytical and computable necessary criteria for preparing states in quantum networks. These criteria can be applied to networks where nodes share at most one source, such as all bipartite networks.

arXiv:2307.13480•Entropy•Aug 24, 2023•1 citation

Separability and entanglement of quantum states based on covariance matrices

Ming Li, Shao-Ming Fei, Zhi-Xi Wang

We investigate the separability of quantum states based on covariance matrices. Separability criteria are presented for multipartite states. The lower bound of concurrence proposed in Vicente (2007 Phys. Rev. A 75 052320) is improved by optimizing the local orthonormal observables.

arXiv:0805.1632•Journal of Physics A Mathematical and Theoretical•Apr 30, 2008•17 citations

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

Julio I de Vicente

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.

arXiv:0705.2583•Journal of Physics A Mathematical and Theoretical•Jan 29, 2008•79 citations

Characterizing Entanglement via Uncertainty Relations

Otfried Gühne

We derive a family of necessary separability criteria for finite-dimensional systems based on inequalities for variances of observables. We show that every pure bipartite entangled state violates some of these inequalities. Furthermore, a family of bound entangled states and true multipartite entangled states can be detected. The inequalities also allow us to distinguish between different classes of true tripartite entanglement for qubits. We formulate an equivalent criterion in terms of covariance matrices. This allows us to apply criteria known from the regime of continuous variables to finite-dimensional systems.

arXiv:quant-ph/0306194•Physical Review Letters•Mar 18, 2004•299 citations

Entanglement Detection: Complexity and Shannon Entropic Criteria

Yichen Huang

Entanglement plays a key role in quantum information. The separability problem arises: how to prove that a given quantum state is entangled? Covariance-matrix-based entanglement criteria are the most important and widely used approach to this problem in continuous variable systems. Here, the separability problem is systematically studied in the more experimentally realistic setting that the questioned state is only partly known. A simple general formalism is proposed for this variant of the separability problem. It builds relations between certain classes of criteria and bounds the power of these criteria. In particular, it shows the equivalence of many seemingly different covariance-matrix-based criteria; it offers guidance on the study of and reveals the inherent limitations of covariance-matrix-based criteria. Also, a Shannon entropic criterion is proposed for m ⊕ n-mode states. It unifies and improves many known covariance-matrix-based criteria and Shannon entropic criteria; it is necessary and sufficient for 1 ⊕ n-mode Gaussian states and m ⊕ n-mode bisymmetric Gaussian states.

IEEE Transactions on Information Theory•May 21, 2013•20 citations
Covariance matrices are a useful tool for investigating correlations and entanglement in quantum systems. They are widely used in continuous-variable systems, but recently also for finite-dimensional systems powerful entanglement criteria in terms of covariance matrices have been derived. We show how these results can be used for the quantification of entanglement in bipartite systems. To that aim we introduce an entanglement parameter that quantifies the violation of the covariance matrix criterion and can be used to give lower bounds on the concurrence. These lower bounds are easily computable and give entanglement estimates for many weakly entangled states.
Quantum networks offer a realistic and practical scheme for generating multiparticle entanglement and implementing multiparticle quantum communication protocols. However, the correlations that can be generated in networks with quantum sources and local operations are not yet well understood. Covariance matrices, which are powerful tools in entanglement theory, have been also applied to the network scenario. We present simple proofs for the decomposition of such matrices into the sum of positive semi-definite block matrices and, based on that, develop analytical and computable necessary criteria for preparing states in quantum networks. These criteria can be applied to networks where nodes share at most one source, such as all bipartite networks.
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.
We derive a family of necessary separability criteria for finite-dimensional systems based on inequalities for variances of observables. We show that every pure bipartite entangled state violates some of these inequalities. Furthermore, a family of bound entangled states and true multipartite entangled states can be detected. The inequalities also allow us to distinguish between different classes of true tripartite entanglement for qubits. We formulate an equivalent criterion in terms of covariance matrices. This allows us to apply criteria known from the regime of continuous variables to finite-dimensional systems.
Entanglement plays a key role in quantum information. The separability problem arises: how to prove that a given quantum state is entangled? Covariance-matrix-based entanglement criteria are the most important and widely used approach to this problem in continuous variable systems. Here, the separability problem is systematically studied in the more experimentally realistic setting that the questioned state is only partly known. A simple general formalism is proposed for this variant of the separability problem. It builds relations between certain classes of criteria and bounds the power of these criteria. In particular, it shows the equivalence of many seemingly different covariance-matrix-based criteria; it offers guidance on the study of and reveals the inherent limitations of covariance-matrix-based criteria. Also, a Shannon entropic criterion is proposed for m ⊕ n-mode states. It unifies and improves many known covariance-matrix-based criteria and Shannon entropic criteria; it is necessary and sufficient for 1 ⊕ n-mode Gaussian states and m ⊕ n-mode bisymmetric Gaussian states.