scispace - formally typeset
Open AccessProceedings ArticleDOI

A general formula for the classical capacity of a general quantum channel

Masahito Hayashi, +1 more
- pp 71
Reads0
Chats0
TLDR
A general formula of the channel capacity for any (classical-) quantum channel is derived and can be regarded as a quantum version of Verdu and Han's result.
Abstract
We derive a general formula of the channel capacity for any (classical-) quantum channel. It can be regarded as a quantum version of Verdu and Han's result (see IEEE Trans. Inform. Theory, vol.40, p.1147-57, 1994). Our results contain Holevo's (see IEEE Trans. Inform. Theory, vol.44, p.269-73, 1998) and Schumacher and Westmoreland's (see Phys. Rev. A, vol.56, p.131-8, 1997) results as the stationary and memoryless case.

read more

Citations
More filters
Journal ArticleDOI

Optimal sequence of quantum measurements in the sense of Stein's lemma in quantum hypothesis testing

TL;DR: In this article, a necessary and sufficient condition for a sequence of quantum measurements to achieve the optimal performance in quantum hypothesis testing is derived, and a projection measurement characterized by the irreducible representation theory of the special linear group SL is proposed.
Journal ArticleDOI

On error exponents in quantum hypothesis testing

TL;DR: In this article, the error probabilities of two density operators were derived based on a key operator inequality between a density operator and a conditional expectation of it. And the upper bounds on the error exponents were shown to lead to a noncommutative analog of the Hoeffding bound for the quantum Stein's lemma.
Journal ArticleDOI

Polar codes for classical-quantum channels

TL;DR: Several known results from the quantum information literature are leveraged to demonstrate that the channel polarization effect occurs for channels with classical inputs and quantum outputs, and linear polar codes are constructed based on this effect, and the encoding complexity is O(NlogN), where N is the blocklength of the code.
Journal ArticleDOI

Sequential decoding of a general classical-quantum channel

TL;DR: It is demonstrated that a sequential decoding strategy works well even in the most general ‘one-shot’ regime, where the authors are given a single instance of a channel and wish to determine the maximal number of bits that can be communicated up to a small failure probability.
Journal ArticleDOI

A One-Shot Achievability Result for Quantum State Redistribution

TL;DR: This work studies the problem of entanglement-assisted quantum state redistribution in the one-shot setting and provides a new achievability result on the quantum communication required and shows that this result is upper bounded by the result obtained in Berta et al. (2016).
References
More filters
Book

Information Theory and Reliable Communication

TL;DR: This chapter discusses Coding for Discrete Sources, Techniques for Coding and Decoding, and Source Coding with a Fidelity Criterion.
Book

Quantum detection and estimation theory

TL;DR: In this article, the optimum procedure for choosing between two hypotheses, and an approximate procedure valid at small signal-to-noise ratios and called threshold detection, are presented, and a quantum counterpart of the Cramer-Rao inequality of conventional statistics sets a lower bound to the mean-square errors of such estimates.
Journal ArticleDOI

Sending classical information via noisy quantum channels

TL;DR: Previous results about the classical information capacity of a noiseless quantum-mechanical communication channel are extended to situations in which the final signal states are mixed states, that is, to channels with noise.
Journal ArticleDOI

The capacity of the quantum channel with general signal states

TL;DR: In this article, the capacity of a classical-quantum channel with arbitrary (possibly mixed) states was shown to be the maximum of the entropy bound with respect to all a priori distributions.
Related Papers (5)