Entanglement can increase asymptotic rates of zero-error classical communication over classical channels

DOI10.1007/S00220-012-1451-XzbMATH Open1259.94031arXiv1009.1195OpenAlexW3098665333WikidataQ62109093 ScholiaQ62109093MaRDI QIDQ411372FDOQ411372

Authors: William Matthews, Maris Ozols, Aidan Roy, L. Mančinska, Debbie Leung 

Publication date: 4 April 2012

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Abstract: It is known that the number of different classical messages which can be communicated with a single use of a classical channel with zero probability of decoding error can sometimes be increased by using entanglement shared between sender and receiver. It has been an open question to determine whether entanglement can ever increase the zero-error communication rates achievable in the limit of many channel uses. In this paper we show, by explicit examples, that entanglement can indeed increase asymptotic zero-error capacity, even to the extent that it is equal to the normal capacity of the channel. Interestingly, our examples are based on the exceptional simple root systems E7 and E8.

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

Recommendations

• On the second-order asymptotics for entanglement-assisted communication
• Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
• Every entangled state provides an advantage in classical communication
• The classical capacity achievable by a quantum channel assisted by limited entanglement

zbMATH Keywords

entanglementasymptotic zero-error capacityclassical channelzero probability of decoding error

Mathematics Subject Classification ID

Information theory (general) (94A15) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Cites Work

• A Mathematical Theory of Communication
• Quantum entanglement
• On the Shannon capacity of a graph
• Title not available (Why is that?)
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Partitions and their stabilizers for line complexes and quadrics
• Zero-error information theory
• Channel Coding Rate in the Finite Blocklength Regime
• A new proof for the existence of mutually unbiased bases
• From qubits to E7
• Introduction to Lie algebras
• Lower bounds to error probability for coding on discrete memoryless channels. I
• Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
• Quantum information theory
• Multiple qubits as symplectic polar spaces of order two
• On the Pauli graphs on \(N\)-qudits
• Factor-group-generated polar spaces and (multi-)qudits
• On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
• Compression of root systems and the \(E\)-sequence
• The diameters graph of the root system \(E_8\) is uniquely geometrisable
• Symplectic spreads
• Orthogonal representations over finite fields and the chromatic number of graphs
• Exceptional and non-crystallographic root systems and the Kochen–Specker theorem
• Zero-Error Channel Capacity and Simulation Assisted by Non-Local Correlations

Cited In (11)

• Violating the Shannon capacity of metric graphs with entanglement
• Quantum homomorphisms
• Transmission of classical information via quantum entanglement
• Combinatorial entanglement
• Permutation Enhances Classical Communication Assisted by Entangled States
• Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone
• More assistance of entanglement, less rounds of classical communication
• Mutually unbiased weighing matrices
• The zero-error entanglement cost is highly non-additive
• Mathematical open problems in projected entangled pair states
• Green's function approach for quantum graphs: an overview

This page was built for publication: Entanglement can increase asymptotic rates of zero-error classical communication over classical channels

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