arXiv Analytics

Sign in

arXiv:quant-ph/0007086AbstractReferencesReviewsResources

Entangled webs: Tight bound for symmetric sharing of entanglement

Masato Koashi, Vladimir Buzek, Nobuyuki Imoto

Published 2000-07-24Version 1

Quantum entanglement cannot be unlimitedly shared among arbitrary number of qubits. Larger the number of entangled pairs in an N-qubit system, smaller the degree of bi-partite entanglement is. 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>.

Related articles: Most relevant | Search more
arXiv:1009.4741 [quant-ph] (Published 2010-09-24, updated 2011-04-26)
Tight bounds for classical and quantum coin flipping
arXiv:quant-ph/0205138 (Published 2002-05-22)
A Tight Bound for Probability of Error for Quantum Counting Based Multiuser Detection
arXiv:1504.05306 [quant-ph] (Published 2015-04-21)
Tight Bound on Randomness for Violating the CHSH Inequality