dorsal/arxiv
View SchemaEntanglement-swapping measurements for deterministic entanglement distribution
| Authors | Mir Alimuddin, Jaemin Kim, Antonio Acín, Leonardo Zambrano |
|---|---|
| Categories | |
| ArXiv ID | 2601.08581vv1 |
| URL | https://arxiv.org/abs/2601.08581 |
| License | http://creativecommons.org/licenses/by/4.0/ |
Abstract
Entanglement swapping is a key primitive for distributing entanglement across nodes in quantum networks. In standard protocols, the outcome of the intermediate measurement determines the resulting state, making the process inherently probabilistic and requiring postselection. In this work, we fully characterize those measurements under which entanglement swapping becomes deterministic: for arbitrary pure inputs, every measurement outcome produces local-unitarily equivalent states. We also show that an optimal measurement, maximizing a concurrence-type entanglement measure, is built from complex Hadamard matrices. For this optimal protocol, we provide a complete, dimension-dependent classification of deterministic entanglement-swapping measurements: unique in dimensions $d=2,3$, infinite for $d=4$, and comprising $72$ inequivalent classes for $d=5$. We further consider a general network with multiple swapping nodes and show that, for $d=2,3$ the resulting end-to-end state is independent of the order in which the repeaters perform the optimal measurements. Our results establish optimal entanglement-swapping schemes that are post-selection free, in the sense that they distribute entanglement across generic quantum network architectures without unfavorable measurement outcomes.
{
"annotation_id": "dc33009d-9e45-44c7-ae1b-2dffc5741cbc",
"date_created": "2026-02-17T05:53:16.282000Z",
"date_modified": "2026-02-17T05:53:16.282000Z",
"file_hash": "3647b33b0fe0574cdc29d07725d67ea4d1a843176ea98548ebb6a7aa30a496a1",
"private": false,
"record": {
"abstract": "Entanglement swapping is a key primitive for distributing entanglement across nodes in quantum networks. In standard protocols, the outcome of the intermediate measurement determines the resulting state, making the process inherently probabilistic and requiring postselection. In this work, we fully characterize those measurements under which entanglement swapping becomes deterministic: for arbitrary pure inputs, every measurement outcome produces local-unitarily equivalent states. We also show that an optimal measurement, maximizing a concurrence-type entanglement measure, is built from complex Hadamard matrices. For this optimal protocol, we provide a complete, dimension-dependent classification of deterministic entanglement-swapping measurements: unique in dimensions $d=2,3$, infinite for $d=4$, and comprising $72$ inequivalent classes for $d=5$. We further consider a general network with multiple swapping nodes and show that, for $d=2,3$ the resulting end-to-end state is independent of the order in which the repeaters perform the optimal measurements. Our results establish optimal entanglement-swapping schemes that are post-selection free, in the sense that they distribute entanglement across generic quantum network architectures without unfavorable measurement outcomes.",
"arxiv_id": "2601.08581",
"authors": [
"Mir Alimuddin",
"Jaemin Kim",
"Antonio Ac\u00edn",
"Leonardo Zambrano"
],
"categories": [
"quant-ph"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "Entanglement-swapping measurements for deterministic entanglement distribution",
"url": "https://arxiv.org/abs/2601.08581",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "f10f1b0b-5ff7-4024-91a0-27efb6f29681",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}