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:1512.02096 · Mathematical Notes

Structure of the algebra generated by a noncommutative operator graph which demonstrates the superactivation phenomenon for zero-error capacity

Grigori Gennadievich Amosov, Il'ya Yur'evich Zhdanovskiy

Published May 1, 2016• 4 citations
arXivHTMLPDF

Abstract

Recently M.E. Shirokov introduced the non-commutative operator graph depending on the complex parameter $θ$ to construct channels with positive quantum zero-error capacity having vanishing n-shot capacity. We study the algebraic structure of this graph. The relations for the algebra generated by the graph are derived. In the limiting case $θ=\pm1$ the graph becomes abelian and degenerates into the direct sum of four one-dimensional irreducible representations of the Klein group.

DOI
10.1134/s000143461605031x

Related papers

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

An Extreme Form of Superactivation for Quantum Zero-Error Capacities

Toby S. Cubitt, Graeme Smith

The zero-error capacity of a channel is the rate at which it can send information perfectly, with zero probability of error, and has long been studied in classical information theory. We show that the zero-error capacity of quantum channels exhibits an extreme form of nonadditivity, one which is not possible for classical channels, or even for the usual capacities of quantum channels. By combining probabilistic arguments with algebraic geometry, we prove that there exist channels and with no zero-error classical capacity whatsoever, , but whose joint zero-error quantum capacity is positive, . This striking effect is an extreme form of the superactivation phenomenon, as it implies that both the classical and quantum zero-error capacities of these channels can be superactivated simultaneously, while being a strictly stronger property of capacities. Superactivation of the quantum zero-error capacity was not previously known.

arXiv:0912.2737•IEEE Transactions on Information Theory•Feb 28, 2012•40 citations

On superactivation of one-shot quantum zero-error capacity and the related property of quantum measurements

Максим Евгеньевич Широков, Tatiana Shulman

We give a detailed description of a low-dimensional quantum channel (input dimension 4, Choi rank 3) demonstrating the symmetric form of superactivation of one-shot quantum zero-error capacity. This property means appearance of a noiseless (perfectly reversible) subchannel in the tensor square of a channel having no noiseless subchannels. Then we describe a quantum channel with an arbitrary given level of symmetric superactivation (including the infinite value). We also show that superactivation of one-shot quantum zero-error capacity of a channel can be reformulated in terms of quantum measurement theory as appearance of an indistinguishable subspace for the tensor product of two observables having no indistinguishable subspaces.

arXiv:1312.3586•Problems of Information Transmission•Jul 1, 2014•9 citations

Morita equivalence for quantum graphs

Alexandros Chatzinikolaou, Gage Hoefer, Nikolaos Koutsonikos-Kouloumpis +1 more

We introduce an operator-algebraic framework for Morita equivalence of quantum graphs based on $Δ$-equivalence of operator systems introduced by Eleftherakis, Kakariadis and Todorov. Adopting the perspective of Weaver, we view quantum graphs as quantum relations, that is, operator systems endowed with a bimodule structure over the commutant of a von Neumann algebra. Within this framework, we show that two irreducibly acting quantum graphs are Morita equivalent if and only if they are both full pullbacks of a common quantum graph. This extends a result of Eleftherakis, Kakariadis and Todorov for graph operator systems to the quantum graph setting. In passing we construct a true-twin reduction analogue for an irreducibly acting quantum graph. We further characterise the case where we have simultaneous TRO-equivalence of the quantum graphs and their associated algebras, thus giving a second, stronger notion of Morita equivalence. In the special case of noncommutative graphs, corresponding to the zero-error quantum communication setting, the two notions coincide and we obtain a characterisation in terms of strong co-homomorphisms of noncommutative graphs. Finally, we show that connectivity, the independence number, Shannon capacity, quantum complexity and subcomplexity, Haemers bound, and the Lovász number are invariant under Morita equivalence.

arXiv:2604.18065•Apr 20, 2026•1 citation

On multipartite superactivation of quantum channel capacities

Максим Евгеньевич Широков

We consider a generalization of the notion of superactivation of quantum channel capacities to the case of n > 2 channels. An explicit example of such superactivation for the 1-shot quantum zero-error capacity is constructed for n = 3. An interpretation of this example in terms of quantum measurements is given.

arXiv:1411.5386•Problems of Information Transmission•Apr 1, 2015•3 citations

Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number

Runyao Duan, Simone Severini B, Andreas Winter

We study the quantum channel version of Shannon's zero-error capacity problem. Motivated by recent progress on this question, we propose to consider a certain subspace of operators (so-called operator systems) as the quantum generalization of the adjacency matrix, in terms of which the zero-error capacity of a quantum channel, as well as the quantum and entanglement-assisted zero-error capacities can be formulated, and for which we show some new basic properties. Most importantly, we define a quantum version of Lovász' famous ϑ function on general operator systems, as the norm-completion (or stabilization) of a “naive” generalization of ϑ. We go on to show that this function upper bounds the number of entanglement-assisted zero-error messages, that it is given by a semidefinite program, whose dual we write down explicitly, and that it is multiplicative with respect to the tensor product of operator systems (corresponding to the tensor product of channels). We explore various other properties of the new quantity, which reduces to Lovász' original ϑ in the classical case, give several applications, and propose to study the operator systems associated with channels as “noncommutative graphs,” using the language of Hilbert modules.

arXiv:1002.2514•IEEE Transactions on Information Theory•Oct 2, 2012•197 citations
Recently M.E. Shirokov introduced the non-commutative operator graph depending on the complex parameter θθθ to construct channels with positive quantum zero-error capacity having vanishing n-shot capacity. We study the algebraic structure of this graph. The relations for the algebra generated by the graph are derived. In the limiting case θ=±1θ=\pm1θ=±1 the graph becomes abelian and degenerates into the direct sum of four one-dimensional irreducible representations of the Klein group.
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.
The zero-error capacity of a channel is the rate at which it can send information perfectly, with zero probability of error, and has long been studied in classical information theory. We show that the zero-error capacity of quantum channels exhibits an extreme form of nonadditivity, one which is not possible for classical channels, or even for the usual capacities of quantum channels. By combining probabilistic arguments with algebraic geometry, we prove that there exist channels and with no zero-error classical capacity whatsoever, , but whose joint zero-error quantum capacity is positive, . This striking effect is an extreme form of the superactivation phenomenon, as it implies that both the classical and quantum zero-error capacities of these channels can be superactivated simultaneously, while being a strictly stronger property of capacities. Superactivation of the quantum zero-error capacity was not previously known.
We give a detailed description of a low-dimensional quantum channel (input dimension 4, Choi rank 3) demonstrating the symmetric form of superactivation of one-shot quantum zero-error capacity. This property means appearance of a noiseless (perfectly reversible) subchannel in the tensor square of a channel having no noiseless subchannels. Then we describe a quantum channel with an arbitrary given level of symmetric superactivation (including the infinite value). We also show that superactivation of one-shot quantum zero-error capacity of a channel can be reformulated in terms of quantum measurement theory as appearance of an indistinguishable subspace for the tensor product of two observables having no indistinguishable subspaces.
We introduce an operator-algebraic framework for Morita equivalence of quantum graphs based on ΔΔΔ-equivalence of operator systems introduced by Eleftherakis, Kakariadis and Todorov. Adopting the perspective of Weaver, we view quantum graphs as quantum relations, that is, operator systems endowed with a bimodule structure over the commutant of a von Neumann algebra. Within this framework, we show that two irreducibly acting quantum graphs are Morita equivalent if and only if they are both full pullbacks of a common quantum graph. This extends a result of Eleftherakis, Kakariadis and Todorov for graph operator systems to the quantum graph setting. In passing we construct a true-twin reduction analogue for an irreducibly acting quantum graph. We further characterise the case where we have simultaneous TRO-equivalence of the quantum graphs and their associated algebras, thus giving a second, stronger notion of Morita equivalence. In the special case of noncommutative graphs, corresponding to the zero-error quantum communication setting, the two notions coincide and we obtain a characterisation in terms of strong co-homomorphisms of noncommutative graphs. Finally, we show that connectivity, the independence number, Shannon capacity, quantum complexity and subcomplexity, Haemers bound, and the Lovász number are invariant under Morita equivalence.
We study the quantum channel version of Shannon's zero-error capacity problem. Motivated by recent progress on this question, we propose to consider a certain subspace of operators (so-called operator systems) as the quantum generalization of the adjacency matrix, in terms of which the zero-error capacity of a quantum channel, as well as the quantum and entanglement-assisted zero-error capacities can be formulated, and for which we show some new basic properties. Most importantly, we define a quantum version of Lovász' famous ϑ function on general operator systems, as the norm-completion (or stabilization) of a “naive” generalization of ϑ. We go on to show that this function upper bounds the number of entanglement-assisted zero-error messages, that it is given by a semidefinite program, whose dual we write down explicitly, and that it is multiplicative with respect to the tensor product of operator systems (corresponding to the tensor product of channels). We explore various other properties of the new quantity, which reduces to Lovász' original ϑ in the classical case, give several applications, and propose to study the operator systems associated with channels as “noncommutative graphs,” using the language of Hilbert modules.