Entanglement can increase asymptotic rates of zero-error classical communication over classical channels
From MaRDI portal
(Redirected from Publication:411372)
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.
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
Cites work
- scientific article; zbMATH DE number 53657 (Why is no real title available?)
- A Mathematical Theory of Communication
- A new proof for the existence of mutually unbiased bases
- Channel Coding Rate in the Finite Blocklength Regime
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- Compression of root systems and the \(E\)-sequence
- Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
- Exceptional and non-crystallographic root systems and the Kochen–Specker theorem
- Factor-group-generated polar spaces and (multi-)qudits
- From qubits to E7
- Introduction to Lie algebras
- Lower bounds to error probability for coding on discrete memoryless channels. I
- Multiple qubits as symplectic polar spaces of order two
- On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
- On the Pauli graphs on \(N\)-qudits
- On the Shannon capacity of a graph
- Orthogonal representations over finite fields and the chromatic number of graphs
- Partitions and their stabilizers for line complexes and quadrics
- Quantum entanglement
- Quantum information theory
- Symplectic spreads
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- The diameters graph of the root system \(E_8\) is uniquely geometrisable
- Zero-Error Channel Capacity and Simulation Assisted by Non-Local Correlations
- Zero-error information theory
Cited in
(12)- More assistance of entanglement, less rounds of classical communication
- The zero-error entanglement cost is highly non-additive
- Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone
- Every entangled state provides an advantage in classical communication
- Violating the Shannon capacity of metric graphs with entanglement
- Combinatorial entanglement
- Transmission of classical information via quantum entanglement
- Quantum homomorphisms
- Mathematical open problems in projected entangled pair states
- Permutation Enhances Classical Communication Assisted by Entangled States
- Green's function approach for quantum graphs: an overview
- Mutually unbiased weighing matrices
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)
