arXiv:1609.08592 · Physical Review Letters

Additive Classical Capacity of Quantum Channels Assisted by Noisy Entanglement

Quntao Zhuang, Elton Yechao Zhu, Peter W. Shor

Published May 19, 2017• 29 citations

Abstract

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.

DOI: 10.1103/physrevlett.118.200503

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.

IEEE International Symposium on Information Theory (ISIT)Jun 1, 20207 citations

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

Every entangled state provides an advantage in classical communication

S. Bäuml, Andreas Winter, D. Yang

We investigate the use of noisy entanglement as a resource in classical communication via a quantum channel. In particular, we are interested in the question whether for any entangled state, including bound entangled states, there exists a quantum channel, the classical capacity of which can be increased by providing the state as an additional resource. We partially answer this question by showing, for any entangled state, the existence of a quantum memory channel, the feedback-assisted classical capacity with product encodings of which can be increased by using the state as a resource. Using a different (memoryless) channel construction, we also provide a sufficient entropic condition for an advantage in classical communication (without feedback and for general encodings) and thus provide an example of a state that is not distillable by means of one-way local operations and classical communication but can provide an advantage in the classical capacity of a number of quantum channels. As separable states cannot provide an advantage in classical communication, our condition also provides an entropic entanglement witness.

arXiv:1810.11431Journal of Mathematical PhysicsJul 1, 201911 citations

Classical capacities under physical constraints: More capacity with less entanglement

Mondal, Sudipta, Pritam Halder, Saptarshi Roy +1 more

Current advancements in communication equipment demand the investigation of classical information transfer over quantum channels, by encompassing realistic scenarios in finite dimensions. To address this issue, we develop a framework for analyzing classical capacities of quantum channels where the set of states used for encoding information is restricted based on various physical properties. Specifically, we provide expressions for the classical capacities of noiseless and noisy quantum channels when the average energy of the encoded ensemble or the energy of each of the constituent states in the ensemble is bounded. In the case of qubit energy-preserving dephasing channels, we demonstrate that a nonuniform probability distribution based on the energy constraint maximizes capacity, while we derive the compact form of the capacity for equiprobable messages. We suggest an energy-constrained dense coding (DC) protocol that we prove to be optimal in the two-qubit situation and obtain a closed-form expression for the DC capacity. Additionally, we demonstrate a no-go result, which states that when the dimension of the sender and the receiver is two, no energy-preserving operation can offer any quantum advantage for energy-constrained entanglement-assisted capacity. We exhibit that, in the energy-constrained situation, classical-quantum noisy channels can show improved capabilities under entanglement assistance, a phenomenon that is unattainable in the unrestricted scenario.

arXiv:2504.21748Apr 30, 20250 citations

Message transmission over classical quantum channels with a jammer with side information: Correlation as resource, common randomness generation

Holger Boche, Minglai Cai, Ning Cai

In this paper, we analyze the capacity of a general model for arbitrarily varying classical-quantum channels (AVCQCs) when the sender and the receiver use correlation as a resource. In this general model, a jammer has side information about the channel input. We determine a single letter formula for the correlation assisted capacity. As an application of our main result, we determine the correlation assisted common randomness generation capacity. In this scenario, the two channel users have access to correlation as a resource and further use an AVCQC with an informed jammer for additional discussion. The goal is to create common randomness between the two channel users. We also analyze these capacity formulas when only a small number of signals from the correlation are available. For the correlation assisted common randomness generation capacity, we show an additional interesting property: For a sufficient amount of “public communication,” common randomness generation capacity is Turing computable; however, without this public communication constraint, the correlation assisted common randomness generation capacity is, in general, not Turing computable. Furthermore, we show that even without knowing the capacity formula of the deterministic capacity using the maximal error criterion, we can show that it is impossible to evaluate the performance algorithmically on any current or future digital computer.

arXiv:1902.01764Journal of Mathematical PhysicsJun 1, 202010 citations