|
| related topics |
| {qubit, qubits, gate} |
| {state, states, entangled} |
| {entanglement, phys, rev} |
| {let, theorem, proof} |
| {equation, function, exp} |
| {bell, inequality, local} |
| {classical, space, random} |
|
Controlling bi-partite entanglement in multi-qubit systems
Martin Plesch, Jaroslav Novotny, Zuzana Dzurakova, Vladimir Buzek
abstract: Bi-partite entanglement in multi-qubit systems cannot be shared freely. The
rules of quantum mechanics impose bounds on how multi-qubit systems can be
correlated. In this paper we utilize a concept of entangled graphs with
weighted edges in order to analyze pure quantum states of multi-qubit systems.
Here qubits are represented by vertexes of the graph while the presence of
bi-partite entanglement is represented by an edge between corresponding
vertexes. The weight of each edge is defined to be the entanglement between the
two qubits connected by the edge, as measured by the concurrence. We prove that
each entangled graph with entanglement bounded by a specific value of the
concurrence can be represented by a pure multi-qubit state. In addition we
present a logic network with O(N2) elementary gates that can be used for
preparation of the weighted entangled graphs of N qubits.
- oai_identifier:
- oai:arXiv.org:quant-ph/0311069
- categories:
- quant-ph
- comments:
- 20 pages, 3 figures, accepted in J. Phys. A
- doi:
- 10.1088/0305-4470/37/5/025
- arxiv_id:
- quant-ph/0311069
- journal_ref:
- J. Phys. A: Math. Gen. 37 (2004), 1843-1859
- created:
- 2003-11-11
Full article ▸
|
|
| related documents |
| 0304054v2 |
| 0410001v3 |
| 9908074v5 |
| 0012067v1 |
| 9903101v2 |
| 0305038v2 |
| 9805070v1 |
| 9909082v1 |
| 0506062v2 |
| 0408081v5 |
| 0511041v1 |
| 0610105v1 |
| 0504197v1 |
| 0411058v1 |
| 0505122v2 |
| 0512058v3 |
| 0405157v2 |
| 0407095v1 |
| 0702212v1 |
| 0610214v3 |
| 0601183v1 |
| 0510161v1 |
| 0505009v4 |
| 0312083v1 |
| 0506006v1 |
|