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/0008024 · Journal of Physics A Mathematical and General

On quantum coding for ensembles of mixed states

Howard Barnum, Carlton M. Caves, Christopher A. Fuchs, Richard Jozsa, Benjamin Schumacher

Published Aug 24, 2001• 38 citations
arXivHTMLPDF

Abstract

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.
DOI
10.1088/0305-4470/34/35/304

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

Limits for compression of quantum information carried by ensembles of mixed states

Michał Horodecki

We consider the problem of compression of the quantum information carried by ensemble of mixed states. We prove that for arbitrary coding schemes the least number of quantum bits (qubits) per message needed to convey the signal states asymptotically faithfully is bounded from below by the Holevo function $S(\ensuremath{\varrho})\ensuremath{-}{\ensuremath{\sum}}_{i}{p}_{i}S({\ensuremath{\varrho}}_{i})$. We also show that a compression protocol can be composed with another one, provided that the latter offers perfect transmission. Such a compound protocol is applied to the case of binary source. It is conjectured to reach the obtained bound. Finally, we point out that in the case of mixed signal states there could be a difference between the maximal compression rates at the coding schemes that are ``blind'' to the signal and the ones that assume the knowledge about the identities of the signal states.

arXiv:quant-ph/9712035•Physical Review A•May 1, 1998•66 citations

Compressibility of Quantum Mixed-State Signals

Masato Koashi, Nobuyuki Imoto

We present a formula that determines the optimal number of qubits per message that allows asymptotically faithful compression of the quantum information carried by an ensemble of mixed states. The set of mixed states determines a decomposition of the Hilbert space into the redundant part and the irreducible part. After removing the redundancy, the optimal compression rate is shown to be given by the von Neumann entropy of the reduced ensemble.

arXiv:quant-ph/0103128•Physical Review Letters•Jun 19, 2001•35 citations

General Mixed State Quantum Data Compression with and without Entanglement Assistance

Zahra Baghali Khanian, Andreas Winter

We consider the most general (finite-dimensional) quantum mechanical information source, which is given by a quantum system A that is correlated with a reference system R. The task is to compress A in such a way as to reproduce the joint source state ρARat the decoder with asymptotically high fidelity. This includes Schumacher's original quantum source coding problem of a pure state ensemble and that of a single pure entangled state, as well as general mixed state ensembles. Here, we determine the optimal compression rate (in qubits per source system) in terms of the Koashi-Imoto decomposition of the source into a classical, a quantum, and a redundant part. The same decomposition yields the optimal rate in the presence of unlimited entanglement between compressor and decoder, and indeed the full region of feasible qubitebit rate pairs. Full version at arXiv:1912.08506 [1].

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2020•4 citations

General Mixed-State Quantum Data Compression With and Without Entanglement Assistance

Zahra Baghali Khanian, Andreas Winter

We consider the most general finite-dimensional quantum mechanical information source, which is given by a quantum system$A$that is correlated with a reference system$R$. The task is to compress$A$in such a way as to reproduce the joint source state$\rho ^{AR}$at the decoder with asymptotically high fidelity. This includes Schumacher’s original quantum source coding problem of a pure state ensemble and that of a single pure entangled state, as well as general mixed state ensembles. Here, we determine the optimal compression rate (in qubits per source system) in terms of the Koashi-Imoto decomposition of the source into a classical, a quantum, and a redundant part. The same decomposition yields the optimal rate in the presence of unlimited entanglement between compressor and decoder, and indeed the full region of feasible qubit-ebit rate pairs.

arXiv:1912.08506•IEEE Transactions on Information Theory•Jan 18, 2022•17 citations

Compression of sources of probability distributions and density operators

Andreas Winter

We study the problem of efficient compression of a stochastic source of probability distributions. It can be viewed as a generalization of Shannon's source coding problem. It has relation to the theory of common randomness, as well as to channel coding and rate--distortion theory: in the first two subjects ``inverses'' to established coding theorems can be derived, yielding a new approach to proving converse theorems, in the third we find a new proof of Shannon's rate--distortion theorem. After reviewing the known lower bound for the optimal compression rate, we present a number of approaches to achieve it by code constructions. Our main results are: a better understanding of the known lower bounds on the compression rate by means of a strong version of this statement, a review of a construction achieving the lower bound by using common randomness which we complement by showing the optimal use of the latter within a class of protocols. Then we review another approach, not dependent on common randomness, to minimizing the compression rate, providing some insight into its combinatorial structure, and suggesting an algorithm to optimize it. The second part of the paper is concerned with the generalization of the problem to quantum information theory: the compression of mixed quantum states. Here, after reviewing the known lower bound we contribute a strong version of it, and discuss the relation of the problem to other issues in quantum information theory.

arXiv:quant-ph/0208131•Aug 21, 2002•62 citations
We consider the problem of compression of the quantum information carried by ensemble of mixed states. We prove that for arbitrary coding schemes the least number of quantum bits (qubits) per message needed to convey the signal states asymptotically faithfully is bounded from below by the Holevo function $S(\ensuremath{\varrho})\ensuremath{-}{\ensuremath{\sum}}_{i}{p}_{i}S({\ensuremath{\varrho}}_{i})$. We also show that a compression protocol can be composed with another one, provided that the latter offers perfect transmission. Such a compound protocol is applied to the case of binary source. It is conjectured to reach the obtained bound. Finally, we point out that in the case of mixed signal states there could be a difference between the maximal compression rates at the coding schemes that are ``blind'' to the signal and the ones that assume the knowledge about the identities of the signal states.
We consider the most general (finite-dimensional) quantum mechanical information source, which is given by a quantum system A that is correlated with a reference system R. The task is to compress A in such a way as to reproduce the joint source state ρARat the decoder with asymptotically high fidelity. This includes Schumacher's original quantum source coding problem of a pure state ensemble and that of a single pure entangled state, as well as general mixed state ensembles. Here, we determine the optimal compression rate (in qubits per source system) in terms of the Koashi-Imoto decomposition of the source into a classical, a quantum, and a redundant part. The same decomposition yields the optimal rate in the presence of unlimited entanglement between compressor and decoder, and indeed the full region of feasible qubitebit rate pairs. Full version at arXiv:1912.08506 [1].
We consider the most general finite-dimensional quantum mechanical information source, which is given by a quantum systemAAAthat is correlated with a reference systemRRR. The task is to compressAAAin such a way as to reproduce the joint source stateρAR\rho ^{AR}ρARat the decoder with asymptotically high fidelity. This includes Schumacher’s original quantum source coding problem of a pure state ensemble and that of a single pure entangled state, as well as general mixed state ensembles. Here, we determine the optimal compression rate (in qubits per source system) in terms of the Koashi-Imoto decomposition of the source into a classical, a quantum, and a redundant part. The same decomposition yields the optimal rate in the presence of unlimited entanglement between compressor and decoder, and indeed the full region of feasible qubit-ebit rate pairs.
We study the problem of efficient compression of a stochastic source of probability distributions. It can be viewed as a generalization of Shannon's source coding problem. It has relation to the theory of common randomness, as well as to channel coding and rate--distortion theory: in the first two subjects ``inverses'' to established coding theorems can be derived, yielding a new approach to proving converse theorems, in the third we find a new proof of Shannon's rate--distortion theorem. After reviewing the known lower bound for the optimal compression rate, we present a number of approaches to achieve it by code constructions. Our main results are: a better understanding of the known lower bounds on the compression rate by means of a strong version of this statement, a review of a construction achieving the lower bound by using common randomness which we complement by showing the optimal use of the latter within a class of protocols. Then we review another approach, not dependent on common randomness, to minimizing the compression rate, providing some insight into its combinatorial structure, and suggesting an algorithm to optimize it. The second part of the paper is concerned with the generalization of the problem to quantum information theory: the compression of mixed quantum states. Here, after reviewing the known lower bound we contribute a strong version of it, and discuss the relation of the problem to other issues in quantum information theory.