Permutation Enhances Classical Communication Assisted by Entangled States

01/07/2020
by   Kun Wang, et al.
0

We give a capacity formula for the classical communication over a noisy quantum channel, when local operations and global permutations allowed in the encoding and bipartite states preshared between the sender and the receiver. The two endpoints of this formula are the Holevo capacity (without entanglement assistance) and the entanglement-assisted capacity (with unlimited entanglement assistance). What's more, we show that the capacity satisfies the strong converse property and thus the formula serves as a sharp dividing line between achievable and unachievable rates of communication. We prove that the difference between the assisted capacity and the Holevo capacity is upper bounded by the discord of formation of the preshared state. As examples, we derive analytically the classical capacity of various quantum channels of interests. Our result witnesses the power of random permutation in classical communication, whenever entanglement assistance is available.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/15/2021

The Entanglement-Assisted Communication Capacity over Quantum Trajectories

The unique and often-weird properties of quantum mechanics allow an info...
03/15/2021

On entanglement assistance to a noiseless classical channel

For a classical channel, neither the Shannon capacity, nor the sum of co...
12/16/2021

Communication with Unreliable Entanglement Assistance

Entanglement resources can increase transmission rates substantially. Un...
12/08/2021

Reliable Simulation of Quantum Channels

The Quantum Reverse Shannon Theorem has been a milestone in quantum info...
09/24/2019

Practical route to entanglement-enhanced communication over noisy bosonic channels

Entanglement can offer substantial advantages in quantum information pro...
10/09/2019

Entanglement-Enabled Communication

We introduce and analyse a multiple-access channel with two senders and ...
05/31/2020

Contextuality in entanglement-assisted one-shot classical communication

We consider the problem of entanglement-assisted one-shot classical comm...