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:2312.13406

A condition for the zero-error capacity of quantum channels

Marciel Medeiros de Oliveira, Francisco de Assis, Micael Andrade Dias

Published Dec 20, 2023• 1 citation
arXivHTMLPDF

Abstract

In this paper, we present a condition for the zero-error capacity of quantum channels. To achieve this result we first prove that the eigenvectors (or eigenstates) common to the Kraus operators representing the quantum channel are fixed points of the channel. From this fact and assuming that these Kraus operators have at least two eigenstates in common and also considering that every quantum channel has at least one fixed point, it is proved that the zero-error capacity of the quantum channel is positive. Moreover, this zero-error capacity condition is a lower bound for the zero-error capacity of the quantum channel. This zero-error capacity condition of quantum channels has a peculiar feature that it is easy to verify when one knows the Kraus operators representing the quantum channel.

DOI
10.48550/arxiv.2312.13406

Related papers

A condition for the zero-error capacity of quantum channels

Marciel Medeiros de Oliveira, Francisco de Assis, Micael Andrade Dias

In this paper, we present a condition for the zeroerror capacity of quantum channels.To achieve this result we first prove that the eigenvectors (or eigenstates) common to the Kraus operators representing the quantum channel are fixed points of the channel.From this fact and assuming that these Kraus operators have at least two eigenstates in common and also considering that every quantum channel has at least one fixed point, it is proved that the zero-error capacity of the quantum channel is positive.Moreover, this zero-error capacity condition is a lower bound for the zero-error capacity of the quantum channel.This zero-error capacity condition of quantum channels has a peculiar feature that it is easy to verify when one knows the Kraus operators representing the quantum channel.

Anais de XXXV Simpósio Brasileiro de Telecomunicações e Processamento de Sinais•Jan 1, 2023•2 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

Zero-Error Capacity and Invariant Subspace of a Quantum Channel

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

In this paper, we explore the connection between the zero-error capacity and the invariant subspace of a quantum channel.We begin by demonstrating that a quantum channel with two invariant subspaces, which only have trivial intersections, has a positive zero-error capacity.Additionally, we establish that an unital quantum channel with a non-trivial invariant subspace of at least two dimensions also has a positive zero-error capacity.

Anais de XXXV Simpósio Brasileiro de Telecomunicações e Processamento de Sinais•Jan 1, 2024•0 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

Zero-Error List Decoding for Classical-Quantum Channels

Marco Dalai, Filippo Girardi, Ludovico Lami

The aim of this work is to study the zero-error capacity of pure-state classical-quantum channels in the setting of list decoding. We provide an achievability bound for list-size two and a converse bound holding for every fixed list size. The two bounds coincide for channels whose pairwise absolute state overlaps form a positive semi-definite matrix. Finally, we discuss a remarkable peculiarity of the classical-quantum case: differently from the fully classical setting, the rate at which the sphere-packing bound diverges might not be achievable by zero-error list codes, even when we take the limit of fixed but arbitrarily large list size.

quant-pharXiv:2601.09786•IEEE International Symposium on Information Theory (ISIT)•Jan 16, 2026•2 citations

Conditions for the existence of quantum error correction codes

Daniel Mark Lucas

In this dissertation, we consider quantum errors, represented by quantum channels defined on the space of n x n complex matrices, M(n). We begin with a quantum channel T defined on M(n). The Kraus operators of this channel can be used to generate an operator system S, which is guaranteed to have a basis of Hermitian matrices A_1,...,A_m in M(n). Given natural numbers k and m, we find a lower bound on n above which there is always an n x k matrix U with orthonormal columns such that U*A_1U,...,U*A_mU are diagonal k x k matrices. We then extend this to a lower bound on n above which there is always a k-dimensional quantum error correction code for any quantum channel T on M(n) with an associated operator system S with dim(S) < m+2. Such a bound is equivalent to a lower bound on n above which the joint rank-k numerical range of any m Hermitian matrices in M(n) is non-empty. So, we further extend our result to a lower bound on n above which the rank-k numerical range of any m Hermitian matrices in M(n) is star-shaped.

•Jan 1, 2020•0 citations
In this paper, we present a condition for the zero-error capacity of quantum channels. To achieve this result we first prove that the eigenvectors (or eigenstates) common to the Kraus operators representing the quantum channel are fixed points of the channel. From this fact and assuming that these Kraus operators have at least two eigenstates in common and also considering that every quantum channel has at least one fixed point, it is proved that the zero-error capacity of the quantum channel is positive. Moreover, this zero-error capacity condition is a lower bound for the zero-error capacity of the quantum channel. This zero-error capacity condition of quantum channels has a peculiar feature that it is easy to verify when one knows the Kraus operators representing the quantum channel.
In this paper, we present a condition for the zeroerror capacity of quantum channels.To achieve this result we first prove that the eigenvectors (or eigenstates) common to the Kraus operators representing the quantum channel are fixed points of the channel.From this fact and assuming that these Kraus operators have at least two eigenstates in common and also considering that every quantum channel has at least one fixed point, it is proved that the zero-error capacity of the quantum channel is positive.Moreover, this zero-error capacity condition is a lower bound for the zero-error capacity of the quantum channel.This zero-error capacity condition of quantum channels has a peculiar feature that it is easy to verify when one knows the Kraus operators representing the quantum channel.
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.
The aim of this work is to study the zero-error capacity of pure-state classical-quantum channels in the setting of list decoding. We provide an achievability bound for list-size two and a converse bound holding for every fixed list size. The two bounds coincide for channels whose pairwise absolute state overlaps form a positive semi-definite matrix. Finally, we discuss a remarkable peculiarity of the classical-quantum case: differently from the fully classical setting, the rate at which the sphere-packing bound diverges might not be achievable by zero-error list codes, even when we take the limit of fixed but arbitrarily large list size.
In this dissertation, we consider quantum errors, represented by quantum channels defined on the space of n x n complex matrices, M(n). We begin with a quantum channel T defined on M(n). The Kraus operators of this channel can be used to generate an operator system S, which is guaranteed to have a basis of Hermitian matrices A_1,...,A_m in M(n). Given natural numbers k and m, we find a lower bound on n above which there is always an n x k matrix U with orthonormal columns such that U*A_1U,...,U*A_mU are diagonal k x k matrices. We then extend this to a lower bound on n above which there is always a k-dimensional quantum error correction code for any quantum channel T on M(n) with an associated operator system S with dim(S) < m+2. Such a bound is equivalent to a lower bound on n above which the joint rank-k numerical range of any m Hermitian matrices in M(n) is non-empty. So, we further extend our result to a lower bound on n above which the rank-k numerical range of any m Hermitian matrices in M(n) is star-shaped.