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• 2 citations
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

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

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

Masahito Hayashi

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

Adaptive Quantum Lossless Compression

Essam Al-Daoud

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

LOSSLESS QUANTUM DATA COMPRESSION AND QUANTUM KOLMOGOROV COMPLEXITY

Caroline Rogers, Rajagopal Nagarajan

We show that the optimal rate of lossless quantum data compression is closely related to Berthiaume, van Dam and Laplante's quantum Kolmogorov complexity. We show that: • The expected quantum Kolmogorov complexity of a mixture is close to the optimal rate of lossless data compression of that mixture. • If quantum Kolmogorov complexity obeys some inequality, then so does the optimal rate of lossless quantum data compression.

International Journal of Quantum Information•Mar 1, 2011•2 citations

Efficient quantum compression for identically prepared states with arbitrary dimensio

Zeyu Chen, Chunhe Xiong, Kamil Ravilevich Khadiev +1 more

Identical preparation creates permutation symmetry that can be used for lossless quantum compression. For $n$ copies of an unknown $d$-dimensional pure state, the tensor-power input lies in the fully symmetric subspace, whose dimension is polynomial in $n$ for fixed local dimension. Schur--Weyl duality isolates this subspace coherently, allowing the fixed representation labels to be discarded while retaining all information needed for recovery. The resulting encoder and decoder are exact on the input family. Because tensor-power states span the symmetric subspace, the achieved memory dimension is also necessary for reversible coherent compression, so the scheme is space-optimal. The encoder is implemented recursively with Clebsch--Gordan transforms, and only the branches reached by symmetric inputs need to be reproduced. Standard efficient synthesis of these transforms yields polynomial-size circuits for fixed local dimension and arbitrary target accuracy. Thus identically prepared pure states in arbitrary dimension admit lossless, space-optimal compression with an efficient circuit implementation.

arXiv:2307.12024•Jul 22, 2023•0 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•IEEE Journal on Selected Areas in Information Theory•May 7, 2026•0 citations
Identical preparation creates permutation symmetry that can be used for lossless quantum compression. For nnn copies of an unknown ddd-dimensional pure state, the tensor-power input lies in the fully symmetric subspace, whose dimension is polynomial in nnn for fixed local dimension. Schur--Weyl duality isolates this subspace coherently, allowing the fixed representation labels to be discarded while retaining all information needed for recovery. The resulting encoder and decoder are exact on the input family. Because tensor-power states span the symmetric subspace, the achieved memory dimension is also necessary for reversible coherent compression, so the scheme is space-optimal. The encoder is implemented recursively with Clebsch--Gordan transforms, and only the branches reached by symmetric inputs need to be reproduced. Standard efficient synthesis of these transforms yields polynomial-size circuits for fixed local dimension and arbitrary target accuracy. Thus identically prepared pure states in arbitrary dimension admit lossless, space-optimal compression with an efficient circuit implementation.
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.