Quantum Zero-Error Source-Channel Coding and Non-Commutative Graph Theory
From MaRDI portal
Publication:2977086
DOI10.1109/TIT.2015.2496377zbMath1359.94454arXiv1405.5254MaRDI QIDQ2977086
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
Related Items (16)
The quantum-to-classical graph homomorphism game ⋮ Information theoretic parameters of noncommutative graphs and convex corners ⋮ A compositional approach to quantum functions ⋮ Quantum teleportation in the commuting operator framework ⋮ A “quantum” Ramsey theorem for operator systems ⋮ Spectral bounds for the quantum chromatic number of quantum graphs ⋮ Quantum Suplattices ⋮ Covariant quantum combinatorics with applications to zero-error communication ⋮ The Morita theory of quantum graph isomorphisms ⋮ Connectivity for quantum graphs ⋮ Sandwich theorems and capacity bounds for non-commutative graphs ⋮ Quantum graphs as quantum relations ⋮ The ``quantum Turán problem for operator systems ⋮ Chromatic numbers, Sabidussi's theorem and Hedetniemi's conjecture for non-commutative graphs ⋮ A category of quantum posets ⋮ Synchronicity for quantum non-local games
This page was built for publication: Quantum Zero-Error Source-Channel Coding and Non-Commutative Graph Theory
