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

IEEE International Symposium on Information Theory (ISIT)

Simple construction of quantum universal variable-length source coding

Masahito Hayashi, Koji Matsumoto

Published Jan 1, 2003• 6 citations
Publisher

Abstract

This paper describes the construction of a quantum universal variable-length source code in which, independent of information source, both of the average error and the probability that the coding rate is greater than the entropy rate H(/spl rho/~/sub p/), tend to 0. If H(/spl rho/~/sub p/) is estimated, and compress the coding rate to the admissible rate H(/spl rho/~/sub p/) with a probability close to 1. However, when we perform a naive measurement for the estimation of H(/spl rho/~/sub p/), the input state is demolished. By smearing the measurement, we successfully treat the trade-off between the estimation of H(/spl rho/~/sub p/) and the nondemolition of the input state. Our protocol can be used not only for the Schumacher's compression but also for the compression of entangled states.

DOI
10.1109/isit.2003.1228476

Related papers

Simple construction of quantum universal variable-length source coding

Masahito Hayashi, Koji Matsumoto

We simply construct a quantum universal variable-length source code in which, independent of information source, both of the average error and the probability that the coding rate is greater than the entropy rate H(\overline{\rho}_p), tend to 0. If H(\overline{\rho}_p) is estimated, we can compress the coding rate to the admissible rate H(\overline{\rho}_p) with a probability close to 1. However, when we perform a naive measurement for the estimation of H(\overline{\rho}_p), the input state is demolished. By smearing the measurement, we successfully treat the trade-off between the estimation of H(\overline{\rho}_p) and the non-demolition of the input state. Our protocol can be used not only for the Schumacher's scheme but also for the compression of entangled states.

arXiv:quant-ph/0209124•Quantum Information and Computation•Nov 1, 2002•31 citations

Quantum universal variable-length source coding

Masahito Hayashi, Keiji Matsumoto

We construct an optimal quantum universal variable-length code that achieves the admissible minimum rate, i.e., our code is used for any probability distribution of quantum states. Its probability of exceeding the admissible minimum rate exponentially goes to 0. Our code is optimal in the sense of its exponent. In addition, its average error asymptotically tends to 0.

arXiv:quant-ph/0202001•Physical Review A•Aug 26, 2002•94 citations

Lossless quantum prefix compression for communication channels that are always open

Markus P. Müller, Caroline Rogers, Rajagopal Nagarajan

We describe a method for lossless quantum compression if the output of the information source is not known. We compute the best possible compression rate, minimizing the expected base length of the output quantum bit string (the base length of a quantum string is the maximal length in the superposition). This complements work by Schumacher and Westmoreland who calculated the corresponding rate for minimizing the output's average length. Our compressed code words are prefix-free indeterminate-length quantum bit strings which can be concatenated in the case of multiple sources. Therefore, we generalize the known theory of prefix-free quantum codes to the case where strings have indeterminate length. Moreover, we describe a communication model which allows the lossless transmission of the compressed code words. The benefit of compression is then the reduction of transmission errors in the presence of noise.

arXiv:0808.2003•Physical Review A•Jan 6, 2009•7 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•3 citations

On Lossless Quantum Data Compression and Quantum Variable–Length Codes

Rudolf Ahlswede, Ning Cai

This chapter contains sections titled: Introduction Codes, Lengths, Kraft Inequality and von Neumann Entropy Bound The Codes Length Observable and Average Length of Codewords Kraft Inequality and von Neumann Entropy Bound Base Length Construct Long Codes from Variable-length Codes Lossless Quantum Data Compression, if the Decoder is Informed about the Base Lengths Code Analysis Based on the Base Length Lossless Quantum Data Compression with a Classical Helper Lossless Quantum Data Compression for Mixed State Sources A Result on Tradeoff between Quantum and Classical Resources in Lossy Quantum Data Compression References

Quantum Information Processing•Feb 21, 2003•2 citations

On Lossless Quantum Data Compression and Quantum Variable‐Length Codes

Rudolf Ahlswede, Ning Cai

This chapter contains sections titled: Introduction Codes, Lengths, Kraft Inequality and von Neumann Entropy Bound The Codes Length Observable and Average Length of Codewords Kraft Inequality and von Neumann Entropy Bound Base Length Construct Long Codes from Variable-length Codes Lossless Quantum Data Compression, if the Decoder is Informed about the Base Lengths Code Analysis Based on the Base Length Lossless Quantum Data Compression with a Classical Helper Lossless Quantum Data Compression for Mixed State Sources A Result on Tradeoff between Quantum and Classical Resources in Lossy Quantum Data Compression References

Quantum Information Processing•Feb 17, 2005•0 citations
This paper describes the construction of a quantum universal variable-length source code in which, independent of information source, both of the average error and the probability that the coding rate is greater than the entropy rate H(/spl rho//sub p/), tend to 0. If H(/spl rho//sub p/) is estimated, and compress the coding rate to the admissible rate H(/spl rho//sub p/) with a probability close to 1. However, when we perform a naive measurement for the estimation of H(/spl rho//sub p/), the input state is demolished. By smearing the measurement, we successfully treat the trade-off between the estimation of H(/spl rho/~/sub p/) and the nondemolition of the input state. Our protocol can be used not only for the Schumacher's compression but also for the compression of entangled states.
We simply construct a quantum universal variable-length source code in which, independent of information source, both of the average error and the probability that the coding rate is greater than the entropy rate H(\overline{\rho}_p), tend to 0. If H(\overline{\rho}_p) is estimated, we can compress the coding rate to the admissible rate H(\overline{\rho}_p) with a probability close to 1. However, when we perform a naive measurement for the estimation of H(\overline{\rho}_p), the input state is demolished. By smearing the measurement, we successfully treat the trade-off between the estimation of H(\overline{\rho}_p) and the non-demolition of the input state. Our protocol can be used not only for the Schumacher's scheme but also for the compression of entangled states.
We describe a method for lossless quantum compression if the output of the information source is not known. We compute the best possible compression rate, minimizing the expected base length of the output quantum bit string (the base length of a quantum string is the maximal length in the superposition). This complements work by Schumacher and Westmoreland who calculated the corresponding rate for minimizing the output's average length. Our compressed code words are prefix-free indeterminate-length quantum bit strings which can be concatenated in the case of multiple sources. Therefore, we generalize the known theory of prefix-free quantum codes to the case where strings have indeterminate length. Moreover, we describe a communication model which allows the lossless transmission of the compressed code words. The benefit of compression is then the reduction of transmission errors in the presence of noise.
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].
This chapter contains sections titled: Introduction Codes, Lengths, Kraft Inequality and von Neumann Entropy Bound The Codes Length Observable and Average Length of Codewords Kraft Inequality and von Neumann Entropy Bound Base Length Construct Long Codes from Variable-length Codes Lossless Quantum Data Compression, if the Decoder is Informed about the Base Lengths Code Analysis Based on the Base Length Lossless Quantum Data Compression with a Classical Helper Lossless Quantum Data Compression for Mixed State Sources A Result on Tradeoff between Quantum and Classical Resources in Lossy Quantum Data Compression References
This chapter contains sections titled: Introduction Codes, Lengths, Kraft Inequality and von Neumann Entropy Bound The Codes Length Observable and Average Length of Codewords Kraft Inequality and von Neumann Entropy Bound Base Length Construct Long Codes from Variable-length Codes Lossless Quantum Data Compression, if the Decoder is Informed about the Base Lengths Code Analysis Based on the Base Length Lossless Quantum Data Compression with a Classical Helper Lossless Quantum Data Compression for Mixed State Sources A Result on Tradeoff between Quantum and Classical Resources in Lossy Quantum Data Compression References