pith. sign in

arxiv: 0809.3972 · v4 · pith:UW5ZOVYMnew · submitted 2008-09-23 · 🪐 quant-ph

Superadditivity of communication capacity using entangled inputs

classification 🪐 quant-ph
keywords capacityinformationadditivitychannelinputclassicalentangledentanglement
0
0 comments X
read the original abstract

The design of error-correcting codes used in modern communications relies on information theory to quantify the capacity of a noisy channel to send information [1]. This capacity can be expressed using the mutual information between input and output for a single use of the channel: although correlations between subsequent input bits are used to correct errors, they cannot increase the capacity. For quantum channels, it has been an open question whether entangled input states can increase the capacity to send classical information [2]. The additivity conjecture [3,4] states that entanglement does not help, making practical computations of the capacity possible. While additivity is widely believed to be true, there is no proof. Here we show that additivity is false, by constructing a random counter-example. Our results show that the most basic question of classical capacity of a quantum channel remains open, with further work needed to determine in which other situations entanglement can boost capacity.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Entanglement Certification $-$ From Theory to Experiment

    quant-ph 2019-06 unverdicted

    Reviews paradigmatic entanglement quantifiers and state-of-the-art detection/certification methods, with emphasis on assumptions about states and measurements.