Entangled graphs II: Classical correlations in multi-qubit entangled systems
arXiv:quant-ph/0306001 · doi:10.1103/PhysRevA.68.012313
Abstract
Bipartite correlations in multi-qubit systems cannot be shared freely. The presence of entanglement or classical correlation on certain pairs of qubits may imply correlations on other pairs. We present a method of characterization of bi-partite correlations in multi-qubit systems using a concept of entangled graphs that has been introduced in our earlier work [M.Plesch and V.Buzek, Phys. Rev. A 67, 012322 (2003)]. In entangled graphs each qubit is represented by a vertex while the entanglement and classical correlations are represented by two types of edges. We prove by construction that any entangled graph with classical correlations can be represented by a mixed state of N qubits. However, not all entangled graphs with classical correlations can be represented by a pure state.
7 pages, 4 figures, to appear in Phys. Rev. A
References in corpus (8)
- Separability Criterion for Density Matrices
- Separability of Mixed States: Necessary and Sufficient Conditions
- Distributed Entanglement
- Entangled Rings
- Entangled webs: Tight bound for symmetric sharing of entanglement
- Entanglement molecules
- Entangled graphs: Bipartite entanglement in multi-qubit systems
- Purification and correlated measurements of bipartite mixed states
Cited by in corpus (8)
- Multi-party entanglement in graph states
- A classification of entanglement in three-qubit systems
- Monogamy inequalities for the EPR paradox and quantum steering
- Quantum correlations and entanglement in a model comprised of a short chain of nonlinear oscillators
- Accessible and inaccessible quantum coherence in relativistic quantum systems
- Structural change in multipartite entanglement sharing: a random matrix approach
- Molecular Nanomagnet as Resource for Bipartite and Tripartite Quantum Entanglement and Coherence
- Combinatorial Approaches in Quantum Information Theory