Quantum Zero-Error Source-Channel Coding and Non-Commutative Graph Theory

DOI10.1109/TIT.2015.2496377MaRDI QIDQ2977086zbMATH OpenFDO

Authors Dan Stahlke

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1405.5254

Mathematics Subject Classification ID

Applications of graph theory (05C90) Source coding (94A29)

Abstract: Alice and Bob receive a bipartite state (possibly entangled) from some finite collection or from some subspace. Alice sends a message to Bob through a noisy quantum channel such that Bob may determine the initial state, with zero chance of error. This framework encompasses, for example, teleportation, dense coding, entanglement assisted quantum channel capacity, and one-way communication complexity of function evaluation. With classical sources and channels, this problem can be analyzed using graph homomorphisms. We show this quantum version can be analyzed using homomorphisms on non-commutative graphs (an operator space generalization of graphs). Previously the Lov'{a}sz $vartheta$ number has been generalized to non-commutative graphs; we show this to be a homomorphism monotone, thus providing bounds on quantum source-channel coding. We generalize the Schrijver and Szegedy numbers, and show these to be monotones as well. As an application we construct a quantum channel whose entanglement assisted zero-error one-shot capacity can only be unlocked by using a non-maximally entangled state. These homomorphisms allow definition of a chromatic number for non-commutative graphs. Many open questions are presented regarding the possibility of a more fully developed theory.

Cited in

(27)

• The Morita theory of quantum graph isomorphisms
• Sandwich theorems and capacity bounds for non-commutative graphs
• Quantum graphs as quantum relations
• A category of quantum posets
• Synchronicity for quantum non-local games
• Information theoretic parameters of noncommutative graphs and convex corners
• Connectivity for quantum graphs
• The ``quantum Turán problem for operator systems
• Chromatic numbers, Sabidussi's theorem and Hedetniemi's conjecture for non-commutative graphs
• Graphical quantum error-correcting codes based on entanglement of subgraphs
• New Separations in Zero-Error Channel Capacity Through Projective Kochen–Specker Sets and Quantum Coloring
• Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number
• scientific article; zbMATH DE number 5508888 (Why is no real title available?)
• A compositional approach to quantum functions
• A ``quantum Ramsey theorem for operator systems
• The quantum-to-classical graph homomorphism game
• Quantum teleportation in the commuting operator framework
• Spectral bounds for the quantum chromatic number of quantum graphs
• Quantum Suplattices
• Covariant quantum combinatorics with applications to zero-error communication
• Quantum graphs: different perspectives, homomorphisms and quantum automorphisms
• Quantum no-signalling correlations and non-local games
• Quantum Mycielski graphs
• Transfer of quantum game strategies
• Quantum chromatic number of products of quantum graphs
• Connectivity for quantum graphs via quantum adjacency operators
• Morita equivalence for operator systems

This page was built for publication: Quantum Zero-Error Source-Channel Coding and Non-Commutative Graph Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977086)