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:0902.2834 · Physical Review A

Classical capacity of quantum channels with memory

T. C. Dorlas, Ciara Morgan

Published Mar 17, 2009• 12 citations
arXivHTMLPDF

Abstract

We investigate the classical capacity of two quantum channels with memory: a periodic channel with depolarizing channel branches and a convex combination of depolarizing channels. We prove that the capacity is additive in both cases. As a result, the channel capacity is achieved without the use of entangled input states. In the case of a convex combination of depolarizing channels the proof provided can be extended to other quantum channels whose classical capacity has been proven to be additive in the memoryless case.

DOI
10.1103/physreva.79.032320

Related papers

Classical and entanglement-assisted capacity of a qubit depolarizing memory channel

Jaideep Mulherkar

We study the classical and entanglement-assisted capacity of a forgetful quantum memory channel that randomly switches between two qubit depolarizing channels. We show that when the input consists of two qubits then depending on channel parameters either the maximally entangled input states or product input states achieve the two-use classical capacity. We conjecture that as the number of input qubits is increased the classical capacity approaches the product state capacity for all values of the parameters. We also derive an expression for the entanglement-assisted classical capacity of this quantum memory channel in terms of the entropy rate of a Markov chain.

arXiv:1503.07075•International Journal of Quantum Information•Apr 1, 2016•3 citations

The Information-carrying capacity of certain quantum channels

Ciara Morgan

In this thesis we analyse the type of states and ensembles which achieve the capacity for certain quantum channels carrying classical information. We first concentrate on the product-state capacity of a particular quantum channel, that is, the capacity which is achieved by encoding the output states from a source into codewords comprised of states taken from ensembles of non-entangled states and sending them over copies of the quantum channel. Using the "single-letter" formula proved independently by Holevo and by Schumacher and Westmoreland we obtain the product-state capacity of the qubit quantum amplitude-damping channel, which is determined by a transcendental equation in a single real variable and can be solved numerically. We demonstrate that the product-state capacity of this channel can be achieved using a minimal ensemble of non-orthogonal pure states. Next we consider the classical capacity of two quantum channels with memory, namely a periodic channel with quantum depolarising channel branches and a convex combination of quantum channels. We prove that the classical capacity for each of the classical memory channels mentioned above is, in fact, equal to the respective product-state capacities. For those channels this means that the classical capacity is achieved without the use of entangled input-states. Next we introduce the channel coding theorem for memoryless quantum channels, providing a known proof by Winter for the strong converse of the theorem. We then consider the strong converse to the channel coding theorem for a periodic quantum channel.

arXiv:1007.2723•Irish Mathematical Society Bulletin•Jan 1, 2010•1 citation

Classical capacity of a qubit depolarizing channel with memory

Jeroen Wouters, M. Fannes, Ismail Yunus Akhalwaya +1 more

The classical product state capacity of a noisy quantum channel with memory is investigated. A forgetful noise-memory channel is constructed by Markov switching between two depolarizing channels which introduces non-Markovian noise correlations between successive channel uses. The computation of the capacity is reduced to an entropy computation for a function of a Markov process. A reformulation in terms of algebraic measures then enables its calculation. The effects of the hidden-Markovian memory on the capacity are explored. An increase in noise correlations is found to increase the capacity.

arXiv:0901.2516•Physical Review A•Apr 2, 2009•15 citations

Parrondo's paradox and superactivation of classical and quantum capacity of communication channels with memory

Sergii Strelchuk

There exist memoryless zero-capacity quantum channels that when used jointly result in a channel with positive capacity. This phenomenon is called superactivation. Making use of Parrondo's paradox, we exhibit examples of the superactivation-like effect for the capacity of classical communication channels as well as quantum and private capacity of quantum channels with memory. There are several ingredients necessary for superactivation of quantum capacity to occur in the memoryless case. The first one is the requirement for the quantum channels which are suitable for superactivation to come from two distinct families: binding entanglement channels and erasure channels. The second one is the ability to utilize inputs which are entangled across the uses of the channels. Our construction uses a single family of erasure channels with classical memory to achieve the same superactivation-like effect for quantum capacity without any of the ingredients above.

arXiv:1305.1326•Physical Review A•Sep 11, 2013•3 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

Classical capacity of Gaussian thermal memory channels

Giacomo De Palma, Andrea Mari, Vittorio Giovannetti

The classical capacity of phase-invariant Gaussian channels has been recently determined under the assumption that such channels are memoryless. In this work we generalize this result by deriving the classical capacity of a model of quantum memory channel, in which the output states depend on the previous input states. In particular we extend the analysis of Lupo et al. [Phys. Rev. Lett. 104, 030501 (2010) and Phys. Rev. A 82, 032312 (2010)] from quantum limited channels to thermal attenuators and thermal amplifiers. Our result applies in many situations in which the physical communication channel is affected by nonzero memory and by thermal noise.

arXiv:1404.1767•Physical Review A•Oct 10, 2014•12 citations
We investigate the classical capacity of two quantum channels with memory: a periodic channel with depolarizing channel branches and a convex combination of depolarizing channels. We prove that the capacity is additive in both cases. As a result, the channel capacity is achieved without the use of entangled input states. In the case of a convex combination of depolarizing channels the proof provided can be extended to other quantum channels whose classical capacity has been proven to be additive in the memoryless case.
We study the classical and entanglement-assisted capacity of a forgetful quantum memory channel that randomly switches between two qubit depolarizing channels. We show that when the input consists of two qubits then depending on channel parameters either the maximally entangled input states or product input states achieve the two-use classical capacity. We conjecture that as the number of input qubits is increased the classical capacity approaches the product state capacity for all values of the parameters. We also derive an expression for the entanglement-assisted classical capacity of this quantum memory channel in terms of the entropy rate of a Markov chain.
In this thesis we analyse the type of states and ensembles which achieve the capacity for certain quantum channels carrying classical information. We first concentrate on the product-state capacity of a particular quantum channel, that is, the capacity which is achieved by encoding the output states from a source into codewords comprised of states taken from ensembles of non-entangled states and sending them over copies of the quantum channel. Using the "single-letter" formula proved independently by Holevo and by Schumacher and Westmoreland we obtain the product-state capacity of the qubit quantum amplitude-damping channel, which is determined by a transcendental equation in a single real variable and can be solved numerically. We demonstrate that the product-state capacity of this channel can be achieved using a minimal ensemble of non-orthogonal pure states. Next we consider the classical capacity of two quantum channels with memory, namely a periodic channel with quantum depolarising channel branches and a convex combination of quantum channels. We prove that the classical capacity for each of the classical memory channels mentioned above is, in fact, equal to the respective product-state capacities. For those channels this means that the classical capacity is achieved without the use of entangled input-states. Next we introduce the channel coding theorem for memoryless quantum channels, providing a known proof by Winter for the strong converse of the theorem. We then consider the strong converse to the channel coding theorem for a periodic quantum channel.
The classical product state capacity of a noisy quantum channel with memory is investigated. A forgetful noise-memory channel is constructed by Markov switching between two depolarizing channels which introduces non-Markovian noise correlations between successive channel uses. The computation of the capacity is reduced to an entropy computation for a function of a Markov process. A reformulation in terms of algebraic measures then enables its calculation. The effects of the hidden-Markovian memory on the capacity are explored. An increase in noise correlations is found to increase the capacity.
There exist memoryless zero-capacity quantum channels that when used jointly result in a channel with positive capacity. This phenomenon is called superactivation. Making use of Parrondo's paradox, we exhibit examples of the superactivation-like effect for the capacity of classical communication channels as well as quantum and private capacity of quantum channels with memory. There are several ingredients necessary for superactivation of quantum capacity to occur in the memoryless case. The first one is the requirement for the quantum channels which are suitable for superactivation to come from two distinct families: binding entanglement channels and erasure channels. The second one is the ability to utilize inputs which are entangled across the uses of the channels. Our construction uses a single family of erasure channels with classical memory to achieve the same superactivation-like effect for quantum capacity without any of the ingredients above.
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.
The classical capacity of phase-invariant Gaussian channels has been recently determined under the assumption that such channels are memoryless. In this work we generalize this result by deriving the classical capacity of a model of quantum memory channel, in which the output states depend on the previous input states. In particular we extend the analysis of Lupo et al. [Phys. Rev. Lett. 104, 030501 (2010) and Phys. Rev. A 82, 032312 (2010)] from quantum limited channels to thermal attenuators and thermal amplifiers. Our result applies in many situations in which the physical communication channel is affected by nonzero memory and by thermal noise.