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/0007086 · Physical Review A

Entangled webs: Tight bound for symmetric sharing of entanglement

Masato Koashi, Vladimír Bužek, Nobuyuki Imoto

Published Oct 16, 2000• 143 citations
arXivHTMLPDF

Abstract

Quantum entanglement cannot be unlimitedly shared among an arbitrary number of qubits. The degree of bipartite entanglement decreases as the number of entangled pairs in an N-qubit system increases. We analyze a system of N qubits in which an arbitrary pair of particles is entangled. We show that the maximum degree of entanglement (measured in the concurrence) between any pair of qubits is $2/N.$ This tight bound can be achieved when the qubits are prepared in a pure symmetric (with respect to permutations) state with just one qubit in the basis state $|0〉$ and the others in the basis state $|1〉.$

DOI
10.1103/physreva.62.050302

Related papers

Bell’s inequality and entanglement in qubits

Po-Yao Chang, Su-Kuan Chu, Chen‐Te Ma

We propose an alternative evaluation of quantum entanglement by measuring the maximum violation of the Bell’s inequality without information of the reduced density matrix of a system. This proposal is demonstrated by bridging the maximum violation of the Bell’s inequality and a concurrence of a pure state in an n-qubit system, in which one subsystem only contains one qubit and the state is a linear combination of two product states. We apply this relation to the ground states of four qubits in the Wen-Plaquette model and show that they are maximally entangled. A topological entanglement entropy of the Wen-Plaquette model could be obtained by relating the upper bound of the maximum violation of the Bell’s inequality to the generalized concurrence of a pure state with respect to different bipartitions.

arXiv:1705.06444•Journal of High Energy Physics•Sep 1, 2017•10 citations

Entanglement polygon inequality in qubit systems

Xiao-Feng Qian, Miguel Angel Alonso, Joseph H. Eberly

We prove a set of tight entanglement inequalities for arbitrary N -qubit pure states. By focusing on all bi-partite marginal entanglements between each single qubit and its remaining partners, we show that the inequalities provide an upper bound for each marginal entanglement, while the known monogamy relation establishes the lower bound. The restrictions and sharing properties associated with the inequalities are further analyzed with a geometric polytope approach, and examples of three-qubit GHZ-class and W-class entangled states are presented to illustrate the results.

arXiv:1806.08415•New Journal of Physics•May 10, 2018•39 citations

Entangled graphs: Bipartite entanglement in multiqubit systems

Martin Plesch, Vladimír Bužek

Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits, we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite system is associated with a point (vertex), while a bipartite entanglement between two specific qubits is represented by a connection (edge) between these points. We prove that any such entangled structure can be associated with a pure state of a multiqubit system. Moreover, we show that a pure state corresponding to a given entangled structure is a superposition of vectors from a subspace of the ${2}^{N}$-dimensional Hilbert space, whose dimension grows linearly with the number of entangled pairs.

arXiv:quant-ph/0211020•Physical Review A•Jan 29, 2003•55 citations

Tight bounds on the concurrence of quantum superpositions

Julien Niset, Nicolas J. Cerf

The entanglement content of superpositions of quantum states is investigated based on a measure called concurrence. Given a bipartite pure state in arbitrary dimension written as the quantum superposition of two other such states, we find simple inequalities relating the concurrence of the state to that of its components. We derive an exact expression for the concurrence when the component states are biorthogonal and provide elegant upper and lower bounds in all other cases. For quantum bits, our upper bound is tighter than the previously derived bound [N. Linden et al., Phys. Rev. Lett. 97, 100502 (2006)].

arXiv:0705.4650•Physical Review A•Oct 23, 2007•29 citations

Simplex of bound entangled multipartite qubit states

Beatrix C. Hiesmayr, Florian Hipp, Marcus Huber +2 more

We construct a simplex for multipartite qubit states of even number $n$ of qubits, which has the same geometry concerning separability, mixedness, kind of entanglement, amount of entanglement, and nonlocality as the bipartite qubit states. We derive the entanglement of the class of states which can be described by only three real parameters with the help of a multipartite measure for all discrete systems. We prove that the bounds on this measure are optimal for the whole class of states and that it reveals that the states possess only $n$-partite entanglement and not, e.g., bipartite entanglement. We then show that this $n$-partite entanglement can be increased by stochastic local operations and classical communication to the purest maximal entangled states. However, pure $n$-partite entanglement cannot be distilled; consequently all entangled states in the simplex are $n$-partite bound entangled. We study also Bell inequalities and find the same geometry as for bipartite qubits. Moreover, we show how the (hidden) nonlocality for all $n$-partite bound entangled states can be revealed.

arXiv:0807.4842•Physical Review A•Oct 24, 2008•11 citations

Estimating the concurrence for quantum states via symmetric measurements

Hao-Fan Wang, Wen Zhou, Lin Chen +1 more

Concurrence is one of the most well-known entanglement measures. We show that, for arbitrary bipartite states, the lower bound of concurrence induced by symmetric measurements is always tighter than the one obtain from realignment. Besides, we derive an extended version of lower bound of concurrence induced by symmetric measurements, which can also be experimentally identified without state tomography, and further present a corresponding lower bound of genuine tripartite entanglement concurrence.

quant-pharXiv:2606.31010•Jul 1, 2026•0 citations
Quantum entanglement cannot be unlimitedly shared among an arbitrary number of qubits. The degree of bipartite entanglement decreases as the number of entangled pairs in an N-qubit system increases. We analyze a system of N qubits in which an arbitrary pair of particles is entangled. We show that the maximum degree of entanglement (measured in the concurrence) between any pair of qubits is 2/N.2/N.2/N. This tight bound can be achieved when the qubits are prepared in a pure symmetric (with respect to permutations) state with just one qubit in the basis state ∣0〉|0〉∣0〉 and the others in the basis state ∣1〉.|1〉.∣1〉.
We propose an alternative evaluation of quantum entanglement by measuring the maximum violation of the Bell’s inequality without information of the reduced density matrix of a system. This proposal is demonstrated by bridging the maximum violation of the Bell’s inequality and a concurrence of a pure state in an n-qubit system, in which one subsystem only contains one qubit and the state is a linear combination of two product states. We apply this relation to the ground states of four qubits in the Wen-Plaquette model and show that they are maximally entangled. A topological entanglement entropy of the Wen-Plaquette model could be obtained by relating the upper bound of the maximum violation of the Bell’s inequality to the generalized concurrence of a pure state with respect to different bipartitions.
We prove a set of tight entanglement inequalities for arbitrary N -qubit pure states. By focusing on all bi-partite marginal entanglements between each single qubit and its remaining partners, we show that the inequalities provide an upper bound for each marginal entanglement, while the known monogamy relation establishes the lower bound. The restrictions and sharing properties associated with the inequalities are further analyzed with a geometric polytope approach, and examples of three-qubit GHZ-class and W-class entangled states are presented to illustrate the results.
Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits, we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite system is associated with a point (vertex), while a bipartite entanglement between two specific qubits is represented by a connection (edge) between these points. We prove that any such entangled structure can be associated with a pure state of a multiqubit system. Moreover, we show that a pure state corresponding to a given entangled structure is a superposition of vectors from a subspace of the 2N{2}^{N}2N-dimensional Hilbert space, whose dimension grows linearly with the number of entangled pairs.
The entanglement content of superpositions of quantum states is investigated based on a measure called concurrence. Given a bipartite pure state in arbitrary dimension written as the quantum superposition of two other such states, we find simple inequalities relating the concurrence of the state to that of its components. We derive an exact expression for the concurrence when the component states are biorthogonal and provide elegant upper and lower bounds in all other cases. For quantum bits, our upper bound is tighter than the previously derived bound [N. Linden et al., Phys. Rev. Lett. 97, 100502 (2006)].
We construct a simplex for multipartite qubit states of even number nnn of qubits, which has the same geometry concerning separability, mixedness, kind of entanglement, amount of entanglement, and nonlocality as the bipartite qubit states. We derive the entanglement of the class of states which can be described by only three real parameters with the help of a multipartite measure for all discrete systems. We prove that the bounds on this measure are optimal for the whole class of states and that it reveals that the states possess only nnn-partite entanglement and not, e.g., bipartite entanglement. We then show that this nnn-partite entanglement can be increased by stochastic local operations and classical communication to the purest maximal entangled states. However, pure nnn-partite entanglement cannot be distilled; consequently all entangled states in the simplex are nnn-partite bound entangled. We study also Bell inequalities and find the same geometry as for bipartite qubits. Moreover, we show how the (hidden) nonlocality for all nnn-partite bound entangled states can be revealed.
Concurrence is one of the most well-known entanglement measures. We show that, for arbitrary bipartite states, the lower bound of concurrence induced by symmetric measurements is always tighter than the one obtain from realignment. Besides, we derive an extended version of lower bound of concurrence induced by symmetric measurements, which can also be experimentally identified without state tomography, and further present a corresponding lower bound of genuine tripartite entanglement concurrence.