Bounding the quantum capacity with flagged extensions
arXiv:2008.02461 · doi:10.22331/q-2022-02-09-647
Abstract
In this article we consider flagged extensions of convex combination of quantum channels, and find general sufficient conditions for the degradability of the flagged extension. An immediate application is a bound on the quantum and private capacities of any channel being a mixture of a unitary map and another channel, with the probability associated to the unitary component being larger than . We then specialize our sufficient conditions to flagged Pauli channels, obtaining a family of upper bounds on quantum and private capacities of Pauli channels. In particular, we establish new state-of-the-art upper bounds on the quantum and private capacities of the depolarizing channel, BB84 channel and generalized amplitude damping channel. Moreover, the flagged construction can be naturally applied to tensor powers of channels with less restricting degradability conditions, suggesting that better upper bounds could be found by considering a larger number of channel uses.
22 pages, 6 figures, published version. Presentation improved, typos corrected, references added
References in corpus (13)
- Quantum cryptography: Public key distribution and coin tossing
- Quantum Communication With Zero-Capacity Channels
- Degenerate Quantum Codes for Pauli Channels
- The structure of degradable quantum channels
- Unbounded number of channel uses are required to see quantum capacity
- Quantum Capacities of Channels with small Environment
- The quantum capacity with symmetric side channels
- The private classical capacity with a symmetric side channel and its application to quantum cryptography
- New lower bounds on the non-zero capacity of Pauli Channels
- Positivity and nonadditivity of quantum capacities using generalized erasure channels
- Estimating Quantum and Private capacities of Gaussian channels via degradable extensions
- Entropic singularities give rise to quantum transmission
- Experimental observation of coherent-information superadditivity in a dephrasure channel