Please use this identifier to cite or link to this item: https://doi.org/10.1103/PhysRevA.82.062324
Title: Quantum-capacity-approaching codes for the detected-jump channel
Authors: Grassl, M. 
Ji, Z.
Wei, Z. 
Zeng, B.
Issue Date: 27-Dec-2010
Citation: Grassl, M., Ji, Z., Wei, Z., Zeng, B. (2010-12-27). Quantum-capacity-approaching codes for the detected-jump channel. Physical Review A - Atomic, Molecular, and Optical Physics 82 (6) : -. ScholarBank@NUS Repository. https://doi.org/10.1103/PhysRevA.82.062324
Abstract: The quantum-channel capacity gives the ultimate limit for the rate at which quantum data can be reliably transmitted through a noisy quantum channel. Degradable quantum channels are among the few channels whose quantum capacities are known. Given the quantum capacity of a degradable channel, it remains challenging to find a practical coding scheme which approaches capacity. Here we discuss code designs for the detected-jump channel, a degradable channel with practical relevance describing the physics of spontaneous decay of atoms with detected photon emission. We show that this channel can be used to simulate a binary classical channel with both erasures and bit flips. The capacity of the simulated classical channel gives a lower bound on the quantum capacity of the detected-jump channel. When the jump probability is small, it almost equals the quantum capacity. Hence using a classical capacity-approaching code for the simulated classical channel yields a quantum code which approaches the quantum capacity of the detected-jump channel. © 2010 The American Physical Society.
Source Title: Physical Review A - Atomic, Molecular, and Optical Physics
URI: http://scholarbank.nus.edu.sg/handle/10635/112509
ISSN: 10502947
DOI: 10.1103/PhysRevA.82.062324
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.