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)

Capacity of a memoryless quantum communication channel

T. Fujiwara, Hiroshi Nagaoka

Published Nov 19, 2002• 1 citation
Publisher

Abstract

We introduce a proper framework of coding problems for a quantum memoryless channel and derive an asymptotic formula for the channel capacity having an operational significance. Some general lower and upper bounds for the quantum channel capacity are also derived.
DOI
10.1109/isit.1995.531342

Related papers

Quantum coding with finite resources

Marco Tomamichel, Mario Berta, Joseph M. Renes

The quantum capacity of a memoryless channel determines the maximal rate at which we can communicate reliably over asymptotically many uses of the channel. Here we illustrate that this asymptotic characterization is insufficient in practical scenarios where decoherence severely limits our ability to manipulate large quantum systems in the encoder and decoder. In practical settings, we should instead focus on the optimal trade-off between three parameters: the rate of the code, the size of the quantum devices at the encoder and decoder, and the fidelity of the transmission. We find approximate and exact characterizations of this trade-off for various channels of interest, including dephasing, depolarizing and erasure channels. In each case, the trade-off is parameterized by the capacity and a second channel parameter, the quantum channel dispersion. In the process, we develop several bounds that are valid for general quantum channels and can be computed for small instances.

arXiv:1504.04617•Nature Communications•May 9, 2016•75 citations

Bounds on classical information capacities for a class of quantum memory channels

Garry Bowen, Igor Devetak, Stefano Mancini

The maximum rates for information transmission through noisy quantum channels has primarily been developed for memoryless channels, where the noise on each transmitted state is treated as independent. Many real-world communication channels experience noise which is modeled better by errors that are correlated between separate channel uses. In this Brief Report, upper bounds on the classical information capacities of a class of quantum memory channels are derived. The class of channels consists of indecomposable quantum memory channels, a generalization of classical indecomposable finite-state channels.

arXiv:quant-ph/0312216•Physical Review A•Mar 24, 2005•46 citations

Lower bound for the quantum capacity of a discrete memoryless quantum channel

Ryutaroh Matsumoto, Tomohiko Uyematsu

We generalize the random coding argument of stabilizer codes and derive a lower bound on the quantum capacity of an arbitrary discrete memoryless quantum channel. For the depolarizing channel, our lower bound coincides with that obtained by Bennett et al. We also slightly improve the quantum Gilbert–Varshamov bound for general stabilizer codes, and establish an analog of the quantum Gilbert–Varshamov bound for linear stabilizer codes. Our proof is restricted to the binary quantum channels, but its extension of to l-adic channels is straight forward.

arXiv:quant-ph/0105151•Journal of Mathematical Physics•Sep 1, 2002•21 citations

General formulas for capacity of classical-quantum channels

Masahito Hayashi, Hiroshi Nagaoka

The capacity of a classical-quantum channel (or, in other words, the classical capacity of a quantum channel) is considered in the most general setting, where no structural assumptions such as the stationary memoryless property are made on a channel. A capacity formula as well as a characterization of the strong converse property is given just in parallel with the corresponding classical results of Verdu-Han (1994) which are based on the so-called information-spectrum method. The general results are applied to the stationary memoryless case with or without cost constraint on inputs, whereby a deep relation between the channel coding theory and the hypothesis testing for two quantum states is elucidated.

IEEE Transactions on Information Theory•Jun 23, 2003•327 citations

One-shot quantum capacities of quantum channels

Francesco Buscemi, Nilanjana Datta

We study optimal rates for quantum communication over a single use of a channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. The corresponding capacity is often referred to as the one-shot quantum capacity. In this paper, we prove bounds on the one-shot quantum capacity of an arbitrary channel. This allows us to compute the quantum capacity of a channel with arbitrarily correlated noise, in the limit of asymptotically many uses of the channel. In the memoryless case, we explicitly show that our results reduce to known expressions for the quantum capacity.

•Feb 2, 2009•3 citations

Capacities of Quantum Channels and How to Find Them

Peter W. Shor

Abstract: We survey what is known about the information transmitting capacities of quantum channels, and give a proposal for how to calculate some of these capacities using linear programming. 1

•Jan 1, 2003•38 citations
The quantum capacity of a memoryless channel determines the maximal rate at which we can communicate reliably over asymptotically many uses of the channel. Here we illustrate that this asymptotic characterization is insufficient in practical scenarios where decoherence severely limits our ability to manipulate large quantum systems in the encoder and decoder. In practical settings, we should instead focus on the optimal trade-off between three parameters: the rate of the code, the size of the quantum devices at the encoder and decoder, and the fidelity of the transmission. We find approximate and exact characterizations of this trade-off for various channels of interest, including dephasing, depolarizing and erasure channels. In each case, the trade-off is parameterized by the capacity and a second channel parameter, the quantum channel dispersion. In the process, we develop several bounds that are valid for general quantum channels and can be computed for small instances.
The maximum rates for information transmission through noisy quantum channels has primarily been developed for memoryless channels, where the noise on each transmitted state is treated as independent. Many real-world communication channels experience noise which is modeled better by errors that are correlated between separate channel uses. In this Brief Report, upper bounds on the classical information capacities of a class of quantum memory channels are derived. The class of channels consists of indecomposable quantum memory channels, a generalization of classical indecomposable finite-state channels.
We generalize the random coding argument of stabilizer codes and derive a lower bound on the quantum capacity of an arbitrary discrete memoryless quantum channel. For the depolarizing channel, our lower bound coincides with that obtained by Bennett et al. We also slightly improve the quantum Gilbert–Varshamov bound for general stabilizer codes, and establish an analog of the quantum Gilbert–Varshamov bound for linear stabilizer codes. Our proof is restricted to the binary quantum channels, but its extension of to l-adic channels is straight forward.
The capacity of a classical-quantum channel (or, in other words, the classical capacity of a quantum channel) is considered in the most general setting, where no structural assumptions such as the stationary memoryless property are made on a channel. A capacity formula as well as a characterization of the strong converse property is given just in parallel with the corresponding classical results of Verdu-Han (1994) which are based on the so-called information-spectrum method. The general results are applied to the stationary memoryless case with or without cost constraint on inputs, whereby a deep relation between the channel coding theory and the hypothesis testing for two quantum states is elucidated.
We study optimal rates for quantum communication over a single use of a channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. The corresponding capacity is often referred to as the one-shot quantum capacity. In this paper, we prove bounds on the one-shot quantum capacity of an arbitrary channel. This allows us to compute the quantum capacity of a channel with arbitrarily correlated noise, in the limit of asymptotically many uses of the channel. In the memoryless case, we explicitly show that our results reduce to known expressions for the quantum capacity.