Pith. sign in

REVIEW

Entangled webs: Tight bound for symmetric sharing of entanglement

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0007086 v1 pith:CYS4PKYF submitted 2000-07-24 quant-ph

classification quant-ph
keywords entanglementqubitsentangledstatearbitrarybasisbounddegree
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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>.

Discussion (0). Sign in to comment.

Pith tools