arXiv:0712.2558 · Open Systems & Information Dynamics

A Random Coding Based Proof for the Quantum Coding Theorem

Rochus Klesse

Published Mar 1, 2008• 28 citations

Abstract

We present a proof for the quantum channel coding theorem which relies on the fact that a randomly chosen code space typically is highly suitable for quantum error correction. In this sense, the proof is close to Shannon's original treatment of information transmission via a noisy classical channel.

DOI: 10.1142/s1230161208000055

Related papers

Classical information theory in quantum notations

Ye Ming

Shannon’s noisy channel coding theorem is a cornerstone in the history of classical information theory. A proof of Shannon’s noisy channel coding theorem using quantum notations is presented, which sets up a bridge between classical information theory and the developing quantum information theory.

Science in China. Series G, Physics, mechanics & astronomy/Science in China. Series G, Physics, Mechanics & AstronomyJan 1, 20110 citations

Capacity of the noisy quantum channel

Seth Lloyd

An upper limit is given to the amount of quantum information that can be transmitted reliably down a noisy, decoherent quantum channel using the high-probability states of quantum sources. A class of quantum error-correcting codes is presented that allows the information transmitted to attain this limit. The result is a quantum analog of Shannon's bound and code for the noisy classical channel [C. E. Shannon and W. Weaver, The Mathematical Theory of Communication (University of Illinois Press, Chicago, 1948)].

arXiv:quant-ph/9604015Physical Review AMar 1, 1997779 citations

A quantum version of Feinstein's Theorem and its application to channel coding

Nilanjana Datta, T. C. Dorlas

In this paper, a quantum version of Feinstein's theorem is developed. This is then used to give a completely self-contained proof of the direct channel coding theorem, for transmission of classical information through a quantum channel with Markovian correlated noise. Our proof does not rely on the Holevo-Schumacher-Westmoreland (HSW) theorem. In addition, for the case of memoryless channels, our method yields an alternative proof of the HSW Theorem

IEEE International Symposium on Information Theory (ISIT)Jul 1, 20066 citations

Quantum Reverse Shannon Theorem Revisited

Zahra Baghali Khanian, Debbie Leung

Reverse Shannon theorems concern the use of noiseless channels to simulate noisy ones. This is dual to the usual noisy channel coding problem, where a noisy (classical or quantum) channel is used to simulate a noiseless one. The Quantum Reverse Shannon Theorem is extensively studied by Bennett and co-authors in [IEEE Trans. Inf. Theory, 2014]. They present two distinct theorems, each tailored to classical and quantum channel simulations respectively, explaining the fact that these theorems remain incomparable due to the fundamentally different nature of correlations they address. The authors leave as an open question the challenge of formulating a unified theorem that could encompass the principles of both and unify them. We unify these two theorems into a single, comprehensive theorem, extending it to the most general case by considering correlations with a general mixed-state reference system. Furthermore, we unify feedback and non-feedback theorems by simulating a general side information system at the encoder side.

arXiv:2504.07068Apr 9, 20250 citations

Degenerate quantum codes and the quantum channel capacity problem

Graeme Smith, John A. Smolin

A striking feature of quantum error correcting codes is that they can sometimes be used to correct more errors than they can uniquely identify. Indeed, such degenerate codes are known to outperform all non-degenerate codes for very noisy quantum channels. As a result, rather than being chosen randomly according to some i.i.d. distribution, capacity achieving quantum codes must be chosen in a highly structured fashion. While there is no systematic understanding of how to design such codes, I will describe our best understanding of the problem. I will also briefly discuss a single-letter upper bound on the quantum capacity and its relation to the capacitypsilas possible additivity.

IEEE Information Theory Workshop (ITW)May 1, 20080 citations

Better transmission with lower capacity: lossy compression over quantum channels

Sristy Agrawal, Rajashik Tarafder, Graeme Smith +2 more

Shannon's channel coding theorem describes the maximum possible rate of reliable information transfer through a classical noisy communication channel. It, together with the source coding theorem, characterizes lossless channel communication in the classical regime. Lossy compression scenarios require the additional description provided by rate-distortion theory, which characterizes the trade-off between compression rate and the distortion of the compressed signal. Even in this context, the capacity characterizes the usefulness of a channel -- a channel with more capacity will always outperform a channel with less capacity. We show that this is no longer true when sending classical information over a quantum channel. In particular, we find a pair of quantum channels where the channel with the lower capacity causes less distortion than the higher capacity channel when both are used at a fixed rate.

arXiv:2105.06617May 14, 20210 citations