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

Decomposition of Quantum Markov Chains and Zero-error Capacity

Ji Guan, Yuan Feng, Mingsheng Ying

Published Aug 22, 2016• 0 citations
OpenAlex

Abstract

Markov chains have been widely applied in information theory and various areas of its applications. Quantum Markov chains are a natural quantum extension of Markov chains. This paper studies irreducibility and periodicity of (discrete time) quantum Markov chains. In particular, we present a periodic decomposition and establish limit theorems for them. Using these mathematical tools, we give a new characterization of (one-shot) zero-error capacity of quantum channels.

Related papers

Quantum Capacities and Entropy Production of Quantum Markov Chains

Alexander Müller‐Hermes

A basic question in quantum information theory is to quantify the optimal rate of transmitting quantum information via a given quantum channel using certain coding schemes. We study this question for discrete- and continuous-time quantum Markov processes. For continuous-time processes modeling a quantum memory we introduce new capacities where coding channels may be applied during the storage time. We prove upper bounds on these quantities by studying the entropy production of quantum Markov processes.

•Jan 1, 2015•0 citations

Sufficient conditions for additivity of the zero-error classical capacity of quantum channels

Jeonghoon Park, Jeong San Kim

The one-shot zero-error classical capacity of a quantum channel is the maximum amount of classical information that can be transmitted with zero probability of error via a single channel use. This capacity is fundamentally characterized by the logarithm of the independence number of the noncommutative graph induced by the quantum channel. Consequently, the additivity of the one-shot zero-error classical capacity is equivalent to the multiplicativity of the independence number of the associated noncommutative graphs. As the independence number is not multiplicative in general, the specific conditions under which multiplicativity is preserved remain an open question in quantum information theory. Here, we establish some sufficient conditions for the multiplicativity of the independence number and provide explicit examples of quantum channels that satisfy these criteria. Furthermore, we investigate the block form of noncommutative graphs and derive the conditions under which the independence number remains multiplicative within this framework. These results offer new insights into the structural properties of noncommutative graphs and the fundamental limits of zero-error quantum communication.

quant-pharXiv:2601.18538•Physical Review A•Jan 27, 2026•0 citations

Reducibility and irreducibility of open quantum random walks: A quantum Markov chain approach

Ameur Dhahri, Chul Ki Ko, Hyun Jae Yoo

In this paper we construct (nonhomogeneous) quantum Markov chains associated with open quantum random walks. We then discuss the reducibility and irreducibility of open quantum random walks via the corresponding quantum Markov chains. The quantum Markov chain was introduced by Accardi by using transition expectation, and the construction of the quantum Markov chains for the open quantum random walks was introduced by Dhahri and Mukhamedov. Here we construct nonhomogeneous quantum Markov chains for the open quantum random walks so that we can naturally express the evolution of any open quantum random walk by the corresponding quantum Markov chain. We provide with some examples. In particular, we show that the classical Markov chains are reconstructed as quantum Markov chains as well and the reducibility and irreducibility properties of classical Markov chains can be investigated in the language of quantum Markov chains.

•Aug 10, 2018•0 citations

Shemesh Theorem and Its Relation With the Zero-Error Quantum Information Theory

Marciel Medeiros de Oliveira, Micael Andrade Dias, Andresso da Silva +1 more

In this paper, our objective is to establish results that connect Shemesh theorem with quantum zero-error information theory. To achieve this, we will first introduce definitions and properties related to the zero-error capacity of a quantum channel, with particular emphasis on demonstrating that the eigenstates common to the Kraus operators representing the quantum channel are fixed points. This result has previously been employed to develop a test for determining whether a quantum channel possesses positive zero-error capacity. In this work, we demonstrate that the eigenstates common to the Kraus operators representing the channel reside within the Shemesh subspace. Consequently, the fixed points of the quantum channel act as a bridge between Shemesh theorem and quantum zero-error information theory, thereby enabling the derivation of new results on the zero-error capacity of quantum channels.

IEEE Access•Jan 1, 2024•2 citations

Quantum states characterization for the zero-error capacity

Rex A. C. Medeiros, Romain Alléaume, Gérard Cohen +1 more

The zero-error capacity of quantum channels was defined as the least upper bound of rates at which classical information can be transmitted through a quantum channel with probability of error equal to zero. This paper investigates some properties of input states and measurements used to attain the quantum zero-error capacity. We start by reformulating the problem of finding the zero-error capacity in the language of graph theory. This alternative definition is used to prove that the zero-error capacity of any quantum channel can be reached by using tensor products of pure states as channel inputs, and projective measurements in the channel output. We conclude by presenting an example that illustrates our results.

arXiv:quant-ph/0611042•Nov 3, 2006•21 citations

Belavkin–Staszewski Quantum Markov Chains

Andreas Blühm, Ángela Capel, Pablo Costa Rico +1 more

Abstract It is well known that the conditional mutual information of a quantum state is zero if, and only if, the quantum state is a quantum Markov chain. Replacing the Umegaki relative entropy in the definition of the conditional mutual information by the Belavkin–Staszewski (BS) relative entropy, we obtain the BS-conditional mutual information, and we call the states with zero BS-conditional mutual information Belavkin–Staszewski quantum Markov chains. In this article, we establish a correspondence which relates quantum Markov chains and BS-quantum Markov chains. This correspondence allows us to find a recovery map for the BS-entropy in the spirit of the Petz recovery map. Furthermore, we show that, over the set of BS-quantum Markov chains, this correspondence constitutes an entanglement-breaking map. Moreover, we prove a structural decomposition of the Belavkin–Staszewski quantum Markov chains and also study states for which the BS-conditional mutual information is only approximately zero. We subsequently extend the aforementioned correspondence, structural decomposition, and recovery map to arbitrary pairs of states and quantum channels. As an application of the correspondence, we find a family of states with non-vanishing conditional mutual information for which it decays superexponentially fast with the size of the middle system.

arXiv:2501.09708•Annales Henri Poincaré•Nov 13, 2025•5 citations
Markov chains have been widely applied in information theory and various areas of its applications. Quantum Markov chains are a natural quantum extension of Markov chains. This paper studies irreducibility and periodicity of (discrete time) quantum Markov chains. In particular, we present a periodic decomposition and establish limit theorems for them. Using these mathematical tools, we give a new characterization of (one-shot) zero-error capacity of quantum channels.
A basic question in quantum information theory is to quantify the optimal rate of transmitting quantum information via a given quantum channel using certain coding schemes. We study this question for discrete- and continuous-time quantum Markov processes. For continuous-time processes modeling a quantum memory we introduce new capacities where coding channels may be applied during the storage time. We prove upper bounds on these quantities by studying the entropy production of quantum Markov processes.
The one-shot zero-error classical capacity of a quantum channel is the maximum amount of classical information that can be transmitted with zero probability of error via a single channel use. This capacity is fundamentally characterized by the logarithm of the independence number of the noncommutative graph induced by the quantum channel. Consequently, the additivity of the one-shot zero-error classical capacity is equivalent to the multiplicativity of the independence number of the associated noncommutative graphs. As the independence number is not multiplicative in general, the specific conditions under which multiplicativity is preserved remain an open question in quantum information theory. Here, we establish some sufficient conditions for the multiplicativity of the independence number and provide explicit examples of quantum channels that satisfy these criteria. Furthermore, we investigate the block form of noncommutative graphs and derive the conditions under which the independence number remains multiplicative within this framework. These results offer new insights into the structural properties of noncommutative graphs and the fundamental limits of zero-error quantum communication.
In this paper we construct (nonhomogeneous) quantum Markov chains associated with open quantum random walks. We then discuss the reducibility and irreducibility of open quantum random walks via the corresponding quantum Markov chains. The quantum Markov chain was introduced by Accardi by using transition expectation, and the construction of the quantum Markov chains for the open quantum random walks was introduced by Dhahri and Mukhamedov. Here we construct nonhomogeneous quantum Markov chains for the open quantum random walks so that we can naturally express the evolution of any open quantum random walk by the corresponding quantum Markov chain. We provide with some examples. In particular, we show that the classical Markov chains are reconstructed as quantum Markov chains as well and the reducibility and irreducibility properties of classical Markov chains can be investigated in the language of quantum Markov chains.
In this paper, our objective is to establish results that connect Shemesh theorem with quantum zero-error information theory. To achieve this, we will first introduce definitions and properties related to the zero-error capacity of a quantum channel, with particular emphasis on demonstrating that the eigenstates common to the Kraus operators representing the quantum channel are fixed points. This result has previously been employed to develop a test for determining whether a quantum channel possesses positive zero-error capacity. In this work, we demonstrate that the eigenstates common to the Kraus operators representing the channel reside within the Shemesh subspace. Consequently, the fixed points of the quantum channel act as a bridge between Shemesh theorem and quantum zero-error information theory, thereby enabling the derivation of new results on the zero-error capacity of quantum channels.
The zero-error capacity of quantum channels was defined as the least upper bound of rates at which classical information can be transmitted through a quantum channel with probability of error equal to zero. This paper investigates some properties of input states and measurements used to attain the quantum zero-error capacity. We start by reformulating the problem of finding the zero-error capacity in the language of graph theory. This alternative definition is used to prove that the zero-error capacity of any quantum channel can be reached by using tensor products of pure states as channel inputs, and projective measurements in the channel output. We conclude by presenting an example that illustrates our results.
Abstract It is well known that the conditional mutual information of a quantum state is zero if, and only if, the quantum state is a quantum Markov chain. Replacing the Umegaki relative entropy in the definition of the conditional mutual information by the Belavkin–Staszewski (BS) relative entropy, we obtain the BS-conditional mutual information, and we call the states with zero BS-conditional mutual information Belavkin–Staszewski quantum Markov chains. In this article, we establish a correspondence which relates quantum Markov chains and BS-quantum Markov chains. This correspondence allows us to find a recovery map for the BS-entropy in the spirit of the Petz recovery map. Furthermore, we show that, over the set of BS-quantum Markov chains, this correspondence constitutes an entanglement-breaking map. Moreover, we prove a structural decomposition of the Belavkin–Staszewski quantum Markov chains and also study states for which the BS-conditional mutual information is only approximately zero. We subsequently extend the aforementioned correspondence, structural decomposition, and recovery map to arbitrary pairs of states and quantum channels. As an application of the correspondence, we find a family of states with non-vanishing conditional mutual information for which it decays superexponentially fast with the size of the middle system.