IEEE International Symposium on Information Theory (ISIT)

Permutation Enhances Classical Communication Assisted by Entangled States

Kun Wang, Masahito Hayashi

Published Jun 1, 2020• 7 citations

Abstract

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.

DOI: 10.1109/isit44484.2020.9174125

Related papers

Permutation Enhances Classical Communication Assisted by Entangled States

Kun Wang, Masahito Hayashi

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.

arXiv:2001.01845Jan 7, 20200 citations

Permutation Enhances Classical Communication Assisted by Entangled States

Kun Wang, Masahito Hayashi

We study classical communication over a noisy quantum channel when bipartite states are preshared between the sender and the receiver, and one of the following encoding strategies are available: i) local operations; ii) local operations and one-way classical communication; iii) local operations and global permutations. Our main result is a capacity formula for strategy iii). This formula's two endpoints are the capacity formula in strategy i) and the entanglement-assisted classical capacity. Interestingly, these capacities satisfy 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 capacities by strategy i) and strategy iii) is upper bounded by the discord of formation of the preshared state. What's more, we show that strategy ii) has no advantage over strategy i) in the weak converse regime. As examples, we derive these capacities analytically by the above strategies for some fundamental quantum channels. In some cases, the capacity of strategy iii) is strictly larger than those of strategies i) and ii) whenever entanglement assistance is available. Our results witness the power of random permutation in entanglement-assisted classical communication.

IEEE Transactions on Information TheoryFeb 19, 20219 citations

Additive Classical Capacity of Quantum Channels Assisted by Noisy Entanglement

Quntao Zhuang, Elton Yechao Zhu, Peter W. Shor

We give a capacity formula for the classical information transmission over a noisy quantum channel, with separable encoding by the sender and limited resources provided by the receiver's preshared ancilla. Instead of a pure state, we consider the signal-ancilla pair in a mixed state, purified by a "witness." Thus, the signal-witness correlation limits the resource available from the signal-ancilla correlation. Our formula characterizes the utility of different forms of resources, including noisy or limited entanglement assistance, for classical communication. With separable encoding, the sender's signals across multiple channel uses are still allowed to be entangled, yet our capacity formula is additive. In particular, for generalized covariant channels, our capacity formula has a simple closed form. Moreover, our additive capacity formula upper bounds the general coherent attack's information gain in various two-way quantum key distribution protocols. For Gaussian protocols, the additivity of the formula indicates that the collective Gaussian attack is the most powerful.

arXiv:1609.08592Physical Review LettersMay 19, 201729 citations

The classical capacity achievable by a quantum channel assisted by limited entanglement

Peter W. Shor

We give the trade-off curve showing the capacity of a quantum channel as a function of the amount of entanglement used by the sender and receiver for transmitting information. The endpoints of this curve are given by the Holevo-Schumacher-Westmoreland capacity formula and the entanglement-assisted capacity, which is the maximum over all input density matrices of the quantum mutual information. The proof we give is based on the Holevo-Schumacher-Westmoreland formula, and also gives a new and simpler proof for the entanglement-assisted capacity formula.

Quantum Information and ComputationDec 1, 200438 citations

The classical capacity achievable by a quantum channel assisted by limited entanglement

Peter W. Shor

arXiv:quant-ph/0402129Feb 18, 20040 citations

The classical capacity achievable by a quantum channel assisted by a limited entanglement

Peter W. Shor

Abstract: We give the trade-off curve showing the capacity of a quantum channel as a function of the amount of entanglement used by the sender and receiver for transmitting information. The endpoints of this curve are given by the Holevo-Schumacher-Westmoreland capacity formula and the entanglement-assisted capacity, which is the maximum over all input density matrices of the quantum mutual information. The proof we give is based on the Holevo-Schumacher-Westmoreland formula, and also gives a new and simpler proof for the entanglement-assisted capacity formula. 1

Quantum Information and ComputationDec 1, 200426 citations