Lower Bounds on the Quantum Capacity and Highest Error Exponent of General Memoryless Channels

A low-rate bound on the reliability of a quantum discrete memoryless channel

We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel to its quantum counterpart. The key observation that we make is that the problem of bounding below the error exponent for a quantum channel relying on the class of stabilizer codes is equivalent to the problem of deriving error exponents for a certain symmetric classical channel.

Information Rates Achievable with Algebraic Codes on Quantum Discrete Memoryless Channels

The highest information rate at which quantum error-correction schemes work reliably on a channel, which is called the quantum capacity, is proven to be lower bounded by the limit of the quantity termed coherent information maximized over the set of input density operators which are proportional to the projections onto the code spaces of symplectic stabilizer codes. Quantum channels to be considered are those subject to independent errors and modeled as tensor products of copies of a completely positive linear map on a Hilbert space of finite dimension, and the codes that are proven to have th…

Exponential improvement for quantum cooling through finite-memory effects

Practical implementations of quantum technologies require preparation of states with a high degree of purity---or, in thermodynamic terms, very low temperatures. Given finite resources, the Third Law of thermodynamics prohibits perfect cooling; nonetheless, attainable upper bounds for the asymptotic ground state population of a system repeatedly interacting with quantum thermal machines have been derived. These bounds apply within a memoryless (Markovian) setting, in which each refrigeration step proceeds independently of those previous. Here, we expand this framework to study the effects of m…

Exponential lower bound on the highest fidelity achievable by quantum error-correcting codes

On a class of memoryless quantum channels which includes the depolarizing channel, the highest fidelity of quantum error-correcting codes of length n and rate R is proven to be lower bounded by 1-exp[-nE(R)+o(n)] for some function E(R). The E(R) is positive below some threshold R', which implies R' is a lower bound on the quantum capacity.

量子容量的强逆界：基于全量子放大引理

Strong Converses for Quantum Channel Capacities from Blowing-Up Lemmata

本文通过全量子放大引理和低次多项式近似，证明了任意有限维无记忆信道在速率超过量子容量时纠缠传输保真度指数衰减的强逆界。

Divergence radii and the strong converse exponent of classical-quantum channel coding with constant compositions

There are different inequivalent ways to define the Rényi capacity of a channel for a fixed input distribution $P$. In a 1995 paper Csiszár has shown that for classical discrete memoryless channels there is a distinguished such quantity that has an operational interpretation as a generalized cutoff rate for constant composition channel coding. We show that the analogous notion of Rényi capacity, defined in terms of the sandwiched quantum Rényi divergences, has the same operational interpretation in the strong converse problem of classical-quantum channel coding. Denoting the constant compositi…