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/0701029

Characterizing the complete hierarchy of correlations in an nnn-party system

Di Zhou, You, L.

Published Jan 7, 2007• 4 citations
arXivHTMLPDF

Abstract

A characterization of the complete correlation structure in an $n$-party system is proposed in terms of a series of $(k,n)$ threshold classical secret sharing protocols ($2\le k\le n$). The total correlation is shown to be the sum of independent correlations of 2-, 3-,$...$, $n$-parties. Our result unifies several earlier scattered works, and shines new light at the important topic of multi-party quantum entanglement. As an application, we explicitly construct the hierarchy of correlations in an $n$-qubit graph state.

DOI
10.48550/arxiv.quant-ph/0701029

Related papers

Multi-party quantum correlation and entanglement

Li You

A characterization of the complete correlation structure in an n-party system is proposed in terms of a series of (k, n) threshold classical secret sharing protocols (2 ≤ k ≤ n). The total correlation is shown to be the sum of independent correlations of 2-, 3-,…, n-parties. Our result unifies several earlier scattered works, and shines new light at the important topic of multi-party quantum entanglement. As an application, we explicitly construct the hierarchy of correlations in an n-qubit graph state.

OSA Workshop on Entanglement and Quantum Decoherence•Jan 1, 2008•0 citations

Entangled graphs. II. Classical correlations in multiqubit entangled systems

Martin Plesch, Vladimír Bužek

Bipartite correlations in multiqubit 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 bipartite correlations in multiqubit systems using a concept of entangled graphs which has been introduced in our earlier work [M. Plesch and V. Bu\ifmmode \check{z}\else \v{z}\fi{}ek, 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.

arXiv:quant-ph/0306001•Physical Review A•Jul 15, 2003•14 citations

Quantum secret sharing with qudit graph states

Adrian Keet, Ben Fortescue, Damian Markham +1 more

We present a unified formalism for threshold quantum secret sharing using graph states of systems with prime dimension. We construct protocols for three varieties of secret sharing: with classical and quantum secrets shared between parties over both classical and quantum channels.

arXiv:1004.4619•Physical Review A•Dec 14, 2010•175 citations

Genuine Quantum and Classical Correlations in Multipartite Systems

Gian Luca Giorgi, Bruno Bellomo, Fernando Galve +1 more

Generalizing the quantifiers used to classify correlations in bipartite systems, we define genuine total, quantum, and classical correlations in multipartite systems. The measure we give is based on the use of relative entropy to quantify the distance between two density matrices. Moreover, we show that, for pure states of three qubits, both quantum and classical bipartite correlations obey a ladder ordering law fixed by two-body mutual informations, or, equivalently, by one-qubit entropies.

arXiv:1108.0434•Physical Review Letters•Nov 3, 2011•123 citations

Graph state secret sharing in higher-dimensional systems

Ben Fortescue, Adrian Keet, Damian Markham +1 more

We present a formalism within which, using entangled graph states of prime-dimensional systems, a variety of different secret-sharing schemes (involving both quantum and classical secrets and quantum and classical channels shared between parties) may be unified. We review the explicit protocols we have found for three varieties of secret sharing within this formalism, including some for which the analogous formalism using qubit graph states is not sufficient.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jul 29, 2010•1 citation

Tsallis entropy, q -expectation value, and constraints on three-party quantum correlations

Jeong San Kim

We show that the mutually exclusive nature of classical and quantum correlations distributed in multiparty quantum systems can be characterized in terms of $q$-expectation value. Using Tsallis $q$ entropy and $q$-expectation value, we first provide generalized definitions of classical and quantum correlations, and establish their trade-off relations in three-party quantum systems of arbitrary dimension with respect to $q$-expectation value for $q\ensuremath{\ge}1$. We also provide equivalence conditions for monogamy and polygamy inequalities of quantum entanglement and quantum discord distributed in three-party quantum systems of arbitrary dimension with respect to $q$-expectation value for $q\ensuremath{\ge}1$.

arXiv:1907.13313•Physical Review A•Sep 19, 2019•6 citations
A characterization of the complete correlation structure in an nnn-party system is proposed in terms of a series of (k,n)(k,n)(k,n) threshold classical secret sharing protocols (2≤k≤n2\le k\le n2≤k≤n). The total correlation is shown to be the sum of independent correlations of 2-, 3-,........., nnn-parties. Our result unifies several earlier scattered works, and shines new light at the important topic of multi-party quantum entanglement. As an application, we explicitly construct the hierarchy of correlations in an nnn-qubit graph state.
A characterization of the complete correlation structure in an n-party system is proposed in terms of a series of (k, n) threshold classical secret sharing protocols (2 ≤ k ≤ n). The total correlation is shown to be the sum of independent correlations of 2-, 3-,…, n-parties. Our result unifies several earlier scattered works, and shines new light at the important topic of multi-party quantum entanglement. As an application, we explicitly construct the hierarchy of correlations in an n-qubit graph state.
Bipartite correlations in multiqubit 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 bipartite correlations in multiqubit systems using a concept of entangled graphs which has been introduced in our earlier work [M. Plesch and V. Bu\ifmmode \check{z}\else \v{z}\fi{}ek, 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.
We show that the mutually exclusive nature of classical and quantum correlations distributed in multiparty quantum systems can be characterized in terms of qqq-expectation value. Using Tsallis qqq entropy and qqq-expectation value, we first provide generalized definitions of classical and quantum correlations, and establish their trade-off relations in three-party quantum systems of arbitrary dimension with respect to qqq-expectation value for $q\ensuremath{\ge}1$. We also provide equivalence conditions for monogamy and polygamy inequalities of quantum entanglement and quantum discord distributed in three-party quantum systems of arbitrary dimension with respect to qqq-expectation value for $q\ensuremath{\ge}1$.