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:2109.12871 · Physical Review Research

Strong entanglement distribution of quantum networks

Xue Yang, Yan‐Han Yang, Ming‐Xing Luo

Published Feb 24, 2022• 19 citations
arXivHTMLPDF

Abstract

Large-scale quantum networks have been employed to overcome practical constraints of transmission and storage for single entangled systems. Our goal in this paper is to explore the strong entanglement distribution of quantum networks. We firstly show that any connected network consisting of generalized Einstein-Podolsky-Rosen states and Greenberger-Horne-Zeilinger states satisfies the strong Coffman-Kundu-Wootters monogamy inequality in terms of the bipartite entanglement measure; in addition, the monogamy inequalities are also considered for generic entangled quantum networks. This reveals the interesting feature of high-dimensional entanglement with local tensor decomposition going beyond qubit entanglement. We then apply the entanglement distribution relation in entangled networks to get a quantum maximum-flow minimum-cut theorem in terms of von Neumann entropy and R\'enyi-$\ensuremath{\alpha}$ entropy. We finally classify entangled quantum networks by distinguishing network configurations under local unitary operations. These results provide insights into characterizing quantum networks in quantum information processing.

DOI
10.1103/physrevresearch.4.013153

Related papers

Strong monogamy of four-qubit entanglement

Bartosz Regula, Sara Di Martino, Soojoon Lee +1 more

We investigate the distribution of bipartite and multipartite entanglement in multiqubit states. In particular we define a set of monogamy inequalities sharpening the conventional Coffman-Kundu-Wootters constraints, and we provide analytical proofs of their validity for relevant classes of states. We present extensive numerical evidence validating the conjectured strong monogamy inequalities for arbitrary pure states of four qubits.

•May 15, 2014•0 citations

Entanglement polygon inequality in qudit systems

Xue Yang, Yan‐Han Yang, Ming‐Xing Luo

Entanglement is an important resource for quantum communication tasks. Most results are focused on qubit entanglement. Our goal in this work is to characterize the multipartite high-dimensional entanglement. We first derive an entanglement polygon inequality for the $q$ concurrence, which manifests the relationship among all the ``one-to-group'' marginal entanglements in any multipartite qudit system. This implies lower and upper bounds for the marginal entanglement of any three-qudit system. We further extend our study to general entanglement distribution inequalities for high-dimensional entanglement in terms of the unified-$(r,s)$ entropy entanglement, including Tsallis entropy, R\'enyi entropy, and von Neumann entropy entanglement as special cases. These results provide insights into characterizing bipartite high-dimensional entanglement in quantum information processing.

arXiv:2205.08801•Physical Review A•Jun 2, 2022•23 citations

Strong Monogamy Conjecture for Multiqubit Entanglement: The Four-Qubit Case

Bartosz Regula, Sara Di Martino, Soojoon Lee +1 more

We investigate the distribution of bipartite and multipartite entanglement in multiqubit states. In particular, we define a set of monogamy inequalities sharpening the conventional Coffman-Kundu-Wootters constraints, and we provide analytical proofs of their validity for relevant classes of states. We present extensive numerical evidence validating the conjectured strong monogamy inequalities for arbitrary pure states of four qubits.

arXiv:1405.3989•Physical Review Letters•Sep 10, 2014•93 citations

Robust multipartite entanglement without entanglement breaking

Ming‐Xing Luo, Shao-Ming Fei

Entangled systems in experiments may be lost or off-line in distributed quantum information processing. This inspires a general problem to characterize quantum operations, which result in breaking of entanglement or not. Our goal in this paper is to solve this problem both in single entanglement and network scenarios. We firstly propose a local model for characterizing all entangled states that are breaking for losing particles. This implies a simple criterion for witnessing single entanglement such as generalized GHZ states and Dicke states. It further provides an efficient witness for entangled quantum networks depending on its connectivity such as $k$-independent quantum networks, completely connected quantum networks, and $k$-connected quantum networks. These networks are universal resources for measurement-based quantum computations. The strong nonlocality can be finally verified by using nonlinear inequalities. These results show distinctive features of both single entangled systems and entangled quantum networks.

arXiv:2106.09240•Physical Review Research•Nov 16, 2021•17 citations

Network configuration theory for all networks

Ming‐Xing Luo

Entangled quantum networks provide great flexibilities and scalabilities for quantum information processing or quantum Internet. Most of results are focused on the nonlocalities of quantum networks. Our goal in this work is to explore new characterizations of any networks with theory-independent configurations. We firstly prove the configuration inequality for any network using the fractional independent set of the associated graph. These inequalities can be built with polynomial-time complexity. The new result allows featuring correlations of any classical network depending only on its network topology. Similar inequalities hold for all entangled quantum networks with any local measurements. This shows an inherent feature of quantum networks under local unitary operations. It is then applied for verifying almost all multipartite entangled pure states with linear complexity, and witnessing quantum network topology without assumption of inputs. The configuration theory is further extended for any no-signalling networks. These results may be interesting in entanglement theory, quantum information processing, and quantum networks.

arXiv:2107.05846•Jul 13, 2021•9 citations

Characterizing entanglement shareability and distribution in $N$-partite systems

Hui Li, Ting Gao, Fengli Yan

Exploring the shareability and distribution of entanglement possesses fundamental significance in quantum information tasks. In this paper, we demonstrate that the square of bipartite entanglement measures $G_q$-concurrence, which is the generalization of concurrence, follows a set of hierarchical monogamy relations for any $N$-qubit quantum state. On the basis of these monogamy inequalities, we render two kinds of hierarchical indicators that exhibit evident advantages in the capacity of witnessing entanglement. Moreover, we show an analytical relation between $G_q$-concurrence and concurrence in $2\otimes d$ systems. Furthermore, we rigorously prove that the monogamy property of squared $G_q$-concurrence is superior to that of squared concurrence in $2\otimes d_2\otimes d_3\otimes\cdots\otimes d_N$ systems. In addition, several concrete examples are provided to illustrate that for multilevel systems, the squared $G_q$-concurrence satisfies the monogamy relation, even if the squared concurrence does not. These results better reveal the intriguing characteristic of multilevel entanglement and provide critical insights into the entanglement distribution within multipartite quantum systems.

quant-pharXiv:2512.15018•Physical Review A•Dec 18, 2025•0 citations
Large-scale quantum networks have been employed to overcome practical constraints of transmission and storage for single entangled systems. Our goal in this paper is to explore the strong entanglement distribution of quantum networks. We firstly show that any connected network consisting of generalized Einstein-Podolsky-Rosen states and Greenberger-Horne-Zeilinger states satisfies the strong Coffman-Kundu-Wootters monogamy inequality in terms of the bipartite entanglement measure; in addition, the monogamy inequalities are also considered for generic entangled quantum networks. This reveals the interesting feature of high-dimensional entanglement with local tensor decomposition going beyond qubit entanglement. We then apply the entanglement distribution relation in entangled networks to get a quantum maximum-flow minimum-cut theorem in terms of von Neumann entropy and R'enyi-\ensuremathα\ensuremath{\alpha}\ensuremathα entropy. We finally classify entangled quantum networks by distinguishing network configurations under local unitary operations. These results provide insights into characterizing quantum networks in quantum information processing.
Entanglement is an important resource for quantum communication tasks. Most results are focused on qubit entanglement. Our goal in this work is to characterize the multipartite high-dimensional entanglement. We first derive an entanglement polygon inequality for the qqq concurrence, which manifests the relationship among all the ``one-to-group'' marginal entanglements in any multipartite qudit system. This implies lower and upper bounds for the marginal entanglement of any three-qudit system. We further extend our study to general entanglement distribution inequalities for high-dimensional entanglement in terms of the unified-(r,s)(r,s)(r,s) entropy entanglement, including Tsallis entropy, R\'enyi entropy, and von Neumann entropy entanglement as special cases. These results provide insights into characterizing bipartite high-dimensional entanglement in quantum information processing.
Entangled systems in experiments may be lost or off-line in distributed quantum information processing. This inspires a general problem to characterize quantum operations, which result in breaking of entanglement or not. Our goal in this paper is to solve this problem both in single entanglement and network scenarios. We firstly propose a local model for characterizing all entangled states that are breaking for losing particles. This implies a simple criterion for witnessing single entanglement such as generalized GHZ states and Dicke states. It further provides an efficient witness for entangled quantum networks depending on its connectivity such as kkk-independent quantum networks, completely connected quantum networks, and kkk-connected quantum networks. These networks are universal resources for measurement-based quantum computations. The strong nonlocality can be finally verified by using nonlinear inequalities. These results show distinctive features of both single entangled systems and entangled quantum networks.
Entangled quantum networks provide great flexibilities and scalabilities for quantum information processing or quantum Internet. Most of results are focused on the nonlocalities of quantum networks. Our goal in this work is to explore new characterizations of any networks with theory-independent configurations. We firstly prove the configuration inequality for any network using the fractional independent set of the associated graph. These inequalities can be built with polynomial-time complexity. The new result allows featuring correlations of any classical network depending only on its network topology. Similar inequalities hold for all entangled quantum networks with any local measurements. This shows an inherent feature of quantum networks under local unitary operations. It is then applied for verifying almost all multipartite entangled pure states with linear complexity, and witnessing quantum network topology without assumption of inputs. The configuration theory is further extended for any no-signalling networks. These results may be interesting in entanglement theory, quantum information processing, and quantum networks.
Characterizing entanglement shareability and distribution in NNN-partite systems
Exploring the shareability and distribution of entanglement possesses fundamental significance in quantum information tasks. In this paper, we demonstrate that the square of bipartite entanglement measures GqG_qGq​-concurrence, which is the generalization of concurrence, follows a set of hierarchical monogamy relations for any NNN-qubit quantum state. On the basis of these monogamy inequalities, we render two kinds of hierarchical indicators that exhibit evident advantages in the capacity of witnessing entanglement. Moreover, we show an analytical relation between GqG_qGq​-concurrence and concurrence in 2⊗d2\otimes d2⊗d systems. Furthermore, we rigorously prove that the monogamy property of squared GqG_qGq​-concurrence is superior to that of squared concurrence in 2⊗d2⊗d3⊗⋯⊗dN2\otimes d_2\otimes d_3\otimes\cdots\otimes d_N2⊗d2​⊗d3​⊗⋯⊗dN​ systems. In addition, several concrete examples are provided to illustrate that for multilevel systems, the squared GqG_qGq​-concurrence satisfies the monogamy relation, even if the squared concurrence does not. These results better reveal the intriguing characteristic of multilevel entanglement and provide critical insights into the entanglement distribution within multipartite quantum systems.