|
| related topics |
| {entanglement, phys, rev} |
| {state, states, entangled} |
| {alice, bob, state} |
| {states, state, optimal} |
| {information, entropy, channel} |
| {let, theorem, proof} |
| {field, particle, equation} |
| {error, code, errors} |
| {temperature, thermal, energy} |
| {qubit, qubits, gate} |
|
Entanglement sharing among qudits
Kenneth A. Dennison, William K. Wootters
abstract: Consider a system consisting of n d-dimensional quantum particles (qudits),
and suppose that we want to optimize the entanglement between each pair. One
can ask the following basic question regarding the sharing of entanglement:
what is the largest possible value Emax(n,d) of the minimum entanglement
between any two particles in the system? (Here we take the entanglement of
formation as our measure of entanglement.) For n=3 and d=2, that is, for a
system of three qubits, the answer is known: Emax(3,2) = 0.550. In this paper
we consider first a system of d qudits and show that Emax(d,d) is greater than
or equal to 1. We then consider a system of three particles, with three
different values of d. Our results for the three-particle case suggest that as
the dimension d increases, the particles can share a greater fraction of their
entanglement capacity.
- oai_identifier:
- oai:arXiv.org:quant-ph/0106058
- categories:
- quant-ph
- comments:
- 4 pages; v2 contains a new result for 3 qudits with d=7
- arxiv_id:
- quant-ph/0106058
- created:
- 2001-06-10
- updated:
- 2001-08-28
Full article ▸
|
|
| related documents |
| 0108021v1 |
| 9811018v3 |
| 0309037v1 |
| 0610176v1 |
| 0612210v3 |
| 0307215v1 |
| 0509056v2 |
| 0011111v1 |
| 0208041v1 |
| 9908065v2 |
| 0305080v1 |
| 0507148v1 |
| 0202108v1 |
| 0310027v1 |
| 0602067v3 |
| 0204140v2 |
| 0112012v1 |
| 0604099v1 |
| 0610188v1 |
| 0611285v1 |
| 0203141v3 |
| 0110139v1 |
| 0703019v1 |
| 0207154v1 |
| 0109024v2 |
|