Optimizing the fundamental limits for quantum and private communication

12/02/2019
by   Xin Wang, et al.
0

The quantum capacity of a noisy quantum channel determines the maximal rate at which we can code reliably over asymptotically many uses of the channel, and it characterizes the channel's ultimate ability to transmit quantum information coherently. In this paper, we derive single-letter computable upper bounds on the quantum and private capacities of quantum channels. The quantum capacity of a quantum channel is always no larger than the quantum capacity of its extended channels, such as its flagged channel, since the flags (or extensions) of the channel can be considered as assistance from the environment. By optimizing the degrading channel of the flagged quantum channel as well as the parametrized flag states, we obtain new upper bounds on the quantum capacity of the main channel. Furthermore, we generalize our approach to private communication and derive upper bounds on the private classical capacity of a quantum channel. As notable applications, we establish improved upper bounds to the quantum and private capacities for fundamental quantum channels of great interest in quantum information, some of which are also the sources of noise in superconducting quantum computing. In particular, our upper bounds on the quantum capacities of the depolarizing channel and the generalized amplitude damping channel are strictly better than previously best-known bounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/02/2020

Bounding the forward classical capacity of bipartite quantum channels

We introduce various measures of forward classical communication for bip...
research
11/05/2019

Computable Upper Bounds on the Capacity of Finite-State Channels

The capacity of finite-state channels (FSCs) without feedback is investi...
research
02/23/2022

Bounding quantum capacities via partial orders and complementarity

Quantum capacities are fundamental quantities that are notoriously hard ...
research
02/16/2020

Non-additivity in classical-quantum wiretap channels

Due to Csiszar and Koerner, the capacity of classical wiretap channels h...
research
07/12/2022

End-to-End Capacities of Imperfect-Repeater Quantum Networks

The optimal performance of a communication network is limited not only b...
research
06/21/2023

Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels

We propose a quantum soft-covering problem for a given general quantum c...
research
03/13/2023

Estimate distillable entanglement and quantum capacity by squeezing useless entanglement

Entanglement distillation is crucial in quantum information processing. ...

Please sign up or login with your details

Forgot password? Click here to reset