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/0202002 · Physical Review A

Exponents of quantum fixed-length pure-state source coding

Masahito Hayashi

Published Sep 27, 2002• 52 citations
arXivHTMLPDF

Abstract

We derive the optimal exponent of the error probability of the quantum fixed-length pure-state source coding in both cases of blind coding and visible coding. The optimal exponent is universally attained by Jozsa et al.'s [Phys. Rev. Lett. 81, 1714 (1998)] universal code. In the direct part, a group representation theoretical type method is essential. In the converse part, Nielsen and Kempe's [Phys. Rev. Lett. 86, 5184 (2001)] lemma is essential.

DOI
10.1103/physreva.66.032321

Related papers

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

Duality Between Source Coding With Quantum Side Information and Classical-Quantum Channel Coding

Hao–Chung Cheng, Eric P. Hanson, Nilanjana Datta +1 more

In this paper, we establish an interesting duality between two different quantum information-processing tasks, namely, classical source coding with quantum side information, and channel coding over classical-quantum channels. The duality relates the optimal error exponents of these two tasks, generalizing the classical results of Ahlswede and Dueck [IEEE Trans. Inf. Theory, 28(3):430–443, 1982]. We establish duality both at the operational level and at the level of the entropic quantities characterizing these exponents. For the latter, the duality is given by an exact relation, whereas for the former, duality manifests itself in the following sense: an optimal coding strategy for one task can be used to construct an optimal coding strategy for the other task. Along the way, we derive a bound on the error exponent for classical-quantum channel coding with constant composition codes which might be of independent interest. Finally, we consider the task of variable-length classical compression with quantum side information, and a duality relation between this task and classical-quantum channel coding can also be established correspondingly. Furthermore, we study the strong converse of this task, and show that the strong converse property does not hold even in the i.i.d. scenario.

IEEE Transactions on Information Theory•Jun 13, 2022•10 citations

Exponential strong converse for blind quantum data compression

Kohdai Kuroiwa

We establish exponential strong converse theorems for blind quantum data compression of finite-dimensional mixed-state sources, with and without entanglement assistance. Blind compression is a fundamental quantum information processing task in which the sender aims to transmit quantum states without direct access to the classical label. Strong converse is a notable aspect of data compression: the accuracy of the compression abruptly drops down to zero once the compression rate goes below a threshold. Strong converses for data compression have been established for pure-state sources; however, for mixed-state sources, the optimal compression rate is determined by a structural decomposition of quantum states and can change substantially under small perturbations. This sensitivity makes it difficult to quantitatively analyze the trade-off between compression rate and error. Despite recent progress, whether a strong converse holds at the optimal rate has remained unresolved in general. In this work, we resolve this question affirmatively. For unassisted compression, we show that at every rate below the optimum, the accuracy decays exponentially with the block length for general mixed-state sources without restrictions on protocols. We also prove exponential strong converse for blind compression with unlimited entanglement assistance at its optimal rate. Combining the two strong converse bounds yields exponential decay at every compression-entanglement rate pair outside the complete achievable rate region. Our proof introduces a new overlap quantity based on the structure of quantum states; this quantity connects preservation of the source information to the dimension of the transmitted system. We expect that this approach provides useful tools for converse analyses of other quantum information-processing tasks involving mixed states.

quant-pharXiv:2609.38328•Oct 1, 2026•0 citations

Quantum universal coding protocols and universal approximation of multi-copy states

Masahito Hayashi

We have constructed universal codes for quantum lossless source coding and classical-quantum channel coding. In this construction, we essentially employ group representation theory. In order to treat quantum lossless source coding, universal approximation of multi-copy states is discussed in terms of the quantum relative entropy.

Journal of Physics Conference Series•Jan 7, 2009•1 citation

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

Construction of Universal Codes Using LDPC Matrices and Their Error Exponents

S. MIYAKE, M. MARUYAMA

A universal coding scheme for information from i.i.d., arbitrarily varying sources, or memoryless correlated sources is constructed using LDPC matrices and shown to have an exponential upper bound of decoding error probability. As a corollary, we construct a universal code for the noisy channel model, which is not necessarily BSC. Simulation results show universality of the code with sum-product decoding, and presence of a gap between the error exponent obtained by simulation and that obtained theoretically.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Sep 1, 2007•6 citations
We derive the optimal exponent of the error probability of the quantum fixed-length pure-state source coding in both cases of blind coding and visible coding. The optimal exponent is universally attained by Jozsa et al.'s [Phys. Rev. Lett. 81, 1714 (1998)] universal code. In the direct part, a group representation theoretical type method is essential. In the converse part, Nielsen and Kempe's [Phys. Rev. Lett. 86, 5184 (2001)] lemma is essential.
In this paper, we establish an interesting duality between two different quantum information-processing tasks, namely, classical source coding with quantum side information, and channel coding over classical-quantum channels. The duality relates the optimal error exponents of these two tasks, generalizing the classical results of Ahlswede and Dueck [IEEE Trans. Inf. Theory, 28(3):430–443, 1982]. We establish duality both at the operational level and at the level of the entropic quantities characterizing these exponents. For the latter, the duality is given by an exact relation, whereas for the former, duality manifests itself in the following sense: an optimal coding strategy for one task can be used to construct an optimal coding strategy for the other task. Along the way, we derive a bound on the error exponent for classical-quantum channel coding with constant composition codes which might be of independent interest. Finally, we consider the task of variable-length classical compression with quantum side information, and a duality relation between this task and classical-quantum channel coding can also be established correspondingly. Furthermore, we study the strong converse of this task, and show that the strong converse property does not hold even in the i.i.d. scenario.
We establish exponential strong converse theorems for blind quantum data compression of finite-dimensional mixed-state sources, with and without entanglement assistance. Blind compression is a fundamental quantum information processing task in which the sender aims to transmit quantum states without direct access to the classical label. Strong converse is a notable aspect of data compression: the accuracy of the compression abruptly drops down to zero once the compression rate goes below a threshold. Strong converses for data compression have been established for pure-state sources; however, for mixed-state sources, the optimal compression rate is determined by a structural decomposition of quantum states and can change substantially under small perturbations. This sensitivity makes it difficult to quantitatively analyze the trade-off between compression rate and error. Despite recent progress, whether a strong converse holds at the optimal rate has remained unresolved in general. In this work, we resolve this question affirmatively. For unassisted compression, we show that at every rate below the optimum, the accuracy decays exponentially with the block length for general mixed-state sources without restrictions on protocols. We also prove exponential strong converse for blind compression with unlimited entanglement assistance at its optimal rate. Combining the two strong converse bounds yields exponential decay at every compression-entanglement rate pair outside the complete achievable rate region. Our proof introduces a new overlap quantity based on the structure of quantum states; this quantity connects preservation of the source information to the dimension of the transmitted system. We expect that this approach provides useful tools for converse analyses of other quantum information-processing tasks involving mixed 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.
A universal coding scheme for information from i.i.d., arbitrarily varying sources, or memoryless correlated sources is constructed using LDPC matrices and shown to have an exponential upper bound of decoding error probability. As a corollary, we construct a universal code for the noisy channel model, which is not necessarily BSC. Simulation results show universality of the code with sum-product decoding, and presence of a gap between the error exponent obtained by simulation and that obtained theoretically.