Quantum Compression for Distributed Entanglement
Summarize this article with:
Quantum Physics arXiv:2605.04271 (quant-ph) [Submitted on 5 May 2026] Title:Quantum Compression for Distributed Entanglement Authors:Jan Østergaard, Shashi Raj Pandey, Christophe Biscio, Torben Bach Pedersen, Petar Popovski View a PDF of the paper titled Quantum Compression for Distributed Entanglement, by Jan {\O}stergaard and 4 other authors View PDF HTML (experimental) Abstract: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. Comments: Subjects: Quantum Physics (quant-ph); Information Theory (cs.IT) Cite as: arXiv:2605.04271 [quant-ph] (or arXiv:2605.04271v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2605.04271 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Jan Ostergaard [view email] [v1] Tue, 5 May 2026 20:06:25 UTC (515 KB) Full-text links: Access Paper: View a PDF of the paper titled Quantum Compression for Distributed Entanglement, by Jan {\O}stergaard and 4 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-05 Change to browse by: cs cs.IT math math.IT References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)