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:2408.00116 · IEEE Transactions on Information Theory

Capacities of Quantum Markovian Noise for Large Times

Omar Fawzi, Mizanur Rahaman, Mostafa Taheri

Published Jun 26, 2026• 12 citations
arXivHTMLPDF

Abstract

Given a quantum Markovian noise model, we study the maximum dimension of a classical or quantum system that can be stored for arbitrarily large time. We show that, unlike the fixed time setting, in the limit of infinite time, the classical and quantum capacities are characterized by efficiently computable properties of the peripheral spectrum of the quantum channel. In addition, the capacities are additive under tensor product, which implies in the language of Shannon theory that the one-shot and the asymptotic i.i.d. capacities are the same. We also provide an improved algorithm for computing the structure of the peripheral subspace of a quantum channel, which might be of independent interest.

DOI
10.1109/tit.2026.3707704

Related papers

Information Storage and Transmission under Markovian Noise

Satvik Singh, Nilanjana Datta

We study the information transmission capacities of quantum Markov semigroups acting on finite-dimensional quantum systems. We show that, in the limit of infinite time, the capacities can be efficiently computed in terms of the structure of the peripheral space of the semigroup, are strongly additive, and satisfy the strong converse property. We also establish convergence bounds to show that the infinite-time capacities are reached after time scaling quadratically with the system dimension. From a data storage perspective, our analysis provides tight bounds on the number of bits or qubits that can be reliably stored for long times in a quantum memory experiencing Markovian noise. From a practical standpoint, we show that typically, a quantum memory with Markovian noise acting independently and identically on all qubits and a fixed time-independent global error correction mechanism becomes useless for storage after time scaling exponentially with the number of qubits. In contrast, if the error correction is local, the memory becomes useless much more quickly, i.e., after time scaling logarithmically with the number of qubits. In the setting of point-to-point communication between two spatially separated parties, our analysis provides efficiently computable bounds on the optimal rate at which bits or qubits can be reliably transmitted via long Markovian communication channels, both in the finite block-length and asymptotic regimes.

arXiv:2409.17743•PRX Quantum•Feb 18, 2026•10 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

The Quantum Capacity of Channels With Arbitrarily Correlated Noise

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 theone-shotquantum 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.

arXiv:0902.0158•IEEE Transactions on Information Theory•Mar 1, 2010•192 citations

Quantum capacity of thermal noise channel

Xiaoyu Chen

The quantum capacity of thermal noise channel (which is addressed as Gaussian quantum channel before) is studied, it turns out to be the maximum of the coherent information of a single use of the channel. The quantum capacity is achieved when the input state is a thermal noise state with infinitive energy. The capacity is achievable with quantum error-correction code. The quantum capacities of thermal noise channels with damping or amplification are also given. One of the most important issues of classical information theory is the Shannon formula, which is the capacity of an additive white Gaussian noise channel. It is achieved when the input is a Gaussian noise source with power constrain [1] [2]. C = log2 (1 + S), (1)

•Feb 11, 2006•0 citations

Hybrid Quantum Noise Model to Compute Gaussian Quantum Channel Capacity

Mouli Chakraborty, Anshu Mukherjee, Avishek Nag +1 more

Quantum information processing leverages the principles of quantum mechanics, utilizing qubits, to improve computational and communicative tasks. In this realm, the quantum channel’s capacity is pivotal in determining the efficiency and accuracy of quantum information handling, with its performance being significantly influenced by channel noise. Our study aims to establish a holistic hybrid quantum noise model to determine the quantum channel capacity. In this paper, we formulated a mathematical expression for this capacity and conducted simulations for both Gaussian and non-Gaussian inputs. A hybrid noise model is constructed by convolution of Poisson-distributed quantum noise with classical additive white Gaussian noise. We characterized the quantum-classical noise and the received signal using Gaussian Mixture Models. The maximum amount of quantum information that can be reliably transmitted over a quantum channel (per use of the channel) is determined by its capacity, and entropy and related quantities like mutual information play a role in calculating this capacity. Our formulation of quantum channel capacity is derived from the mutual information shared between the transmitter and receiver, encompassing the entropies of the signals. The quantum channel presents a higher capacity-to-signal-to-noise ratio for Gaussian inputs than non-Gaussian ones.

IEEE Access•Jan 1, 2024•26 citations

The Classical Capacity of Additive Quantum Queue-Channels

Prabha Mandayam, Krishna Jagannathan, Avhishek Chatterjee

We consider a setting where a stream of qubits is processed sequentially. We derive fundamental limits on the rate at which classical information can be transmitted using qubits that decohere as they wait to be processed. Specifically, we model the sequential processing of qubits using a single server queue, and derive expressions for the classical capacity of such a quantum `queue-channel.' Focusing on two important noise models, namely the erasure channel and the depolarizing channel, we obtain explicit single-letter capacity formulas in terms of the stationary waiting time of qubits in the queue. Our capacity proof also implies that a `classical' coding/decoding strategy is optimal, i.e., an encoder which uses only orthogonal product states, and a decoder which measures in a fixed product basis, are sufficient to achieve the classical capacity of both queue-channels. Our proof technique for the converse theorem generalizes readily - in particular, whenever the underlying quantum noise channel is additive, we can obtain a single-letter upper bound on the classical capacity of the corresponding quantum queue-channel. More broadly, our work begins to quantitatively address the impact of decoherence on the performance limits of quantum information processing systems.

arXiv:1906.01356•IEEE Journal on Selected Areas in Information Theory•Aug 1, 2020•17 citations
Given a quantum Markovian noise model, we study the maximum dimension of a classical or quantum system that can be stored for arbitrarily large time. We show that, unlike the fixed time setting, in the limit of infinite time, the classical and quantum capacities are characterized by efficiently computable properties of the peripheral spectrum of the quantum channel. In addition, the capacities are additive under tensor product, which implies in the language of Shannon theory that the one-shot and the asymptotic i.i.d. capacities are the same. We also provide an improved algorithm for computing the structure of the peripheral subspace of a quantum channel, which might be of independent interest.
We study the information transmission capacities of quantum Markov semigroups acting on finite-dimensional quantum systems. We show that, in the limit of infinite time, the capacities can be efficiently computed in terms of the structure of the peripheral space of the semigroup, are strongly additive, and satisfy the strong converse property. We also establish convergence bounds to show that the infinite-time capacities are reached after time scaling quadratically with the system dimension. From a data storage perspective, our analysis provides tight bounds on the number of bits or qubits that can be reliably stored for long times in a quantum memory experiencing Markovian noise. From a practical standpoint, we show that typically, a quantum memory with Markovian noise acting independently and identically on all qubits and a fixed time-independent global error correction mechanism becomes useless for storage after time scaling exponentially with the number of qubits. In contrast, if the error correction is local, the memory becomes useless much more quickly, i.e., after time scaling logarithmically with the number of qubits. In the setting of point-to-point communication between two spatially separated parties, our analysis provides efficiently computable bounds on the optimal rate at which bits or qubits can be reliably transmitted via long Markovian communication channels, both in the finite block-length and asymptotic regimes.
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.
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 theone-shotquantum 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.
The quantum capacity of thermal noise channel (which is addressed as Gaussian quantum channel before) is studied, it turns out to be the maximum of the coherent information of a single use of the channel. The quantum capacity is achieved when the input state is a thermal noise state with infinitive energy. The capacity is achievable with quantum error-correction code. The quantum capacities of thermal noise channels with damping or amplification are also given. One of the most important issues of classical information theory is the Shannon formula, which is the capacity of an additive white Gaussian noise channel. It is achieved when the input is a Gaussian noise source with power constrain [1] [2]. C = log2 (1 + S), (1)
Quantum information processing leverages the principles of quantum mechanics, utilizing qubits, to improve computational and communicative tasks. In this realm, the quantum channel’s capacity is pivotal in determining the efficiency and accuracy of quantum information handling, with its performance being significantly influenced by channel noise. Our study aims to establish a holistic hybrid quantum noise model to determine the quantum channel capacity. In this paper, we formulated a mathematical expression for this capacity and conducted simulations for both Gaussian and non-Gaussian inputs. A hybrid noise model is constructed by convolution of Poisson-distributed quantum noise with classical additive white Gaussian noise. We characterized the quantum-classical noise and the received signal using Gaussian Mixture Models. The maximum amount of quantum information that can be reliably transmitted over a quantum channel (per use of the channel) is determined by its capacity, and entropy and related quantities like mutual information play a role in calculating this capacity. Our formulation of quantum channel capacity is derived from the mutual information shared between the transmitter and receiver, encompassing the entropies of the signals. The quantum channel presents a higher capacity-to-signal-to-noise ratio for Gaussian inputs than non-Gaussian ones.
We consider a setting where a stream of qubits is processed sequentially. We derive fundamental limits on the rate at which classical information can be transmitted using qubits that decohere as they wait to be processed. Specifically, we model the sequential processing of qubits using a single server queue, and derive expressions for the classical capacity of such a quantum `queue-channel.' Focusing on two important noise models, namely the erasure channel and the depolarizing channel, we obtain explicit single-letter capacity formulas in terms of the stationary waiting time of qubits in the queue. Our capacity proof also implies that a `classical' coding/decoding strategy is optimal, i.e., an encoder which uses only orthogonal product states, and a decoder which measures in a fixed product basis, are sufficient to achieve the classical capacity of both queue-channels. Our proof technique for the converse theorem generalizes readily - in particular, whenever the underlying quantum noise channel is additive, we can obtain a single-letter upper bound on the classical capacity of the corresponding quantum queue-channel. More broadly, our work begins to quantitatively address the impact of decoherence on the performance limits of quantum information processing systems.