Decoding quantum information via the Petz recovery map

TL;DR

This paper establishes a lower bound on quantum communication capacity using the Petz recovery map, demonstrating its effectiveness in achieving coherent information rates and revealing a scaling threshold for the erasure channel.

Contribution

It introduces a new achievability bound for quantum communication that employs the Petz recovery map as the decoding strategy, linking it to coherent information.

Findings

Petz recovery map can be used as an effective decoding strategy.

Achievability bounds are derived for quantum channels with second-order asymptotics.

A sharp error threshold is identified for the erasure channel where capacity scales as √n.

Abstract

We obtain a lower bound on the maximum number of qubits, $Q^{n, \epsilon}(\mathcal{N})$, which can be transmitted over $n$ uses of a quantum channel $\mathcal{N}$, for a given non-zero error threshold $\epsilon$. To obtain our result, we first derive a bound on the one-shot entanglement transmission capacity of the channel, and then compute its asymptotic expansion up to the second order. In our method to prove this achievability bound, the decoding map, used by the receiver on the output of the channel, is chosen to be the \emph{Petz recovery map} (also known as the \emph{transpose channel}). Our result, in particular, shows that this choice of the decoder can be used to establish the coherent information as an achievable rate for quantum information transmission. Applying our achievability bound to the 50-50 erasure channel (which has zero quantum capacity), we find that there is a sharp error threshold above which $Q^{n, \epsilon}(\mathcal{N})$ scales as $\sqrt{n}$.