Quantum Compression for Distributed Entanglement
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910194098765824 |
|---|---|
| author | Østergaard, Jan Pandey, Shashi Raj Biscio, Christophe Pedersen, Torben Bach Popovski, Petar |
| author_facet | Østergaard, Jan Pandey, Shashi Raj Biscio, Christophe Pedersen, Torben Bach Popovski, Petar |
| contents | We study compression strategies for multipartite entanglement distribution under uncertainty in the partitioning of the quantum state. When the partition is not known at the time of state preparation, we show that a joint design of the resource state and a family of compression schemes can increase the entanglement across partitions under a fixed transmission budget. We formulate this as a source coding problem and derive non-asymptotic upper and lower bounds on the achievable average entanglement subject to an average coding rate. We furthermore design an efficient method for jointly optimizing states and lossless compression maps by exploiting the inherent symmetry of weighted Dicke states. In the bipartite case, we propose practical constructions that closely approach the derived upper bound, and more generally we provide practical constructions for multipartite settings. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_04271 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Quantum Compression for Distributed Entanglement Østergaard, Jan Pandey, Shashi Raj Biscio, Christophe Pedersen, Torben Bach Popovski, Petar Quantum Physics Information Theory We study compression strategies for multipartite entanglement distribution under uncertainty in the partitioning of the quantum state. When the partition is not known at the time of state preparation, we show that a joint design of the resource state and a family of compression schemes can increase the entanglement across partitions under a fixed transmission budget. We formulate this as a source coding problem and derive non-asymptotic upper and lower bounds on the achievable average entanglement subject to an average coding rate. We furthermore design an efficient method for jointly optimizing states and lossless compression maps by exploiting the inherent symmetry of weighted Dicke states. In the bipartite case, we propose practical constructions that closely approach the derived upper bound, and more generally we provide practical constructions for multipartite settings. |
| title | Quantum Compression for Distributed Entanglement |
| topic | Quantum Physics Information Theory |
| url | https://arxiv.org/abs/2605.04271 |