dorsal/arxiv
View SchemaQuantum Networks for Concentrating Entanglement
| Authors | Phillip Kaye, Michele Mosca |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0101009 |
| URL | https://arxiv.org/abs/quant-ph/0101009 |
| DOI | 10.1088/0305-4470/34/35/319 |
Abstract
If two parties, Alice and Bob, share some number, n, of partially entangled pairs of qubits, then it is possible for them to concentrate these pairs into some smaller number of maximally entangled states. We present a simplified version of the algorithm for such entanglement concentration, and we describe efficient networks for implementing these operations.
{
"annotation_id": "da029f6b-1022-4236-b66b-66dbe49381ea",
"date_created": "2026-03-02T18:01:42.430000Z",
"date_modified": "2026-03-02T18:01:42.430000Z",
"file_hash": "6d51b39b6394110e11e14a6be05508d93e0bb8f6472856e0fe5f7bcf6c5ded90",
"private": false,
"record": {
"abstract": "If two parties, Alice and Bob, share some number, n, of partially entangled\npairs of qubits, then it is possible for them to concentrate these pairs into\nsome smaller number of maximally entangled states. We present a simplified\nversion of the algorithm for such entanglement concentration, and we describe\nefficient networks for implementing these operations.",
"arxiv_id": "quant-ph/0101009",
"authors": [
"Phillip Kaye",
"Michele Mosca"
],
"categories": [
"quant-ph"
],
"doi": "10.1088/0305-4470/34/35/319",
"title": "Quantum Networks for Concentrating Entanglement",
"url": "https://arxiv.org/abs/quant-ph/0101009"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "a095d828-e531-4e7e-9c9c-97aa9d0dc7ac",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}