Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0508170

Lossless Quantum Compression

Caroline Rogers, Rajagopal Nagarajan

Published Aug 23, 2005• 1 citation
arXivHTMLPDF

Abstract

We describe lossless quantum compression of unknown mixtures (of non-orthogonal states) and give an expression of the optimal rate of compression.
DOI
10.48550/arxiv.quant-ph/0508170

Related papers

On quantum coding for ensembles of mixed states

Howard Barnum, Carlton M. Caves, Christopher A. Fuchs +2 more

We consider the problem of optimal asymptotically faithful compression for ensembles of mixed quantum states. Although the optimal rate is unknown, we prove upper and lower bounds and describe a series of illustrative examples of compression of mixed states. We also discuss a classical analogue of the problem. 1

•Aug 4, 2000•41 citations

Lossless Quantum Data Compression and Secure Direct Communication- New concepts and methods for quantum information theory

Kim Joris Boström

•Nov 5, 2007•0 citations

On quantum coding for ensembles of mixed states

Howard Barnum, Carlton M. Caves, Christopher A. Fuchs +2 more

We consider the problem of optimal asymptotically faithful compression for ensembles of mixed quantum states. Although the optimal rate is unknown, we prove upper and lower bounds and describe a series of illustrative examples of compression of mixed states. We also discuss a classical analogue of the problem.

arXiv:quant-ph/0008024•Journal of Physics A Mathematical and General•Aug 24, 2001•38 citations

Universal Approximation of Multi-copy States and Universal Quantum Lossless Data Compression

Masahito Hayashi

arXiv:0806.1091•Communications in Mathematical Physics•Aug 31, 2009•21 citations

Adaptive Quantum Lossless Compression

Essam Al-Daoud

Journal of Applied Sciences•Nov 1, 2007•2 citations

Quantum Compression for Distributed Entanglement

Jan Østergaard, Shashi Raj Pandey, Christophe Biscio +2 more

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.

quant-pharXiv:2605.04271•May 7, 2026•0 citations
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.