Decoding quantum information via the Petz recovery map

April 17, 2015 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Salman Beigi, Nilanjana Datta, Felix Leditzky arXiv ID 1504.04449 Category quant-ph: Quantum Computing Cross-listed cs.IT Citations 38 Venue arXiv.org Last Checked 6 months ago
Abstract
We obtain a lower bound on the maximum number of qubits, $Q^{n, Ξ΅}(\mathcal{N})$, which can be transmitted over $n$ uses of a quantum channel $\mathcal{N}$, for a given non-zero error threshold $Ξ΅$. 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, Ξ΅}(\mathcal{N})$ scales as $\sqrt{n}$.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

Died the same way β€” πŸ‘» Ghosted