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• 0 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

Capacities of Quantum Channels : Markovian Noise and Computational Aspects

Mostafa Taheri

This thesis studies the capacities of quantum channels under repeated noisy evolution, with a focus on the long-time behavior of classical and quantum information transmission. The main goal is to understand how much information can still be preserved or recovered when a quantum channel is applied many times, and to develop structural, analytic, and algorithmic tools for characterizing these capacities.The core results are presented in Chapter 2. First, the thesis investigates the infinite-time regime and shows that the asymptotic capacities of quantum channels are determined by the structure of their peripheral subspace. This leads to explicit characterizations of the infinite-time classical capacity and bounds on the infinite-time quantum capacity, together with results on additivity and extensions to more general settings. The thesis then studies the finite-time behavior for GNS-symmetric channels and proves explicit exponential convergence bounds, showing that the capacities approach their infinite-time values rapidly. In addition, algorithmic methods are developed for computing the peripheral structure and the associated capacity quantities efficiently.Chapter 3 explores a related optimization-based direction motivated by Sum-of-Squares methods and semidefinite programming. Using ideas inspired by separability and SDP hierarchies, this part investigates whether machine-learning-assisted ansatz discovery can help construct more efficient SOS certificates. Although this direction is not yet complete in the specific capacity setting, it provides promising intermediate results and suggests new computational approaches for related problems in quantum information theory. Overall, this thesis provides a structural and quantitative understanding of the long-time information-carrying capabilities of noisy quantum dynamical systems, while also opening new perspectives through optimization and machine-learning-based methods.

•Jul 15, 2026•0 citations

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:2504.10436•PRX Quantum•Feb 18, 2026•0 citations

Information transmission under Markovian noise

Singh, Satvik, Nilanjana Datta

We consider an open quantum system undergoing Markovian dynamics, the latter being modelled by a discrete-time quantum Markov semigroup $(Φ^n)_{n \in {\mathbb{N}}}$, resulting from the action of sequential uses of a quantum channel $Φ$, with $n \in {\mathbb{N}}$ being the discrete time parameter. We find upper and lower bounds on the one-shot $ε$-error information transmission capacities of $Φ^n$ for a finite time $n\in \mathbb{N}$ and $ε\in [0,1)$ in terms of the structure of the peripheral space of the channel $Φ$. We consider transmission of $(i)$ classical information (both in the unassisted and entanglement-assisted settings); $(ii)$ quantum information and $(iii)$ private classical information.

arXiv:2409.17743•Sep 26, 2024•0 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•181 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
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.
This thesis studies the capacities of quantum channels under repeated noisy evolution, with a focus on the long-time behavior of classical and quantum information transmission. The main goal is to understand how much information can still be preserved or recovered when a quantum channel is applied many times, and to develop structural, analytic, and algorithmic tools for characterizing these capacities.The core results are presented in Chapter 2. First, the thesis investigates the infinite-time regime and shows that the asymptotic capacities of quantum channels are determined by the structure of their peripheral subspace. This leads to explicit characterizations of the infinite-time classical capacity and bounds on the infinite-time quantum capacity, together with results on additivity and extensions to more general settings. The thesis then studies the finite-time behavior for GNS-symmetric channels and proves explicit exponential convergence bounds, showing that the capacities approach their infinite-time values rapidly. In addition, algorithmic methods are developed for computing the peripheral structure and the associated capacity quantities efficiently.Chapter 3 explores a related optimization-based direction motivated by Sum-of-Squares methods and semidefinite programming. Using ideas inspired by separability and SDP hierarchies, this part investigates whether machine-learning-assisted ansatz discovery can help construct more efficient SOS certificates. Although this direction is not yet complete in the specific capacity setting, it provides promising intermediate results and suggests new computational approaches for related problems in quantum information theory. Overall, this thesis provides a structural and quantitative understanding of the long-time information-carrying capabilities of noisy quantum dynamical systems, while also opening new perspectives through optimization and machine-learning-based methods.
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 consider an open quantum system undergoing Markovian dynamics, the latter being modelled by a discrete-time quantum Markov semigroup (Φn)n∈N(Φ^n)_{n \in {\mathbb{N}}}(Φn)n∈N​, resulting from the action of sequential uses of a quantum channel ΦΦΦ, with n∈Nn \in {\mathbb{N}}n∈N being the discrete time parameter. We find upper and lower bounds on the one-shot εεε-error information transmission capacities of ΦnΦ^nΦn for a finite time n∈Nn\in \mathbb{N}n∈N and ε∈[0,1)ε\in [0,1)ε∈[0,1) in terms of the structure of the peripheral space of the channel ΦΦΦ. We consider transmission of (i)(i)(i) classical information (both in the unassisted and entanglement-assisted settings); (ii)(ii)(ii) quantum information and (iii)(iii)(iii) private classical information.
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)